Constructive Post-Quantum Reductions. | 0 | 0.34 | 2022 |
Succinct Non-Interactive Arguments via Linear Interactive Proofs | 0 | 0.34 | 2022 |
PPAD is as Hard as LWE and Iterated Squaring. | 0 | 0.34 | 2022 |
A Note on Perfect Correctness by Derandomization | 0 | 0.34 | 2022 |
Post-quantum Resettably-Sound Zero Knowledge | 0 | 0.34 | 2021 |
Structure Versus Hardness Through The Obfuscation Lens | 0 | 0.34 | 2021 |
Classical Binding for Quantum Commitments | 0 | 0.34 | 2021 |
Post-quantum zero knowledge in constant rounds | 1 | 0.36 | 2020 |
On the Cryptographic Hardness of Local Search. | 0 | 0.34 | 2020 |
On Oblivious Amplification of Coin-Tossing Protocols. | 0 | 0.34 | 2020 |
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs | 0 | 0.34 | 2020 |
On Round Optimal Statistical Zero Knowledge Arguments. | 0 | 0.34 | 2019 |
Distributional Collision Resistance Beyond One-Way Functions. | 0 | 0.34 | 2019 |
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. | 2 | 0.37 | 2018 |
A Note on Perfect Correctness by Derandomization. | 2 | 0.38 | 2017 |
On Removing Graded Encodings from Functional Encryption. | 3 | 0.36 | 2017 |
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. | 8 | 0.42 | 2017 |
Structure vs Hardness through the Obfuscation Lens. | 5 | 0.39 | 2016 |
3-Message Zero Knowledge Against Human Ignorance. | 4 | 0.38 | 2016 |
Time-Lock Puzzles From Randomized Encodings | 24 | 0.86 | 2016 |
Indistinguishability Obfuscation: From Approximate to Exact. | 8 | 0.42 | 2016 |
Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. | 8 | 0.44 | 2016 |
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. | 6 | 0.41 | 2015 |
Perfect Structure on the Edge of Chaos. | 18 | 0.54 | 2015 |
Indistinguishability Obfuscation from Functional Encryption. | 60 | 1.13 | 2015 |
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. | 27 | 0.68 | 2014 |
The Hunting of the SNARK. | 2 | 0.38 | 2014 |
Succinct Randomized Encodings and their Applications. | 50 | 1.01 | 2014 |
On the existence of extractable one-way functions | 35 | 0.84 | 2014 |
On the Cryptographic Hardness of Finding a Nash Equilibrium. | 27 | 0.66 | 2014 |
Leakage-Tolerant Computation with Input-Independent Preprocessing. | 15 | 0.54 | 2014 |
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. | 25 | 0.82 | 2014 |
On Virtual Grey Box Obfuscation for General Circuits. | 10 | 0.55 | 2014 |
Recursive composition and bootstrapping for SNARKS and proof-carrying data | 95 | 2.36 | 2013 |
Why “fiat-shamir for proofs” lacks a proof | 12 | 0.47 | 2013 |
How To Construct Extractable One-Way Functions Against Uniform Adversaries. | 2 | 0.37 | 2013 |
Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. | 1 | 0.35 | 2013 |
Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall. | 13 | 0.57 | 2013 |
Succinct non-interactive arguments via linear interactive proofs | 69 | 1.72 | 2013 |
Obfuscation for Evasive Functions. | 10 | 0.52 | 2013 |
On the impossibility of approximate obfuscation and applications to resettable cryptography | 25 | 0.71 | 2013 |
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input. | 6 | 0.47 | 2013 |
From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique | 20 | 0.63 | 2012 |
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again | 132 | 3.27 | 2012 |
Leakage-Tolerant interactive protocols | 41 | 0.98 | 2012 |
Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits. | 21 | 0.64 | 2012 |
Program obfuscation with leaky hardware | 20 | 0.77 | 2011 |
Point obfuscation and 3-round zero-knowledge | 0 | 0.34 | 2011 |
On Strong Simulation and Composable Point Obfuscation | 26 | 0.85 | 2010 |