Author
Year
 

Year 2017

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

Author: Furukawa J, Lindell Y, Nof A, Weinstein O
In EUROCRYPT 2017, Springer (LNCS 10211), pages 225-255, 2017
Download PDF

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

Author: Araki T, Barak B, Furukawa J, Lichter T, Lindell Y, Nof A, Ohara K, Watzman A, Weinstein O
In the 38th IEEE Security and Privacy Conference
Download PDF

Scalable Private Set Intersection Based on OT Extension

Author: Pinkas B, Schneider T, Zohner M
Submitted to the ACM Transactions on Privacy and Security
Download PDF

The Circle Game: Scalable Private Membership Test Using Trusted Hardware

Author: Asokan N, Ekberg J-E, Liu J, Paverd A, Pinkas B, Tamrakar S
Asia CCS '2017
Download PDF

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup

Author: Abraham I, Fletcher C, Nayak K, Pinkas B, Ren L
PKC 2017
Download PDF

Year 2016

On Adaptively Secure Multiparty Computation with a Short CRS

Author: Cohen R, Peikert C
In Security and Cryptography for Networks, SCN 2016, Springer (LNCS 9841), pages 129–146, 2016.
Download PDF

Probabilistic Termination and Composability of Cryptographic Protocols

Author: Cohen R, Coretti S, Garay J, Zikas V
In Advances of Cryptology, CRYPTO 2016, Part III, Springer (LNCS 9816), pages 240–269, 2016.
Download PDF

Asynchronous Secure Multiparty Computation in Constant Time

Author: Cohen R
In Public-Key Cryptography, PKC 2016, Part II, Springer (LNCS 9615), pages 183–207, 2016.
Download PDF

Characterization of Secure Multiparty Computation without Broadcast

Author: Cohen R, Haitner I, Omri E, Rotem L
In Theory of Cryptography, TCC 2016-A, Part I, Springer (LNCS 9562), pages 596–616, 2016.
Download PDF

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

Author: Lindell Y
Cryptology ePrint Archive: Report 2016/046, 2016.
Download PDF

Maturity and Performance of Programmable Secure Computation

Author: Archer D W, Bogdanov D, Pinkas B, Pullonen P
IEEE Security and Privacy Journal, Vol. 14, Issue 5, 2016.
Download PDF

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model

Author: Hazay C, Yanay A
IACR-TCC-2016
Download PDF

Attribute-based Key Exchange with General Policies

Author: Kolesnikov V, Krawczyk H, Lindell Y, Malozemoff A. J, Rabin T
In the 23rd ACM CCS, pages 1451-1463, 2016.
Download PDF

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

Author: Araki T, Furukawa J, Lindell Y, Nof A, Ohara K
The 23rd ACM CCS, 2016
Download PDF

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

Author: Lindell Y, Smart N, Soria-Vazquez E
In TCC 2016-B, Springer (LNCS 9985), pages 554-581, 2016
Download PDF

Optimizing Semi-Honest Secure Multiparty Computation for the Internet.

Author: Ben-Efraim A, Lindell Y, Omri E
In the 23rd ACM CCS, pages 578-590, 2016
Download PDF

Year 2015

Phasing: Private Set Intersection Using Permutation-baSED Hashing

Author: Pinkas B, Schneider T, Segev G, Zohner M
Proceedings of the 24th USENIX Conference on Security Symposium (SEC'15), Jaeyeon Jung (Ed.). USENIX Association, Berkeley, CA, USA, 515-530.
Download PDF

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.

Author: Canetti R, Cohen A, Lindell Y
In CRYPTO 2015, Springer (LNCS 9216), pages 3-22, 2015.
Download PDF

Adaptively Secure Computation with Partial Erasures.

Author: Hazay C, Lindell Y, Patra A
In ACM PODC 2015, pages 291-300, 2015.
Download PDF

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

Author: Lindell Y
In TCC 2015, Springer (LNCS 9014), pages 93-109, 2015
Download PDF

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

Author: Lindell Y, Riva B
In 22nd ACM CCS, pages 579-590, 2015
Download PDF

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

Author: Lindell Y, Pinkas B, Smart N, Yanay A
In CRYPTO 2015, Springer (LNCS 9216), pages 319-338, 2015.
Download PDF

Fast Garbling of Circuits Under Standard Assumptions.

Author: Gueron S, Lindell Y, Nof A, Pinkas B
In 22nd ACM CCS, pages 567-578, 2015
Download PDF

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

Author: Gueron S, Lindell Y
In 22nd ACM CCS, pages 109-119, 2015.
Download PDF

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.

Author: Asharov G, Lindell Y, Schneider T, Zohner M
In EUROCRYPT 2015, Springer(LNCS 9056), pages 673-701, 2015
Download PDF

Year 2014

Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation

Author: Cohen R, Lindell Y
In Advances in Cryptology, ASIACRYPT 2014, Part II, Springer (LNCS 8873), pages 466–485, 2014
Download PDF

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

Author: Asharov G, Lindell Y
To appear in the Journal of Cryptology.
Download PDF

A Simple Recursive Tree Oblivious RAM

Author: Pinkas B, Reinman T
Download PDF

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

Author: Lindell Y, Riva B
In CRYPTO 2014, Springer (LNCS 8617), pages 476-494, 2014
Download PDF

Faster Private Set Intersection based on OT Extension

Author: Pinkas B, Schneider T, Zohner M
Download PDF

Towards Characterizing Complete Fairness in Secure Two-Party Computation

Author: Asharov G
In the 11th TCC, Springer (LNCS 8349), pages 291-316, 2014
Download PDF

Year 2013

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

Author: Asharov G, Lindell Y, Rabin T
In the 10th TCC, Springer (LNCS 7785), pages 243-262, 2013
Download PDF

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

Author: Lindell Y
In the Journal of Cryptology, 26(4), pages 638-654, 2013
Download PDF

Canon-MPC, a System for Casual Non-Interactive Secure Multi-Party Computation Using Native Client

Author: Jarrous A, Pinkas B
In the Proceedings of the 12th ACM Workshop on Privacy in the Electronic Society, pages 155-166, 2013.
Download PDF

Fair and Efficient Secure Multiparty Computation with Reputation Systems

Author: Asharov G, Lindell Y, Zarosim H
In ASIACRYPT 2013, Springer (LNCS 8270), pages 201-220, 2013
Download PDF

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

Author: Lindell Y
In CRYPTO 2013, Springer (LNCS 8043), pages 1-17, 2013
Download PDF

Hiding the Input-Size in Secure Two-Party Computation

Author: Lindell Y, Nissim K, Orlandi C
In ASIACRYPT 2013, Springer (LNCS 8270), pages 421-440, 2013.
Download PDF

Limits on the Usefulness of Random Oracles

Author: Haitner I, Omri E, Zarosim H
In the 10th TCC, Springer (LNCS 7785), pages 437-456, 2013
Download PDF

More Efficient Oblivious Transfer and Extensions for Faster Secure Computation

Author: Asharov G, Lindell Y, Schneider T, Zohner M
In the 20th ACM Conference on Computer and Communications security (ACM CCS), pages 535-548, 2013
Download PDF

On the Feasibility of Extending Oblivious Transfer

Author: Lindell Y, Zarosim H
In the 10th TCC, Springer (LNCS 7785), pages 519-538, 2013
Download PDF

Secure Computation of Functionalities Based on Hamming Distance and its Application to Computing Document Similarity

Author: Jarrous A, Pinkas B
International Journal of Applied Cryptography 3(1), pages 21-46, 2013
Download PDF

Year 2012

Calling Out Cheaters: Covert Security with Public Verifiability

Author: Asharov G, Orlandi C
In ASIACRYPT 2012, Springer (LNCS 7658), pages 681-698, 2012
Download PDF

Completeness for Symmetric Two-Party Functionalities – Revisited

Author: Lindell Y, Omri E, Zarosim H
In ASIACRYPT 2012, Springer (LNCS 7658), pages 116-133, 2012
Download PDF

Firm Grip Handshakes: A Tool for Bidirectional Vouching

Author: Berkman O, Pinkas B, Yung M
Cryptology and Network Security, (LNCS 7712) pages 142-157  
Download PDF

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

Author: Asharov G, Jain A, Lopez-Alt A, Tromer E, Vaikuntanathan V, Wichs D
In EUROCRYPT 2012, Springer (LNCS 7237), pages 483-501, 2012
Download PDF

SCAPI: The Secure Computation Application Programming Interface

Author: Ejgenberg Y, Farbstein M, Levy M, Lindell Y
Technical Report
Download PDF

Secure Computing in the Cloud

Author: Pinkas B, Sadeghi AR, Smart N
Dagstuhl Reports, Vol. 1 Issue 12 pages 1-11, 2012
Download PDF

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

Author: Lindell Y, Pinkas B
Journal of Cryptology 25(4), pages 680-722, 2012
Download PDF

Year 2011

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

Author: Beimel A, Lindell Y, Omri E, Orlov I
In CRYPTO 2011, Springer (LNCS 6841), pages 277-296, 2011
Download PDF

Highly-Efficient Universally Composable Commitments based on the DDH Assumption

Author: Lindell Y
In EUROCRYPT 2011, Springer (LNCS 6632), pages 446-466, 2011.
Download PDF

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

Author: Kidron D, Lindell Y
In the Journal of Cryptology, 24(3):517-544, 2011
Download PDF

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

Author: Dachman-Soled D, Lindell Y, Mahmoody M, Malkin T
In the 8th TCC, Springer (LNCS 6597), pages 450-467, 2011
Download PDF

Perfectly-Secure Multiplication for any n/3

Author: Asharov G, Lindell Y, Rabin T
In CRYPTO 2011, Springer (LNCS 6841), pages 240-258, 2011
Download PDF

Proofs of Ownership in Remote Storage Systems

Author: Halevi S, Harnik D, Pinkas B, Shulman-Peleg A
Proceedings of the 18th ACM Conference on Computer and Communications Security, pages 491-500, 2011
Download PDF

Secure Computation on the Web: Computing without Simultaneous Interaction

Author: Halevi S, Lindell Y, Pinkas B
In CRYPTO 2011, Springer (LNCS 6841), pages 132-150, 2011
Download PDF

The IPS Compiler: Optimizations, Variants and Concrete Efficiency

Author: Lindell Y, Oxman E, Pinkas B
In CRYPTO 2011, Springer (LNCS 6841), pages 259-276, 2011. This is the preliminary full version
Download PDF

Towards a Game Theoretic View of Secure Computation

Author: Asharov G, Canetti R, Hazay C
In EUROCRYPT 2011, Springer (LNCS 6632), pages 426-445, 2011
Download PDF

Year 2010

Private Web Search with Malicious Adversaries

Author: Lindell Y, Waisbard E
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
Download PDF

Year 2009

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

Author: Lindell Y, Zarosim H
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  
Download PDF

Adaptively Secure Two-Party Computation with Erasures

Author: Lindell Y
In CT-RSA, Springer (LNCS 5473), pages 117-132, 2009. Full version available
Download PDF

Collusion-Free Multiparty Computation in the Mediated Model

Author: Katz J, Lindell Y
In CRYPTO 2009, Springer-Verlag (LNCS 5677), pages 524-540, 2009
Download PDF

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

Author: Lindell Y
Download PDF

Secure Multiparty Computation for Privacy-Preserving Data Mining

Author: Lindell Y, Pinkas B
In the Journal of Privacy and Confidentiality, 1(1):59-98, 2009
Download PDF

Utility Dependence in Correct and Fair Rational Secret Sharing

Author: Asharov G, Lindell Y
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
Download PDF

Year 2008

Aggregate Message Authentication Codes

Author: Katz J, Lindell Y
In CT-RSA, Springer (LNCS 4964), pages 155-169, 2008
Download PDF

Complete Fairness in Secure Two-Party Computation

Author: Gordon S.D, Hazay C, Katz J, Lindell Y
To appear in the Journal of the ACM. An extended abstract appeared in the 40th STOC, pages 413-422, 2008
Download PDF

Constructions of Truly Practical Secure Protocols using Standard Smartcards

Author: Hazay C, Lindell Y
In the 15th ACM Conference on Computer and Communications Security (ACM CCS), pages 491-500, 2008. Full version available
Download PDF

Efficient Fully-Simulatable Oblivious Transfer

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

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

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

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

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

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

Author: Lindell Y, Pinkas B, Smart N
In the 6th Conference on Security and Cryptography for Networks, Springer (LNCS 5229), pages 2-20, 2008
Download PDF

Legally Enforceable Fairness in Secure Two-Party Computation

Author: Lindell Y
In CT-RSA, Springer (LNCS 4964), pages 121-137, 2008
Download PDF

Year 2007

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

Author: Lindell Y, Pinkas B
In Eurocrypt 2007, Springer-Verlag (LNCS 4515), pages 52-78, 2007. Full version available
Download PDF

Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions

Author: Hazay C, Katz J, Koo C.Y, Lindell Y
In TCC 2007, Springer-Verlag (LNCS 4392), pages 323-341, 2007.
Download PDF

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

Author: Aumann Y, Lindell Y
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.
Download PDF

Year 2006

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

Author: Lindell Y, Pinkas B
In the Journal of Cryptology, 22(2):161-188, 2009
Download PDF

Black-Box Constructions for Secure Computation

Author: Ishai Y, Kushilevitz E, Lindell Y, Petrank E
In the 38th STOC, pages 99-108, 2006
Download PDF

Black-Box Constructions of Protocols for Secure Computation

Author: Haitner I, Ishai Y, Kushilevitz E, Lindell Y, Petrank E
In the SIAM Journal on Computing, 40(2):225-266, 2011.
Download PDF

Information-Theoretically Secure Protocols and Security Under Composition

Author: Kushilevitz E, Lindell Y, Rabin T
In the SIAM Journal on Computing, 39(4):2090-2112, 2010. An extended abstract appeared in the 38th STOC, pages 109-118, 2006.
Download PDF

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation

Author: Ishai Y, Katz J, Kushilevitz E, Lindell Y, Petrank E
In CRYPTO 2006, Springer-Verlag (LNCS 4117), pages 483-500, 2006 The full version appears
Download PDF

Year 2005

Concurrent Composition of Secure Protocols in the Timing Model

Author: Kalai Y.T, Lindell Y, Prabhakaran M
In the Journal of Cryptology, 20(4):431-492, 2007. An extended abstract appeared in the 37th STOC, pages 644-653, 2005
Download PDF

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

Author: Katz J, Lindell Y
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.
Download PDF

Secure Computation Without Authentication

Author: Barak B, Canetti R, Lindell Y, Pass R, Rabin T
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
Download PDF

Universally Composable Password-Based Key Exchange

Author: Canetti R, Halevi S, Katz J, Lindell Y, Mackenzie P
In EUROCRYPT 2005, Springer-Verlag (LNCS 3494), pages 404-421, 2005
Download PDF

Year 2004

Lower Bounds and Impossibility Results for Concurrent Self Composition

Author: Lindell Y
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.
Download PDF

Lower Bounds for Concurrent Self Composition

Author: Lindell Y
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.
Download PDF

Protocol Initialization for the Framework of Universal Composability

Author: Barak B, Lindell Y, Rabin T
Download PDF