2026 Zvika Brakerski: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	45	7004	6801	113	107	130	15754

Overview

Zvika Brakerski is a researcher affiliated with the Weizmann Institute of Science in Israel, with a primary focus on computer science. Their work spans several subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Information Systems, and Statistics and Probability.

The main topics of their research include:

Cryptography and Data Security
Complexity and Algorithms in Graphs
Quantum Computing Algorithms and Architecture
Cryptographic Implementations and Security
Privacy-Preserving Technologies in Data
Quantum Information and Cryptography
Chaos-based Image/Signal Encryption

Zvika Brakerski has contributed extensively to the literature, with key publications across respected venues such as the Leibniz-Zentrum für Informatik (Schloss Dagstuhl), Journal of Cryptology, and arXiv. Notable recent papers include:

"Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices," 2023, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE," 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"On the Computational Hardness Needed for Quantum Cryptography," 2023, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Candidate iO from Homomorphic Encryption Schemes," 2023, Journal of Cryptology
"Simpler Proofs of Quantumness," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Their publication record includes a total of over 100 works primarily in computer science, with frequent contributions to venues such as:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Lecture Notes in Computer Science
Journal of Cryptology
Journal of the ACM

Zvika Brakerski frequently collaborates with researchers including Nico Döttling, Sanjam Garg, Giulio Malavolta, Thomas Vidick, and Yael Tauman Kalai. These repeated collaborations indicate participation in complex interdisciplinary projects within cryptographic and computational theory domains.

Best Publications

Leveled) fully homomorphic encryption without bootstrapping

Zvika Brakerski;Craig Gentry;Vinod Vaikuntanathan

2168
Citations
Efficient Fully Homomorphic Encryption from (Standard) LWE

Zvika Brakerski;Vinod Vaikuntanathan

2033
Citations
Leveled) Fully Homomorphic Encryption without Bootstrapping

Zvika Brakerski;Craig Gentry;Vinod Vaikuntanathan

1438
Citations
Fully homomorphic encryption from ring-LWE and security for key dependent messages

Zvika Brakerski;Vinod Vaikuntanathan

1429
Citations
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

Zvika Brakerski

1421
Citations
Classical hardness of learning with errors

Zvika Brakerski;Adeline Langlois;Chris Peikert;Oded Regev

779
Citations
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$

Zvika Brakerski;Vinod Vaikuntanathan

513
Citations
Fully Homomorphic Encryption without Bootstrapping.

Zvika Brakerski;Craig Gentry;Vinod Vaikuntanathan

461
Citations
Lattice-based FHE as secure as PKE

Zvika Brakerski;Vinod Vaikuntanathan

378
Citations
Overcoming the Hole In The Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage.

Zvika Brakerski;Yael Tauman Kalai;Jonathan Katz;Vinod Vaikuntanathan

314
Citations
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

Zvika Brakerski;Guy N. Rothblum

278
Citations
Packed Ciphertexts in LWE-Based Homomorphic Encryption

Zvika Brakerski;Craig Gentry;Shai Halevi

271
Citations
Circular and leakage resilient public-key encryption under subgroup indistinguishability

Zvika Brakerski;Shafi Goldwasser

218
Citations
Lattice-Based Fully Dynamic Multi-Key FHE with Short Ciphertexts.

Zvika Brakerski;Renen Perlman

184
Citations
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back).

Zvika Brakerski;Shafi Goldwasser

181
Citations
Hedged Public-key Encryption: How to Protect against Bad Randomness.

Mihir Bellare;Zvika Brakerski;Moni Naor;Thomas Ristenpart

164
Citations
From Selective to Adaptive Security in Functional Encryption

Prabhanjan Ananth;Zvika Brakerski;Gil Segev;Vinod Vaikuntanathan

152
Citations
Better security for deterministic public-key encryption: the auxiliary-input setting

Zvika Brakerski;Gil Segev

122
Citations
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions

Zvika Brakerski;Vinod Vaikuntanathan

120
Citations
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions

Zvika Brakerski;Alex Lombardi;Gil Segev;Vinod Vaikuntanathan

115
Citations
Obfuscating Circuits via Composite-Order Graded Encoding

Benny Applebaum;Zvika Brakerski

110
Citations

Frequent Co-Authors

Vinod Vaikuntanathan MIT

Gil Segev Hebrew University of Jerusalem

Yael Tauman Kalai MIT

Sanjam Garg University of California, Berkeley

Boaz Patt-Shamir Tel Aviv University

Shafi Goldwasser University of California, Berkeley

Craig Gentry TripleBlind

Daniel Wichs Northeastern University

Shai Halevi Amazon (United States)

Guy N. Rothblum Weizmann Institute of Science

External Links

Personal website of Zvika Brakerski Google Scholar page

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

Related Online Degrees & Career Pathways

Expanding your education beyond computer science can open doors to a wide range of tech-focused careers. Today’s online degrees offer convenience and flexibility, whether you’re looking for the fastest computer science degree to quickly start your career, or you’re seeking specialized knowledge in another discipline.

Engineering fields are growing rapidly, with online options such as the cheapest online environmental science degree and cheapest online master's mechanical engineering making these areas more accessible than ever. These programs can help you tap into sustainable technologies, research, or industry innovations.

For those interested in the fundamental principles behind tech, an online physics degree provides valuable analytical and problem-solving skills. As you consider online study, look for programs that are accredited, affordable, and aligned with your career goals. With so many diverse pathways, you can tailor your education to your interests and the evolving demands of the tech industry.