Zvika Brakerski

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 129

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

TCC (1)

ITCS

Publications

James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan
Quantum State Obfuscation from Classical Oracles. STOC (2024)
Zvika Brakerski, Nir Magrafta
Real-Valued Somewhat-Pseudorandom Unitaries. CoRR (2024)
Madalina Bolboceanu, Zvika Brakerski, Devika Sharma
On Algebraic Embedding for Unstructured Lattices. Public Key Cryptography (3) (2024)
Zvika Brakerski, Nir Magrafta
Real-Valued Somewhat-Pseudorandom Unitaries. IACR Cryptol. ePrint Arch. 2024 (2024)
James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan
Quantum State Obfuscation from Classical Oracles. CoRR (2024)
James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan
Quantum State Obfuscation from Classical Oracles. IACR Cryptol. ePrint Arch. 2024 (2024)
Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth
SNARGs for Monotone Policy Batch NP. CRYPTO (2) (2023)
Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta
Candidate iO from Homomorphic Encryption Schemes. J. Cryptol. 36 (3) (2023)
Zvika Brakerski, Stav Medina
Limits on Adaptive Security for Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2023 (2023)
Amit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli
Pseudorandomness with Proof of Destruction and Applications. IACR Cryptol. ePrint Arch. 2023 (2023)
Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth
SNARGs for Monotone Policy Batch NP. IACR Cryptol. ePrint Arch. 2023 (2023)
Zvika Brakerski, Ran Canetti, Luowen Qian
On the Computational Hardness Needed for Quantum Cryptography. ITCS (2023)
Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
Lattice Problems beyond Polynomial Time. STOC (2023)
Amit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli
Pseudorandomness with Proof of Destruction and Applications. TCC (4) (2023)
Zvika Brakerski, Vinod Vaikuntanathan
Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE. ITCS (2022)
Zvika Brakerski
Black-Hole Radiation Decoding is Quantum Cryptography. CoRR (2022)
Zvika Brakerski, Pedro Branco, Nico Döttling, Sihang Pu
Batch-OT with Optimal Rate. EUROCRYPT (2) (2022)
Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
Lattice Problems Beyond Polynomial Time. CoRR (2022)
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai
Constructive Post-Quantum Reductions. IACR Cryptol. ePrint Arch. 2022 (2022)
Zvika Brakerski, Pedro Branco, Nico Döttling, Sihang Pu
Batch-OT with Optimal Rate. IACR Cryptol. ePrint Arch. 2022 (2022)
Zvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick
Simple Tests of Quantumness Also Certify Qubits. CRYPTO (5) (2022)
Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta
Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices. ICALP (2022)
Zvika Brakerski, Ran Canetti, Luowen Qian
On the computational hardness needed for quantum cryptography. IACR Cryptol. ePrint Arch. 2022 (2022)
Zvika Brakerski, Ran Canetti, Luowen Qian
On the computational hardness needed for quantum cryptography. CoRR (2022)
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai
Constructive Post-Quantum Reductions. CRYPTO (3) (2022)
Zvika Brakerski
Black-Hole Radiation Decoding Is Quantum Cryptography. CRYPTO (5) (2022)
Zvika Brakerski, Henry Yuen
Quantum garbled circuits. STOC (2022)
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai
Constructive Post-Quantum Reductions. CoRR (2022)
Zvika Brakerski, Paul F. Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. J. ACM 68 (5) (2021)
Benny Applebaum, Zvika Brakerski
Obfuscating Circuits Via Composite-Order Graded Encoding. J. Cryptol. 34 (2) (2021)
Madalina Bolboceanu, Zvika Brakerski, Devika Sharma
On Algebraic Embedding for Unstructured Lattices. IACR Cryptol. ePrint Arch. 2021 (2021)
Zvika Brakerski, Devika Sharma, Guy Weissenberg
Unitary Subgroup Testing. CoRR (2021)
Nir Bitansky, Zvika Brakerski
Classical Binding for Quantum Commitments. TCC (1) (2021)
Nir Bitansky, Zvika Brakerski
Classical Binding for Quantum Commitments. IACR Cryptol. ePrint Arch. 2021 (2021)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Perfect Secure Computation in Two Rounds. SIAM J. Comput. 50 (1) (2021)
Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
On the Hardness of Average-Case k-SUM. APPROX-RANDOM (2021)
Gorjan Alagic, Zvika Brakerski, Yfke Dulek, Christian Schaffner
Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits. CRYPTO (1) (2021)
Zvika Brakerski, Nico Döttling
Hardness of LWE on General Entropic Distributions. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Venkata Koppula, Umesh V. Vazirani, Thomas Vidick
Simpler Proofs of Quantumness. TQC (2020)
Zvika Brakerski, Yael Kalai
Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control. Public Key Cryptography (2) (2020)
Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
On the Hardness of Average-case k-SUM. CoRR (2020)
Zvika Brakerski, Yael Tauman Kalai, Raghuvansh Saxena
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes. Electron. Colloquium Comput. Complex. 27 (2020)
Zvika Brakerski, Nico Döttling
Hardness of LWE on General Entropic Distributions. EUROCRYPT (2) (2020)
Zvika Brakerski, Pedro Branco, Nico Döttling, Sanjam Garg, Giulio Malavolta
Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions. TCC (1) (2020)
Zvika Brakerski, Nico Döttling
Lossiness and Entropic Hardness for Ring-LWE. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Vinod Vaikuntanathan
Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Nico Döttling
Lossiness and Entropic Hardness for Ring-LWE. TCC (1) (2020)
Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Separating Two-Round Secure Computation from Oblivious Transfer. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Omri Shmueli
Scalable Pseudorandom Quantum States. CoRR (2020)
Zvika Brakerski, Omri Shmueli
Scalable Pseudorandom Quantum States. CRYPTO (2) (2020)
Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta
Candidate iO from Homomorphic Encryption Schemes. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Venkata Koppula, Tamer Mour
NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Pedro Branco, Nico Döttling, Sanjam Garg, Giulio Malavolta
Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta
Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta
Candidate iO from Homomorphic Encryption Schemes. EUROCRYPT (1) (2020)
Zvika Brakerski, Sanjam Garg, Rotem Tsabary
FHE-Based Bootstrapping of Designated-Prover NIZK. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Henry Yuen
Quantum Garbled Circuits. IACR Cryptol. ePrint Arch. 2020 (2020)
Zvika Brakerski, Sanjam Garg, Rotem Tsabary
FHE-Based Bootstrapping of Designated-Prover NIZK. TCC (1) (2020)
Zvika Brakerski, Venkata Koppula, Tamer Mour
NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations. CRYPTO (3) (2020)
Gorjan Alagic, Zvika Brakerski, Yfke Dulek, Christian Schaffner
Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits. CoRR (2020)
Zvika Brakerski, Venkata Koppula, Umesh V. Vazirani, Thomas Vidick
Simpler Proofs of Quantumness. CoRR (2020)
Zvika Brakerski, Henry Yuen
Quantum Garbled Circuits. CoRR (2020)
Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Separating Two-Round Secure Computation From Oblivious Transfer. ITCS (2020)
Zvika Brakerski, Yael Tauman Kalai, Raghuvansh R. Saxena
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes. FOCS (2020)
Dorit Aharonov, Zvika Brakerski, Kai-Min Chung, Ayal Green, Ching-Yi Lai, Or Sattath
On Quantum Advantage in Information Theoretic Single-Server PIR. CoRR (2019)
Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles. TCC (2) (2019)
Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles. IACR Cryptol. ePrint Arch. 2019 (2019)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Degree 2 is Complete for the Round-Complexity of Malicious MPC. EUROCRYPT (2) (2019)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Degree 2 is Complete for the Round-Complexity of Malicious MPC. IACR Cryptol. ePrint Arch. 2019 (2019)
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. EUROCRYPT (3) (2019)
Dorit Aharonov, Zvika Brakerski, Kai-Min Chung, Ayal Green, Ching-Yi Lai, Or Sattath
On Quantum Advantage in Information Theoretic Single-Server PIR. EUROCRYPT (3) (2019)
Zvika Brakerski, Omri Shmueli
(Pseudo) Random Quantum States with Binary Phase. TCC (1) (2019)
Madalina Bolboceanu, Zvika Brakerski, Renen Perlman, Devika Sharma
Order-LWE and the Hardness of Ring-LWE with Entropic Secrets. ASIACRYPT (2) (2019)
Dorit Aharonov, Zvika Brakerski, Kai-Min Chung, Ayal Green, Ching-Yi Lai, Or Sattath
On Quantum Advantage in Information Theoretic Single-Server PIR. IACR Cryptol. ePrint Arch. 2019 (2019)
Zvika Brakerski, Omri Shmueli
(Pseudo) Random Quantum States with Binary Phase. CoRR (2019)
Zvika Brakerski, Paul F. Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick
Certifiable Randomness from a Single Quantum Device. CoRR (2018)
Ben Berger, Zvika Brakerski
Zero-Knowledge Protocols for Search Problems. SCN (2018)
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. IACR Cryptol. ePrint Arch. 2018 (2018)
Ben Berger, Zvika Brakerski
Zero-Knowledge Protocols for Search Problems. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Yael Tauman Kalai
Monotone Batch NP-Delegation with Applications to Access Control. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Renen Perlman
Order-LWE and the Hardness of Ring-LWE with Entropic Secrets. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Nico Döttling
Two-Message Statistical Sender-Private OT from LWE. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. EUROCRYPT (1) (2018)
Zvika Brakerski, Paul F. Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. FOCS (2018)
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. Electron. Colloquium Comput. Complex. 25 (2018)
Zvika Brakerski
Fundamentals of Fully Homomorphic Encryption - A Survey. Electron. Colloquium Comput. Complex. 25 (2018)
Zvika Brakerski
Quantum FHE (Almost) As Secure As Classical. CRYPTO (3) (2018)
Zvika Brakerski
Quantum FHE (Almost) As Secure as Classical. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Elena Kirshanova, Damien Stehlé, Weiqiang Wen
Learning with Errors and Extrapolated Dihedral Cosets. Public Key Cryptography (2) (2018)
Zvika Brakerski, Gil Segev
Function-Private Functional Encryption in the Private-Key Setting. J. Cryptol. 31 (1) (2018)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Perfect Secure Computation in Two Rounds. TCC (1) (2018)
Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). EUROCRYPT (2) (2018)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Perfect Secure Computation in Two Rounds. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs
Non-trivial Witness Encryption and Null-iO from Standard Assumptions. SCN (2018)
Zvika Brakerski, Ilan Komargodski, Gil Segev
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. J. Cryptol. 31 (2) (2018)
Zvika Brakerski, Nico Döttling
Two-Message Statistically Sender-Private OT from LWE. TCC (2) (2018)
Ben Berger, Zvika Brakerski
Brief Announcement: Zero-Knowledge Protocols for Search Problems. ICALP (2018)
Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). IACR Cryptol. ePrint Arch. 2017 (2017)
Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou
Four Round Secure Computation without Setup. IACR Cryptol. ePrint Arch. 2017 (2017)
Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou
Four Round Secure Computation Without Setup. TCC (1) (2017)

Zvika Brakerski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Zvika Brakerski