Zvika Brakerski

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Unitary Subgroup Testing.

[BibT_eX]

[DOI]

Devika Sharma

Guy Weissenberg

CoRR, 2021

Classical Binding for Quantum Commitments.

[BibT_eX]

[DOI]

Nir Bitansky

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

On the Hardness of Average-Case k-SUM.

[BibT_eX]

[DOI]

Noah Stephens-Davidowitz

Proceedings of the Approximation, 2021

2020

Simpler Proofs of Quantumness.

[BibT_eX]

[DOI]

Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

FHE-Based Bootstrapping of Designated-Prover NIZK.

[BibT_eX]

[DOI]

Sanjam Garg

Rotem Tsabary

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Lossiness and Entropic Hardness for Ring-LWE.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control.

[BibT_eX]

[DOI]

Yael Kalai

Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Separating Two-Round Secure Computation From Oblivious Transfer.

[BibT_eX]

[DOI]

Akshayaram Srinivasan

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes.

[BibT_eX]

[DOI]

Raghuvansh R. Saxena

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Candidate iO from Homomorphic Encryption Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Hardness of LWE on General Entropic Distributions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Scalable Pseudorandom Quantum States.

[BibT_eX]

[DOI]

Omri Shmueli

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations.

[BibT_eX]

[DOI]

Venkata Koppula

Tamer Mour

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

(Pseudo) Random Quantum States with Binary Phase.

[BibT_eX]

[DOI]

Omri Shmueli

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Degree 2 is Complete for the Round-Complexity of Malicious MPC.

[BibT_eX]

[DOI]

Benny Applebaum

Rotem Tsabary

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

On Quantum Advantage in Information Theoretic Single-Server PIR.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Order-LWE and the Hardness of Ring-LWE with Entropic Secrets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

Fundamentals of fully homomorphic encryption.

[BibT_eX]

[DOI]

Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018

Order-LWE and the Hardness of Ring-LWE with Entropic Secrets.

[BibT_eX]

[DOI]

Renen Perlman

IACR Cryptol. ePrint Arch., 2018

Monotone Batch NP-Delegation with Applications to Access Control.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Two-Message Statistical Sender-Private OT from LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Fundamentals of Fully Homomorphic Encryption - A Survey.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Certifiable Randomness from a Single Quantum Device.

[BibT_eX]

[DOI]

CoRR, 2018

Two-Message Statistically Sender-Private OT from LWE.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Perfect Secure Computation in Two Rounds.

[BibT_eX]

[DOI]

Benny Applebaum

Rotem Tsabary

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Non-trivial Witness Encryption and Null-iO from Standard Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Zero-Knowledge Protocols for Search Problems.

[BibT_eX]

[DOI]

Ben Berger

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Learning with Errors and Extrapolated Dihedral Cosets.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Brief Announcement: Zero-Knowledge Protocols for Search Problems.

[BibT_eX]

[DOI]

Ben Berger

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Quantum FHE (Almost) As Secure As Classical.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Private Constrained PRFs (and More) from LWE.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Four Round Secure Computation Without Setup.

[BibT_eX]

[DOI]

Shai Halevi

Antigoni Polychroniadou

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Non-interactive delegation and batch NP verification from standard computational assumptions.

[BibT_eX]

[DOI]

Justin Holmgren

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime.

[BibT_eX]

[DOI]

Daniel Benarroch

Tancrède Lepoint

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Hierarchical Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Succinct Spooky Free Compilers Are Not Black Box Sound.

[BibT_eX]

[DOI]

Renen Perlman

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Non-Interactive RAM and Batch NP Delegation from any PIR.

[BibT_eX]

[DOI]

Justin Holmgren

Electron. Colloquium Comput. Complex., 2016

Targeted Homomorphic Attribute-Based Encryption.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

3-Message Zero Knowledge Against Human Ignorance.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Shorter Circuit Obfuscation in Challenging Security Models.

[BibT_eX]

[DOI]

Or Dagmi

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Obfuscating Conjunctions under Entropic Ring LWE.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

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

[BibT_eX]

[DOI]

Ilan Komargodski

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts.

[BibT_eX]

[DOI]

Renen Perlman

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

On Statistically Secure Obfuscation with Approximate Correctness.

[BibT_eX]

[DOI]

Christina Brzuska

Nils Fleischhacker

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Hierarchical Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting.

[BibT_eX]

[DOI]

Ilan Komargodski

IACR Cryptol. ePrint Arch., 2015

Cryptanalysis of the Quadratic Zero-Testing of GGH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions - Or: How to Secretly Embed a Circuit in Your PRF.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Function-Private Functional Encryption in the Private-Key Setting.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Obfuscating Circuits via Composite-Order Graded Encoding.

[BibT_eX]

[DOI]

Benny Applebaum

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

From Selective to Adaptive Security in Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Fast Interactive Coding against Adversarial Noise.

[BibT_eX]

[DOI]

Moni Naor

J. ACM, 2014

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

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

[BibT_eX]

[DOI]

Guy N. Rothblum

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Lattice-based FHE as secure as PKE.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2014

Black-box obfuscation for d-CNFs.

[BibT_eX]

[DOI]

Guy N. Rothblum

Proceedings of the Innovations in Theoretical Computer Science, 2014

2013

When Homomorphism Becomes a Liability.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Classical hardness of learning with errors.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Fast Algorithms for Interactive Coding.

[BibT_eX]

[DOI]

Moni Naor

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Packed Ciphertexts in LWE-Based Homomorphic Encryption.

[BibT_eX]

[DOI]

Craig Gentry

Shai Halevi

Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Obfuscating Conjunctions.

[BibT_eX]

[DOI]

Guy N. Rothblum

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

A Parallel Repetition Theorem for Leakage Resilience.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

(Leveled) fully homomorphic encryption without bootstrapping.

[BibT_eX]

[DOI]

Craig Gentry

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Efficient Interactive Coding against Adversarial Noise.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

Fully Homomorphic Encryption without Bootstrapping.

[BibT_eX]

[DOI]

Craig Gentry

Electron. Colloquium Comput. Complex., 2011

Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Black-Box Circular-Secure Encryption beyond Affine Functions.

[BibT_eX]

[DOI]

Shafi Goldwasser

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Efficient Fully Homomorphic Encryption from (Standard) LWE.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

From Absolute Distinguishability to Positive Distinguishability.

[BibT_eX]

[DOI]

Oded Goldreich

Proceedings of the Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 2011

2010

A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

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

[BibT_eX]

[DOI]

Shafi Goldwasser

Proceedings of the Advances in Cryptology, 2010

2009

From absolute distinguishability to positive distinguishability.

[BibT_eX]

[DOI]

Oded Goldreich

Electron. Colloquium Comput. Complex., 2009

Weak Verifiable Random Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Distributed discovery of large near-cliques.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Hedged Public-Key Encryption: How to Protect against Bad Randomness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2004

Jitter-Approximation Tradeoff for Periodic Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Dispatching in perfectly-periodic schedules.

[BibT_eX]

[DOI]

Vladimir Dreizin

J. Algorithms, 2003

2002

General perfectly periodic scheduling.

[BibT_eX]

[DOI]

Aviv Nisgav