Yehuda Lindell

Yehuda Lindell: Techniques for Efficient Secure Computation Based on Yao's Protocol. Public Key Cryptography 2013: 253

Gilad Asharov, Yehuda Lindell, Tal Rabin: A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. TCC 2013: 243-262

Yehuda Lindell, Hila Zarosim: On the Feasibility of Extending Oblivious Transfer. TCC 2013: 519-538

Yehuda Lindell: Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. IACR Cryptology ePrint Archive 2013: 79 (2013)

Gilad Asharov, Yehuda Lindell, Tal Rabin: Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. IACR Cryptology ePrint Archive 2013: 110 (2013)

Yehuda Lindell, Benny Pinkas: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. J. Cryptology 25(4): 680-722 (2012)

Yehuda Lindell, Eran Omri, Hila Zarosim: Completeness for Symmetric Two-Party Functionalities - Revisited. ASIACRYPT 2012: 116-133

Yehuda Lindell, Hila Zarosim: On the Feasibility of Extending Oblivious Transfer. IACR Cryptology ePrint Archive 2012: 333 (2012)

Yael Ejgenberg, Moriya Farbstein, Meital Levy, Yehuda Lindell: SCAPI: The Secure Computation Application Programming Interface. IACR Cryptology ePrint Archive 2012: 629 (2012)

Yehuda Lindell, Kobbi Nissim, Claudio Orlandi: Hiding the Input-Size in Secure Two-Party Computation. IACR Cryptology ePrint Archive 2012: 679 (2012)

S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell: Complete Fairness in Secure Two-Party Computation. J. ACM 58(6): 24 (2011)

Gilad Asharov, Yehuda Lindell: Utility Dependence in Correct and Fair Rational Secret Sharing. J. Cryptology 24(1): 157-202 (2011)

Dafna Kidron, Yehuda Lindell: Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. J. Cryptology 24(3): 517-544 (2011)

Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. J. Cryptology 24(4): 720-760 (2011)

Yehuda Lindell, Hila Zarosim: Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. J. Cryptology 24(4): 761-799 (2011)

Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. SIAM J. Comput. 40(1): 122-141 (2011)

Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-Box Constructions of Protocols for Secure Computation. SIAM J. Comput. 40(2): 225-266 (2011)

Shai Halevi, Yehuda Lindell, Benny Pinkas: Secure Computation on the Web: Computing without Simultaneous Interaction. CRYPTO 2011: 132-150

Gilad Asharov, Yehuda Lindell, Tal Rabin: Perfectly-Secure Multiplication for Any t < n/3. CRYPTO 2011: 240-258

Yehuda Lindell, Eli Oxman, Benny Pinkas: The IPS Compiler: Optimizations, Variants and Concrete Efficiency. CRYPTO 2011: 259-276

Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov: 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. CRYPTO 2011: 277-296

Yehuda Lindell: Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption. EUROCRYPT 2011: 446-466

Yehuda Lindell, Benny Pinkas: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. TCC 2011: 329-346

Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin: On the Black-Box Complexity of Optimally-Fair Coin Tossing. TCC 2011: 450-467

Yehuda Lindell: Constant-Round Zero-Knowledge Proofs of Knowledge. Electronic Colloquium on Computational Complexity (ECCC) 18: 3 (2011)

Gilad Asharov, Yehuda Lindell: A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. Electronic Colloquium on Computational Complexity (ECCC) 18: 36 (2011)

Gilad Asharov, Yehuda Lindell: A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. IACR Cryptology ePrint Archive 2011: 136 (2011)

Yehuda Lindell, Eran Omri: A Practical Application of Differential Privacy to Personalized Online Advertising. IACR Cryptology ePrint Archive 2011: 152 (2011)

Shai Halevi, Yehuda Lindell, Benny Pinkas: Secure Computation on the Web: Computing without Simultaneous Interaction. IACR Cryptology ePrint Archive 2011: 157 (2011)

Yehuda Lindell: Highly-Efficient Universally-Composable Commitments based on the DDH Assumption. IACR Cryptology ePrint Archive 2011: 180 (2011)

Yehuda Lindell, Benny Pinkas, Eli Oxman: The IPS Compiler: Optimizations, Variants and Concrete Efficiency. IACR Cryptology ePrint Archive 2011: 435 (2011)

Yonatan Aumann, Yehuda Lindell: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. J. Cryptology 23(2): 281-343 (2010)

Carmit Hazay, Yehuda Lindell: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. J. Cryptology 23(3): 422-456 (2010)

Eyal Kushilevitz, Yehuda Lindell, Tal Rabin: Information-Theoretically Secure Protocols and Security under Composition. SIAM J. Comput. 39(5): 2090-2112 (2010)

Yehuda Lindell, Erez Waisbard: Private Web Search with Malicious Adversaries. Privacy Enhancing Technologies 2010: 220-235

Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. IACR Cryptology ePrint Archive 2010: 29 (2010)

Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-Box Constructions of Protocols for Secure Computation. IACR Cryptology ePrint Archive 2010: 164 (2010)

Yehuda Lindell, Benny Pinkas: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. IACR Cryptology ePrint Archive 2010: 284 (2010)

Carmit Hazay, Yehuda Lindell: A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries. IACR Cryptology ePrint Archive 2010: 551 (2010)

Carmit Hazay, Yehuda Lindell: A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality. IACR Cryptology ePrint Archive 2010: 552 (2010)

Yehuda Lindell: Constant-Round Zero-Knowledge Proofs of Knowledge. IACR Cryptology ePrint Archive 2010: 656 (2010)

Yehuda Lindell: Legally Enforceable Fairness in Secure Two-Party Communication. Chicago J. Theor. Comput. Sci. 2009 (2009)

Yehuda Lindell, Benny Pinkas: A Proof of Security of Yao's Protocol for Two-Party Computation. J. Cryptology 22(2): 161-188 (2009)

Yehuda Lindell: General Composition and Universal Composability in Secure Multiparty Computation. J. Cryptology 22(3): 395-428 (2009)

Joël Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti: Collusion-Free Multiparty Computation in the Mediated Model. CRYPTO 2009: 524-540

Gilad Asharov, Yehuda Lindell: Utility Dependence in Correct and Fair Rational Secret Sharing. CRYPTO 2009: 559-576

Yehuda Lindell, Hila Zarosim: Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. TCC 2009: 183-201

Yehuda Lindell: Secure Computation for Privacy Preserving Data Mining. Encyclopedia of Data Warehousing and Mining 2009: 1747-1752

Yehuda Lindell: Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1. IACR Cryptology ePrint Archive 2009: 13 (2009)

Yehuda Lindell: Adaptively Secure Two-Party Computation with Erasures. IACR Cryptology ePrint Archive 2009: 31 (2009)

Carmit Hazay, Yehuda Lindell: Constructions of Truly Practical Secure Protocols using Standard Smartcards. IACR Cryptology ePrint Archive 2009: 36 (2009)

Carmit Hazay, Yehuda Lindell: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. IACR Cryptology ePrint Archive 2009: 45 (2009)

Yehuda Lindell, Hila Zarosim: Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. IACR Cryptology ePrint Archive 2009: 366 (2009)

Gilad Asharov, Yehuda Lindell: Utility Dependence in Correct and Fair Rational Secret Sharing. IACR Cryptology ePrint Archive 2009: 373 (2009)

Carmit Hazay, Yehuda Lindell: Efficient Oblivious Polynomial Evaluation with Simulation-Based Security. IACR Cryptology ePrint Archive 2009: 459 (2009)

Eyal Kushilevitz, Yehuda Lindell, Tal Rabin: Information-Theoretically Secure Protocols and Security Under Composition. IACR Cryptology ePrint Archive 2009: 630 (2009)

Yehuda Lindell: Efficient Fully-Simulatable Oblivious Transfer. Chicago J. Theor. Comput. Sci. 2008 (2008)

Yehuda Lindell: Lower Bounds and Impossibility Results for Concurrent Self Composition. J. Cryptology 21(2): 200-249 (2008)

Jonathan Katz, Yehuda Lindell: Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. J. Cryptology 21(3): 303-349 (2008)

Carmit Hazay, Yehuda Lindell: Constructions of truly practical secure protocols using standardsmartcards. ACM Conference on Computer and Communications Security 2008: 491-500

Yehuda Lindell, Benny Pinkas, Nigel P. Smart: Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. SCN 2008: 2-20

S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell: Complete fairness in secure two-party computation. STOC 2008: 413-422

Carmit Hazay, Yehuda Lindell: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. TCC 2008: 155-175

Yehuda Lindell: Efficient Fully-Simulatable Oblivious Transfer. IACR Cryptology ePrint Archive 2008: 35 (2008)

Yehuda Lindell, Benny Pinkas: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. IACR Cryptology ePrint Archive 2008: 49 (2008)

Yehuda Lindell, Benny Pinkas: Secure Multiparty Computation for Privacy-Preserving Data Mining. IACR Cryptology ePrint Archive 2008: 197 (2008)

S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell: Complete Fairness in Secure Two-Party Computation. IACR Cryptology ePrint Archive 2008: 303 (2008)

Jonathan Katz, Yehuda Lindell: Collusion-Free Multiparty Computation in the Mediated Model. IACR Cryptology ePrint Archive 2008: 533 (2008)

Jonathan Katz, Yehuda Lindell: Introduction to Modern Cryptography. Chapman and Hall/CRC Press 2007, isbn 978-1-58488-551-1

Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran: Concurrent Composition of Secure Protocols in the Timing Model. J. Cryptology 20(4): 431-492 (2007)

Yehuda Lindell, Benny Pinkas: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. EUROCRYPT 2007: 52-78

Yonatan Aumann, Yehuda Lindell: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. TCC 2007: 137-156

Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell: Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. TCC 2007: 323-341

Yonatan Aumann, Yehuda Lindell: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. IACR Cryptology ePrint Archive 2007: 60 (2007)

Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. IACR Cryptology ePrint Archive 2007: 464 (2007)

Dafna Kidron, Yehuda Lindell: Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. IACR Cryptology ePrint Archive 2007: 478 (2007)

Yehuda Lindell: Protocols for Bounded-Concurrent Secure Two-Party Computation. Chicago J. Theor. Comput. Sci. 2006 (2006)

Yehuda Lindell, Anna Lysyanskaya, Tal Rabin: On the composition of authenticated Byzantine Agreement. J. ACM 53(6): 881-917 (2006)

Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci. 72(2): 321-391 (2006)

Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. J. Cryptology 19(2): 135-167 (2006)

Oded Goldreich, Yehuda Lindell: Session-Key Generation Using Human Passwords Only. J. Cryptology 19(3): 241-340 (2006)

Yehuda Lindell: A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions. J. Cryptology 19(3): 359-377 (2006)

Rosario Gennaro, Yehuda Lindell: A framework for password-based authenticated key exchange¹. ACM Trans. Inf. Syst. Secur. 9(2): 181-234 (2006)

Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. CRYPTO 2006: 483-500

Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-box constructions for secure computation. STOC 2006: 99-108

Eyal Kushilevitz, Yehuda Lindell, Tal Rabin: Information-theoretically secure protocols and security under composition. STOC 2006: 109-118

Shafi Goldwasser, Yehuda Lindell: Secure Multi-Party Computation without Agreement. J. Cryptology 18(3): 247-287 (2005)

Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. CRYPTO 2005: 361-377

Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie: Universally Composable Password-Based Key Exchange. EUROCRYPT 2005: 404-421

Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran: Concurrent general composition of secure protocols in the timing model. STOC 2005: 644-653

Jonathan Katz, Yehuda Lindell: Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. TCC 2005: 128-149

Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran: Concurrent Composition of Secure Protocols in the Timing Model. IACR Cryptology ePrint Archive 2005: 36 (2005)

Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie: Universally Composable Password-Based Key Exchange. IACR Cryptology ePrint Archive 2005: 196 (2005)

Jonathan Katz, Yehuda Lindell: Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. IACR Cryptology ePrint Archive 2005: 379 (2005)

Boaz Barak, Yehuda Lindell: Strict Polynomial-Time in Simulation and Extraction. SIAM J. Comput. 33(4): 738-818 (2004)

Yehuda Lindell: Lower Bounds for Concurrent Self Composition. TCC 2004: 203-222

Yehuda Lindell, Benny Pinkas: A Proof of Yao's Protocol for Secure Two-Party Computation. Electronic Colloquium on Computational Complexity (ECCC)(063) (2004)

Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower Bounds for Non-Black-Box Zero Knowledge. Electronic Colloquium on Computational Complexity (ECCC)(083) (2004)

Boaz Barak, Yehuda Lindell, Tal Rabin: Protocol Initialization for the Framework of Universal Composability. IACR Cryptology ePrint Archive 2004: 6 (2004)

Yehuda Lindell: Lower Bounds and Impossibility Results for Concurrent Self Composition. IACR Cryptology ePrint Archive 2004: 45 (2004)

Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. IACR Cryptology ePrint Archive 2004: 116 (2004)

Yehuda Lindell, Benny Pinkas: A Proof of Yao's Protocol for Secure Two-Party Computation. IACR Cryptology ePrint Archive 2004: 175 (2004)

Yehuda Lindell, Anna Lysyanskaya, Tal Rabin: On the Composition of Authenticated Byzantine Agreement. IACR Cryptology ePrint Archive 2004: 181 (2004)

Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower Bounds for Non-Black-Box Zero Knowledge. IACR Cryptology ePrint Archive 2004: 226 (2004)

Yehuda Lindell: Composition of Secure Multi-Party Protocols, A Comprehensive Study. Lecture Notes in Computer Science 2815, Springer 2003, isbn 3-540-20105-X

Yonatan Aumann, Yehuda Lindell: A Statistical Theory for Quantitative Association Rules. J. Intell. Inf. Syst. 20(3): 255-283 (2003)

Yehuda Lindell: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. J. Cryptology 16(3): 143-184 (2003)

Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. EUROCRYPT 2003: 68-86

Yehuda Lindell: A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions. EUROCRYPT 2003: 241-254

Rosario Gennaro, Yehuda Lindell: A Framework for Password-Based Authenticated Key Exchange. EUROCRYPT 2003: 524-543

Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower Bounds for Non-Black-Box Zero Knowledge. FOCS 2003: 384-393

Yehuda Lindell: General Composition and Universal Composability in Secure Multi-Party Computation. FOCS 2003: 394-403

Yehuda Lindell: Brief announcement: impossibility results for concurrent secure two-party computation. PODC 2003: 200

Yehuda Lindell: Bounded-concurrent secure two-party computation without setup assumptions. STOC 2003: 683-692

Rosario Gennaro, Yehuda Lindell: A Framework for Password-Based Authenticated Key Exchange. IACR Cryptology ePrint Archive 2003: 32 (2003)

Yehuda Lindell: Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model. IACR Cryptology ePrint Archive 2003: 100 (2003)

Yehuda Lindell: General Composition and Universal Composability in Secure Multiparty Computation. IACR Cryptology ePrint Archive 2003: 141 (2003)

Yehuda Lindell, Benny Pinkas: Privacy Preserving Data Mining. J. Cryptology 15(3): 177-206 (2002)

Yehuda Lindell, Anna Lysyanskaya, Tal Rabin: Sequential composition of protocols without simultaneous termination. PODC 2002: 203-212

Boaz Barak, Yehuda Lindell: Strict polynomial-time in simulation and extraction. STOC 2002: 484-493

Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai: Universally composable two-party and multi-party secure computation. STOC 2002: 494-503

Yehuda Lindell, Anna Lysyanskaya, Tal Rabin: On the composition of authenticated byzantine agreement. STOC 2002: 514-523

Shafi Goldwasser, Yehuda Lindell: Secure Computation without Agreement. DISC 2002: 17-32

Boaz Barak, Yehuda Lindell: Strict Polynomial-time in Simulation and Extraction. Electronic Colloquium on Computational Complexity (ECCC)(026) (2002)

Shafi Goldwasser, Yehuda Lindell: Secure Computation Without Agreement. IACR Cryptology ePrint Archive 2002: 40 (2002)

Boaz Barak, Yehuda Lindell: Strict Polynomial-time in Simulation and Extraction. IACR Cryptology ePrint Archive 2002: 43 (2002)

Yehuda Lindell: A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions. IACR Cryptology ePrint Archive 2002: 57 (2002)

Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai: Universally Composable Two-Party and Multi-Party Secure Computation. IACR Cryptology ePrint Archive 2002: 140 (2002)

Yehuda Lindell: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. CRYPTO 2001: 171-189

Oded Goldreich, Yehuda Lindell: Session-Key Generation Using Human Passwords Only. CRYPTO 2001: 408-432

Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell: Resettably-Sound Zero-Knowledge and its Applications. FOCS 2001: 116-125

Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell: Resettably-Sound Zero-Knowledge and its Applications. IACR Cryptology ePrint Archive 2001: 63 (2001)

Yehuda Lindell: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. IACR Cryptology ePrint Archive 2001: 107 (2001)

Yehuda Lindell, Benny Pinkas: Privacy Preserving Data Mining. CRYPTO 2000: 36-54

Oded Goldreich, Yehuda Lindell: Session-Key Generation using Human Passwords Only. IACR Cryptology ePrint Archive 2000: 57 (2000)

Yonatan Aumann, Yehuda Lindell: A Statistical Theory for Quantitative Association Rules. KDD 1999: 261-270

David Landau, Ronen Feldman, Yonatan Aumann, Moshe Fresko, Yehuda Lindell, Orly Liphstat, Oren Zamir: TextVis: An Integrated Visual Environment for Text Mining. PKDD 1998: 56-64

Ronen Feldman, Moshe Fresko, Yakkov Kinar, Yehuda Lindell, Orly Liphstat, Martin Rajman, Yonatan Schler, Oren Zamir: Text Mining at the Term Level. PKDD 1998: 65-73