 I'm interested in the theory of computation at large, and theory of cryptography in particular.
Contact Email: nirbitan at tau dot ac dot il
Office: Schreiber 123
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions
STOC 2018 PDF
Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs
Structure vs Hardness through the Obfuscation Lens
CRYPTO 2017 PDF
On Removing Graded Encodings from Functional Encryption
A Note on Perfect Correctness by Derandomization
From Cryptomania to Obfustopia through Secret-Key Functional Encryption
3-Message Zero Knowledge against Human Ignorance
Time-Lock Puzzles from Randomized Encodings
Indistinguishability Obfuscation: from Approximate to Exact
Perfect Structure on the Edge of Chaos
Indistinguishability Obfuscation from Functional Encryption
On the Cryptographic Hardness of Finding a Nash Equilibrium
Succinct Randomized Encodings and their Applications
with Sanjam Garg, Huijia Lin, Rafael Pass, and Sidharth Telang STOC 2015 PDF
ZAPs and Non-Interactive Witness-Indistinguishability from Indistinguishability Obfuscation
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
with Dana Dachman-Soled and Huijia Lin, CRYPTO 2014 PDF On the Existence of Extractable One-Way Functions
Obfuscation for Evasive Functions
Why "Fiat-Shamir for Proofs" Lacks a Proof
with Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana Lopez-Alt, and Daniel Wichs TCC 2013 Merge of [BGW] and [DJKL] Succinct Non-Interactive Arguments via Linear Interactive Proofs with Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth TCC 2013 PDF Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data
On the Impossibility of Approximate Obfuscation and Applications to Resettable Cryptography
with Omer Paneth FOCS 2012, Siam Journal on Computing 2015 Draft Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits
with Alessandro Chiesa CRYPTO 2012 PDF Leakage-Tolerant Interactive Protocols with Ran Canetti and Shai Halevi TCC 2012 PDF Point Obfuscation and 3-Message Zero Knowledge with Omer Paneth TCC 2012 PDF The Hunting of the SNARK
Preliminary version: From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again
with Ran Canetti, Alessandro Chiesa, Eran Tromer ITCS 2012 Program Obfuscation with Leaky Hardware
with Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum ASIACRYPT 2011 PDF On Strong Simulation and Composable Point Obfuscation
Thesis
Getting Inside the Adversary's Head: New Directions in Non-Black-Box Knowledge Extraction
Tel Aviv University 2015 PDF
Some Videotaped Talks
On Removing Graded Encodings from Functional Encryption (Eurocrypt '17)
A Note on Perfect Correctness by Derandomization (Eurocrypt '17)
A Reduction from Flying Pigs to Jumping Pigs (IAS, March '17)
On the Cryptographic Hardness of Finding a Nash Equilibrium (IAS, March '17, shorter version at FOCS '15)
Program Obfuscation: The Power of Unreadable Code (UW Colloquia, April '16)
On Virtual Grey Box Obfuscation for General Circuits (Crypto '14)
Program CommitteesEurocrypt 2019, 2018, 2017FOCS 2018Public Key Cryptography 2017Theory of Cryptography Conference 2017, 2016A, 2015Teaching
Foundations of Cryptography Fall 2017 |