Yehuda Lindell

248 papers A* 48A 3B 11Misc 2Journal 155Unranked 21
YearRankTypeTitle / Venue / Authors
2025 — conf
Exponent-VRFs and Their Applications.
EUROCRYPT (7)
Dan Boneh, Iftach Haitner, Yehuda Lindell, Gil Segev
2025 J jnl
Integer Commitments, Old and New Tools.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Yehuda Lindell, Nikolaos Makriyannis
2024 J jnl
Exponent-VRFs and Their Applications.
IACR Cryptol. ePrint Arch.
Dan Boneh, Iftach Haitner, Yehuda Lindell
2024 J jnl
Feldman's Verifiable Secret Sharing for a Dishonest Majority.
IACR Commun. Cryptol.
Yi-Hsiu Chen, Yehuda Lindell
2024 J jnl
Feldman's Verifiable Secret Sharing for a Dishonest Majority.
IACR Cryptol. ePrint Arch.
Yi-Hsiu Chen, Yehuda Lindell
2024 J jnl
Optimizing and Implementing Fischlin's Transform for UC-Secure Zero Knowledge.
IACR Commun. Cryptol.
Yi-Hsiu Chen, Yehuda Lindell
2024 J jnl
Optimizing and Implementing Fischlin's Transform for UC-Secure Zero-Knowledge.
IACR Cryptol. ePrint Arch.
Yi-Hsiu Chen, Yehuda Lindell
2024 J jnl
Simple Three-Round Multiparty Schnorr Signing with Full Simulatability.
IACR Commun. Cryptol.
Yehuda Lindell
2023 J jnl
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries.
J. Cryptol.
Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Daniel Genkin, Yehuda Lindell, Ariel Nof
2023 J jnl
High-Throughput Secure Three-Party Computation with an Honest Majority.
J. Cryptol.
Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein
2022 J jnl
Simple Three-Round Multiparty Schnorr Signing with Full Simulatability.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2021 J jnl
Fast Secure Two-Party ECDSA Signing.
J. Cryptol.
Yehuda Lindell
2021 J jnl
Secure multiparty computation.
Commun. ACM
Yehuda Lindell
2020 J jnl
1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds.
J. Cryptol.
Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
2020 J jnl
Deterministic-Prover Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Hila Dahari, Yehuda Lindell
2020 J jnl
Secure Multiparty Computation (MPC).
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2019 J jnl
AES-GCM-SIV: Nonce Misuse-Resistant Authenticated Encryption.
RFC
Shay Gueron, Adam Langley, Yehuda Lindell
2019 Misc conf
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme.
ACISP
Michael Kraitsberg, Yehuda Lindell, Valery Osheter, Nigel P. Smart, Younes Talibi Alaoui
2019 J jnl
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ.
J. Cryptol.
Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai
2019 J jnl
SimpleENC and SimpleENCsmall - an Authenticated Encryption Mode for the Lightweight Setting.
IACR Cryptol. ePrint Arch.
Shay Gueron, Yehuda Lindell
2019 A* conf
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest.
CCS
Jun Furukawa, Yehuda Lindell
2019 J jnl
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest.
IACR Cryptol. ePrint Arch.
Jun Furukawa, Yehuda Lindell
2018 J jnl
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme.
IACR Cryptol. ePrint Arch.
Michael Kraitsberg, Yehuda Lindell, Valery Osheter, Nigel P. Smart, Younes Talibi Alaoui
2018 A* conf
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants.
CCS
Assi Barak, Martin Hirt, Lior Koskas, Yehuda Lindell
2018 J jnl
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants.
IACR Cryptol. ePrint Arch.
Assi Barak, Martin Hirt, Lior Koskas, Yehuda Lindell
2018 J jnl
Completeness for Symmetric Two-Party Functionalities: Revisited.
J. Cryptol.
Yehuda Lindell, Eran Omri, Hila Zarosim
2018 J jnl
Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries.
IACR Cryptol. ePrint Arch.
Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas
2018 — conf
Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries.
CRYPTO (2)
Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas
2018 J jnl
Fast Garbling of Circuits Under Standard Assumptions.
J. Cryptol.
Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas
2018 — conf
Fast Garbling of Circuits over 3-Valued Logic.
Public Key Cryptography (1)
Yehuda Lindell, Avishay Yanai
2018 — conf
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries.
CRYPTO (3)
Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof
2018 J jnl
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries.
IACR Cryptol. ePrint Arch.
Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof
2018 A* conf
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody.
CCS
Yehuda Lindell, Ariel Nof
2018 J jnl
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Ariel Nof, Samuel Ranellucci
2018 J jnl
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation.
Comput. J.
David W. Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P. Smart, Rebecca N. Wright
2018 J jnl
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation.
IACR Cryptol. ePrint Arch.
David W. Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P. Smart, Rebecca N. Wright
2018 A* conf
Generalizing the SPDZ Compiler For Other Protocols.
CCS
Toshinori Araki, Assi Barak, Jun Furukawa, Marcel Keller, Yehuda Lindell, Kazuma Ohara, Hikaru Tsuchida
2018 J jnl
Generalizing the SPDZ Compiler For Other Protocols.
IACR Cryptol. ePrint Arch.
Toshinori Araki, Assi Barak, Jun Furukawa, Marcel Keller, Yehuda Lindell, Kazuma Ohara, Hikaru Tsuchida
2018 J jnl
On the Feasibility of Extending Oblivious Transfer.
J. Cryptol.
Yehuda Lindell, Hila Zarosim
2018 J jnl
Privacy-Preserving Search of Similar Patients in Genomic Data.
Proc. Priv. Enhancing Technol.
Gilad Asharov, Shai Halevi, Yehuda Lindell, Tal Rabin
2018 J jnl
Turning Lemons into Peaches using Secure Computation.
CoRR
Stav Buchsbaum, Ran Gilad-Bachrach, Yehuda Lindell
2017 A* conf
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.
CCS
Yehuda Lindell, Ariel Nof
2017 J jnl
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Ariel Nof
2017 J jnl
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation.
J. Cryptol.
Gilad Asharov, Yehuda Lindell
2017 J jnl
AES-GCM-SIV: Specification and Analysis.
IACR Cryptol. ePrint Arch.
Shay Gueron, Adam Langley, Yehuda Lindell
2017 A* conf
Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation.
CCS
Shay Gueron, Yehuda Lindell
2017 J jnl
Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation.
IACR Cryptol. ePrint Arch.
Shay Gueron, Yehuda Lindell
2017 — conf
Efficient Scalable Constant-Round MPC via Garbled Circuits.
ASIACRYPT (2)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
2017 J jnl
Efficient Scalable Constant-Round MPC via Garbled Circuits.
IACR Cryptol. ePrint Arch.
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
2017 J jnl
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation.
J. Cryptol.
Ran Cohen, Yehuda Lindell
2017 J jnl
Fast Garbling of Circuits over 3-Valued Logic.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Avishay Yanai
2017 — conf
Fast Secure Two-Party ECDSA Signing.
CRYPTO (2)
Yehuda Lindell
2017 J jnl
Fast Secure Two-Party ECDSA Signing.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2017 — conf
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority.
EUROCRYPT (2)
Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein
2017 J jnl
How To Simulate It - A Tutorial on the Simulation Proof Technique.
Electron. Colloquium Comput. Complex.
Yehuda Lindell
2017 — ch.
How to Simulate It - A Tutorial on the Simulation Proof Technique.
Tutorials on the Foundations of Cryptography
Yehuda Lindell
2017 J jnl
More Efficient Oblivious Transfer Extensions.
J. Cryptol.
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
2017 A* conf
Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier.
IEEE Symposium on Security and Privacy
Toshinori Araki, Assi Barak, Jun Furukawa, Tamar Lichter, Yehuda Lindell, Ariel Nof, Kazuma Ohara, Adi Watzman, Or Weinstein
2017 J jnl
Privacy-Preserving Search of Similar Patients in Genomic Data.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Shai Halevi, Yehuda Lindell, Tal Rabin
2017 — conf
Secure Two-Party Computation with Fairness - A Necessary Design Principle.
TCC (1)
Yehuda Lindell, Tal Rabin
2017 J jnl
Secure Two-Party Computation with Fairness - A Necessary Design Principle.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Tal Rabin
2017 — book
Tutorials on the Foundations of Cryptography.
Yehuda Lindell
2016 A* conf
Attribute-based Key Exchange with General Policies.
CCS
Vladimir Kolesnikov, Hugo Krawczyk, Yehuda Lindell, Alex J. Malozemoff, Tal Rabin
2016 J jnl
Attribute-based Key Exchange with General Policies.
IACR Cryptol. ePrint Arch.
Vladimir Kolesnikov, Hugo Krawczyk, Yehuda Lindell, Alex J. Malozemoff, Tal Rabin
2016 A* conf
DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation.
CCS
Toshinori Araki, Assaf Barak, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara
2016 J jnl
Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries.
J. Cryptol.
Yehuda Lindell
2016 J jnl
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority.
IACR Cryptol. ePrint Arch.
Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein
2016 A* conf
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority.
CCS
Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara
2016 J jnl
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority.
IACR Cryptol. ePrint Arch.
Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara
2016 J jnl
How To Simulate It - A Tutorial on the Simulation Proof Technique.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2016 J jnl
More Efficient Constant-Round Multi-Party Computation from BMR and SHE.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez
2016 — conf
More Efficient Constant-Round Multi-party Computation from BMR and SHE.
TCC (B1)
Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez
2016 J jnl
More Efficient Oblivious Transfer Extensions.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
2016 A* conf
Optimizing Semi-Honest Secure Multiparty Computation for the Internet.
CCS
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
2016 J jnl
Optimizing Semi-Honest Secure Multiparty Computation for the Internet.
IACR Cryptol. ePrint Arch.
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
2015 — conf
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.
CRYPTO (2)
Ran Canetti, Asaf Cohen, Yehuda Lindell
2015 A* conf
Adaptively Secure Computation with Partial Erasures.
PODC
Carmit Hazay, Yehuda Lindell, Arpita Patra
2015 J jnl
Adaptively Secure Computation with Partial Erasures.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Yehuda Lindell, Arpita Patra
2015 J jnl
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.
J. Cryptol.
Yehuda Lindell, Benny Pinkas
2015 — conf
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle.
TCC (1)
Yehuda Lindell
2015 A* conf
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries.
CCS
Yehuda Lindell, Ben Riva
2015 J jnl
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Ben Riva
2015 J jnl
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai
2015 — conf
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ.
CRYPTO (2)
Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai
2015 A* conf
Fast Garbling of Circuits Under Standard Assumptions.
CCS
Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas
2015 J jnl
Fast Garbling of Circuits Under Standard Assumptions.
IACR Cryptol. ePrint Arch.
Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas
2015 A* conf
GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte.
CCS
Shay Gueron, Yehuda Lindell
2015 J jnl
GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte.
IACR Cryptol. ePrint Arch.
Shay Gueron, Yehuda Lindell
2015 — conf
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.
EUROCRYPT (1)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
2015 J jnl
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
2014 J jnl
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.
IACR Cryptol. ePrint Arch.
Ran Canetti, Asaf Cohen, Yehuda Lindell
2014 J jnl
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2014 J jnl
Completeness for Symmetric Two-Party Functionalities - Revisited.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Eran Omri, Hila Zarosim
2014 J jnl
Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Ben Riva
2014 — conf
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings.
CRYPTO (2)
Yehuda Lindell, Ben Riva
2014 J jnl
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation.
IACR Cryptol. ePrint Arch.
Ran Cohen, Yehuda Lindell
2014 — conf
Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation.
ASIACRYPT (2)
Ran Cohen, Yehuda Lindell
2014 — book
Introduction to Modern Cryptography, Second Edition
Jonathan Katz, Yehuda Lindell
2014 B ed.
Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings
TCC
Yehuda Lindell
2013 B conf
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.
TCC
Gilad Asharov, Yehuda Lindell, Tal Rabin
2013 J jnl
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge.
J. Cryptol.
Yehuda Lindell
2013 — conf
Fair and Efficient Secure Multiparty Computation with Reputation Systems.
ASIACRYPT (2)
Gilad Asharov, Yehuda Lindell, Hila Zarosim
2013 J jnl
Fair and Efficient Secure Multiparty Computation with Reputation Systems.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Yehuda Lindell, Hila Zarosim
2013 — conf
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.
CRYPTO (2)
Yehuda Lindell
2013 J jnl
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2013 J jnl
Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Yehuda Lindell, Tal Rabin
2013 — conf
Hiding the Input-Size in Secure Two-Party Computation.
ASIACRYPT (2)
Yehuda Lindell, Kobbi Nissim, Claudio Orlandi
2013 J jnl
More Efficient Oblivious Transfer and Extensions for Faster Secure Computation.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
2013 A* conf
More efficient oblivious transfer and extensions for faster secure computation.
CCS
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
2013 B conf
On the Feasibility of Extending Oblivious Transfer.
TCC
Yehuda Lindell, Hila Zarosim
2013 — conf
Techniques for Efficient Secure Computation Based on Yao's Protocol.
Public Key Cryptography
Yehuda Lindell
2013 — ch.
The BGW Protocol for Perfectly-Secure Multiparty Computation.
Secure Multi-Party Computation
Gilad Asharov, Yehuda Lindell
2012 A conf
Completeness for Symmetric Two-Party Functionalities - Revisited.
ASIACRYPT
Yehuda Lindell, Eran Omri, Hila Zarosim
2012 J jnl
Hiding the Input-Size in Secure Two-Party Computation.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Kobbi Nissim, Claudio Orlandi
2012 J jnl
On the Feasibility of Extending Oblivious Transfer.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Hila Zarosim
2012 J jnl
SCAPI: The Secure Computation Application Programming Interface.
IACR Cryptol. ePrint Arch.
Yael Ejgenberg, Moriya Farbstein, Meital Levy, Yehuda Lindell
2012 J jnl
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.
J. Cryptol.
Yehuda Lindell, Benny Pinkas
2011 A* conf
1/
CRYPTO
Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
2011 J jnl
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation.
Electron. Colloquium Comput. Complex.
Gilad Asharov, Yehuda Lindell
2011 J jnl
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Yehuda Lindell
2011 J jnl
A Practical Application of Differential Privacy to Personalized Online Advertising.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Eran Omri
2011 J jnl
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.
J. Cryptol.
Yehuda Lindell, Hila Zarosim
2011 J jnl
Anonymous Authentication.
J. Priv. Confidentiality
Yehuda Lindell
2011 J jnl
Black-Box Constructions of Protocols for Secure Computation.
SIAM J. Comput.
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2011 J jnl
Complete Fairness in Secure Two-Party Computation.
J. ACM
S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell
2011 J jnl
Constant-Round Zero-Knowledge Proofs of Knowledge.
Electron. Colloquium Comput. Complex.
Yehuda Lindell
2011 A* conf
Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption.
EUROCRYPT
Yehuda Lindell
2011 J jnl
Highly-Efficient Universally-Composable Commitments based on the DDH Assumption.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2011 J jnl
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs.
J. Cryptol.
Dafna Kidron, Yehuda Lindell
2011 J jnl
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
SIAM J. Comput.
Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2011 B conf
On the Black-Box Complexity of Optimally-Fair Coin Tossing.
TCC
Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin
2011 A* conf
Perfectly-Secure Multiplication for Any
CRYPTO
Gilad Asharov, Yehuda Lindell, Tal Rabin
2011 J jnl
Secure Computation Without Authentication.
J. Cryptol.
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin
2011 A* conf
Secure Computation on the Web: Computing without Simultaneous Interaction.
CRYPTO
Shai Halevi, Yehuda Lindell, Benny Pinkas
2011 J jnl
Secure Computation on the Web: Computing without Simultaneous Interaction.
IACR Cryptol. ePrint Arch.
Shai Halevi, Yehuda Lindell, Benny Pinkas
2011 B conf
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.
TCC
Yehuda Lindell, Benny Pinkas
2011 A* conf
The IPS Compiler: Optimizations, Variants and Concrete Efficiency.
CRYPTO
Yehuda Lindell, Eli Oxman, Benny Pinkas
2011 J jnl
The IPS Compiler: Optimizations, Variants and Concrete Efficiency.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Benny Pinkas, Eli Oxman
2011 J jnl
Utility Dependence in Correct and Fair Rational Secret Sharing.
J. Cryptol.
Gilad Asharov, Yehuda Lindell
2010 J jnl
A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Yehuda Lindell
2010 J jnl
A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Yehuda Lindell
2010 J jnl
Black-Box Constructions of Protocols for Secure Computation.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2010 J jnl
Constant-Round Zero-Knowledge Proofs of Knowledge.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2010 J jnl
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.
J. Cryptol.
Carmit Hazay, Yehuda Lindell
2010 — book
Efficient Secure Two-Party Protocols - Techniques and Constructions
Carmit Hazay, Yehuda Lindell
2010 J jnl
Information-Theoretically Secure Protocols and Security under Composition.
SIAM J. Comput.
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
2010 J jnl
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
IACR Cryptol. ePrint Arch.
Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2010 A conf
Private Web Search with Malicious Adversaries.
Privacy Enhancing Technologies
Yehuda Lindell, Erez Waisbard
2010 J jnl
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Benny Pinkas
2010 J jnl
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.
J. Cryptol.
Yonatan Aumann, Yehuda Lindell
2009 J jnl
A Proof of Security of Yao's Protocol for Two-Party Computation.
J. Cryptol.
Yehuda Lindell, Benny Pinkas
2009 B conf
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.
TCC
Yehuda Lindell, Hila Zarosim
2009 J jnl
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Hila Zarosim
2009 J jnl
Adaptively Secure Two-Party Computation with Erasures.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2009 A* conf
Collusion-Free Multiparty Computation in the Mediated Model.
CRYPTO
Joël Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti
2009 J jnl
Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2009 J jnl
Constructions of Truly Practical Secure Protocols using Standard Smartcards.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Yehuda Lindell
2009 J jnl
Efficient Oblivious Polynomial Evaluation with Simulation-Based Security.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Yehuda Lindell
2009 J jnl
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Yehuda Lindell
2009 J jnl
General Composition and Universal Composability in Secure Multiparty Computation.
J. Cryptol.
Yehuda Lindell
2009 J jnl
Information-Theoretically Secure Protocols and Security Under Composition.
IACR Cryptol. ePrint Arch.
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
2009 J jnl
Legally Enforceable Fairness in Secure Two-Party Communication.
Chic. J. Theor. Comput. Sci.
Yehuda Lindell
2009 — ch.
Secure Computation for Privacy Preserving Data Mining.
Encyclopedia of Data Warehousing and Mining
Yehuda Lindell
2009 J jnl
Secure Multiparty Computation for Privacy-Preserving Data Mining.
J. Priv. Confidentiality
Yehuda Lindell, Benny Pinkas
2009 A* conf
Utility Dependence in Correct and Fair Rational Secret Sharing.
CRYPTO
Gilad Asharov, Yehuda Lindell
2009 J jnl
Utility Dependence in Correct and Fair Rational Secret Sharing.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Yehuda Lindell
2008 J jnl
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Benny Pinkas
2008 J jnl
Collusion-Free Multiparty Computation in the Mediated Model.
IACR Cryptol. ePrint Arch.
Jonathan Katz, Yehuda Lindell
2008 J jnl
Complete Fairness in Secure Two-Party Computation.
IACR Cryptol. ePrint Arch.
S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell
2008 A* conf
Complete fairness in secure two-party computation.
STOC
S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell
2008 A* conf
Constructions of truly practical secure protocols using standard smartcards.
CCS
Carmit Hazay, Yehuda Lindell
2008 J jnl
Efficient Fully-Simulatable Oblivious Transfer.
Chic. J. Theor. Comput. Sci.
Yehuda Lindell
2008 J jnl
Efficient Fully-Simulatable Oblivious Transfer.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2008 B conf
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.
TCC
Carmit Hazay, Yehuda Lindell
2008 J jnl
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.
J. Cryptol.
Jonathan Katz, Yehuda Lindell
2008 Misc conf
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries.
SCN
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
2008 J jnl
Lower Bounds and Impossibility Results for Concurrent Self Composition.
J. Cryptol.
Yehuda Lindell
2008 J jnl
Secure Multiparty Computation for Privacy-Preserving Data Mining.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Benny Pinkas
2007 A* conf
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.
EUROCRYPT
Yehuda Lindell, Benny Pinkas
2007 J jnl
Concurrent Composition of Secure Protocols in the Timing Model.
J. Cryptol.
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran
2007 B conf
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions.
TCC
Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell
2007 J jnl
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs.
IACR Cryptol. ePrint Arch.
Dafna Kidron, Yehuda Lindell
2007 — book
Introduction to Modern Cryptography
Jonathan Katz, Yehuda Lindell
2007 J jnl
Secure Computation Without Authentication.
IACR Cryptol. ePrint Arch.
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin
2007 B conf
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.
TCC
Yonatan Aumann, Yehuda Lindell
2007 J jnl
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.
IACR Cryptol. ePrint Arch.
Yonatan Aumann, Yehuda Lindell
2006 J jnl
A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions.
J. Cryptol.
Yehuda Lindell
2006 J jnl
A framework for password-based authenticated key exchange
ACM Trans. Inf. Syst. Secur.
Rosario Gennaro, Yehuda Lindell
2006 A* conf
Black-box constructions for secure computation.
STOC
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2006 A* conf
Information-theoretically secure protocols and security under composition.
STOC
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
2006 J jnl
Lower bounds for non-black-box zero knowledge.
J. Comput. Syst. Sci.
Boaz Barak, Yehuda Lindell, Salil P. Vadhan
2006 A* conf
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation.
CRYPTO
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2006 J jnl
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions.
J. Cryptol.
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
2006 J jnl
On the composition of authenticated Byzantine Agreement.
J. ACM
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
2006 J jnl
Protocols for Bounded-Concurrent Secure Two-Party Computation.
Chic. J. Theor. Comput. Sci.
Yehuda Lindell
2006 J jnl
Session-Key Generation Using Human Passwords Only.
J. Cryptol.
Oded Goldreich, Yehuda Lindell
2005 J jnl
Concurrent Composition of Secure Protocols in the Timing Model.
IACR Cryptol. ePrint Arch.
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran
2005 A* conf
Concurrent general composition of secure protocols in the timing model.
STOC
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran
2005 B conf
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.
TCC
Jonathan Katz, Yehuda Lindell
2005 J jnl
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.
IACR Cryptol. ePrint Arch.
Jonathan Katz, Yehuda Lindell
2005 A* conf
Secure Computation Without Authentication.
CRYPTO
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin
2005 J jnl
Secure Multi-Party Computation without Agreement.
J. Cryptol.
Shafi Goldwasser, Yehuda Lindell
2005 A* conf
Universally Composable Password-Based Key Exchange.
EUROCRYPT
Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie
2005 J jnl
Universally Composable Password-Based Key Exchange.
IACR Cryptol. ePrint Arch.
Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie
2004 J jnl
A Proof of Yao's Protocol for Secure Two-Party Computation
Electron. Colloquium Comput. Complex.
Yehuda Lindell, Benny Pinkas
2004 J jnl
A Proof of Yao's Protocol for Secure Two-Party Computation.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Benny Pinkas
2004 J jnl
Lower Bounds and Impossibility Results for Concurrent Self Composition.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2004 B conf
Lower Bounds for Concurrent Self Composition.
TCC
Yehuda Lindell
2004 J jnl
Lower Bounds for Non-Black-Box Zero Knowledge
Electron. Colloquium Comput. Complex.
Boaz Barak, Yehuda Lindell, Salil P. Vadhan
2004 J jnl
Lower Bounds for Non-Black-Box Zero Knowledge.
IACR Cryptol. ePrint Arch.
Boaz Barak, Yehuda Lindell, Salil P. Vadhan
2004 J jnl
On the Composition of Authenticated Byzantine Agreement.
IACR Cryptol. ePrint Arch.
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
2004 J jnl
On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions.
IACR Cryptol. ePrint Arch.
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
2004 J jnl
Protocol Initialization for the Framework of Universal Composability.
IACR Cryptol. ePrint Arch.
Boaz Barak, Yehuda Lindell, Tal Rabin
2004 J jnl
Strict Polynomial-Time in Simulation and Extraction.
SIAM J. Comput.
Boaz Barak, Yehuda Lindell
2003 A* conf
A Framework for Password-Based Authenticated Key Exchange.
EUROCRYPT
Rosario Gennaro, Yehuda Lindell
2003 J jnl
A Framework for Password-Based Authenticated Key Exchange.
IACR Cryptol. ePrint Arch.
Rosario Gennaro, Yehuda Lindell
2003 A* conf
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions.
EUROCRYPT
Yehuda Lindell
2003 J jnl
A Statistical Theory for Quantitative Association Rules.
J. Intell. Inf. Syst.
Yonatan Aumann, Yehuda Lindell
2003 A* conf
Bounded-concurrent secure two-party computation without setup assumptions.
STOC
Yehuda Lindell
2003 A* conf
Brief announcement: impossibility results for concurrent secure two-party computation.
PODC
Yehuda Lindell
2003 — book
Composition of Secure Multi-Party Protocols, A Comprehensive Study
Yehuda Lindell
2003 A* conf
General Composition and Universal Composability in Secure Multi-Party Computation.
FOCS
Yehuda Lindell
2003 J jnl
General Composition and Universal Composability in Secure Multiparty Computation.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2003 A* conf
Lower Bounds for Non-Black-Box Zero Knowledge.
FOCS
Boaz Barak, Yehuda Lindell, Salil P. Vadhan
2003 A* conf
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions.
EUROCRYPT
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
2003 J jnl
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.
J. Cryptol.
Yehuda Lindell
2003 J jnl
Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2002 J jnl
A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2002 A* conf
On the composition of authenticated byzantine agreement.
STOC
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
2002 J jnl
Privacy Preserving Data Mining.
J. Cryptol.
Yehuda Lindell, Benny Pinkas
2002 J jnl
Secure Computation Without Agreement.
IACR Cryptol. ePrint Arch.
Shafi Goldwasser, Yehuda Lindell
2002 A conf
Secure Computation without Agreement.
DISC
Shafi Goldwasser, Yehuda Lindell
2002 A* conf
Sequential composition of protocols without simultaneous termination.
PODC
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
2002 J jnl
Strict Polynomial-time in Simulation and Extraction
Electron. Colloquium Comput. Complex.
Boaz Barak, Yehuda Lindell
2002 J jnl
Strict Polynomial-time in Simulation and Extraction.
IACR Cryptol. ePrint Arch.
Boaz Barak, Yehuda Lindell
2002 A* conf
Strict polynomial-time in simulation and extraction.
STOC
Boaz Barak, Yehuda Lindell
2002 J jnl
Universally Composable Two-Party and Multi-Party Secure Computation.
IACR Cryptol. ePrint Arch.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai
2002 A* conf
Universally composable two-party and multi-party secure computation.
STOC
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai
2001 A* conf
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.
CRYPTO
Yehuda Lindell
2001 J jnl
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.
IACR Cryptol. ePrint Arch.
Yehuda Lindell
2001 A* conf
Resettably-Sound Zero-Knowledge and its Applications.
FOCS
Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell
2001 J jnl
Resettably-Sound Zero-Knowledge and its Applications.
IACR Cryptol. ePrint Arch.
Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell
2001 A* conf
Session-Key Generation Using Human Passwords Only.
CRYPTO
Oded Goldreich, Yehuda Lindell
2000 A* conf
Privacy Preserving Data Mining.
CRYPTO
Yehuda Lindell, Benny Pinkas
2000 J jnl
Session-Key Generation using Human Passwords Only.
IACR Cryptol. ePrint Arch.
Oded Goldreich, Yehuda Lindell
1999 A* conf
A Statistical Theory for Quantitative Association Rules.
KDD
Yonatan Aumann, Yehuda Lindell
1998 — conf
Text Mining at the Term Level.
PKDD
Ronen Feldman, Moshe Fresko, Yakkov Kinar, Yehuda Lindell, Orly Liphstat, Martin Rajman, Yonatan Schler, Oren Zamir
1998 — conf
TextVis: An Integrated Visual Environment for Text Mining.
PKDD
David Landau, Ronen Feldman, Yonatan Aumann, Moshe Fresko, Yehuda Lindell, Orly Liphstat, Oren Zamir