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.
