H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 66 Citations 14,482 182 World Ranking 1088 National Ranking 16

Overview

What is he best known for?

The fields of study he is best known for:

  • Cryptography
  • Algebra
  • Algorithm

His primary areas of investigation include Theoretical computer science, Secure multi-party computation, Cryptography, Oblivious transfer and Function. His Communication complexity study, which is part of a larger body of work in Theoretical computer science, is frequently linked to Block, bridging the gap between disciplines. His Secure multi-party computation study integrates concerns from other disciplines, such as Discrete mathematics and Pseudorandom generator.

His work is dedicated to discovering how Cryptography, Adversary are connected with Secrecy and Random number generation and other disciplines. His studies in Oblivious transfer integrate themes in fields like Random oracle and Private information retrieval. His work deals with themes such as Integer and Combinatorics, which intersect with Function.

His most cited work include:

  • Private Circuits: Securing Hardware against Probing Attacks (596 citations)
  • Extending Oblivious Transfers Efficiently (424 citations)
  • Protecting data privacy in private information retrieval schemes (411 citations)

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

Yuval Ishai mostly deals with Theoretical computer science, Secure multi-party computation, Cryptography, Discrete mathematics and Oblivious transfer. His specific area of interest is Theoretical computer science, where Yuval Ishai studies Communication complexity. Yuval Ishai has included themes like Computational complexity theory, Sublinear function and Private information retrieval in his Communication complexity study.

His study of Secure two-party computation is a part of Secure multi-party computation. His research integrates issues of Boolean circuit and Computer network in his study of Cryptography. As a part of the same scientific study, Yuval Ishai usually deals with the Discrete mathematics, concentrating on Security parameter and frequently concerns with Finite field and Gas meter prover.

He most often published in these fields:

  • Theoretical computer science (50.34%)
  • Secure multi-party computation (48.99%)
  • Cryptography (31.76%)

What were the highlights of his more recent work (between 2018-2021)?

  • Secure multi-party computation (48.99%)
  • Theoretical computer science (50.34%)
  • Function (20.27%)

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

Secure multi-party computation, Theoretical computer science, Function, Cryptography and Oblivious transfer are his primary areas of study. He interconnects Boolean circuit, Overhead, Secret sharing, Zero-knowledge proof and Bounded function in the investigation of issues within Secure multi-party computation. His Theoretical computer science research is multidisciplinary, incorporating elements of Homomorphic secret sharing, Mathematical proof, Protocol and Encryption.

His Function research integrates issues from Discrete mathematics, Cryptanalysis, Key generation and Obfuscation. Yuval Ishai usually deals with Cryptography and limits it to topics linked to Computer network and Binary tree and Tree. Computation covers Yuval Ishai research in Oblivious transfer.

Between 2018 and 2021, his most popular works were:

  • Efficient Pseudorandom Correlation Generators: Silent OT Extension and More (20 citations)
  • Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation (18 citations)
  • Trapdoor Hash Functions and Their Applications (17 citations)

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

  • Algebra
  • Algorithm
  • Cryptography

Yuval Ishai spends much of his time researching Secure multi-party computation, Theoretical computer science, Cryptography, Oblivious transfer and Pseudorandom number generator. His research in Secure multi-party computation intersects with topics in Cryptographic primitive, Mathematical proof and Secret sharing. His Theoretical computer science research focuses on subjects like Protocol, which are linked to Code.

His Cryptography research includes elements of Boolean circuit, Boolean function, Overhead, Binary logarithm and Natural proof. His studies in Oblivious transfer integrate themes in fields like Matching, Simple and Pseudorandom function family. His Pseudorandom number generator research is multidisciplinary, incorporating perspectives in Function, Variety, Key exchange and Distribution.

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

Private Circuits: Securing Hardware against Probing Attacks

Yuval Ishai;Amit Sahai;David Wagner.
international cryptology conference (2003)

717 Citations

Protecting data privacy in private information retrieval schemes

Yael Gertner;Yuval Ishai;Eyal Kushilevitz;Tal Malkin.
symposium on the theory of computing (1998)

643 Citations

Extending Oblivious Transfers Efficiently

Yuval Ishai;Joe Kilian;Kobbi Nissim;Erez Petrank.
international cryptology conference (2003)

637 Citations

Priced Oblivious Transfer: How to Sell Digital Goods

William Aiello;Yuval Ishai;Omer Reingold.
theory and application of cryptographic techniques (2001)

476 Citations

Founding Cryptography on Oblivious Transfer --- Efficiently

Yuval Ishai;Manoj Prabhakaran;Amit Sahai.
international cryptology conference (2008)

397 Citations

Keyword search and oblivious pseudorandom functions

Michael J. Freedman;Yuval Ishai;Benny Pinkas;Omer Reingold.
theory of cryptography conference (2005)

380 Citations

Cryptography in $NC^0$

Benny Applebaum;Yuval Ishai;Eyal Kushilevitz.
SIAM Journal on Computing (2006)

294 Citations

Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval

A. Beimel;Y. Ishai;E. Kushilevitz;J.-F. Raymond.
foundations of computer science (2002)

293 Citations

Randomizing polynomials: A new representation with applications to round-efficient secure computation

Y. Ishai;E. Kushilevitz.
foundations of computer science (2000)

263 Citations

Zero-knowledge from secure multiparty computation

Yuval Ishai;Eyal Kushilevitz;Rafail Ostrovsky;Amit Sahai.
symposium on the theory of computing (2007)

244 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 Yuval Ishai

Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

Publications: 97

Jonathan Katz

Jonathan Katz

University of Maryland, College Park

Publications: 70

Amit Sahai

Amit Sahai

University of California, Los Angeles

Publications: 69

Vinod Vaikuntanathan

Vinod Vaikuntanathan

MIT

Publications: 63

Ivan Damgård

Ivan Damgård

Aarhus University

Publications: 61

Thomas Schneider

Thomas Schneider

TU Darmstadt

Publications: 56

Yehuda Lindell

Yehuda Lindell

Bar-Ilan University

Publications: 52

Daniel Wichs

Daniel Wichs

Northeastern University

Publications: 50

Yael Tauman Kalai

Yael Tauman Kalai

Microsoft (United States)

Publications: 49

Ran Canetti

Ran Canetti

Boston University

Publications: 48

Benny Pinkas

Benny Pinkas

Bar-Ilan University

Publications: 44

Jesper Buus Nielsen

Jesper Buus Nielsen

Aarhus University

Publications: 44

Hoeteck Wee

Hoeteck Wee

École Normale Supérieure

Publications: 39

Tal Malkin

Tal Malkin

Columbia University

Publications: 39

Sanjam Garg

Sanjam Garg

University of California, Berkeley

Publications: 38

Something went wrong. Please try again later.