<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="//yehudalindell.com/wp-content/plugins/wordpress-seo/css/main-sitemap.xsl"?>
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd http://www.google.com/schemas/sitemap-image/1.1 http://www.google.com/schemas/sitemap-image/1.1/sitemap-image.xsd" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
	<url>
		<loc>https://yehudalindell.com/publications/</loc>
		<lastmod>2024-06-19T08:28:49+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/secure-multiparty-computation-mpc/</loc>
		<lastmod>2023-05-30T13:42:24+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/two-thirds-honest-majority-mpc-for-malicious-adversaries-at-almost-the-cost-of-semi-honest/</loc>
		<lastmod>2023-05-30T13:49:16+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/an-end-to-end-system-for-large-scale-p2p-mpc-as-a-service-and-low-bandwidth-mpc-for-weak-participants/</loc>
		<lastmod>2023-05-30T13:49:36+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/generalizing-the-spdz-compiler-for-other-protocols/</loc>
		<lastmod>2023-05-30T13:49:44+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/fast-distributed-rsa-key-generation-for-semi-honest-and-malicious-adversaries/</loc>
		<lastmod>2023-05-30T13:49:53+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/fast-large-scale-honest-majority-mpc-for-malicious-adversaries/</loc>
		<lastmod>2023-05-30T13:54:23+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/fast-garbling-of-circuits-over-3-valued-logic/</loc>
		<lastmod>2023-05-30T13:54:36+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/secure-two-party-computation-with-fairness-a-necessary-design-principle/</loc>
		<lastmod>2023-05-30T13:54:42+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/efficient-scalable-constant-round-mpc-via-garbled-circuits/</loc>
		<lastmod>2023-05-30T13:54:48+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/a-framework-for-constructing-fast-mpc-over-arithmetic-circuits-with-malicious-adversaries-and-an-honest-majority/</loc>
		<lastmod>2023-05-30T13:55:02+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/better-bounds-for-block-cipher-modes-of-operation-via-nonce-based-key-derivation/</loc>
		<lastmod>2023-05-30T13:55:10+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/fast-secure-two-party-ecdsa-signing/</loc>
		<lastmod>2023-05-30T13:55:18+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/optimized-honest-majority-mpc-for-malicious-adversaries-breaking-the-1-billion-gate-per-second-barrier/</loc>
		<lastmod>2023-05-30T13:55:26+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/high-throughput-secure-three-party-computation-for-malicious-adversaries-and-an-honest-majority/</loc>
		<lastmod>2023-05-30T13:55:33+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/more-efficient-constant-round-multi-party-computation-from-bmr-and-she/</loc>
		<lastmod>2023-05-30T13:55:41+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/high-throughput-semi-honest-secure-three-party-computation-with-an-honest-majority/</loc>
		<lastmod>2023-05-30T13:55:48+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/optimizing-semi-honest-secure-multiparty-computation-for-the-internet/</loc>
		<lastmod>2023-05-30T13:55:56+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/attribute-based-key-exchange-with-general-policies/</loc>
		<lastmod>2023-05-30T13:56:01+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/how-to-simulate-it-a-tutorial-on-the-simulation-proof-technique/</loc>
		<lastmod>2023-05-30T13:56:07+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/blazing-fast-2pc-in-the-offline-online-setting-with-security-for-malicious-adversaries/</loc>
		<lastmod>2023-05-30T14:01:16+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/gcm-siv-full-nonce-misuse-resistant-authenticated-encryption-at-under-one-cycle-per-byte/</loc>
		<lastmod>2023-05-30T14:01:23+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/fast-garbling-of-circuits-under-standard-assumptions/</loc>
		<lastmod>2023-05-30T14:01:29+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/efficient-constant-round-multi-party-computation-combining-bmr-and-spdz/</loc>
		<lastmod>2023-05-30T14:01:36+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/a-simpler-variant-of-universally-composable-security-for-standard-multiparty-computation/</loc>
		<lastmod>2023-05-30T14:01:43+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/adaptively-secure-computation-with-partial-erasures/</loc>
		<lastmod>2023-05-30T14:01:50+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/more-efficient-oblivious-transfer-extensions-with-security-for-malicious-adversaries/</loc>
		<lastmod>2023-05-30T14:01:56+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/more-efficient-oblivious-transfer-extensions-with-security-for-malicious-adversaries-2/</loc>
		<lastmod>2023-05-30T14:02:05+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/an-efficient-transform-from-sigma-protocols-to-nizk-with-a-crs-and-non-programmable-random-oracle/</loc>
		<lastmod>2023-05-30T14:02:17+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/fairness-versus-guaranteed-output-delivery-in-secure-multiparty-computation/</loc>
		<lastmod>2023-05-30T14:02:24+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/cut-and-choose-yao-based-secure-computation-in-the-online-offline-and-batch-settings/</loc>
		<lastmod>2023-05-30T14:02:32+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/hiding-the-input-size-in-secure-two-party-computation/</loc>
		<lastmod>2023-05-30T14:02:42+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/fair-and-efficient-secure-multiparty-computation-with-reputation-systems/</loc>
		<lastmod>2023-05-30T14:02:50+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/more-efficient-oblivious-transfer-and-extensions-for-faster-secure-computation/</loc>
		<lastmod>2023-05-30T14:02:57+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/fast-cut-and-choose-based-protocols-for-malicious-and-covert-adversaries/</loc>
		<lastmod>2023-05-30T14:03:04+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/on-the-feasibility-of-extending-oblivious-transfer/</loc>
		<lastmod>2023-05-30T14:03:10+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/a-full-characterization-of-functions-that-imply-fair-coin-tossing-and-ramifications-to-fairness/</loc>
		<lastmod>2023-05-30T14:03:16+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/a-note-on-constant-round-zero-knowledge-proofs-of-knowledge/</loc>
		<lastmod>2023-05-30T14:03:21+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/scapi-the-secure-computation-application-programming-interface/</loc>
		<lastmod>2023-05-30T14:03:26+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/completeness-for-symmetric-two-party-functionalities-revisited/</loc>
		<lastmod>2023-05-30T14:05:08+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/the-ips-compiler-optimizations-variants-and-concrete-efficiency/</loc>
		<lastmod>2023-05-30T14:05:11+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/perfectly-secure-multiplication-for-any-t/</loc>
		<lastmod>2023-05-30T14:05:13+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/1-p-secure-multiparty-computation-without-honest-majority-and-the-best-of-both-worlds/</loc>
		<lastmod>2023-05-30T14:05:16+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/a-full-proof-of-the-bgw-protocol-for-perfectly-secure-multiparty-computation/</loc>
		<lastmod>2023-05-30T14:05:18+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/highly-efficient-universally-composable-commitments-based-on-the-ddh-assumption/</loc>
		<lastmod>2023-05-30T14:05:20+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/secure-two-party-computation-via-cut-and-choose-oblivious-transfer/</loc>
		<lastmod>2023-05-30T14:05:24+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/on-the-black-box-complexity-of-optimally-fair-coin-tossing/</loc>
		<lastmod>2023-05-30T14:05:28+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/impossibility-results-for-universal-composability-in-public-key-models-and-with-fixed-inputs/</loc>
		<lastmod>2023-05-30T14:05:31+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/private-web-search-with-malicious-adversaries/</loc>
		<lastmod>2023-05-30T14:05:38+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/utility-dependence-in-correct-and-fair-rational-secret-sharing/</loc>
		<lastmod>2023-05-30T14:05:41+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/collusion-free-multiparty-computation-in-the-mediated-model/</loc>
		<lastmod>2023-05-30T14:05:44+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/comparison-based-key-exchange-and-the-security-of-the-numeric-comparison-mode-in-bluetooth-v2-1/</loc>
		<lastmod>2023-05-30T14:05:47+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/adaptively-secure-two-party-computation-with-erasures/</loc>
		<lastmod>2023-05-30T14:05:50+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/adaptive-zero-knowledge-proofs-and-adaptively-secure-oblivious-transfer/</loc>
		<lastmod>2023-05-30T14:05:53+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/secure-multiparty-computation-for-privacy-preserving-data-mining/</loc>
		<lastmod>2023-05-30T14:05:56+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/constructions-of-truly-practical-secure-protocols-using-standard-smartcards/</loc>
		<lastmod>2023-05-30T14:05:59+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/implementing-two-party-computation-efficiently-with-security-against-malicious-adversaries/</loc>
		<lastmod>2023-05-30T14:06:18+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/complete-fairness-in-secure-two-party-computation/</loc>
		<lastmod>2023-05-30T14:06:40+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/efficient-fully-simulatable-oblivious-transfer/</loc>
		<lastmod>2023-05-30T14:06:44+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/legally-enforceable-fairness-in-secure-two-party-computation/</loc>
		<lastmod>2023-05-30T14:06:50+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/aggregate-message-authentication-codes/</loc>
		<lastmod>2023-05-30T14:06:54+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/efficient-protocols-for-set-intersection-and-pattern-matching-with-security-against-malicious-and-covert-adversaries/</loc>
		<lastmod>2023-05-30T14:06:58+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/an-efficient-protocol-for-secure-two-party-computation-in-the-presence-of-malicious-adversaries/</loc>
		<lastmod>2023-05-30T14:07:02+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/security-against-covert-adversaries-efficient-protocols-for-realistic-adversaries/</loc>
		<lastmod>2023-05-30T14:07:06+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/concurrently-secure-blind-signatures-without-random-oracles-or-setup-assumptions/</loc>
		<lastmod>2023-05-30T14:07:11+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/on-achieving-the-best-of-both-worlds-in-secure-multiparty-computation/</loc>
		<lastmod>2023-05-30T14:07:15+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/information-theoretically-secure-protocols-and-security-under-composition/</loc>
		<lastmod>2023-05-30T14:07:26+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/black-box-constructions-of-protocols-for-secure-computation/</loc>
		<lastmod>2023-05-30T14:07:32+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/secure-computation-without-authentication/</loc>
		<lastmod>2023-05-30T14:07:36+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/universally-composable-password-based-key-exchange/</loc>
		<lastmod>2023-05-30T14:07:40+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/concurrent-composition-of-secure-protocols-in-the-timing-model/</loc>
		<lastmod>2023-05-30T14:07:44+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/handling-expected-polynomial-time-strategies-in-simulation-based-security-proofs/</loc>
		<lastmod>2023-05-30T14:07:48+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/a-proof-of-security-of-yaos-protocol-for-two-party-computation/</loc>
		<lastmod>2023-05-30T14:07:52+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/protocol-initialization-for-the-framework-of-universal-composability/</loc>
		<lastmod>2023-05-30T14:07:58+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/lower-bounds-and-impossibility-results-for-concurrent-self-composition/</loc>
		<lastmod>2023-05-30T14:08:01+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/lower-bounds-for-concurrent-self-composition/</loc>
		<lastmod>2023-05-30T14:08:04+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/general-composition-and-universal-composability-in-secure-multi-party-computation/</loc>
		<lastmod>2023-05-30T14:08:07+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/bounded-concurrent-secure-two-party-computation-without-setup-assumptions/</loc>
		<lastmod>2023-05-30T14:08:14+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/on-the-limitations-of-universally-composable-two-party-computation-without-set-up-assumptions/</loc>
		<lastmod>2023-05-30T14:08:17+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/a-framework-for-password-based-authenticated-key-exchange/</loc>
		<lastmod>2023-05-30T14:08:23+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/a-simpler-construction-of-cca2-secure-public-key-encryption-under-general-assumptions/</loc>
		<lastmod>2023-05-30T14:08:28+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/secure-computation-without-agreement/</loc>
		<lastmod>2023-05-30T14:08:34+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/sequential-composition-of-protocols-without-simultaneous-termination/</loc>
		<lastmod>2023-05-30T14:08:40+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/on-the-composition-of-authenticated-byzantine-agreement/</loc>
		<lastmod>2023-05-30T14:08:43+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/universally-composable-two-party-and-multi-party-secure-computation/</loc>
		<lastmod>2023-05-30T14:08:48+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/strict-polynomial-time-in-simulation-and-extraction/</loc>
		<lastmod>2023-05-30T14:08:51+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/resettably-sound-zero-knowledge-and-its-applications/</loc>
		<lastmod>2023-05-30T14:08:56+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/session-key-generation-using-human-passwords-only/</loc>
		<lastmod>2023-05-30T14:09:04+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/privacy-preserving-data-mining/</loc>
		<lastmod>2023-05-30T14:09:07+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/a-statistical-theory-for-quantitative-association-rules/</loc>
		<lastmod>2023-05-30T14:09:11+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/textvis-an-integrated-visual-environment-for-text-mining/</loc>
		<lastmod>2023-05-30T14:09:15+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/text-mining-at-the-term-level/</loc>
		<lastmod>2023-05-30T14:09:19+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/lower-bounds-for-non-black-box-zero-knowledge/</loc>
		<lastmod>2023-05-30T14:09:58+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/secure-computation-on-the-web-computing-without-simultaneous-interaction/</loc>
		<lastmod>2023-05-30T14:10:04+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/on-the-composition-of-secure-multi-party-protocols/</loc>
		<lastmod>2023-06-01T08:44:28+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/techniques-for-efficient-secure-computation-based-on-yaos-protocol/</loc>
		<lastmod>2023-06-01T08:47:10+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/fast-secure-multiparty-ecdsa-with-practical-distributed-key-generation-and-applications-to-cryptocurrency-custody/</loc>
		<lastmod>2023-06-05T12:53:17+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/parallel-coin-tossing-and-constant-round-secure-two-party-computation/</loc>
		<lastmod>2023-09-01T12:53:15+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/feldmans-verifiable-secret-sharing-for-a-dishonest-majority/</loc>
		<lastmod>2024-04-30T07:55:13+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/simple-three-round-multiparty-schnorr-signing-with-full-simulatability/</loc>
		<lastmod>2024-04-30T07:56:19+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/exponent-vrfs-and-their-applications/</loc>
		<lastmod>2024-04-30T08:11:32+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/privacy-preserving-search-of-similar-patients-in-genomic-data/</loc>
		<lastmod>2024-04-30T10:55:11+00:00</lastmod>
	</url>
	<url>
		<loc>https://yehudalindell.com/publications/optimizing-and-implementing-fischlins-transform-for-uc-secure-zero-knowledge/</loc>
		<lastmod>2024-06-19T08:28:49+00:00</lastmod>
	</url>
</urlset>
<!-- XML Sitemap generated by Yoast SEO -->