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

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

Resettably-Sound Zero-Knowledge and its Applications. - Boaz Barak; Oded Goldreich 001; Shafi Goldwasser; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2001)

Sequential composition of protocols without simultaneous termination. - Yehuda Lindell; Anna Lysyanskaya; Tal Rabin (PODC, 2002)

Universally Composable Two-Party and Multi-Party Secure Computation. - Ran Canetti; Yehuda Lindell; Rafail Ostrovsky; Amit Sahai (IACR Cryptol. ePrint Arch., 2002)

Secure Computation Without Agreement. - Shafi Goldwasser; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2002)

A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions. - Yehuda Lindell (IACR Cryptol. ePrint Arch., 2002)

Privacy Preserving Data Mining. - Yehuda Lindell; Benny Pinkas (J. Cryptol., 2002)

Composition of Secure Multi-Party Protocols, A Comprehensive Study - Yehuda Lindell (Springer, 2003)

General Composition and Universal Composability in Secure Multi-Party Computation. - Yehuda Lindell (FOCS, 2003)

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

Bounded-concurrent secure two-party computation without setup assumptions. - Yehuda Lindell (STOC, 2003)

A Framework for Password-Based Authenticated Key Exchange. - Rosario Gennaro; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2003)

Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model. - Yehuda Lindell (IACR Cryptol. ePrint Arch., 2003)

A Statistical Theory for Quantitative Association Rules. - Yonatan Aumann; Yehuda Lindell (J. Intell. Inf. Syst., 2003)

Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. - Yehuda Lindell (J. Cryptol., 2003)

Lower Bounds for Concurrent Self Composition. - Yehuda Lindell (TCC, 2004)

A Proof of Yao's Protocol for Secure Two-Party Computation - Yehuda Lindell; Benny Pinkas (Electron. Colloquium Comput. Complex., 2004)

Protocol Initialization for the Framework of Universal Composability. - Boaz Barak; Yehuda Lindell; Tal Rabin (IACR Cryptol. ePrint Arch., 2004)

Strict Polynomial-Time in Simulation and Extraction. - Boaz Barak; Yehuda Lindell (SIAM J. Comput., 2004)

Concurrent general composition of secure protocols in the timing model. - Yael Tauman Kalai; Yehuda Lindell; Manoj Prabhakaran 001 (STOC, 2005)

Universally Composable Password-Based Key Exchange. - Ran Canetti; Shai Halevi; Jonathan Katz; Yehuda Lindell; Philip D. MacKenzie (IACR Cryptol. ePrint Arch., 2005)

Secure Multi-Party Computation without Agreement. - Shafi Goldwasser; Yehuda Lindell (J. Cryptol., 2005)

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

Black-box constructions for secure computation. - Yuval Ishai; Eyal Kushilevitz; Yehuda Lindell; Erez Petrank (STOC, 2006)

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

On the composition of authenticated Byzantine Agreement. - Yehuda Lindell; Anna Lysyanskaya; Tal Rabin (J. ACM, 2006)

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

On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. - Ran Canetti; Eyal Kushilevitz; Yehuda Lindell (J. Cryptol., 2006)

Session-Key Generation Using Human Passwords Only. - Oded Goldreich 001; Yehuda Lindell (J. Cryptol., 2006)

A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions. - Yehuda Lindell (J. Cryptol., 2006)

A framework for password-based authenticated key exchange1. - Rosario Gennaro; Yehuda Lindell (ACM Trans. Inf. Syst. Secur., 2006)

Introduction to Modern Cryptography - Jonathan Katz; Yehuda Lindell (Chapman and Hall/CRC Press, 2007)

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

Concurrent Composition of Secure Protocols in the Timing Model. - Yael Tauman Kalai; Yehuda Lindell; Manoj Prabhakaran 001 (J. Cryptol., 2007)

Aggregate Message Authentication Codes. - Jonathan Katz; Andrew Y. Lindell (CT-RSA, 2008)

Legally-Enforceable Fairness in Secure Two-Party Computation. - Andrew Y. Lindell (CT-RSA, 2008)

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. - Yehuda Lindell; Benny Pinkas; Nigel P. Smart (SCN, 2008)

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

Collusion-Free Multiparty Computation in the Mediated Model. - Jonathan Katz; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2008)

Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. - Jonathan Katz; Yehuda Lindell (J. Cryptol., 2008)

Lower Bounds and Impossibility Results for Concurrent Self Composition. - Yehuda Lindell (J. Cryptol., 2008)

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

Local Sequentiality Does Not Help for Concurrent Composition. - Andrew Y. Lindell (CT-RSA, 2009)

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

Constructions of Truly Practical Secure Protocols using Standard Smartcards. - Carmit Hazay; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2009)

Efficient Oblivious Polynomial Evaluation with Simulation-Based Security. - Carmit Hazay; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2009)

Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1. - Yehuda Lindell (IACR Cryptol. ePrint Arch., 2009)

Adaptively Secure Two-Party Computation with Erasures. - Yehuda Lindell (IACR Cryptol. ePrint Arch., 2009)

General Composition and Universal Composability in Secure Multiparty Computation. - Yehuda Lindell (J. Cryptol., 2009)

A Proof of Security of Yao's Protocol for Two-Party Computation. - Yehuda Lindell; Benny Pinkas (J. Cryptol., 2009)

Secure Multiparty Computation for Privacy-Preserving Data Mining. - Yehuda Lindell; Benny Pinkas (J. Priv. Confidentiality, 2009)

Secure Computation for Privacy Preserving Data Mining. - Yehuda Lindell (Encyclopedia of Data Warehousing and Mining, 2009)

Private Web Search with Malicious Adversaries. - Yehuda Lindell; Erez Waisbard (Privacy Enhancing Technologies, 2010)

A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries. - Carmit Hazay; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2010)

A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality. - Carmit Hazay; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2010)

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. - Yonatan Aumann; Yehuda Lindell (J. Cryptol., 2010)

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. - Carmit Hazay; Yehuda Lindell (J. Cryptol., 2010)

Information-Theoretically Secure Protocols and Security under Composition. - Eyal Kushilevitz; Yehuda Lindell; Tal Rabin (SIAM J. Comput., 2010)

Efficient Secure Two-Party Protocols - Techniques and Constructions - Carmit Hazay; Yehuda Lindell (Springer, 2010)

Perfectly-Secure Multiplication for Any t < n/3. - Gilad Asharov; Yehuda Lindell; Tal Rabin (CRYPTO, 2011)

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

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

A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. - Gilad Asharov; Yehuda Lindell (Electron. Colloquium Comput. Complex., 2011)

Constant-Round Zero-Knowledge Proofs of Knowledge. - Yehuda Lindell (Electron. Colloquium Comput. Complex., 2011)

Secure Computation on the Web: Computing without Simultaneous Interaction. - Shai Halevi; Yehuda Lindell; Benny Pinkas (IACR Cryptol. ePrint Arch., 2011)

Highly-Efficient Universally-Composable Commitments based on the DDH Assumption. - Yehuda Lindell (IACR Cryptol. ePrint Arch., 2011)

A Practical Application of Differential Privacy to Personalized Online Advertising. - Yehuda Lindell; Eran Omri (IACR Cryptol. ePrint Arch., 2011)

The IPS Compiler: Optimizations, Variants and Concrete Efficiency. - Yehuda Lindell; Benny Pinkas; Eli Oxman (IACR Cryptol. ePrint Arch., 2011)

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

Utility Dependence in Correct and Fair Rational Secret Sharing. - Gilad Asharov; Yehuda Lindell (J. Cryptol., 2011)

Secure Computation Without Authentication. - Boaz Barak; Ran Canetti; Yehuda Lindell; Rafael Pass; Tal Rabin (J. Cryptol., 2011)

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. - Dafna Kidron; Yehuda Lindell (J. Cryptol., 2011)

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. - Yehuda Lindell; Hila Zarosim (J. Cryptol., 2011)

Anonymous Authentication. - Yehuda Lindell (J. Priv. Confidentiality, 2011)

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

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

SCAPI: The Secure Computation Application Programming Interface. - Yael Ejgenberg; Moriya Farbstein; Meital Levy; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2012)

Hiding the Input-Size in Secure Two-Party Computation. - Yehuda Lindell; Kobbi Nissim; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2012)

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. - Yehuda Lindell; Benny Pinkas (J. Cryptol., 2012)

Techniques for Efficient Secure Computation Based on Yao's Protocol. - Yehuda Lindell (Public Key Cryptography, 2013)

Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. - Gilad Asharov; Yehuda Lindell; Tal Rabin (IACR Cryptol. ePrint Arch., 2013)

More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. - Gilad Asharov; Yehuda Lindell; Thomas Schneider 003; Michael Zohner (IACR Cryptol. ePrint Arch., 2013)

Fair and Efficient Secure Multiparty Computation with Reputation Systems. - Gilad Asharov; Yehuda Lindell; Hila Zarosim (IACR Cryptol. ePrint Arch., 2013)

A Note on Constant-Round Zero-Knowledge Proofs of Knowledge. - Yehuda Lindell (J. Cryptol., 2013)

The BGW Protocol for Perfectly-Secure Multiparty Computation. - Gilad Asharov; Yehuda Lindell (Secure Multi-Party Computation, 2013)

Introduction to Modern Cryptography, Second Edition - Jonathan Katz; Yehuda Lindell (CRC Press, 2014)

Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings. - Yehuda Lindell; Ben Riva (CRYPTO (2), 2014)

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. - Ran Canetti; Asaf Cohen 002; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2014)

An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle. - Yehuda Lindell (IACR Cryptol. ePrint Arch., 2014)

Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings. - Yehuda Lindell; Ben Riva (IACR Cryptol. ePrint Arch., 2014)

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. - Gilad Asharov; Yehuda Lindell; Thomas Schneider 003; Michael Zohner (IACR Cryptol. ePrint Arch., 2015)

GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte. - Shay Gueron; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2015)

Adaptively Secure Computation with Partial Erasures. - Carmit Hazay; Yehuda Lindell; Arpita Patra (IACR Cryptol. ePrint Arch., 2015)

Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries. - Yehuda Lindell; Ben Riva (IACR Cryptol. ePrint Arch., 2015)

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. - Yehuda Lindell; Benny Pinkas (J. Cryptol., 2015)

DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation. - Toshinori Araki; Assaf Barak; Jun Furukawa 001; Yehuda Lindell; Ariel Nof; Kazuma Ohara (CCS, 2016)

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. - Toshinori Araki; Jun Furukawa 001; Yehuda Lindell; Ariel Nof; Kazuma Ohara (IACR Cryptol. ePrint Arch., 2016)

Optimizing Semi-Honest Secure Multiparty Computation for the Internet. - Aner Ben-Efraim; Yehuda Lindell; Eran Omri (IACR Cryptol. ePrint Arch., 2016)

High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. - Jun Furukawa 001; Yehuda Lindell; Ariel Nof; Or Weinstein (IACR Cryptol. ePrint Arch., 2016)

Attribute-based Key Exchange with General Policies. - Vladimir Kolesnikov; Hugo Krawczyk; Yehuda Lindell; Alex J. Malozemoff; Tal Rabin (IACR Cryptol. ePrint Arch., 2016)

More Efficient Constant-Round Multi-Party Computation from BMR and SHE. - Yehuda Lindell; Nigel P. Smart; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2016)

Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries. - Yehuda Lindell (J. Cryptol., 2016)

How to Simulate It - A Tutorial on the Simulation Proof Technique. - Yehuda Lindell (Tutorials on the Foundations of Cryptography, 2017)

Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. - Toshinori Araki; Assi Barak; Jun Furukawa 001; Tamar Lichter; Yehuda Lindell; Ariel Nof; Kazuma Ohara; Adi Watzman; Or Weinstein (IEEE Symposium on Security and Privacy, 2017)

How To Simulate It - A Tutorial on the Simulation Proof Technique. - Yehuda Lindell (Electron. Colloquium Comput. Complex., 2017)

Efficient Scalable Constant-Round MPC via Garbled Circuits. - Aner Ben-Efraim; Yehuda Lindell; Eran Omri (IACR Cryptol. ePrint Arch., 2017)

Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation. - Shay Gueron; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2017)

AES-GCM-SIV: Specification and Analysis. - Shay Gueron; Adam Langley; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2017)

A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. - Yehuda Lindell; Ariel Nof (IACR Cryptol. ePrint Arch., 2017)

Secure Two-Party Computation with Fairness - A Necessary Design Principle. - Yehuda Lindell; Tal Rabin (IACR Cryptol. ePrint Arch., 2017)

Fast Garbling of Circuits over 3-Valued Logic. - Yehuda Lindell; Avishay Yanai (IACR Cryptol. ePrint Arch., 2017)

More Efficient Oblivious Transfer Extensions. - Gilad Asharov; Yehuda Lindell; Thomas Schneider 003; Michael Zohner (J. Cryptol., 2017)

Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. - Ran Cohen; Yehuda Lindell (J. Cryptol., 2017)

Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. - Yehuda Lindell; Ariel Nof (CCS, 2018)

From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. - David W. Archer; Dan Bogdanov; Yehuda Lindell; Liina Kamm; Kurt Nielsen; Jakob Illeborg Pagter; Nigel P. Smart; Rebecca N. Wright (Comput. J., 2018)

Turning Lemons into Peaches using Secure Computation. - Stav Buchsbaum; Ran Gilad-Bachrach; Yehuda Lindell (CoRR, 2018)

Generalizing the SPDZ Compiler For Other Protocols. - Toshinori Araki; Assi Barak; Jun Furukawa 001; Marcel Keller; Yehuda Lindell; Kazuma Ohara; Hikaru Tsuchida 001 (IACR Cryptol. ePrint Arch., 2018)

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 (IACR Cryptol. ePrint Arch., 2018)

Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries. - Tore Kasper Frederiksen; Yehuda Lindell; Valery Osheter; Benny Pinkas (IACR Cryptol. ePrint Arch., 2018)

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 (IACR Cryptol. ePrint Arch., 2018)

Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. - Yehuda Lindell; Ariel Nof; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2018)

Fast Garbling of Circuits Under Standard Assumptions. - Shay Gueron; Yehuda Lindell; Ariel Nof; Benny Pinkas (J. Cryptol., 2018)

Completeness for Symmetric Two-Party Functionalities: Revisited. - Yehuda Lindell; Eran Omri; Hila Zarosim (J. Cryptol., 2018)

On the Feasibility of Extending Oblivious Transfer. - Yehuda Lindell; Hila Zarosim (J. Cryptol., 2018)

Privacy-Preserving Search of Similar Patients in Genomic Data. - Gilad Asharov; Shai Halevi; Yehuda Lindell; Tal Rabin (Proc. Priv. Enhancing Technol., 2018)

Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. - Jun Furukawa 001; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2019)

SimpleENC and SimpleENCsmall - an Authenticated Encryption Mode for the Lightweight Setting. - Shay Gueron; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2019)

Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ. - Yehuda Lindell; Benny Pinkas; Nigel P. Smart; Avishay Yanai (J. Cryptol., 2019)

AES-GCM-SIV: Nonce Misuse-Resistant Authenticated Encryption. - Shay Gueron; Adam Langley; Yehuda Lindell (RFC, 2019)

Deterministic-Prover Zero-Knowledge Proofs. - Hila Dahari; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2020)

Secure Multiparty Computation (MPC). - Yehuda Lindell (IACR Cryptol. ePrint Arch., 2020)

1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds. - Amos Beimel; Yehuda Lindell; Eran Omri; Ilan Orlov (J. Cryptol., 2020)

Secure multiparty computation. - Yehuda Lindell (Commun. ACM, 2021)

Fast Secure Two-Party ECDSA Signing. - Yehuda Lindell (J. Cryptol., 2021)

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. - Koji Chida; Koki Hamada; Dai Ikarashi; Ryo Kikuchi; Daniel Genkin; Yehuda Lindell; Ariel Nof (J. Cryptol., 2023)

High-Throughput Secure Three-Party Computation with an Honest Majority. - Jun Furukawa 001; Yehuda Lindell; Ariel Nof; Or Weinstein (J. Cryptol., 2023)

Feldman's Verifiable Secret Sharing for a Dishonest Majority. - Yi-Hsiu Chen; Yehuda Lindell (IACR Commun. Cryptol., 2024)

Optimizing and Implementing Fischlin's Transform for UC-Secure Zero Knowledge. - Yi-Hsiu Chen; Yehuda Lindell (IACR Commun. Cryptol., 2024)

Simple Three-Round Multiparty Schnorr Signing with Full Simulatability. - Yehuda Lindell (IACR Commun. Cryptol., 2024)

Exponent-VRFs and Their Applications. - Dan Boneh; Iftach Haitner; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2024)

Exponent-VRFs and Their Applications. - Dan Boneh; Iftach Haitner; Yehuda Lindell; Gil Segev 001 (EUROCRYPT (7), 2025)

Integer Commitments, Old and New Tools. - Iftach Haitner; Yehuda Lindell; Nikolaos Makriyannis (IACR Cryptol. ePrint Arch., 2025)