Yehuda Lindell
Artificial Intelligence · 2000–2020
A researcher in the Science corpus: 35 papers; trusts 115 researchers and is trusted by 235 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 237 citations into it; #1,753 of 36,961 by trust here, #1,945 by citations
- Computer Networks and Communications — 142 citations into it; #817 of 9,996 by trust here, #1,295 by citations
- Computational Theory and Mathematics — 133 citations into it; #86 of 12,489 by trust here, #172 by citations
- Privacy & Security — 122 citations into it; #102 of 710 by trust here, #136 by citations
- Information Systems — 76 citations into it; #1,083 of 9,233 by trust here, #1,145 by citations
- Atomic and Molecular Physics, and Optics — 39 citations into it
- Discrete Mathematics and Combinatorics — 34 citations into it
- Computer Vision and Pattern Recognition — 32 citations into it; #11,099 of 21,973 by trust here, #12,488 by citations
Whom Yehuda Lindell trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Ran Canetti
- Oded Goldreich
- Donald Beaver
- Benny Pinkas
- Pascal Paillier
- Ivan Bjerre Damgård
- Silvio Micali
- Victor Shoup
- Yuval Ishai
- Shafi Goldwasser
Who trusts Yehuda Lindell overall
- David E. Evans
- Yan Huang
- Xiao Shaun Wang
- Jonathan Katz
- Adrià Gascón
- Benny Pinkas
- Samee Zahur
- Mihir Bellare
- Marcel Keller
- M. Sadegh Riazi
Papers from Yehuda Lindell's perspective
Ordered by how strongly the researchers Yehuda Lindell trusts endorse each paper. Same corpus, a different order for every researcher.
- New Directions in Cryptography
- Probabilistic Encryption
- Random oracles are practical: a paradigm for designing efficient protocols
- Fair exchange with a semi-trusted third party (extended abstract)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Fairplay - Secure Two-Party Computation System
- Protocols for secure computations
- How to share a secret
- Security and Composition of Multiparty Cryptographic Protocols (Journal of Cryptology)
- Universally composable security: a new paradigm for cryptographic protocols
Their papers
- Secure Computation on the Web: Computing without Simultaneous Interaction (2011) — 147 citations
- Introduction to Modern Cryptography, Second Edition (2014) — 546 citations
- High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority (2016) — 470 citations
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority (2017) — 190 citations
- From Keys to Databases - Real-World Applications of Secure Multi-Party Computation (2018) — 154 citations
- A Proof of Security of Yao’s Protocol for Two-Party Computation (2009) — 688 citations
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (2008) — 369 citations
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (2008) — 139 citations
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer (2011) — 291 citations
- More efficient oblivious transfer and extensions for faster secure computation (2013) — 456 citations
- Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation (2001) — 245 citations
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (2007) — 394 citations
- Optimized Honest-Majority MPC for Malicious Adversaries — Breaking the 1 Billion-Gate Per Second Barrier (2017) — 139 citations
- More Efficient Constant-Round Multi-Party Computation from BMR and SHE (2016) — 215 citations
- Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries (2013) — 226 citations
- Secure Multiparty Computation for Privacy-Preserving Data Mining (2009) — 791 citations
- Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ (2019) — 133 citations
- A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority (2017) — 110 citations
- How To Simulate It - A Tutorial on the Simulation Proof Technique (2016) — 578 citations
- Introduction to Modern Cryptography (2020) — 2,534 citations