| 2025 | EuroCrypt | Exponent-VRFs and Their Applications. | Dan Boneh, Iftach Haitner, Yehuda Lindell, Gil Segev |
| 2019 | ACISP | Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme. | Michael Kraitsberg, Yehuda Lindell, Valery Osheter, Nigel P. Smart, Younes Talibi Alaoui |
| 2019 | CCS | Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. | Jun Furukawa, Yehuda Lindell |
| 2018 | CCS | Generalizing the SPDZ Compiler For Other Protocols. | Toshinori Araki, Assi Barak, Jun Furukawa, Marcel Keller, Yehuda Lindell, Kazuma Ohara, Hikaru Tsuchida |
| 2018 | CCS | An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. | Assi Barak, Martin Hirt, Lior Koskas, Yehuda Lindell |
| 2018 | CCS | Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. | Yehuda Lindell, Ariel Nof |
| 2018 | CRYPTO | Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. | Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof |
| 2018 | CRYPTO | Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries. | Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas |
| 2018 | PKC | Fast Garbling of Circuits over 3-Valued Logic. | Yehuda Lindell, Avishay Yanai |
| 2017 | ASIACRYPT | Efficient Scalable Constant-Round MPC via Garbled Circuits. | Aner Ben-Efraim, Yehuda Lindell, Eran Omri |
| 2017 | CCS | Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation. | Shay Gueron, Yehuda Lindell |
| 2017 | CCS | A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. | Yehuda Lindell, Ariel Nof |
| 2017 | CRYPTO | Fast Secure Two-Party ECDSA Signing. | Yehuda Lindell |
| 2017 | EuroCrypt | High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. | Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein |
| 2017 | SP | Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. | Toshinori Araki, Assi Barak, Jun Furukawa, Tamar Lichter, Yehuda Lindell, Ariel Nof, Kazuma Ohara, Adi Watzman, Or Weinstein |
| 2017 | TCC | Secure Two-Party Computation with Fairness - A Necessary Design Principle. | Yehuda Lindell, Tal Rabin |
| 2016 | CCS | DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation. | Toshinori Araki, Assaf Barak, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara |
| 2016 | CCS | High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. | Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara |
| 2016 | CCS | Optimizing Semi-Honest Secure Multiparty Computation for the Internet. | Aner Ben-Efraim, Yehuda Lindell, Eran Omri |
| 2016 | CCS | Attribute-based Key Exchange with General Policies. | Vladimir Kolesnikov, Hugo Krawczyk, Yehuda Lindell, Alex J. Malozemoff, Tal Rabin |
| 2016 | TCC | More Efficient Constant-Round Multi-party Computation from BMR and SHE. | Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez |
| 2015 | CCS | GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte. | Shay Gueron, Yehuda Lindell |
| 2015 | CCS | Fast Garbling of Circuits Under Standard Assumptions. | Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas |
| 2015 | CCS | Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries. | Yehuda Lindell, Ben Riva |
| 2015 | CRYPTO | A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. | Ran Canetti, Asaf Cohen, Yehuda Lindell |
| 2015 | CRYPTO | Efficient Constant Round Multi-party Computation Combining BMR and SPDZ. | Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai |
| 2015 | EuroCrypt | More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. | Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner |
| 2015 | PODC | Adaptively Secure Computation with Partial Erasures. | Carmit Hazay, Yehuda Lindell, Arpita Patra |
| 2015 | TCC | An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle. | Yehuda Lindell |
| 2014 | ASIACRYPT | Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation. | Ran Cohen, Yehuda Lindell |
| 2014 | CRYPTO | Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings. | Yehuda Lindell, Ben Riva |
| 2013 | ASIACRYPT | Fair and Efficient Secure Multiparty Computation with Reputation Systems. | Gilad Asharov, Yehuda Lindell, Hila Zarosim |
| 2013 | ASIACRYPT | Hiding the Input-Size in Secure Two-Party Computation. | Yehuda Lindell, Kobbi Nissim, Claudio Orlandi |
| 2013 | CCS | More efficient oblivious transfer and extensions for faster secure computation. | Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner |
| 2013 | CRYPTO | Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. | Yehuda Lindell |
| 2013 | PKC | Techniques for Efficient Secure Computation Based on Yao's Protocol. | Yehuda Lindell |
| 2013 | TCC | A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. | Gilad Asharov, Yehuda Lindell, Tal Rabin |
| 2013 | TCC | On the Feasibility of Extending Oblivious Transfer. | Yehuda Lindell, Hila Zarosim |
| 2012 | ASIACRYPT | Completeness for Symmetric Two-Party Functionalities - Revisited. | Yehuda Lindell, Eran Omri, Hila Zarosim |
| 2011 | CRYPTO | Perfectly-Secure Multiplication for Any | Gilad Asharov, Yehuda Lindell, Tal Rabin |
| 2011 | CRYPTO | 1/ | Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov |
| 2011 | CRYPTO | Secure Computation on the Web: Computing without Simultaneous Interaction. | Shai Halevi, Yehuda Lindell, Benny Pinkas |
| 2011 | CRYPTO | The IPS Compiler: Optimizations, Variants and Concrete Efficiency. | Yehuda Lindell, Eli Oxman, Benny Pinkas |
| 2011 | EuroCrypt | Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption. | Yehuda Lindell |
| 2011 | TCC | On the Black-Box Complexity of Optimally-Fair Coin Tossing. | Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin |
| 2011 | TCC | Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. | Yehuda Lindell, Benny Pinkas |
| 2009 | CRYPTO | Collusion-Free Multiparty Computation in the Mediated Model. | Jol Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti |
| 2009 | CRYPTO | Utility Dependence in Correct and Fair Rational Secret Sharing. | Gilad Asharov, Yehuda Lindell |
| 2009 | TCC | Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. | Yehuda Lindell, Hila Zarosim |
| 2008 | CCS | Constructions of truly practical secure protocols using standard smartcards. | Carmit Hazay, Yehuda Lindell |
| 2008 | STOC | Complete fairness in secure two-party computation. | S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell |
| 2008 | SCN | Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. | Yehuda Lindell, Benny Pinkas, Nigel P. Smart |
| 2008 | TCC | Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. | Carmit Hazay, Yehuda Lindell |
| 2007 | EuroCrypt | An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. | Yehuda Lindell, Benny Pinkas |
| 2007 | TCC | Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. | Yonatan Aumann, Yehuda Lindell |
| 2007 | TCC | Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. | Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell |
| 2006 | CRYPTO | On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
| 2006 | STOC | Black-box constructions for secure computation. | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
| 2006 | STOC | Information-theoretically secure protocols and security under composition. | Eyal Kushilevitz, Yehuda Lindell, Tal Rabin |
| 2005 | CRYPTO | Secure Computation Without Authentication. | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin |
| 2005 | EuroCrypt | Universally Composable Password-Based Key Exchange. | Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie |
| 2005 | STOC | Concurrent general composition of secure protocols in the timing model. | Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran |
| 2005 | TCC | Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. | Jonathan Katz, Yehuda Lindell |
| 2004 | TCC | Lower Bounds for Concurrent Self Composition. | Yehuda Lindell |
| 2003 | EuroCrypt | On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. | Ran Canetti, Eyal Kushilevitz, Yehuda Lindell |
| 2003 | EuroCrypt | A Framework for Password-Based Authenticated Key Exchange. | Rosario Gennaro, Yehuda Lindell |
| 2003 | EuroCrypt | A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions. | Yehuda Lindell |
| 2003 | FOCS | Lower Bounds for Non-Black-Box Zero Knowledge. | Boaz Barak, Yehuda Lindell, Salil P. Vadhan |
| 2003 | FOCS | General Composition and Universal Composability in Secure Multi-Party Computation. | Yehuda Lindell |
| 2003 | PODC | Brief announcement: impossibility results for concurrent secure two-party computation. | Yehuda Lindell |
| 2003 | STOC | Bounded-concurrent secure two-party computation without setup assumptions. | Yehuda Lindell |
| 2002 | PODC | Sequential composition of protocols without simultaneous termination. | Yehuda Lindell, Anna Lysyanskaya, Tal Rabin |
| 2002 | STOC | Strict polynomial-time in simulation and extraction. | Boaz Barak, Yehuda Lindell |
| 2002 | STOC | Universally composable two-party and multi-party secure computation. | Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai |
| 2002 | STOC | On the composition of authenticated byzantine agreement. | Yehuda Lindell, Anna Lysyanskaya, Tal Rabin |
| 2001 | CRYPTO | Session-Key Generation Using Human Passwords Only. | Oded Goldreich, Yehuda Lindell |
| 2001 | CRYPTO | Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. | Yehuda Lindell |
| 2001 | FOCS | Resettably-Sound Zero-Knowledge and its Applications. | Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell |
| 2000 | CRYPTO | Privacy Preserving Data Mining. | Yehuda Lindell, Benny Pinkas |
| 1999 | KDD | A Statistical Theory for Quantitative Association Rules. | Yonatan Aumann, Yehuda Lindell |