What is he best known for?
The fields of study he is best known for:
- Algebra
- Cryptography
- Algorithm
Zvika Brakerski focuses on Homomorphic encryption, Encryption, Public-key cryptography, Learning with errors and Discrete mathematics.
His Homomorphic encryption research includes themes of Ciphertext, Security parameter, Lattice, Probabilistic encryption and Homomorphic secret sharing.
His Encryption study is concerned with Computer security in general.
The study incorporates disciplines such as Theoretical computer science and Cryptography in addition to Public-key cryptography.
He interconnects Cryptographic protocol, Communication complexity and Cipher in the investigation of issues within Learning with errors.
In his work, Dimension and Combinatorics is strongly intertwined with Lattice problem, which is a subfield of Discrete mathematics.
His most cited work include:
- Efficient Fully Homomorphic Encryption from (Standard) LWE (1047 citations)
- Leveled) fully homomorphic encryption without bootstrapping (959 citations)
- Fully homomorphic encryption from ring-LWE and security for key dependent messages (751 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Theoretical computer science, Encryption, Discrete mathematics, Homomorphic encryption and Learning with errors.
Zvika Brakerski interconnects Obfuscation, Bounded function, Protocol, Function and Key in the investigation of issues within Theoretical computer science.
His Encryption study is related to the wider topic of Computer security.
Zvika Brakerski focuses mostly in the field of Discrete mathematics, narrowing it down to topics relating to Pseudorandom number generator and, in certain cases, Topology.
His Homomorphic encryption research also works with subjects such as
- Security parameter which connect with Communication complexity,
- Computation together with Bootstrapping.
Within one scientific family, Zvika Brakerski focuses on topics pertaining to Reduction under Learning with errors, and may sometimes address concerns connected to Private information retrieval.
He most often published in these fields:
- Theoretical computer science (39.87%)
- Encryption (35.44%)
- Discrete mathematics (29.11%)
What were the highlights of his more recent work (between 2018-2021)?
- Theoretical computer science (39.87%)
- Discrete mathematics (29.11%)
- Homomorphic encryption (25.95%)
In recent papers he was focusing on the following fields of study:
Zvika Brakerski mainly focuses on Theoretical computer science, Discrete mathematics, Homomorphic encryption, Learning with errors and Encryption.
His research in Theoretical computer science intersects with topics in Obfuscation, Tree, Construct, Function and Secure multi-party computation.
His Discrete mathematics research integrates issues from Hash function, Correlation and Pseudorandom function family.
His work deals with themes such as Upper and lower bounds, Server and Communication complexity, which intersect with Homomorphic encryption.
His Learning with errors study is concerned with the field of Cryptography as a whole.
His work carried out in the field of Encryption brings together such families of science as Record locking and Computer hardware.
Between 2018 and 2021, his most popular works were:
- Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles (14 citations)
- Order-LWE and the Hardness of Ring-LWE with Entropic Secrets (13 citations)
- Candidate iO from Homomorphic Encryption Schemes (8 citations)
In his most recent research, the most cited papers focused on:
- Algebra
- Cryptography
- Algorithm
His scientific interests lie mostly in Discrete mathematics, Learning with errors, Theoretical computer science, Cryptography and Quantum computer.
His Discrete mathematics research includes themes of Ball and Distribution.
The concepts of his Learning with errors study are interwoven with issues in Lattice problem, Cryptographic hash function, Decoding methods and Symmetric-key algorithm.
His Theoretical computer science study integrates concerns from other disciplines, such as Obfuscation and Private information retrieval.
Zvika Brakerski has included themes like Function, Random oracle and Mathematical proof in his Cryptography study.
His Pseudorandom number generator research is multidisciplinary, incorporating elements of Secure multi-party computation, Computation and Security parameter.
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.
