D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 61 Citations 21,863 137 World Ranking 1472 National Ranking 28

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Algebra
  • Cryptography

Eyal Kushilevitz spends much of his time researching Theoretical computer science, Combinatorics, Communication complexity, Discrete mathematics and Secure multi-party computation. His Theoretical computer science study integrates concerns from other disciplines, such as Cryptographic protocol, Cryptographic primitive, Cryptography, Hash function and Locally decodable code. His Combinatorics research integrates issues from Function, Algorithm and Constant.

His Communication complexity study combines topics in areas such as Worst-case complexity and Private information retrieval. The various areas that Eyal Kushilevitz examines in his Worst-case complexity study include Multiparty communication, Pointer jumping, Function computation and Notation. His Discrete mathematics study typically links adjacent topics like Transmission protocol.

His most cited work include:

  • Communication Complexity (1886 citations)
  • Private information retrieval (1387 citations)
  • Private information retrieval (949 citations)

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

His primary scientific interests are in Discrete mathematics, Theoretical computer science, Combinatorics, Communication complexity and Secure multi-party computation. His Discrete mathematics research incorporates elements of Function, Upper and lower bounds and Constant. Eyal Kushilevitz interconnects Cryptographic protocol, Cryptographic hash function, Cryptography, Cryptographic primitive and Hash function in the investigation of issues within Theoretical computer science.

His Combinatorics study combines topics in areas such as Bounded function and Exponential function. The concepts of his Communication complexity study are interwoven with issues in Private information retrieval, Computational complexity theory, Worst-case complexity, Algorithmics and Structural complexity theory. He combines subjects such as Homomorphic encryption and Oblivious transfer with his study of Secure multi-party computation.

He most often published in these fields:

  • Discrete mathematics (40.43%)
  • Theoretical computer science (31.30%)
  • Combinatorics (27.83%)

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

  • Secure multi-party computation (22.61%)
  • Theoretical computer science (31.30%)
  • Discrete mathematics (40.43%)

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

Secure multi-party computation, Theoretical computer science, Discrete mathematics, Computer security and Function are his primary areas of study. His Theoretical computer science study integrates concerns from other disciplines, such as Strong cryptography, Cryptographic hash function, Cryptography, Low complexity and Financial cryptography. The Discrete mathematics study combines topics in areas such as Computation, Arbitrarily large, Decoding methods, One-way function and Linear code.

The study incorporates disciplines such as Random function, Boolean function and Communication complexity in addition to Function. His Communication complexity research incorporates themes from Multiplexing and Direct sum. His work is dedicated to discovering how Secure two-party computation, Commitment scheme are connected with Combinatorics and other disciplines.

Between 2013 and 2021, his most popular works were:

  • Private Large-Scale Databases with Distributed Searchable Symmetric Encryption (50 citations)
  • On the Cryptographic Complexity of the Worst Functions (38 citations)
  • Non-Interactive Secure Multiparty Computation (36 citations)

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

  • Algebra
  • Algorithm
  • Cryptography

His main research concerns Theoretical computer science, Secure multi-party computation, Secure two-party computation, Function and Combinatorics. His Theoretical computer science research is multidisciplinary, incorporating perspectives in Cryptographic hash function, Algorithm, Low complexity, Multilinear map and Cryptographic primitive. Eyal Kushilevitz has researched Secure multi-party computation in several fields, including Oblivious ram, Symmetric-key algorithm and Database.

In his work, Homomorphic encryption, Encryption, Oblivious transfer, Discrete mathematics and Security parameter is strongly intertwined with Constant, which is a subfield of Function. His work in the fields of Boolean circuit overlaps with other areas such as Range. His studies deal with areas such as Learning with errors, Exponential function, Bounded function and Arithmetic circuits as well as Combinatorics.

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.

Best Publications

Private information retrieval

B. Chor;O. Goldreich;E. Kushilevitz;M. Sudan.
foundations of computer science (1995)

2494 Citations

Communication Complexity

Eyal Kushilevitz;Noam Nisan.
(1996)

2371 Citations

Private information retrieval

Benny Chor;Eyal Kushilevitz;Oded Goldreich;Madhu Sudan.
Journal of the ACM (1998)

2040 Citations

Replication is not needed: single database, computationally-private information retrieval

E. Kushilevitz;R. Ostrovsky.
foundations of computer science (1997)

1075 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

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

Eyal Kushilevitz;Rafail Ostrovsky;Yuval Rabani.
SIAM Journal on Computing (2000)

638 Citations

Learning decision trees using the Fourier spectrum

Eyal Kushilevitz;Yishay Mansour.
SIAM Journal on Computing (1993)

530 Citations

An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

Eyal Kushilevitz;Yishay Mansour.
SIAM Journal on Computing (1998)

391 Citations

Public key encryption that allows PIR queries

Dan Boneh;Eyal Kushilevitz;Rafail Ostrovsky;Iii. William E. Skeith.
international cryptology conference (2007)

315 Citations

Cryptography in $NC^0$

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

294 Citations

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

Contact us

Best Scientists Citing Eyal Kushilevitz

Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

Publications: 108

Yuval Ishai

Yuval Ishai

Technion – Israel Institute of Technology

Publications: 99

Amit Sahai

Amit Sahai

University of California, Los Angeles

Publications: 75

Jonathan Katz

Jonathan Katz

University of Maryland, College Park

Publications: 59

Dariusz R. Kowalski

Dariusz R. Kowalski

Augusta University

Publications: 56

Ivan Damgård

Ivan Damgård

Aarhus University

Publications: 50

Yehuda Lindell

Yehuda Lindell

Bar-Ilan University

Publications: 50

Elaine Shi

Elaine Shi

Carnegie Mellon University

Publications: 46

David P. Woodruff

David P. Woodruff

Carnegie Mellon University

Publications: 46

Vinod Vaikuntanathan

Vinod Vaikuntanathan

MIT

Publications: 46

Andrzej Pelc

Andrzej Pelc

Université du Québec en Outaouais

Publications: 45

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 45

Tal Malkin

Tal Malkin

Columbia University

Publications: 44

Sennur Ulukus

Sennur Ulukus

University of Maryland, College Park

Publications: 43

Piotr Indyk

Piotr Indyk

MIT

Publications: 41

Amos Beimel

Amos Beimel

Ben-Gurion University of the Negev

Publications: 40

Trending Scientists

Steve Lawrence

Steve Lawrence

Google (United States)

Lyndon Kennedy

Lyndon Kennedy

Apple (United States)

Philippe Coussot

Philippe Coussot

Centre national de la recherche scientifique, CNRS

Ji-Feng Zhang

Ji-Feng Zhang

Chinese Academy of Sciences

Mika Torkkeli

Mika Torkkeli

University of Helsinki

Shuichi Matsumura

Shuichi Matsumura

Keio University

D. L. Robinson

D. L. Robinson

University of New England

Gregory C. Lanzaro

Gregory C. Lanzaro

University of California, Davis

Thomas Bataillon

Thomas Bataillon

Aarhus University

Nikki J. Holbrook

Nikki J. Holbrook

Yale University

Huilin Zhou

Huilin Zhou

University of California, San Diego

Claudio Babiloni

Claudio Babiloni

Sapienza University of Rome

Kevin G. Lynch

Kevin G. Lynch

University of Pennsylvania

Peter J. Rentfrow

Peter J. Rentfrow

University of Cambridge

C. Conrad Johnston

C. Conrad Johnston

Indiana University

David Doloreux

David Doloreux

HEC Montréal

Something went wrong. Please try again later.