Yehuda Lindell

Yehuda Lindell's AcademicInfluence.com Rankings

Yehuda Lindell

Computer Science

#6425

World Rank

#6774

Historical Rank

Database

#3513

World Rank

#3660

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Yehuda Lindell's Degrees

PhD Computer Science Weizmann Institute of Science
Masters Computer Science Weizmann Institute of Science

Similar Degrees You Can Earn

Why Is Yehuda Lindell Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Yehuda Lindell's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Privacy Preserving Data Mining (2000) (3471)
Introduction to Modern Cryptography (2007) (2166)
Universally composable two-party and multi-party secure computation (2002) (722)
Secure Multiparty Computation for Privacy-Preserving Data Mining (2009) (701)
A Proof of Security of Yao’s Protocol for Two-Party Computation (2009) (620)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series) (2007) (518)
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (2007) (374)
Introduction to Modern Cryptography, Second Edition (2014) (355)
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries (2007) (354)
More efficient oblivious transfer and extensions for faster secure computation (2013) (346)
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (2008) (337)
A Framework for Password-Based Authenticated Key Exchange (2003) (319)
A Statistical Theory for Quantitative Association Rules (1999) (298)
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority (2016) (284)
Efficient Secure Two-Party Protocols: Techniques and Constructions (2010) (283)
How To Simulate It - A Tutorial on the Simulation Proof Technique (2016) (281)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer (2011) (264)
Universally Composable Password-Based Key Exchange (2005) (244)
Session-Key Generation Using Human Passwords Only (2001) (242)
Text Mining at the Term Level (1998) (223)
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions (2003) (221)
More Efficient Constant-Round Multi-Party Computation from BMR and SHE (2016) (206)
A Proof of Yao's Protocol for Secure Two-Party Computation (2004) (168)
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation (2003) (165)
General Composition and Universal Composability in Secure Multiparty Computation (2003) (136)
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation (2015) (135)
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (2008) (133)
Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries (2016) (132)
Secure Computation on the Web: Computing without Simultaneous Interaction (2011) (131)
Complete Fairness in Secure Two-Party Computation (2011) (130)
Fast Secure Two-Party ECDSA Signing (2017) (130)
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority (2017) (126)
Strict polynomial-time in simulation and extraction (2002) (125)
Efficient Secure Two-Party Protocols (2010) (124)
Secure Computation Without Authentication (2005) (119)
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody (2018) (117)
Information-theoretically secure protocols and security under composition (2006) (117)
Lower bounds for non-black-box zero knowledge (2003) (116)
Secure Computation without Agreement (2002) (113)
Secure Multi-Party Computation without Agreement (2005) (111)
Resettably-sound zero-knowledge and its applications (2001) (111)
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation (2018) (107)
Optimized Honest-Majority MPC for Malicious Adversaries — Breaking the 1 Billion-Gate Per Second Barrier (2017) (106)
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ (2019) (105)
Bounded-concurrent secure two-party computation without setup assumptions (2003) (103)
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries (2018) (102)
Lower Bounds for Concurrent Self Composition (2004) (98)
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions (2006) (97)
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries (2015) (95)
On the composition of authenticated byzantine agreement (2002) (90)
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings (2014) (82)
Fast Garbling of Circuits Under Standard Assumptions (2015) (80)
A framework for password-based authenticated key exchange1 (2006) (79)
Highly-Efficient Universally-Composable Commitments based on the DDH Assumption (2011) (77)
SCAPI: The Secure Computation Application Programming Interface (2012) (75)
GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte (2015) (74)
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation (2015) (74)
Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries (2013) (73)
Optimizing Semi-Honest Secure Multiparty Computation for the Internet (2016) (72)
Efficient Fully-Simulatable Oblivious Transfer (2008) (72)
Constructions of truly practical secure protocols using standardsmartcards (2008) (71)
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries (2015) (71)
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation (2001) (70)
Black-box constructions for secure computation (2006) (66)
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority (2017) (63)
The IPS Compiler: Optimizations, Variants and Concrete Efficiency (2011) (63)
Utility Dependence in Correct and Fair Rational Secret Sharing (2009) (59)
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle (2015) (58)
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation (2014) (58)
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions (2007) (57)
On the Black-Box Complexity of Optimally-Fair Coin Tossing (2011) (49)
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds (2011) (49)
Concurrent general composition of secure protocols in the timing model (2005) (49)
More Efficient Oblivious Transfer Extensions (2017) (48)
Collusion-Free Multiparty Computation in the Mediated Model (2009) (47)
Privacy-Preserving Search of Similar Patients in Genomic Data (2018) (47)
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation (2006) (44)
Composition of Secure Multi-Party Protocols: A Comprehensive Study (2003) (44)
Introduction to Coding Theory Lecture Notes (2009) (42)
Generalizing the SPDZ Compiler For Other Protocols (2018) (41)
Black-Box Constructions of Protocols for Secure Computation (2011) (40)
AES-GCM-SIV: Specification and Analysis (2017) (38)
Private Web Search with Malicious Adversaries (2010) (37)
Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries (2018) (37)
Protocol Initialization for the Framework of Universal Composability (2004) (37)
Anonymous Authentication (2011) (37)
Secure Multiparty Computation (MPC) (2020) (36)
AES-GCM-SIV: Nonce Misuse-Resistant Authenticated Encryption (2019) (35)
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer (2009) (35)
Lower Bounds and Impossibility Results for Concurrent Self Composition (2008) (33)
Utility Dependence in Correct and Fair Rational Secret Sharing (2010) (31)
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions (2003) (31)
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants (2018) (31)
Complete fairness in secure two-party computation (2008) (31)
Concurrent Composition of Secure Protocols in the Timing Model (2007) (30)
Tutorials on the Foundations of Cryptography (2017) (29)
Sequential composition of protocols without simultaneous termination (2002) (28)
Fair and Efficient Secure Multiparty Computation with Reputation Systems (2013) (28)
Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation (2017) (27)
TextVis: An Integrated Visual Environment for Text Mining (1998) (27)
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs (2011) (27)
Hiding the Input-Size in Secure Two-Party Computation (2013) (25)
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness (2013) (25)
Secure multiparty computation (2020) (24)
A Practical Application of Differential Privacy to Personalized Online Advertising (2011) (24)
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs (2008) (23)
Efficient Oblivious Polynomial Evaluation with Simulation-Based Security (2009) (22)
On the composition of authenticated Byzantine Agreement (2006) (21)
Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich (2017) (21)
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest (2019) (21)
A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries (2010) (19)
Perfectly-Secure Multiplication for Any t < n/3 (2011) (19)
Composition of Secure Multi-Party Protocols (2003) (18)
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge (2013) (14)
Efficient Scalable Constant-Round MPC via Garbled Circuits (2017) (14)
Attribute-based Key Exchange with General Policies (2016) (13)
On the Feasibility of Extending Oblivious Transfer (2013) (13)
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (2014) (13)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer (2011) (12)
Adaptively Secure Computation with Partial Erasures (2015) (11)
A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality (2010) (9)
Sigma Protocols and Efficient Zero-Knowledge1 (2010) (9)
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme (2019) (8)
4. Universally Composable Multi-party Computation (2003) (8)
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ (2019) (7)
Simple Three-Round Multiparty Schnorr Signing with Full Simulatability (2022) (7)
Protocols for Bounded-Concurrent Secure Two-Party Computation (2006) (6)
Secure Two-Party Computation with Fairness - A Necessary Design Principle (2017) (6)
Constant-Round Zero-Knowledge Proofs of Knowledge (2010) (6)
DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation (2016) (6)
Completeness for Symmetric Two-Party Functionalities: Revisited (2018) (5)
Theory of cryptography : 11th theory of cryptography conference, TCC 2014 San Diego, CA, USA, February 24-26, 2014 : proceedings (2014) (5)
Secure Computation for Privacy Preserving Data Mining (2009) (5)
Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings (2014) (4)
A Theory of Quantitative Association Rules with Statistical Validation (1998) (4)
Semi-honest Adversaries (2010) (4)
Legally Enforceable Fairness in Secure Two-Party Communication (2009) (4)
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs (2005) (4)
The BGW Protocol for Perfectly-Secure Multiparty Computation (2013) (4)
Completeness for Symmetric Two-Party Functionalities: Revisited (2012) (3)
Introduction to Cryptography 89-656 (2006) (2)
Black-Box Constructions for Secure Computation ∗ (extended abstract) (2006) (2)
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation (2016) (1)
Fast Garbling of Circuits Under Standard Assumptions (2017) (1)
On the Feasibility of Extending Oblivious Transfer (2017) (1)
Brief announcement: impossibility results for concurrent secure two-party computation (2003) (1)
SimpleENC and SimpleENCsmall - an Authenticated Encryption Mode for the Lightweight Setting (2019) (1)
Fast Garbling of Circuits over 3-Valued Logic (2018) (1)
Techniques for Efficient Secure Computation Based on Yao's Protocol (2013) (1)
Deterministic-Prover Zero-Knowledge Proofs (2020) (1)
More Efficient Oblivious Transfer Extensions (2016) (1)
$${\varvec{1/p}}$$-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds (2020) (0)
*Post-Quantum Cryptography (2020) (0)
Message Authentication Codes (2020) (0)
*Algorithms for Factoring and Computing Discrete Logarithms (2020) (0)
Introduction (2020) (0)
Perfectly Secret Encryption (2014) (0)
Number 12 (2017) (0)
Turning Lemons into Peaches using Secure Computation (2018) (0)
The k th-Ranked Element (2010) (0)
Practical Constructions of Symmetric-Key Primitives (2020) (0)
*Theoretical Constructions of Symmetric-Key Primitives (2020) (0)
The Security Advantages of Hardware Tokens over Software Tokens for PKI Applications (2006) (0)
Digital Signature Schemes (2020) (0)
Fast Secure Two-Party ECDSA Signing ? Yehuda Lindell ? ? (2017) (0)
Hash Functions and Applications (2020) (0)
Balancing Needs, Values and Policies in a Time of National Crisis (2021) (0)
Key Management and the Public-Key Revolution (2020) (0)
Explicit Logspace Constructions of Weak DesignsTzvika Hartmany RanR z (2007) (0)
Simple : a simple AEAD scheme A submission to the NIST Lightweight Cryptography Standardization Process (2019) (0)
CCA-Security and Authenticated Encryption (2020) (0)
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge (2012) (0)
Number Theory and Cryptographic Hardness Assumptions (2014) (0)
GCM-SIV : Full Nonce Misuse-Resistant Authenticated Encryption at Under One C / B (2015) (0)
Private-Key Encryption (2020) (0)
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation (2015) (0)
Zero-Knowledge from Sigma Protocols – An Erratum (2018) (0)
Oblivious Transfer and Applications (2010) (0)
Efficient Secure Two-Party Protocols - Preamble (2015) (0)
*Advanced Topics in Public-Key Encryption (2020) (0)
Classic Results in Theoretical Computer Science (Seminar) (2010) (0)
Public-Key Encryption (2020) (0)