Yehuda Lindell

19.5k total citations · 3 hit papers
97 papers, 5.4k citations indexed

About

Yehuda Lindell is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Yehuda Lindell has authored 97 papers receiving a total of 5.4k indexed citations (citations by other indexed papers that have themselves been cited), including 88 papers in Artificial Intelligence, 47 papers in Computational Theory and Mathematics and 22 papers in Computer Networks and Communications. Recurrent topics in Yehuda Lindell's work include Cryptography and Data Security (78 papers), Complexity and Algorithms in Graphs (44 papers) and Privacy-Preserving Technologies in Data (28 papers). Yehuda Lindell is often cited by papers focused on Cryptography and Data Security (78 papers), Complexity and Algorithms in Graphs (44 papers) and Privacy-Preserving Technologies in Data (28 papers). Yehuda Lindell collaborates with scholars based in Israel, United States and Japan. Yehuda Lindell's co-authors include Jonathan Katz, Benny Pinkas, Carmit Hazay, Yonatan Aumann, Ariel Nof, Gilad Asharov, Ran Canetti, Michael Zohner, Thomas Schneider and Rafail Ostrovsky and has published in prestigious journals such as SHILAP Revista de lepidopterología, Communications of the ACM and Journal of the ACM.

In The Last Decade

Yehuda Lindell

95 papers receiving 5.0k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Introduction to Modern Cryptography

2014 856 citations Jonathan Katz, Yehuda Lindell profile →
Introduction to Modern Cryptography

2007 671 citations Jonathan Katz, Yehuda Lindell profile →
Privacy Preserving Data Mining

2002 413 citations Yehuda Lindell et al. Journal of Cryptology profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Yehuda Lindell Israel	31	4.5k	1.7k	1.1k	1.0k	738	97	5.4k
Benny Pinkas Israel	32	4.7k 1.0×	2.2k 1.3×	872 0.8×	1.2k 1.2×	759 1.0×	71	5.8k
Jonathan Katz United States	37	4.3k 0.9×	2.0k 1.2×	940 0.8×	2.3k 2.3×	947 1.3×	126	6.2k
Craig Gentry United States	21	7.3k 1.6×	3.1k 1.8×	1.9k 1.7×	1.1k 1.1×	1.1k 1.5×	42	8.2k
Moti Yung United States	35	3.3k 0.7×	1.4k 0.9×	913 0.8×	2.2k 2.2×	660 0.9×	260	4.8k
Mihir Bellare United States	36	5.6k 1.2×	2.3k 1.4×	1.8k 1.5×	2.4k 2.3×	1.1k 1.5×	93	6.9k
Shafi Goldwasser United States	30	7.3k 1.6×	2.2k 1.3×	2.7k 2.4×	1.7k 1.7×	1.2k 1.6×	90	8.3k
Ran Canetti United States	38	5.9k 1.3×	2.3k 1.4×	1.6k 1.4×	3.3k 3.3×	744 1.0×	121	7.6k
Eyal Kushilevitz Israel	34	4.6k 1.0×	743 0.4×	1.9k 1.7×	1.4k 1.4×	492 0.7×	126	5.5k
Qiaoyan Wen China	55	9.3k 2.0×	2.2k 1.3×	861 0.8×	1.4k 1.4×	746 1.0×	457	11.3k
Rafail Ostrovsky United States	35	6.1k 1.3×	2.5k 1.5×	1.9k 1.7×	1.7k 1.7×	1.3k 1.8×	168	7.8k

Countries citing papers authored by Yehuda Lindell

Since Specialization

Citations

This map shows the geographic impact of Yehuda Lindell's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Yehuda Lindell with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yehuda Lindell more than expected).

Fields of papers citing papers by Yehuda Lindell

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yehuda Lindell. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Yehuda Lindell. The network helps show where Yehuda Lindell may publish in the future.

Co-authorship network of co-authors of Yehuda Lindell

This figure shows the co-authorship network connecting the top 25 collaborators of Yehuda Lindell. A scholar is included among the top collaborators of Yehuda Lindell based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Yehuda Lindell. Yehuda Lindell is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lindell, Yehuda, et al.. (2024). Optimizing and Implementing Fischlin's Transform for UC-Secure Zero Knowledge. 1 indexed citations

Lindell, Yehuda. (2024). Simple Three-Round Multiparty Schnorr Signing with Full Simulatability. 1 indexed citations

Lindell, Yehuda, et al.. (2024). Feldman's Verifiable Secret Sharing for a Dishonest Majority. 3 indexed citations

Chida, Koji, Koki Hamada, Dai Ikarashi, et al.. (2023). Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. Journal of Cryptology. 36(3). 4 indexed citations

Araki, Toshinori, et al.. (2017). Optimized Honest-Majority MPC for Malicious Adversaries — Breaking the 1 Billion-Gate Per Second Barrier. 843–862. 50 indexed citations

Lindell, Yehuda. (2017). Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich. Springer eBooks. 12 indexed citations

Asharov, Gilad, Yehuda Lindell, Thomas Schneider, & Michael Zohner. (2016). More Efficient Oblivious Transfer Extensions. Journal of Cryptology. 30(3). 805–858. 23 indexed citations

Katz, Jonathan & Yehuda Lindell. (2014). Introduction to Modern Cryptography. 856 indexed citations breakdown →

Lindell, Yehuda. (2014). Theory of cryptography : 11th theory of cryptography conference, TCC 2014 San Diego, CA, USA, February 24-26, 2014 : proceedings. DIAL (Catholic University of Leuven). 1 indexed citations

10.

Lindell, Yehuda & Benny Pinkas. (2014). An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. Journal of Cryptology. 28(2). 312–350. 20 indexed citations

11.

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

12.

Hazay, Carmit & Yehuda Lindell. (2010). Efficient Secure Two-Party Protocols: Techniques and Constructions. DIAL (Catholic University of Leuven). 94 indexed citations

13.

Lindell, Yehuda. (2009). Legally Enforceable Fairness in Secure Two-Party Communication.. 2009. 1 indexed citations

14.

Lindell, Yehuda, Benny Pinkas, & Nigel P. Smart. (2008). Security and Cryptography for Networks - SCN 2008. Lecture notes in computer science. 6 indexed citations

15.

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

16.

Lindell, Yehuda. (2008). General Composition and Universal Composability in Secure Multiparty Computation. Journal of Cryptology. 22(3). 395–428. 29 indexed citations

17.

Barak, Boaz, Yehuda Lindell, & Salil Vadhan. (2005). Lower bounds for non-black-box zero knowledge. Journal of Computer and System Sciences. 72(2). 321–391. 25 indexed citations

18.

Canetti, Ran, Eyal Kushilevitz, & Yehuda Lindell. (2005). On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. Journal of Cryptology. 19(2). 135–167. 20 indexed citations

19.

Lindell, Yehuda. (2005). A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions. Journal of Cryptology. 19(3). 359–377. 2 indexed citations

20.

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

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact