Dispatching in perfectly-periodic schedules. - Zvika Brakerski; Vladimir Dreizin; Boaz Patt-Shamir (J. Algorithms, 2003)

General Perfectly Periodic Scheduling. - Zvika Brakerski; Aviv Nisgav; Boaz Patt-Shamir (Algorithmica, 2006)

Jitter-approximation tradeoff for periodic scheduling. - Zvika Brakerski; Boaz Patt-Shamir (Wirel. Networks, 2006)

Weak Verifiable Random Functions. - Zvika Brakerski; Shafi Goldwasser; Guy N. Rothblum; Vinod Vaikuntanathan (TCC, 2009)

From absolute distinguishability to positive distinguishability. - Zvika Brakerski; Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2009)

Black-Box Circular-Secure Encryption Beyond Affine Functions. - Zvika Brakerski; Shafi Goldwasser; Yael Tauman Kalai (IACR Cryptol. ePrint Arch., 2009)

Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back). - Zvika Brakerski; Shafi Goldwasser (IACR Cryptol. ePrint Arch., 2010)

A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model. - Zvika Brakerski; Yael Tauman Kalai (IACR Cryptol. ePrint Arch., 2010)

Overcoming the Hole In The Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage. - Zvika Brakerski; Yael Tauman Kalai; Jonathan Katz; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2010)

From Absolute Distinguishability to Positive Distinguishability. - Zvika Brakerski; Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages. - Zvika Brakerski; Vinod Vaikuntanathan (CRYPTO, 2011)

Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions. - Zvika Brakerski; Jonathan Katz; Gil Segev 001; Arkady Yerukhimovich (TCC, 2011)

Distributed discovery of large near-cliques. - Zvika Brakerski; Boaz Patt-Shamir (Distributed Comput., 2011)

Fully Homomorphic Encryption without Bootstrapping. - Zvika Brakerski; Craig Gentry; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2011)

Efficient Fully Homomorphic Encryption from (Standard) LWE. - Zvika Brakerski; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2011)

A Parallel Repetition Theorem for Leakage Resilience. - Zvika Brakerski; Yael Tauman Kalai (IACR Cryptol. ePrint Arch., 2011)

Efficient Interactive Coding Against Adversarial Noise. - Zvika Brakerski; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2012)

Hedged Public-key Encryption: How to Protect against Bad Randomness. - Mihir Bellare; Zvika Brakerski; Moni Naor; Thomas Ristenpart; Gil Segev 001; Hovav Shacham; Scott Yilek (IACR Cryptol. ePrint Arch., 2012)

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. - Zvika Brakerski (IACR Cryptol. ePrint Arch., 2012)

When Homomorphism Becomes a Liability. - Zvika Brakerski (IACR Cryptol. ePrint Arch., 2012)

Packed Ciphertexts in LWE-based Homomorphic Encryption. - Zvika Brakerski; Craig Gentry; Shai Halevi (IACR Cryptol. ePrint Arch., 2012)

Classical hardness of learning with errors. - Zvika Brakerski; Adeline Langlois; Chris Peikert; Oded Regev 001; Damien Stehlé (STOC, 2013)

Fast Algorithms for Interactive Coding. - Zvika Brakerski; Moni Naor (Electron. Colloquium Comput. Complex., 2013)

Black-Box Obfuscation for d-CNFs. - Zvika Brakerski; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2013)

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding. - Zvika Brakerski; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2013)

Lattice-Based FHE as Secure as PKE. - Zvika Brakerski; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2013)

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically. - Prabhanjan Ananth; Zvika Brakerski; Gil Segev 001; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2014)

Fast Interactive Coding against Adversarial Noise. - Zvika Brakerski; Yael Tauman Kalai; Moni Naor (J. ACM, 2014)

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. - Zvika Brakerski; Gil Segev 001 (J. Cryptol., 2014)

Efficient Fully Homomorphic Encryption from (Standard) $ mathsf{LWE}$. - Zvika Brakerski; Vinod Vaikuntanathan (SIAM J. Comput., 2014)

(Leveled) Fully Homomorphic Encryption without Bootstrapping. - Zvika Brakerski; Craig Gentry; Vinod Vaikuntanathan (ACM Trans. Comput. Theory, 2014)

From Selective to Adaptive Security in Functional Encryption. - Prabhanjan Ananth; Zvika Brakerski; Gil Segev 001; Vinod Vaikuntanathan (CRYPTO (2), 2015)

Cryptanalysis of the Quadratic Zero-Testing of GGH. - Zvika Brakerski; Craig Gentry; Shai Halevi; Tancrède Lepoint; Amit Sahai; Mehdi Tibouchi (IACR Cryptol. ePrint Arch., 2015)

From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting. - Zvika Brakerski; Ilan Komargodski; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2015)

Hierarchical Functional Encryption. - Zvika Brakerski; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2015)

Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions Or: How to Secretly Embed a Circuit in Your PRF. - Zvika Brakerski; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2015)

Obfuscating Conjunctions under Entropic Ring LWE. - Zvika Brakerski; Vinod Vaikuntanathan; Hoeteck Wee; Daniel Wichs (ITCS, 2016)

Non-Interactive RAM and Batch NP Delegation from any PIR. - Zvika Brakerski; Justin Holmgren; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2016)

3-Message Zero Knowledge Against Human Ignorance. - Nir Bitansky; Zvika Brakerski; Yael Tauman Kalai; Omer Paneth; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2016)

On Statistically Secure Obfuscation with Approximate Correctness. - Zvika Brakerski; Christina Brzuska; Nils Fleischhacker (IACR Cryptol. ePrint Arch., 2016)

Targeted Homomorphic Attribute Based Encryption. - Zvika Brakerski; David Cash; Rotem Tsabary; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2016)

Shorter Circuit Obfuscation in Challenging Security Models. - Zvika Brakerski; Or Dagmi (IACR Cryptol. ePrint Arch., 2016)

Lattice-Based Fully Dynamic Multi-Key FHE with Short Ciphertexts. - Zvika Brakerski; Renen Perlman (IACR Cryptol. ePrint Arch., 2016)

Circuit-ABE from LWE: Unbounded Attributes and Semi-Adaptive Security. - Zvika Brakerski; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2016)

Hierarchical Functional Encryption. - Zvika Brakerski; Nishanth Chandran; Vipul Goyal; Aayush Jain; Amit Sahai; Gil Segev 001 (ITCS, 2017)

Non-interactive delegation and batch NP verification from standard computational assumptions. - Zvika Brakerski; Justin Holmgren; Yael Tauman Kalai (STOC, 2017)

Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). - Boaz Barak; Zvika Brakerski; Ilan Komargodski; Pravesh Kothari (Electron. Colloquium Comput. Complex., 2017)

FHE Over the Integers: Decomposed and Batched in the Post-Quantum Regime. - Daniel Benarroch; Zvika Brakerski; Tancrède Lepoint (IACR Cryptol. ePrint Arch., 2017)

Four Round Secure Computation without Setup. - Zvika Brakerski; Shai Halevi; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2017)

Non-Trivial Witness Encryption and Null-iO from Standard Assumptions. - Zvika Brakerski; Aayush Jain; Ilan Komargodski; Alain Passelègue; Daniel Wichs (IACR Cryptol. ePrint Arch., 2017)

Succinct Spooky Free Compilers Are Not Black Box Sound. - Zvika Brakerski; Yael Tauman Kalai; Renen Perlman (IACR Cryptol. ePrint Arch., 2017)

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. - Zvika Brakerski; Alex Lombardi; Gil Segev 001; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2017)

Private Constrained PRFs (and More) from LWE. - Zvika Brakerski; Rotem Tsabary; Vinod Vaikuntanathan; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2017)

Obfuscating Conjunctions. - Zvika Brakerski; Guy N. Rothblum (J. Cryptol., 2017)

Brief Announcement: Zero-Knowledge Protocols for Search Problems. - Ben Berger; Zvika Brakerski (ICALP, 2018)

Learning with Errors and Extrapolated Dihedral Cosets. - Zvika Brakerski; Elena Kirshanova; Damien Stehlé; Weiqiang Wen (Public Key Cryptography (2), 2018)

Two-Message Statistically Sender-Private OT from LWE. - Zvika Brakerski; Nico Döttling (TCC (2), 2018)

Certifiable Randomness from a Single Quantum Device. - Zvika Brakerski; Paul F. Christiano; Urmila Mahadev; Umesh V. Vazirani; Thomas Vidick (CoRR, 2018)

Fundamentals of Fully Homomorphic Encryption - A Survey. - Zvika Brakerski (Electron. Colloquium Comput. Complex., 2018)

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. - Zvika Brakerski; Vadim Lyubashevsky; Vinod Vaikuntanathan; Daniel Wichs (Electron. Colloquium Comput. Complex., 2018)

Zero-Knowledge Protocols for Search Problems. - Ben Berger; Zvika Brakerski (IACR Cryptol. ePrint Arch., 2018)

Quantum FHE (Almost) As Secure as Classical. - Zvika Brakerski (IACR Cryptol. ePrint Arch., 2018)

Two-Message Statistical Sender-Private OT from LWE. - Zvika Brakerski; Nico Döttling (IACR Cryptol. ePrint Arch., 2018)

Monotone Batch NP-Delegation with Applications to Access Control. - Zvika Brakerski; Yael Tauman Kalai (IACR Cryptol. ePrint Arch., 2018)

Order-LWE and the Hardness of Ring-LWE with Entropic Secrets. - Zvika Brakerski; Renen Perlman (IACR Cryptol. ePrint Arch., 2018)

Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. - Zvika Brakerski; Ilan Komargodski; Gil Segev 001 (J. Cryptol., 2018)

Function-Private Functional Encryption in the Private-Key Setting. - Zvika Brakerski; Gil Segev 001 (J. Cryptol., 2018)

Fundamentals of fully homomorphic encryption. - Zvika Brakerski (Providing Sound Foundations for Cryptography, 2019)

Order-LWE and the Hardness of Ring-LWE with Entropic Secrets. - Madalina Bolboceanu; Zvika Brakerski; Renen Perlman; Devika Sharma (ASIACRYPT (2), 2019)

(Pseudo) Random Quantum States with Binary Phase. - Zvika Brakerski; Omri Shmueli (TCC (1), 2019)

On Quantum Advantage in Information Theoretic Single-Server PIR. - Dorit Aharonov; Zvika Brakerski; Kai-Min Chung; Ayal Green; Ching-Yi Lai; Or Sattath (IACR Cryptol. ePrint Arch., 2019)

Degree 2 is Complete for the Round-Complexity of Malicious MPC. - Benny Applebaum; Zvika Brakerski; Rotem Tsabary (IACR Cryptol. ePrint Arch., 2019)

Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles. - Zvika Brakerski; Nico Döttling; Sanjam Garg; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2019)

Scalable Pseudorandom Quantum States. - Zvika Brakerski; Omri Shmueli (CRYPTO (2), 2020)

Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control. - Zvika Brakerski; Yael Kalai (Public Key Cryptography (2), 2020)

Simpler Proofs of Quantumness. - Zvika Brakerski; Venkata Koppula; Umesh V. Vazirani; Thomas Vidick (TQC, 2020)

Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes. - Zvika Brakerski; Yael Tauman Kalai; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2020)

Separating Two-Round Secure Computation from Oblivious Transfer. - Benny Applebaum; Zvika Brakerski; Sanjam Garg; Yuval Ishai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2020)

Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions. - Zvika Brakerski; Pedro Branco 005; Nico Döttling; Sanjam Garg; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2020)

Hardness of LWE on General Entropic Distributions. - Zvika Brakerski; Nico Döttling (IACR Cryptol. ePrint Arch., 2020)

Lossiness and Entropic Hardness for Ring-LWE. - Zvika Brakerski; Nico Döttling (IACR Cryptol. ePrint Arch., 2020)

Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices. - Zvika Brakerski; Nico Döttling; Sanjam Garg; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2020)

FHE-Based Bootstrapping of Designated-Prover NIZK. - Zvika Brakerski; Sanjam Garg; Rotem Tsabary (IACR Cryptol. ePrint Arch., 2020)

NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations. - Zvika Brakerski; Venkata Koppula; Tamer Mour (IACR Cryptol. ePrint Arch., 2020)

Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE. - Zvika Brakerski; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2020)

Quantum Garbled Circuits. - Zvika Brakerski; Henry Yuen (IACR Cryptol. ePrint Arch., 2020)

On the Hardness of Average-Case k-SUM. - Zvika Brakerski; Noah Stephens-Davidowitz; Vinod Vaikuntanathan (APPROX-RANDOM, 2021)

Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits. - Gorjan Alagic; Zvika Brakerski; Yfke Dulek; Christian Schaffner (CRYPTO (1), 2021)

Unitary Subgroup Testing. - Zvika Brakerski; Devika Sharma; Guy Weissenberg (CoRR, 2021)

Classical Binding for Quantum Commitments. - Nir Bitansky; Zvika Brakerski (IACR Cryptol. ePrint Arch., 2021)

On Algebraic Embedding for Unstructured Lattices. - Madalina Bolboceanu; Zvika Brakerski; Devika Sharma (IACR Cryptol. ePrint Arch., 2021)

A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. - Zvika Brakerski; Paul F. Christiano; Urmila Mahadev; Umesh V. Vazirani; Thomas Vidick (J. ACM, 2021)

Obfuscating Circuits Via Composite-Order Graded Encoding. - Benny Applebaum; Zvika Brakerski (J. Cryptol., 2021)

Perfect Secure Computation in Two Rounds. - Benny Applebaum; Zvika Brakerski; Rotem Tsabary (SIAM J. Comput., 2021)

Constructive Post-Quantum Reductions. - Nir Bitansky; Zvika Brakerski; Yael Tauman Kalai (IACR Cryptol. ePrint Arch., 2022)

Batch-OT with Optimal Rate. - Zvika Brakerski; Pedro Branco 005; Nico Döttling; Sihang Pu (IACR Cryptol. ePrint Arch., 2022)

On the computational hardness needed for quantum cryptography. - Zvika Brakerski; Ran Canetti; Luowen Qian (IACR Cryptol. ePrint Arch., 2022)

Black-Hole Radiation Decoding Is Quantum Cryptography. - Zvika Brakerski (CRYPTO (5), 2023)

Simple Tests of Quantumness Also Certify Qubits. - Zvika Brakerski; Alexandru Gheorghiu; Gregory D. Kahanamoku-Meyer; Eitan Porat; Thomas Vidick (CRYPTO (5), 2023)

Lattice Problems beyond Polynomial Time. - Divesh Aggarwal; Huck Bennett; Zvika Brakerski; Alexander Golovnev; Rajendra Kumar 002; Zeyong Li; Spencer Peters; Noah Stephens-Davidowitz; Vinod Vaikuntanathan (STOC, 2023)

Pseudorandomness with Proof of Destruction and Applications. - Amit Behera; Zvika Brakerski; Or Sattath; Omri Shmueli (IACR Cryptol. ePrint Arch., 2023)

SNARGs for Monotone Policy Batch NP. - Zvika Brakerski; Maya Farber Brodsky; Yael Tauman Kalai; Alex Lombardi; Omer Paneth (IACR Cryptol. ePrint Arch., 2023)

Limits on Adaptive Security for Attribute-Based Encryption. - Zvika Brakerski; Stav Medina (IACR Cryptol. ePrint Arch., 2023)

Candidate iO from Homomorphic Encryption Schemes. - Zvika Brakerski; Nico Döttling; Sanjam Garg; Giulio Malavolta (J. Cryptol., 2023)

Quantum State Obfuscation from Classical Oracles. - James Bartusek; Zvika Brakerski; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2024)

Real-Valued Somewhat-Pseudorandom Unitaries. - Zvika Brakerski; Nir Magrafta (IACR Cryptol. ePrint Arch., 2024)

REFHE: Fully Homomorphic ALU. - Zvika Brakerski; Offir Friedman; Daniel Golan; Alon Gurny; Dolev Mutzari; Ohad Sheinfeld (IACR Cryptol. ePrint Arch., 2025)

Threshold FHE with Efficient Asynchronous Decryption. - Zvika Brakerski; Offir Friedman; Avichai Marmor; Dolev Mutzari; Yuval Spiizer; Ni Trieu (IACR Cryptol. ePrint Arch., 2025)

State-Based Classical Shadows. - Zvika Brakerski; Nir Magrafta; Tomer Solomon (IACR Cryptol. ePrint Arch., 2025)

On the Importance of Error Mitigation for Quantum Computation. - Dorit Aharonov; Ori Alberton; Itai Arad; Yosi Atia; Eyal Bairey; Zvika Brakerski; Itsik Cohen; Omri Golan; Ilya Gurwich; Oded Kenneth; Eyal Leviatan; Netanel H. Lindner; et al. (CoRR, 2025)