Zvika Brakerski

Orcid: 0000-0002-4867-7999

According to our database1, Zvika Brakerski authored at least 106 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Real-Valued Somewhat-Pseudorandom Unitaries.
IACR Cryptol. ePrint Arch., 2024

Quantum State Obfuscation from Classical Oracles.
IACR Cryptol. ePrint Arch., 2024

2023
Candidate iO from Homomorphic Encryption Schemes.
J. Cryptol., July, 2023

Limits on Adaptive Security for Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2023

SNARGs for Monotone Policy Batch NP.
IACR Cryptol. ePrint Arch., 2023

Pseudorandomness with Proof of Destruction and Applications.
IACR Cryptol. ePrint Arch., 2023

Lattice Problems beyond Polynomial Time.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Simple Tests of Quantumness Also Certify Qubits.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Black-Hole Radiation Decoding Is Quantum Cryptography.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
On the computational hardness needed for quantum cryptography.
IACR Cryptol. ePrint Arch., 2022

Batch-OT with Optimal Rate.
IACR Cryptol. ePrint Arch., 2022

Constructive Post-Quantum Reductions.
IACR Cryptol. ePrint Arch., 2022

2021
Obfuscating Circuits Via Composite-Order Graded Encoding.
J. Cryptol., 2021

A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device.
J. ACM, 2021

On Algebraic Embedding for Unstructured Lattices.
IACR Cryptol. ePrint Arch., 2021

Classical Binding for Quantum Commitments.
IACR Cryptol. ePrint Arch., 2021

Unitary Subgroup Testing.
CoRR, 2021

Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

On the Hardness of Average-Case k-SUM.
Proceedings of the Approximation, 2021

2020
Quantum Garbled Circuits.
IACR Cryptol. ePrint Arch., 2020

Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE.
IACR Cryptol. ePrint Arch., 2020

NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations.
IACR Cryptol. ePrint Arch., 2020

FHE-Based Bootstrapping of Designated-Prover NIZK.
IACR Cryptol. ePrint Arch., 2020

Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices.
IACR Cryptol. ePrint Arch., 2020

Lossiness and Entropic Hardness for Ring-LWE.
IACR Cryptol. ePrint Arch., 2020

Hardness of LWE on General Entropic Distributions.
IACR Cryptol. ePrint Arch., 2020

Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2020

Separating Two-Round Secure Computation from Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2020

Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes.
Electron. Colloquium Comput. Complex., 2020

Simpler Proofs of Quantumness.
Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Scalable Pseudorandom Quantum States.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 2019

Degree 2 is Complete for the Round-Complexity of Malicious MPC.
IACR Cryptol. ePrint Arch., 2019

On Quantum Advantage in Information Theoretic Single-Server PIR.
IACR Cryptol. ePrint Arch., 2019

(Pseudo) Random Quantum States with Binary Phase.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Order-LWE and the Hardness of Ring-LWE with Entropic Secrets.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

Fundamentals of fully homomorphic encryption.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018
Function-Private Functional Encryption in the Private-Key Setting.
J. Cryptol., 2018

Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions.
J. Cryptol., 2018

Order-LWE and the Hardness of Ring-LWE with Entropic Secrets.
IACR Cryptol. ePrint Arch., 2018

Monotone Batch NP-Delegation with Applications to Access Control.
IACR Cryptol. ePrint Arch., 2018

Two-Message Statistical Sender-Private OT from LWE.
IACR Cryptol. ePrint Arch., 2018

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

Zero-Knowledge Protocols for Search Problems.
IACR Cryptol. ePrint Arch., 2018

Perfect Secure Computation in Two Rounds.
IACR Cryptol. ePrint Arch., 2018

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing.
Electron. Colloquium Comput. Complex., 2018

Fundamentals of Fully Homomorphic Encryption - A Survey.
Electron. Colloquium Comput. Complex., 2018

Certifiable Randomness from a Single Quantum Device.
CoRR, 2018

Two-Message Statistically Sender-Private OT from LWE.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Learning with Errors and Extrapolated Dihedral Cosets.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Brief Announcement: Zero-Knowledge Protocols for Search Problems.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Obfuscating Conjunctions.
J. Cryptol., 2017

Private Constrained PRFs (and More) from LWE.
IACR Cryptol. ePrint Arch., 2017

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions.
IACR Cryptol. ePrint Arch., 2017

Succinct Spooky Free Compilers Are Not Black Box Sound.
IACR Cryptol. ePrint Arch., 2017

Non-Trivial Witness Encryption and Null-iO from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2017

Four Round Secure Computation without Setup.
IACR Cryptol. ePrint Arch., 2017

FHE Over the Integers: Decomposed and Batched in the Post-Quantum Regime.
IACR Cryptol. ePrint Arch., 2017

Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation).
Electron. Colloquium Comput. Complex., 2017

Non-interactive delegation and batch NP verification from standard computational assumptions.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Hierarchical Functional Encryption.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Circuit-ABE from LWE: Unbounded Attributes and Semi-Adaptive Security.
IACR Cryptol. ePrint Arch., 2016

Lattice-Based Fully Dynamic Multi-Key FHE with Short Ciphertexts.
IACR Cryptol. ePrint Arch., 2016

Shorter Circuit Obfuscation in Challenging Security Models.
IACR Cryptol. ePrint Arch., 2016

Targeted Homomorphic Attribute Based Encryption.
IACR Cryptol. ePrint Arch., 2016

On Statistically Secure Obfuscation with Approximate Correctness.
IACR Cryptol. ePrint Arch., 2016

3-Message Zero Knowledge Against Human Ignorance.
IACR Cryptol. ePrint Arch., 2016

Non-Interactive RAM and Batch NP Delegation from any PIR.
Electron. Colloquium Comput. Complex., 2016

Obfuscating Conjunctions under Entropic Ring LWE.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions Or: How to Secretly Embed a Circuit in Your PRF.
IACR Cryptol. ePrint Arch., 2015

Hierarchical Functional Encryption.
IACR Cryptol. ePrint Arch., 2015

From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting.
IACR Cryptol. ePrint Arch., 2015

Cryptanalysis of the Quadratic Zero-Testing of GGH.
IACR Cryptol. ePrint Arch., 2015

From Selective to Adaptive Security in Functional Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
(Leveled) Fully Homomorphic Encryption without Bootstrapping.
ACM Trans. Comput. Theory, 2014

Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$.
SIAM J. Comput., 2014

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.
J. Cryptol., 2014

Fast Interactive Coding against Adversarial Noise.
J. ACM, 2014

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically.
IACR Cryptol. ePrint Arch., 2014

2013
Lattice-Based FHE as Secure as PKE.
IACR Cryptol. ePrint Arch., 2013

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding.
IACR Cryptol. ePrint Arch., 2013

Black-Box Obfuscation for d-CNFs.
IACR Cryptol. ePrint Arch., 2013

Fast Algorithms for Interactive Coding.
Electron. Colloquium Comput. Complex., 2013

Classical hardness of learning with errors.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
Packed Ciphertexts in LWE-based Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2012

When Homomorphism Becomes a Liability.
IACR Cryptol. ePrint Arch., 2012

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP.
IACR Cryptol. ePrint Arch., 2012

Hedged Public-key Encryption: How to Protect against Bad Randomness.
IACR Cryptol. ePrint Arch., 2012

Efficient Interactive Coding Against Adversarial Noise.
Electron. Colloquium Comput. Complex., 2012

2011
A Parallel Repetition Theorem for Leakage Resilience.
IACR Cryptol. ePrint Arch., 2011

Efficient Fully Homomorphic Encryption from (Standard) LWE.
Electron. Colloquium Comput. Complex., 2011

Fully Homomorphic Encryption without Bootstrapping.
Electron. Colloquium Comput. Complex., 2011

Distributed discovery of large near-cliques.
Distributed Comput., 2011

Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

From Absolute Distinguishability to Positive Distinguishability.
Proceedings of the Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 2011

2010
Overcoming the Hole In The Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage.
IACR Cryptol. ePrint Arch., 2010

A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model.
IACR Cryptol. ePrint Arch., 2010

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

2009
Black-Box Circular-Secure Encryption Beyond Affine Functions.
IACR Cryptol. ePrint Arch., 2009

From absolute distinguishability to positive distinguishability.
Electron. Colloquium Comput. Complex., 2009

Weak Verifiable Random Functions.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2006
Jitter-approximation tradeoff for periodic scheduling.
Wirel. Networks, 2006

General Perfectly Periodic Scheduling.
Algorithmica, 2006

2003
Dispatching in perfectly-periodic schedules.
J. Algorithms, 2003


  Loading...