H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 62 Citations 18,717 131 World Ranking 1375 National Ranking 24

Overview

What is he best known for?

The fields of study he is best known for:

  • Cryptography
  • Operating system
  • Algebra

His scientific interests lie mostly in Secure two-party computation, Secure multi-party computation, Theoretical computer science, Computer security and Cryptography. His work deals with themes such as Distributed computing and Oblivious transfer, which intersect with Secure two-party computation. His study on Secure multi-party computation is covered under Protocol.

In his study, Field is inextricably linked to Computation, which falls within the broad field of Protocol. His research in Theoretical computer science intersects with topics in Cryptographic protocol, Universal composability, Homomorphic encryption, Mathematical proof and Data mining. His Cryptography study combines topics in areas such as Password, Hash function, Encryption, String and Series.

His most cited work include:

  • Introduction to Modern Cryptography (1269 citations)
  • Privacy Preserving Data Mining (958 citations)
  • Universally composable two-party and multi-party secure computation (632 citations)

What are the main themes of his work throughout his whole career to date?

Yehuda Lindell mainly investigates Secure multi-party computation, Theoretical computer science, Computer security, Protocol and Cryptography. The study incorporates disciplines such as Correctness and Distributed computing in addition to Secure multi-party computation. His studies deal with areas such as Cryptographic protocol, Universal composability, Mathematical proof, Oblivious transfer and Security parameter as well as Theoretical computer science.

His work on Adversary, Adversary model, Encryption and Password as part of general Computer security study is frequently connected to Protocol, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. In general Protocol study, his work on Divide and choose often relates to the realm of Function, thereby connecting several areas of interest. In his study, Time complexity is strongly linked to Probabilistic logic, which falls under the umbrella field of Cryptography.

He most often published in these fields:

  • Secure multi-party computation (44.49%)
  • Theoretical computer science (38.78%)
  • Computer security (34.22%)

What were the highlights of his more recent work (between 2017-2020)?

  • Secure multi-party computation (44.49%)
  • Computer security (34.22%)
  • Computer network (12.55%)

In recent papers he was focusing on the following fields of study:

Yehuda Lindell mostly deals with Secure multi-party computation, Computer security, Computer network, Theoretical computer science and Public-key cryptography. Computation and Cryptography are the two main areas of interest in his Secure multi-party computation studies. His studies in Cryptography integrate themes in fields like Reduction, Telecommunications, Series and Network security.

His study in Computer security focuses on Authenticated encryption in particular. Within one scientific family, he focuses on topics pertaining to Security parameter under Theoretical computer science, and may sometimes address concerns connected to Oblivious transfer, Ideal, Polynomial and Range. The Protocol study combines topics in areas such as Adversary, Adversary model and Adversarial system.

Between 2017 and 2020, his most popular works were:

  • Introduction to Modern Cryptography (Chapman & Hall/CRC Cryptography and Network Security Series) (449 citations)
  • Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ (59 citations)
  • Fast Large-Scale Honest-Majority MPC for Malicious Adversaries (47 citations)

In his most recent research, the most cited papers focused on:

  • Cryptography
  • Operating system
  • Algebra

His main research concerns Secure multi-party computation, Computer security, Cryptography, Computation and Computer network. The concepts of his Secure multi-party computation study are interwoven with issues in Correctness, Boolean circuit and Theoretical computer science. He performs integrative study on Theoretical computer science and Random permutation in his works.

Yehuda Lindell performs integrative Cryptography and Protocol research in his work. Yehuda Lindell combines subjects such as Field, Mathematical optimization, Computer engineering and Constant with his study of Computation. His Protocol research includes themes of Adversarial system and Adversary, Adversary model.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Introduction to Modern Cryptography

Jonathan Katz;Yehuda Lindell.
(2007)

1783 Citations

Privacy Preserving Data Mining

Y. Lindell;B. Pinkas.
international cryptology conference (2000)

1582 Citations

A Proof of Security of Yao’s Protocol for Two-Party Computation

Yehuda Lindell;Benny Pinkas.
Journal of Cryptology (2009)

780 Citations

Universally composable two-party and multi-party secure computation

Ran Canetti;Yehuda Lindell;Rafail Ostrovsky;Amit Sahai.
symposium on the theory of computing (2002)

759 Citations

Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)

Jonathan Katz;Yehuda Lindell.
(2007)

632 Citations

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

Yehuda Lindell;Benny Pinkas.
international cryptology conference (2007)

455 Citations

Secure Multiparty Computation for Privacy-Preserving Data Mining

Yehuda Lindell;Benny Pinkas.
Journal of Privacy and Confidentiality (2009)

415 Citations

A framework for password-based authenticated key exchange

Rosario Gennaro;Yehuda Lindell.
theory and application of cryptographic techniques (2003)

385 Citations

More Efficient Constant-Round Multi-party Computation from BMR and SHE

Yehuda Lindell;Nigel P. Smart;Eduardo Soria-Vazquez.
theory of cryptography conference (2016)

378 Citations

A Statistical Theory for Quantitative Association Rules

Yonatan Aumann;Yehuda Lindell.
intelligent information systems (2003)

367 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Yehuda Lindell

Jonathan Katz

Jonathan Katz

University of Maryland, College Park

Publications: 106

Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

Publications: 88

Thomas Schneider

Thomas Schneider

TU Darmstadt

Publications: 68

Yuval Ishai

Yuval Ishai

Technion – Israel Institute of Technology

Publications: 68

Rafael Pass

Rafael Pass

Cornell University

Publications: 61

Amit Sahai

Amit Sahai

University of California, Los Angeles

Publications: 57

Ran Canetti

Ran Canetti

Boston University

Publications: 49

Vipul Goyal

Vipul Goyal

Carnegie Mellon University

Publications: 48

Sanjam Garg

Sanjam Garg

University of California, Berkeley

Publications: 47

Ivan Damgård

Ivan Damgård

Aarhus University

Publications: 45

Vladimir Kolesnikov

Vladimir Kolesnikov

Georgia Institute of Technology

Publications: 42

David Pointcheval

David Pointcheval

École Normale Supérieure

Publications: 41

Jesper Buus Nielsen

Jesper Buus Nielsen

Aarhus University

Publications: 40

Ahmad-Reza Sadeghi

Ahmad-Reza Sadeghi

TU Darmstadt

Publications: 36

Benny Pinkas

Benny Pinkas

Bar-Ilan University

Publications: 34

Something went wrong. Please try again later.