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.
