Yehuda Lindell: On-Line Papers (Chronological)

Papers in Chronological Order

Years: 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998.

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

2013

Y. Lindell. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.
To appear at CRYPTO 2013.
PDF
Y. Lindell and H. Zarosim. On the Feasibility of Extending Oblivious Transfer.
In the 10th TCC, Springer (LNCS 7785), pages 519-538, 2013.
PDF
G. Asharov, Y. Lindell and T. Rabin. A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.
In the 10th TCC, Springer (LNCS 7785), pages 243-262, 2013.
PDF

2012

Y. Ejgenberg, M. Farbstein, M. Levy and Y. Lindell. SCAPI: The Secure Computation Application Programming Interface.
PDF
Y. Lindell, E. Omri and H. Zarosim. Completeness for Symmetric Two-Party Functionalities - Revisited.
In ASIACRYPT 2012, Springer (LNCS 7658), pages 116-133, 2012.
PDF
Y. Lindell. A Note on Constant-Round Zero-Knowledge Proofs of Knowledge. To appear in the Journal of Cryptology.
PDF

2011

Y. Lindell, E. Oxman and B. Pinkas. The IPS Compiler: Optimizations, Variants and Concrete Efficiency.
In CRYPTO 2011, Springer (LNCS 6841), pages 259-276, 2011. This is the preliminary full version.
PDF
G. Asharov, Y. Lindell and T. Rabin. Perfectly-Secure Multiplication for any t<n/3.
In CRYPTO 2011, Springer (LNCS 6841), pages 240-258, 2011.
PDF
S. Halevi, Y. Lindell, and B. Pinkas. Secure Computation on the Web: Computing without Simultaneous Interaction.
In CRYPTO 2011, Springer (LNCS 6841), pages 132-150, 2011.
Conference version: PDF
Preliminary full version: PDF
A. Beimel, Y. Lindell, E. Omri and I. Orlov. 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.
In CRYPTO 2011, Springer (LNCS 6841), pages 277-296, 2011.
PDF
G. Asharov and Y. Lindell. A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation.
Abstract, PDF.
Y. Lindell. Highly-Efficient Universally Composable Commitments based on the DDH Assumption.
In EUROCRYPT 2011, Springer (LNCS 6632), pages 446-466, 2011. Full version available.
Abstract, PDF.
Y. Lindell and B. Pinkas. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.
To appear in the Journal of Cryptology. An extended abstract appeared in the 8th TCC, Springer (LNCS 6597), pages 329-346, 2011.
Abstract, PDF.
D. Dachman-Soled, Y. Lindell, M. Mahmoody and T. Malkin. On the Black-Box Complexity of Optimally-Fair Coin Tossing.
In the 8th TCC, Springer (LNCS 6597), pages 450-467, 2011.
Abstract, PDF.
D. Kidron and Y. Lindell. Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs.
In the Journal of Cryptology, 24(3):517-544, 2011.
Abstract, PDF.

2010

Y. Lindell and E. Waisbard. Private Web Search with Malicious Adversaries.
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.
Abstract, PDF.

2009

G. Asharov and Y. Lindell. Utility Dependence in Correct and Fair Rational Secret Sharing.
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.
Abstract, PDF.
J. Alwen, J. Katz, Y. Lindell, G. Persiano, A. Shelat and I. Visconti. Collusion-Free Multiparty Computation in the Mediated Model.
In CRYPTO 2009, Springer-Verlag (LNCS 5677), pages 524-540, 2009.
Abstract, PDF.
Y. Lindell. Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1.
In CT-RSA, Springer (LNCS 5473), pages 66-83, 2009. Full version available.
Abstract, PDF.
Y. Lindell. Adaptively Secure Two-Party Computation with Erasures.
In CT-RSA, Springer (LNCS 5473), pages 117-132, 2009. Full version available.
Abstract, PDF.
Y. Lindell and H. Zarosim. Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.
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.
Abstract, PDF.
Y. Lindell and B. Pinkas. Secure Multiparty Computation for Privacy-Preserving Data Mining.
In the Journal of Privacy and Confidentiality, 1(1):59-98, 2009.
Abstract, PDF.

2008

C. Hazay and Y. Lindell. Constructions of Truly Practical Secure Protocols using Standard Smartcards.
In the 15th ACM Conference on Computer and Communications Security (ACM CCS), pages 491-500, 2008. Full version available.
Abstract, PDF.
Y. Lindell, B. Pinkas and N. Smart. Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries.
In the 6th Conference on Security and Cryptography for Networks, Springer (LNCS 5229), pages 2-20, 2008.
Abstract, PDF.
S.D. Gordon, C. Hazay, J. Katz and Y. Lindell. Complete Fairness in Secure Two-Party Computation.
To appear in the Journal of the ACM. An extended abstract appeared in the 40th STOC, pages 413-422, 2008.
Abstract, PDF.
Y. Lindell. Efficient Fully-Simulatable Oblivious Transfer.
In the Chicago Journal of Theoretical Computer Science, 2008. Preliminary version appeared in CT-RSA, Springer (LNCS 4964), pages 52-70, 2008.
Abstract, PDF.
Y. Lindell. Legally Enforceable Fairness in Secure Two-Party Computation.
In CT-RSA, Springer (LNCS 4964), pages 121-137, 2008.
Abstract, PDF.
J. Katz and Y. Lindell. Aggregate Message Authentication Codes.
In CT-RSA, Springer (LNCS 4964), pages 155-169, 2008.
Abstract, PDF.
C. Hazay and Y. Lindell. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.
In the Journal of Cryptology, 23(3):422-456, 2010. An extended abstract appeared in TCC 2008, Springer (LNCS 4948) pages 155-175, 2008.
Abstract, PDF.

2007

Y. Lindell and B. Pinkas. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.
In Eurocrypt 2007, Springer-Verlag (LNCS 4515), pages 52-78, 2007. Full version available.
Abstract, PDF.
Y. Aumann and Y. Lindell. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.
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.
Abstract, PDF.
C. Hazay, J. Katz, C.Y. Koo and Y. Lindell. Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions.
In TCC 2007, Springer-Verlag (LNCS 4392), pages 323-341, 2007.
Abstract, Postscript, gzipped Postscript.

2006

Y. Ishai, E. Kushilevitz, Y. Lindell and E. Petrank. On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation.
In CRYPTO 2006, Springer-Verlag (LNCS 4117), pages 483-500, 2006.
Abstract, Postscript, gzipped Postscript.
The full version of this paper has been combined with a paper by Jonathan Katz, and appears as follows:
Y. Ishai, J. Katz, E. Kushilevitz, Y. Lindell and E. Petrank. On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
In the SIAM Journal on Computing, 40(1):122-141, 2011.
Abstract, PDF.
E. Kushilevitz, Y. Lindell and T. Rabin. Information-Theoretically Secure Protocols and Security Under Composition.
In the SIAM Journal on Computing, 39(4):2090-2112, 2010. An extended abstract appeared in the 38th STOC, pages 109-118, 2006.
Abstract, PDF.
Y. Ishai, E. Kushilevitz, Y. Lindell and E. Petrank. Black-Box Constructions for Secure Computation.
In the 38th STOC, pages 99-108, 2006.
Abstract, Postscript, gzipped Postscript. The full version of this paper has been combined with a paper by Iftach Haitner, and appears as follows:
I. Haitner, Y. Ishai, E. Kushilevitz, Y. Lindell and E. Petrank. Black-Box Constructions of Protocols for Secure Computation.
In the SIAM Journal on Computing, 40(2):225-266, 2011.
Abstract, PDF.

2005

B. Barak, R. Canetti, Y. Lindell, R. Pass and T. Rabin. Secure Computation Without Authentication.
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.
Abstract, Conference version: Postscript, gzipped Postscript, Full version: PDF.
R. Canetti, S. Halevi, J. Katz, Y. Lindell and P. Mackenzie. Universally Composable Password-Based Key Exchange.
In EUROCRYPT 2005, Springer-Verlag (LNCS 3494), pages 404-421, 2005.
Abstract, Postscript, gzipped Postscript.
Y.T. Kalai, Y. Lindell and M. Prabhakaran. Concurrent Composition of Secure Protocols in the Timing Model.
In the Journal of Cryptology, 20(4):431-492, 2007. An extended abstract appeared in the 37th STOC, pages 644-653, 2005.
Abstract, Postscript, gzipped Postscript.
J. Katz and Y. Lindell. Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.
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.
Abstract, Postscript, gzipped Postscript.

2004

Y. Lindell and B. Pinkas. A Proof of Security of Yao's Protocol for Two-Party Computation.
In the Journal of Cryptology, 22(2):161-188, 2009.
Abstract, Postscript, gzipped Postscript.
B. Barak, Y. Lindell and T. Rabin. Protocol Initialization for the Framework of Universal Composability.
Abstract, Postscript, gzipped Postscript.
Y. Lindell. Lower Bounds and Impossibility Results for Concurrent Self Composition.
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.
Abstract, Postscript, gzipped Postscript.
Y. Lindell. Lower Bounds for Concurrent Self Composition.
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.
Abstract, Postscript, gzipped Postscript.

2003

Y. Lindell. General Composition and Universal Composability in Secure Multi-Party Computation.
In the Journal of Cryptology, 22(3):395-428, 2009.
An extended abstract appeared in the 44th FOCS, pages 394-403, 2003.
Abstract, Postscript, gzipped Postscript.
B. Barak, Y. Lindell and S. Vadhan. Lower Bounds for Non-Black-Box Zero-Knowledge.
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.
Abstract, Postscript, gzipped Postscript.
Y. Lindell. Brief Announcement: Impossibility Results for Concurrent Secure Two-Party Computation.
In 22nd PODC, page 200, 2003.
Postscript, gzipped Postscript.
Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions.
In 35th STOC, pages 683-692, 2003.
Abstract, Postscript, gzipped Postscript.
The full version of the upper bound from this paper appears in the Chicago Journal of Theoretical Computer Science, 2006(1):1-50, 2006.
Abstract, Postscript, gzipped Postscript.
R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions.
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.
Abstract, Postscript, gzipped Postscript.
R. Gennaro and Y. Lindell. A Framework for Password-Based Authenticated Key Exchange.
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.)
Abstract, Postscript, gzipped Postscript.
Y. Lindell. A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions.
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.
Abstract, Postscript, gzipped Postscript.

2002

S. Goldwasser and Y. Lindell. Secure Computation Without Agreement.
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.
Abstract, Postscript, gzipped Postscript.
Y. Lindell, A. Lysyanskaya and T. Rabin. Sequential Composition of Protocols without Simultaneous Termination.
In 21st PODC, pages 203-212, 2002.
Abstract, Postscript, gzipped Postscript.
Y. Lindell, A. Lysyanskaya and T. Rabin. On the Composition of Authenticated Byzantine Agreement.
To appear in the Journal of the ACM, 2006.
An extended abstract appear in the 34th STOC, pages 514-523, 2002.
Abstract, Postscript, gzipped Postscript.
R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Secure Computation.
In 34th STOC, pages 494-503, 2002. Full version available.
Abstract, Postscript, gzipped Postscript.
Y. Lindell and B. Barak. Strict Polynomial-Time in Simulation and Extraction.
In the SIAM Journal on Computing, 33(4):783-818, 2004.
An extended abstract appeared in the 34th STOC, pages 484-493, 2002.
Abstract, Postscript, gzipped Postscript.

2001

B. Barak, O. Goldreich, S. Goldwasser and Y. Lindell. Resettably-Sound Zero-Knowledge and its Applications.
In 42nd FOCS, pages 116-125, 2001. Preliminary full version available.
Abstract, Postscript, gzipped Postscript.
Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.
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.
Abstract, Postscript, gzipped Postscript.
O. Goldreich and Y. Lindell. Session-Key Generation using Human Passwords Only.
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.
Abstract, Postscript, gzipped Postscript.

2000

Y. Lindell and B. Pinkas. Privacy Preserving Data Mining.
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.
Abstract, Postscript, gzipped Postscript.

1999

Y. Aumann and Y. Lindell. A Statistical Theory for Quantitative Association Rules.
In the Journal of Intelligent Information Systems, 20(3):255-283, 2003.
An extended abstract appeared in KDD, 1999.

Abstract

Postscript

gzipped Postscript

1998

D. Landau, R. Feldman, Y. Aumann, M. Fresko, Y. Lindell, O. Lipshtat and O. Zamir, TextVis: An Integrated Visual Environment for Text Mining, The 2nd European Symposium on Principles of Data Mining and Knowledge Discovery - Proceedings (PKDD98), Springer-Verlag (LNCS 1510), pages 56-64, 1998.
R. Feldman, M. Fresko, Y. Kinar, Y. Lindell, O. Lipshtat, M. Rajman, Y. Schler and O. Zamir, Text Mining at the Term Level, The 2nd European Symposium on Principles of Data Mining and Knowledge Discovery - Proceedings (PKDD98), Springer-Verlag (LNCS 1510), pages 65-73,Springer-Verlag, 1998.

Please read the copyright notice.

Back Home