Publications

Note: the order of the papers here is according to the year of the conference in which the paper was presented.

2024

Optimizing and Implementing Fischlin’s Transform for UC-Secure Zero-Knowledge

2024
Y. Chen and Y. Lindell

Cryptology ePrint Archive, Paper 2024/526, 2024.

Exponent-VRFs and Their Applications

2024
D. Boneh, I. Haitner and Y. Lindell

Cryptology ePrint Archive, Paper 2024/397, 2024.

Feldman’s Verifiable Secret Sharing for a Dishonest Majority

2024
Yi-Hsiu Chen and Yehuda Lindell

IACR Communications in Cryptology, 1:1, 2024.

2022

Simple Three-Round Multiparty Schnorr Signing with Full Simulatability

2022
Y. Lindell.

IACR Communications in Cryptology, 1:1, 2024.

2021

Secure Multiparty Computation (MPC)

2021
Y. Lindell

Communications of the ACM (CACM), 64(1):86-96, 2021

2019

Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest

2019
J. Furukawa and Y. Lindell

In the 26th ACM CCS, pages 1557-1571, 2019.

2018

Fast Garbling of Circuits over 3-Valued Logic.

2018
Y. Lindell and A. Yanai.

In the 21st PKC, Springer (LNCS 10769), pages 620-643, 2018.

Privacy-Preserving Search of Similar Patients in Genomic Data.

2018
G. Asharov, S. Halevi, Y. Lindell and T. Rabin.

In Privacy Enhancing Technologies 2018.

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries.

2018
K. China, D. Genkin, K. Hamada, D. Ikarashi, R. Kikuchi, Y. Lindell and A. Nof.

In CRYPTO 2018, Springer (LNCS 10993), pages 34-64, 2018.

Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries

2018
T. Frederiksen, Y. Lindell, V. Osheter and B. Pinkas.

In CRYPTO 2018, Springer (LNCS 10992), pages 331-361, 2018.

Generalizing the SPDZ Compiler For Other Protocols

2018
T. Araki, A. Barak, J. Furukawa, M. Keller, Y. Lindell, K. Ohara and H. Tsuchida

In the 25th ACM CCS, pages 880-895, 2018.

An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants.

2018
A. Barak, M. Hirt, L. Koskas and Y. Lindell.

In the 25th ACM CCS, pages 695-712, 2018.

Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody.

2018
I. Haitner, Y. Lindell, A. Nof and S. Ranellucci.

In the 25th ACM CCS, pages 1837-1854, 2018 (full version).

2017

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.

2017
G. Asharov, Y. Lindell, T. Schneider and M. Zohner.

The combined full version of this paper, and the ACM CCS 2013 paper on oblivious transfer extensions appeared in the Journal of Cryptology 30(3):805-858, 2017.

High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority.

2017
J. Furukawa, Y. Lindell, A. Nof and O. Weinstein

In EUROCRYPT 2017, Springer (LNCS 10211), pages 225-255, 2017.

Optimized Honest-Majority MPC for Malicious Adversaries – Breaking the 1 Billion-Gate Per Second Barrier.

2017
T. Araki, A. Barak, J. Furukawa, T. Lichter, Y. Lindell, A. Nof, K. Ohara, A. Watzman, and O. Weinstein.

In the 38th IEEE Security and Privacy Conference, pages 843-862, 2017.

Fast Secure Two-Party ECDSA Signing.

2017
Y. Lindell.

In CRYPTO 2017, Springer (LNCS 10402), pages 613-644, 2017.

Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation.

2017
S. Gueron and Y. Lindell.

In the 24th ACM CCS, pages 1019-1036, 2017. Recipient of the best-paper award.

A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.

2017
Y. Lindell and A. Nof.

In the 24th ACM CCS, pages 259-276, 2017.

Efficient Scalable Constant-Round MPC via Garbled Circuits.

2017
A. Ben-Efraim, Y. Lindell and E. Omri.

In ASIACRYPT 2017, Springer (LNCS 10625), pages 471-498, 2017.

Secure Two-Party Computation with Fairness – A Necessary Design Principle.

2017
Y. Lindell and T. Rabin.

In TCC 2017, Springer (LNCS 10677), pages 565-580, 2017.

2016

How To Simulate It – A Tutorial on the Simulation Proof Technique

2016
Y. Lindell.

Cryptology ePrint Archive: Report 2016/046, 2016.

Attribute-based Key Exchange with General Policies

2016
V. Kolesnikov, H. Krawczyk, Y. Lindell, A.J. Malozemoff and T. Rabin

In the 23rd ACM CCS, pages 1451-1463, 2016.

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

2016
A. Ben-Efraim, Y. Lindell and E. Omri.

In the 23rd ACM CCS, pages 578-590, 2016.

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority

2016
T. Araki, J. Furukawa, Y. Lindell, A. Nof and K. Ohara

In the 23rd ACM CCS, pages 805-817, 2016. Recipient of the best-paper award.

More Efficient Constant-Round Multi-Party Computation from BMR and SHE.

2016
Y. Lindell, N.P. Smart and E. Soria-Vazquez.

In TCC 2016-B, Springer (LNCS 9985), pages 554-581, 2016.

2015

An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle

2015
Y. Lindell

In TCC 2015, Springer (LNCS 9014), pages 93-109, 2015.

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

2015
G. Asharov, Y. Lindell, T. Schneider and M. Zohner.

In EUROCRYPT 2015, Springer (LNCS 9056), pages 673-701, 2015.

Adaptively Secure Computation with Partial Erasures

2015
C. Hazay, Y. Lindell and A. Patra.

In ACM PODC 2015, pages 291-300, 2015.

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation

2015
R. Canetti, A. Cohen and Y. Lindell.

In CRYPTO 2015, Springer (LNCS 9216), pages 3-22, 2015.

Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ.

2015
Y. Lindell, B. Pinkas, N. Smart and A. Yanai.

In CRYPTO 2015, Springer (LNCS 9216), pages 319-338, 2015.

Fast Garbling of Circuits Under Standard Assumptions

2015
S. Gueron, Y. Lindell, A. Nof and B. Pinkas

In 22nd ACM CCS, pages 567-578, 2015.

GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte

2015
S. Gueron and Y. Lindell.

In 22nd ACM CCS, pages 109-119, 2015.

Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries

2015
Y. Lindell and B. Riva

In 22nd ACM CCS, pages 579-590, 2015.

2014

Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings

2014
Y. Lindell and B. Riva.

In CRYPTO 2014, Springer (LNCS 8617), pages 476-494, 2014.

Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation.

2014
R. Cohen and Y. Lindell

In ASIACRYPT 2014, Springer (LNCS 8873), pages 466-485, 2014. To appear in the Journal of Cryptology.

2013

Techniques for Efficient Secure Computation Based on Yao’s Protocol.

2013
Y. Lindell.

At PKC 2013, I gave an invited talk on Techniques for Efficient Secure Computation Based on Yao's Protocol.

A Note on Constant-Round Zero-Knowledge Proofs of Knowledge.

2013
Y. Lindell.

In the Journal of Cryptology, 26(4)638-654, 2013.

A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness

2013
G. Asharov, Y. Lindell and T. Rabin

In the 10th TCC, Springer (LNCS 7785), pages 243-262, 2013.

On the Feasibility of Extending Oblivious Transfer

2013
Y. Lindell and H. Zarosim

In the 10th TCC, Springer (LNCS 7785), pages 519-538, 2013.

Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries

2013
Y. Lindell.

In CRYPTO 2013, Springer (LNCS 8043), pages 1-17, 2013. In the Journal of Cryptology, 29(2):456-490, 2016.

More Efficient Oblivious Transfer and Extensions for Faster Secure Computation

2013
G. Asharov, Y. Lindell, T. Schneider and M. Zohner.

In the 20th ACM Conference on Computer and Communications Security (ACM CCS), pages 535-548, 2013.

Fair and Efficient Secure Multiparty Computation with Reputation Systems

2013
G. Asharov, Y. Lindell and H. Zarosim

In ASIACRYPT 2013, Springer (LNCS 8270), pages 201-220, 2013.

Hiding the Input-Size in Secure Two-Party Computation

2013
Y. Lindell, K. Nissim and C. Orlandi.

In ASIACRYPT 2013, Springer (LNCS 8270), pages 421-440, 2013.

2012

Completeness for Symmetric Two-Party Functionalities – Revisited

2012
Y. Lindell, E. Omri and H. Zarosim

In ASIACRYPT 2012, Springer (LNCS 7658), pages 116-133, 2012. To appear in the Journal of Cryptology.

SCAPI: The Secure Computation Application Programming Interface

2012
Y. Ejgenberg, M. Farbstein, M. Levy and Y. Lindell.

2011

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs

2011
D. Kidron and Y. Lindell

In the Journal of Cryptology, 24(3):517-544, 2011.

On the Black-Box Complexity of Optimally-Fair Coin Tossing

2011
D. Dachman-Soled, Y. Lindell, M. Mahmoody and T. Malkin

In the 8th TCC, Springer (LNCS 6597), pages 450-467, 2011.

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

2011
Y. Lindell and B. Pinkas

In the 8th TCC, Springer (LNCS 6597), pages 329-346, 2011. In the Journal of Cryptology, 25(4):680-722,2012.

Highly-Efficient Universally Composable Commitments based on the DDH Assumption

2011
Y. Lindell.

In EUROCRYPT 2011, Springer (LNCS 6632), pages 446-466, 2011. Full version available.

A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation

2011
G. Asharov and Y. Lindell

In the Journal of Cryptology, 30(1):58-151, 2017.

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds

2011
A. Beimel, Y. Lindell, E. Omri and I. Orlov

In CRYPTO 2011, Springer (LNCS 6841), pages 277-296, 2011.

Secure Computation on the Web: Computing without Simultaneous Interaction

2011
S. Halevi, Y. Lindell, and B. Pinkas

In CRYPTO 2011, Springer (LNCS 6841), pages 132-150, 2011.

Perfectly-Secure Multiplication for any t<n/3

2011
G. Asharov, Y. Lindell and T. Rabin

In CRYPTO 2011, Springer (LNCS 6841), pages 240-258, 2011.

The IPS Compiler: Optimizations, Variants and Concrete Efficiency

2011
Y. Lindell, E. Oxman and B. Pinkas

In CRYPTO 2011, Springer (LNCS 6841), pages 259-276, 2011. This is the preliminary full version.

2010

Private Web Search with Malicious Adversaries

2010
Y. Lindell and E. Waisbard

In the 10th Privacy Enhancing Technologies Symposium (PETS), 2010. The conference version of this paper contained a serious error which is fixed in this draft of the full version.

2009

Secure Multiparty Computation for Privacy-Preserving Data Mining

2009
Y. Lindell and B. Pinkas

In the Journal of Privacy and Confidentiality, 1(1):59-98, 2009.

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

2009
Y. Lindell and H. Zarosim

In the Journal of Cryptology, 24(4):761-799, 2011. An extended abstract appeared in the 6th TCC, Springer (LNCS 5444), pages 183-201, 2009.

Adaptively Secure Two-Party Computation with Erasures

2009
Y. Lindell

In CT-RSA, Springer (LNCS 5473), pages 117-132, 2009. Full version available.

Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1

2009
Y. Lindell

In CT-RSA, Springer (LNCS 5473), pages 66-83, 2009. Full version available.

Collusion-Free Multiparty Computation in the Mediated Model

2009
J. Alwen, J. Katz, Y. Lindell, G. Persiano, A. Shelat and I. Visconti

In CRYPTO 2009, Springer-Verlag (LNCS 5677), pages 524-540, 2009.

Utility Dependence in Correct and Fair Rational Secret Sharing

2009
G. Asharov and Y. Lindell.

In the Journal of Cryptology, 24(1):157-202, 2011. An extended abstract appeared in CRYPTO 2009, Springer-Verlag (LNCS 5677), pages 559-576, 2009.

2008

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

2008
C. Hazay and Y. Lindell.

In the Journal of Cryptology, 23(3):422-456, 2010. An extended abstract appeared in TCC 2008, Springer (LNCS 4948) pages 155-175, 2008.

Aggregate Message Authentication Codes

2008
J. Katz and Y. Lindell.

In CT-RSA, Springer (LNCS 4964), pages 155-169, 2008.

Legally Enforceable Fairness in Secure Two-Party Computation

2008
Y. Lindell.

In CT-RSA, Springer (LNCS 4964), pages 121-137, 2008.

Efficient Fully-Simulatable Oblivious Transfer

2008
Y. Lindell

In the Chicago Journal of Theoretical Computer Science, 2008. Preliminary version appeared in CT-RSA, Springer (LNCS 4964), pages 52-70, 2008.

Complete Fairness in Secure Two-Party Computation

2008
S.D. Gordon, C. Hazay, J. Katz and Y. Lindell.

In the 40th STOC, pages 413-422, 2008. In the Journal of the ACM, 58(6):24, 2011.

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

2008
Y. Lindell, B. Pinkas and N. Smart.

In the 6th Conference on Security and Cryptography for Networks, Springer (LNCS 5229), pages 2-20, 2008.

Constructions of Truly Practical Secure Protocols using Standard Smartcards

2008
C. Hazay and Y. Lindell.

In the 15th ACM Conference on Computer and Communications Security (ACM CCS), pages 491-500, 2008. Full version available.

2007

Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions

2007
C. Hazay, J. Katz, C.Y. Koo and Y. Lindell.

In TCC 2007, Springer-Verlag (LNCS 4392), pages 323-341, 2007.

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

2007
Y. Aumann and Y. Lindell.

In the Journal of Cryptology, 23(2):281-343, 2010. An extended abstract appeared in TCC 2007, Springer-Verlag (LNCS 4392), pages 137-156, 2007.

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

2007
Y. Lindell and B. Pinkas

In Eurocrypt 2007, Springer-Verlag (LNCS 4515), pages 52-78, 2007. In the Journal of Cryptology, 28(2):312-350, 2015.

2006

Black-Box Constructions of Protocols for Secure Computation

2006
I. Haitner, Y. Ishai, E. Kushilevitz, Y. Lindell and E. Petrank.

In the SIAM Journal on Computing, 40(2):225-266, 2011.

Information-Theoretically Secure Protocols and Security Under Composition

2006
E. Kushilevitz, Y. Lindell and T. Rabin

In the SIAM Journal on Computing, 39(4):2090-2112, 2010. An extended abstract appeared in the 38th STOC, pages 109-118, 2006.

On Achieving the “Best of Both Worlds” in Secure Multiparty Computation

2006
Y. Ishai, J. Katz, E. Kushilevitz, Y. Lindell and E. Petrank.

In the SIAM Journal on Computing, 40(1):122-141, 2011.

2005

Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs

2005
J. Katz and Y. Lindell.

In the Journal of Cryptology, 21(3):303-349, 2008. An extended abstract appeared in the 2nd Annual Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 3378), pages 128-149, 2005.

Concurrent Composition of Secure Protocols in the Timing Model

2005
Y.T. Kalai, Y. Lindell and M. Prabhakaran.

In the Journal of Cryptology, 20(4):431-492, 2007. An extended abstract appeared in the 37th STOC, pages 644-653, 2005.

Universally Composable Password-Based Key Exchange

2005
R. Canetti, S. Halevi, J. Katz, Y. Lindell and P. Mackenzie.

In EUROCRYPT 2005, Springer-Verlag (LNCS 3494), pages 404-421, 2005.

Secure Computation Without Authentication

2005
B. Barak, R. Canetti, Y. Lindell, R. Pass and T. Rabin.

In the Journal of Cryptology, 24(4):720-760, 2011. An extended abstract appeared in CRYPTO 2005, Springer-Verlag (LNCS 3621), pages 361-377, 2005.

2004

Lower Bounds for Concurrent Self Composition

2004
Y. Lindell.

In the 1st Annual Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 2951), pages 203-222, 2004. See above for the full version of this paper.

Lower Bounds and Impossibility Results for Concurrent Self Composition

2004
Y. Lindell.

In the Journal of Cryptology, 21(2):200-249, 2008. This version combines the results of the paper Lower Bounds for Concurrent Self Composition at TCC 2004 together with the lower bound from the paper Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions at STOC 2003.

Protocol Initialization for the Framework of Universal Composability

2004
B. Barak, Y. Lindell and T. Rabin.

A Proof of Security of Yao’s Protocol for Two-Party Computation

2004
Y. Lindell and B. Pinkas.

In the Journal of Cryptology, 22(2):161-188, 2009.

2003

On the Composition of Secure Multi-Party Protocols

2003
Yehuda Lindell

My Ph.D. Thesis

A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions

2003
Y. Lindell.

In the Journal of Cryptology, 19(3):359-377, 2006. An extended abstract appeared in Eurocrypt 2003, Springer-Verlag (LNCS 2656), pages 241-254, 2003.

A Framework for Password-Based Authenticated Key Exchange

2003
R. Gennaro and Y. Lindell.

In the ACM Transactions on Information and System Security (TISSEC), 9(2):181-234, 2006. An extended abstract appeared in Eurocrypt 2003, Springer-Verlag (LNCS 2656), pages 524-543, 2003. (Note: the conference version of this paper contains a serious flaw that is corrected in the final version.)

On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

2003
R. Canetti, E. Kushilevitz and Y. Lindell.

In the Journal of Cryptology, 19(2):135-167, 2006. An extended abstract appeared in Eurocrypt 2003, Springer-Verlag (LNCS 2656), pages 68-86, 2003.

Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions

2003
Y. Lindell.

In 35th STOC, pages 683-692, 2003.

Lower Bounds for Non-Black-Box Zero-Knowledge

2003
B. Barak, Y. Lindell and S. Vadhan.

In the Journal of Computer and System Sciences, 72(2):321-391, 2006 (JCSS FOCS 2003 Special Issue). An extended abstract appear in the 44th FOCS, pages 384-393, 2003.

General Composition and Universal Composability in Secure Multi-Party Computation

2003
Y. Lindell.

In the Journal of Cryptology, 22(3):395-428, 2009. An extended abstract appeared in the 44th FOCS, pages 394-403, 2003.

2002

Strict Polynomial-Time in Simulation and Extraction

2002
Y. Lindell and B. Barak.

In the SIAM Journal on Computing, 33(4):783-818, 2004. An extended abstract appeared in the 34th STOC, pages 484-493, 2002.

Universally Composable Two-Party and Multi-Party Secure Computation

2002
R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai.

In 34th STOC, pages 494-503, 2002. Full version available.

On the Composition of Authenticated Byzantine Agreement

2002
Y. Lindell, A. Lysyanskaya and T. Rabin.

To appear in the Journal of the ACM, 2006. An extended abstract appear in the 34th STOC, pages 514-523, 2002.

Sequential Composition of Protocols without Simultaneous Termination

2002
Y. Lindell, A. Lysyanskaya and T. Rabin.

In 21st PODC, pages 203-212, 2002.

Secure Computation Without Agreement

2002
S. Goldwasser and Y. Lindell.

In the Journal of Cryptology, 18(3):247-287, 2005. An extended abstract appeared in the 16th DISC, Springer-Verlag (LNCS 2508), pages 17-32, 2002.

2001

Session-Key Generation using Human Passwords Only

2001
O. Goldreich and Y. Lindell.

In the Journal of Cryptology, 19(3):241-340, 2006. An extended abstract appeared in Crypto 2001, Springer-Verlag (LNCS 2139), pages 408-432, 2001.

Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

2001
Y. Lindell.

In the Journal of Cryptology, 16(3):143-184, 2003. An extended abstract appeared in Crypto 2001, Springer-Verlag (LNCS 2139), pages 171-189, 2001.

Resettably-Sound Zero-Knowledge and its Applications

2001
B. Barak, O. Goldreich, S. Goldwasser and Y. Lindell

In 42nd FOCS, pages 116-125, 2001. Preliminary full version available.

2000

Privacy Preserving Data Mining

2000
Y. Lindell and B. Pinkas.

In the Journal of Cryptology, 15(3):177-206, 2002. An extended abstract appeared in Crypto 2000, Springer-Verlag (LNCS 1880), pages 36-54, 2000.

1999

A Statistical Theory for Quantitative Association Rules

1999
Y. Aumann and Y. Lindell.

In the Journal of Intelligent Information Systems, 20(3):255-283, 2003. An extended abstract appeared in KDD, 1999

1998

Text Mining at the Term Level

1998
R. Feldman, M. Fresko, Y. Kinar, Y. Lindell, O. Lipshtat, M. Rajman, Y. Schler and O. Zamir,

The 2nd European Symposium on Principles of Data Mining and Knowledge Discovery - Proceedings (PKDD98), Springer-Verlag (LNCS 1510), pages 65-73,Springer-Verlag, 1998.

TextVis: An Integrated Visual Environment for Text Mining

1998
D. Landau, R. Feldman, Y. Aumann, M. Fresko, Y. Lindell, O. Lipshtat and O. Zamir

The 2nd European Symposium on Principles of Data Mining and Knowledge Discovery - Proceedings (PKDD98), Springer-Verlag (LNCS 1510), pages 56-64, 1998.