Nir Bitansky

Sapir Freizeit

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Constructive Post-Quantum Reductions.

[BibT_eX]

[DOI]

Zvika Brakerski

Yael Tauman Kalai

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Structure Versus Hardness Through the Obfuscation Lens.

[BibT_eX]

[DOI]

Akshay Degwekar

SIAM J. Comput., 2021

Post-quantum Resettably-Sound Zero Knowledge.

[BibT_eX]

[DOI]

Michael Kellner

Omri Shmueli

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

Classical Binding for Quantum Commitments.

[BibT_eX]

[DOI]

Zvika Brakerski

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

2020

Weakly Extractable One-Way Functions.

[BibT_eX]

[DOI]

Noa Eizenstadt

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

Characterizing Deterministic-Prover Zero Knowledge.

[BibT_eX]

[DOI]

Arka Rai Choudhuri

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

Post-quantum zero knowledge in constant rounds.

[BibT_eX]

[DOI]

Omri Shmueli

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

On Oblivious Amplification of Coin-Tossing Protocols.

[BibT_eX]

[DOI]

Nathan Geier

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

On the Cryptographic Hardness of Local Search.

[BibT_eX]

[DOI]

Idan Gerichter

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

2019

On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations.

[BibT_eX]

[DOI]

Akshay Degwekar

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

Weak zero-knowledge beyond the black-box barrier.

[BibT_eX]

[DOI]

Dakshita Khurana

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Distributional Collision Resistance Beyond One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

On Round Optimal Statistical Zero Knowledge Arguments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Weak Zero-Knowledge Beyond the Black-Box Barrier.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

One-Message Zero Knowledge and Non-malleable Commitments.

[BibT_eX]

[DOI]

Huijia Lin

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

Multi-collision resistance: a paradigm for keyless hash functions.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs.

[BibT_eX]

[DOI]

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

A Note on Perfect Correctness by Derandomization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

On Removing Graded Encodings from Functional Encryption.

[BibT_eX]

[DOI]

Huijia Lin

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Structure vs. Hardness Through the Obfuscation Lens.

[BibT_eX]

[DOI]

Akshay Degwekar

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

Indistinguishability Obfuscation: From Approximate to Exact.

[BibT_eX]

[DOI]

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

Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

Daniel Wichs

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

From Cryptomania to Obfustopia Through Secret-Key Functional 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

Time-Lock Puzzles from Randomized Encodings.

[BibT_eX]

[DOI]

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

2015

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Perfect Structure on the Edge of Chaos.

[BibT_eX]

[DOI]

Daniel Wichs

IACR Cryptol. ePrint Arch., 2015

ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

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

Succinct Randomized Encodings and their Applications.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Indistinguishability Obfuscation from Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

On the Cryptographic Hardness of Finding a Nash Equilibrium.

[BibT_eX]

[DOI]

Alon Rosen

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Getting inside the adversary's head: new directions in non- black- box knowledge extraction

[BibT_eX]

[DOI]

PhD thesis, 2014

Succinct Randomized Encodings and their Applications.

[BibT_eX]

[DOI]

Sanjam Garg

Sidharth Telang

IACR Cryptol. ePrint Arch., 2014

The Hunting of the SNARK.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Obfuscation for Evasive Functions.

[BibT_eX]

[DOI]

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

On the existence of extractable one-way functions.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Leakage-Tolerant Computation with Input-Independent Preprocessing.

[BibT_eX]

[DOI]

Dana Dachman-Soled

Huijia Lin

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

On Virtual Grey Box Obfuscation for General Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

How To Construct Extractable One-Way Functions Against Uniform Adversaries.

[BibT_eX]

[DOI]

Ran Canetti

IACR Cryptol. ePrint Arch., 2013

Why "Fiat-Shamir for Proofs" Lacks a Proof.

[BibT_eX]

[DOI]

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

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs.

[BibT_eX]

[DOI]

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

Succinct Non-interactive Arguments via Linear Interactive Proofs.

[BibT_eX]

[DOI]

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

On the impossibility of approximate obfuscation and applications to resettable cryptography.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Recursive composition and bootstrapping for SNARKS and proof-carrying data.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Why "Fiat-Shamir for Proofs" Lacks a Proof.

[BibT_eX]

[DOI]

Sanjam Garg

Daniel Wichs

IACR Cryptol. ePrint Arch., 2012

Point Obfuscation and 3-Round Zero-Knowledge.

[BibT_eX]

[DOI]

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

Leakage-Tolerant Interactive Protocols.

[BibT_eX]

[DOI]

Ran Canetti

Shai Halevi

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

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique.

[BibT_eX]

[DOI]

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

Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits.

[BibT_eX]

[DOI]

Alessandro Chiesa

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

From Point Obfuscation To 3-round Zero-Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Program Obfuscation with Leaky Hardware.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

On Strong Simulation and Composable Point Obfuscation.

[BibT_eX]

[DOI]