Yehuda Lindell

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 70

Top Venues

IACR Cryptol. ePrint Arch.

CCS

J. Cryptol.

CRYPTO (2)

Publications

Yi-Hsiu Chen, Yehuda Lindell
Feldman's Verifiable Secret Sharing for a Dishonest Majority. IACR Commun. Cryptol. 1 (1) (2024)
Yi-Hsiu Chen, Yehuda Lindell
Feldman's Verifiable Secret Sharing for a Dishonest Majority. IACR Cryptol. ePrint Arch. 2024 (2024)
Yi-Hsiu Chen, Yehuda Lindell
Optimizing and Implementing Fischlin's Transform for UC-Secure Zero-Knowledge. IACR Cryptol. ePrint Arch. 2024 (2024)
Yehuda Lindell
Simple Three-Round Multiparty Schnorr Signing with Full Simulatability. IACR Commun. Cryptol. 1 (1) (2024)
Dan Boneh, Iftach Haitner, Yehuda Lindell
Exponent-VRFs and Their Applications. IACR Cryptol. ePrint Arch. 2024 (2024)
Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Daniel Genkin, Yehuda Lindell, Ariel Nof
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. J. Cryptol. 36 (3) (2023)
Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein
High-Throughput Secure Three-Party Computation with an Honest Majority. J. Cryptol. 36 (3) (2023)
Yehuda Lindell
Simple Three-Round Multiparty Schnorr Signing with Full Simulatability. IACR Cryptol. ePrint Arch. 2022 (2022)
Yehuda Lindell
Secure multiparty computation. Commun. ACM 64 (1) (2021)
Yehuda Lindell
Fast Secure Two-Party ECDSA Signing. J. Cryptol. 34 (4) (2021)
Yehuda Lindell
Secure Multiparty Computation (MPC). IACR Cryptol. ePrint Arch. 2020 (2020)
Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds. J. Cryptol. 33 (4) (2020)
Hila Dahari, Yehuda Lindell
Deterministic-Prover Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2020 (2020)
Jun Furukawa, Yehuda Lindell
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. IACR Cryptol. ePrint Arch. 2019 (2019)
Shay Gueron, Yehuda Lindell
SimpleENC and SimpleENCsmall - an Authenticated Encryption Mode for the Lightweight Setting. IACR Cryptol. ePrint Arch. 2019 (2019)
Jun Furukawa, Yehuda Lindell
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. CCS (2019)
Michael Kraitsberg, Yehuda Lindell, Valery Osheter, Nigel P. Smart, Younes Talibi Alaoui
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme. ACISP (2019)
Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ. J. Cryptol. 32 (3) (2019)
Shay Gueron, Adam Langley, Yehuda Lindell
AES-GCM-SIV: Nonce Misuse-Resistant Authenticated Encryption. RFC 8452 (2019)
Assi Barak, Martin Hirt, Lior Koskas, Yehuda Lindell
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. CCS (2018)
Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas
Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries. CRYPTO (2) (2018)
Yehuda Lindell, Ariel Nof, Samuel Ranellucci
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. IACR Cryptol. ePrint Arch. 2018 (2018)
Michael Kraitsberg, Yehuda Lindell, Valery Osheter, Nigel P. Smart, Younes Talibi Alaoui
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme. IACR Cryptol. ePrint Arch. 2018 (2018)
Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. CRYPTO (3) (2018)
Stav Buchsbaum, Ran Gilad-Bachrach, Yehuda Lindell
Turning Lemons into Peaches using Secure Computation. CoRR (2018)
Toshinori Araki, Assi Barak, Jun Furukawa, Marcel Keller, Yehuda Lindell, Kazuma Ohara, Hikaru Tsuchida
Generalizing the SPDZ Compiler For Other Protocols. CCS (2018)
Gilad Asharov, Shai Halevi, Yehuda Lindell, Tal Rabin
Privacy-Preserving Search of Similar Patients in Genomic Data. Proc. Priv. Enhancing Technol. 2018 (4) (2018)
David W. Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P. Smart, Rebecca N. Wright
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. Comput. J. 61 (12) (2018)
Yehuda Lindell, Eran Omri, Hila Zarosim
Completeness for Symmetric Two-Party Functionalities: Revisited. J. Cryptol. 31 (3) (2018)
Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas
Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries. IACR Cryptol. ePrint Arch. 2018 (2018)
Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas
Fast Garbling of Circuits Under Standard Assumptions. J. Cryptol. 31 (3) (2018)
Yehuda Lindell, Hila Zarosim
On the Feasibility of Extending Oblivious Transfer. J. Cryptol. 31 (3) (2018)
Toshinori Araki, Assi Barak, Jun Furukawa, Marcel Keller, Yehuda Lindell, Kazuma Ohara, Hikaru Tsuchida
Generalizing the SPDZ Compiler For Other Protocols. IACR Cryptol. ePrint Arch. 2018 (2018)
Yehuda Lindell, Avishay Yanai
Fast Garbling of Circuits over 3-Valued Logic. Public Key Cryptography (1) (2018)
Assi Barak, Martin Hirt, Lior Koskas, Yehuda Lindell
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. IACR Cryptol. ePrint Arch. 2018 (2018)
Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. IACR Cryptol. ePrint Arch. 2018 (2018)
Yehuda Lindell, Ariel Nof
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. CCS (2018)
David W. Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P. Smart, Rebecca N. Wright
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2018 (2018)
Yehuda Lindell, Avishay Yanai
Fast Garbling of Circuits over 3-Valued Logic. IACR Cryptol. ePrint Arch. 2017 (2017)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Efficient Scalable Constant-Round MPC via Garbled Circuits. IACR Cryptol. ePrint Arch. 2017 (2017)
Yehuda Lindell, Tal Rabin
Secure Two-Party Computation with Fairness - A Necessary Design Principle. IACR Cryptol. ePrint Arch. 2017 (2017)
Yehuda Lindell
Fast Secure Two-Party ECDSA Signing. IACR Cryptol. ePrint Arch. 2017 (2017)
Yehuda Lindell, Ariel Nof
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. CCS (2017)
Yehuda Lindell
How To Simulate It - A Tutorial on the Simulation Proof Technique. Electron. Colloquium Comput. Complex. 24 (2017)
Yehuda Lindell
Fast Secure Two-Party ECDSA Signing. CRYPTO (2) (2017)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Efficient Scalable Constant-Round MPC via Garbled Circuits. ASIACRYPT (2) (2017)
Gilad Asharov, Yehuda Lindell
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation. J. Cryptol. 30 (1) (2017)
Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. EUROCRYPT (2) (2017)
Yehuda Lindell, Ariel Nof
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. IACR Cryptol. ePrint Arch. 2017 (2017)
Shay Gueron, Yehuda Lindell
Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation. IACR Cryptol. ePrint Arch. 2017 (2017)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer Extensions. J. Cryptol. 30 (3) (2017)
Yehuda Lindell, Tal Rabin
Secure Two-Party Computation with Fairness - A Necessary Design Principle. TCC (1) (2017)
Shay Gueron, Yehuda Lindell
Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation. CCS (2017)
Shay Gueron, Adam Langley, Yehuda Lindell
AES-GCM-SIV: Specification and Analysis. IACR Cryptol. ePrint Arch. 2017 (2017)
Gilad Asharov, Shai Halevi, Yehuda Lindell, Tal Rabin
Privacy-Preserving Search of Similar Patients in Genomic Data. IACR Cryptol. ePrint Arch. 2017 (2017)
Toshinori Araki, Assi Barak, Jun Furukawa, Tamar Lichter, Yehuda Lindell, Ariel Nof, Kazuma Ohara, Adi Watzman, Or Weinstein
Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. IEEE Symposium on Security and Privacy (2017)
Ran Cohen, Yehuda Lindell
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. J. Cryptol. 30 (4) (2017)
Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. CCS (2016)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer Extensions. IACR Cryptol. ePrint Arch. 2016 (2016)
Toshinori Araki, Assaf Barak, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara
DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation. CCS (2016)
Vladimir Kolesnikov, Hugo Krawczyk, Yehuda Lindell, Alex J. Malozemoff, Tal Rabin
Attribute-based Key Exchange with General Policies. IACR Cryptol. ePrint Arch. 2016 (2016)
Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez
More Efficient Constant-Round Multi-Party Computation from BMR and SHE. IACR Cryptol. ePrint Arch. 2016 (2016)
Vladimir Kolesnikov, Hugo Krawczyk, Yehuda Lindell, Alex J. Malozemoff, Tal Rabin
Attribute-based Key Exchange with General Policies. CCS (2016)
Yehuda Lindell
Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries. J. Cryptol. 29 (2) (2016)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. IACR Cryptol. ePrint Arch. 2016 (2016)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. CCS (2016)
Yehuda Lindell
How To Simulate It - A Tutorial on the Simulation Proof Technique. IACR Cryptol. ePrint Arch. 2016 (2016)
Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez
More Efficient Constant-Round Multi-party Computation from BMR and SHE. TCC (B1) (2016)
Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. IACR Cryptol. ePrint Arch. 2016 (2016)
Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. IACR Cryptol. ePrint Arch. 2016 (2016)
Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ. CRYPTO (2) (2015)
Yehuda Lindell, Ben Riva
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries. IACR Cryptol. ePrint Arch. 2015 (2015)
Carmit Hazay, Yehuda Lindell, Arpita Patra
Adaptively Secure Computation with Partial Erasures. PODC (2015)
Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas
Fast Garbling of Circuits Under Standard Assumptions. CCS (2015)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. IACR Cryptol. ePrint Arch. 2015 (2015)
Ran Canetti, Asaf Cohen, Yehuda Lindell
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. CRYPTO (2) (2015)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. EUROCRYPT (1) (2015)
Shay Gueron, Yehuda Lindell
GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte. IACR Cryptol. ePrint Arch. 2015 (2015)
Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ. IACR Cryptol. ePrint Arch. 2015 (2015)
Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas
Fast Garbling of Circuits Under Standard Assumptions. IACR Cryptol. ePrint Arch. 2015 (2015)
Yehuda Lindell, Benny Pinkas
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. J. Cryptol. 28 (2) (2015)
Yehuda Lindell
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle. TCC (1) (2015)
Carmit Hazay, Yehuda Lindell, Arpita Patra
Adaptively Secure Computation with Partial Erasures. IACR Cryptol. ePrint Arch. 2015 (2015)
Yehuda Lindell, Ben Riva
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries. CCS (2015)
Shay Gueron, Yehuda Lindell
GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte. CCS (2015)
Ran Canetti, Asaf Cohen, Yehuda Lindell
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. IACR Cryptol. ePrint Arch. 2014 (2014)
Yehuda Lindell
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle. IACR Cryptol. ePrint Arch. 2014 (2014)
Ran Cohen, Yehuda Lindell
Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation. ASIACRYPT (2) (2014)
Yehuda Lindell, Ben Riva
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings. CRYPTO (2) (2014)
Yehuda Lindell, Eran Omri, Hila Zarosim
Completeness for Symmetric Two-Party Functionalities - Revisited. IACR Cryptol. ePrint Arch. 2014 (2014)
Yehuda Lindell, Ben Riva
Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings. IACR Cryptol. ePrint Arch. 2014 (2014)
Ran Cohen, Yehuda Lindell
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014 (2014)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. IACR Cryptol. ePrint Arch. 2013 (2013)
Yehuda Lindell
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. CRYPTO (2) (2013)
Yehuda Lindell
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. IACR Cryptol. ePrint Arch. 2013 (2013)
Gilad Asharov, Yehuda Lindell, Hila Zarosim
Fair and Efficient Secure Multiparty Computation with Reputation Systems. ASIACRYPT (2) (2013)
Yehuda Lindell, Hila Zarosim
On the Feasibility of Extending Oblivious Transfer. TCC (2013)
Gilad Asharov, Yehuda Lindell, Tal Rabin
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. TCC (2013)
Gilad Asharov, Yehuda Lindell, Hila Zarosim
Fair and Efficient Secure Multiparty Computation with Reputation Systems. IACR Cryptol. ePrint Arch. 2013 (2013)
Yehuda Lindell
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge. J. Cryptol. 26 (4) (2013)

Yehuda Lindell.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yehuda Lindell