| 2013 | ||
|---|---|---|
| c9 | Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt, Daniel Wichs: Why "Fiat-Shamir for Proofs" Lacks a Proof. TCC 2013: 182-201 | |
| c8 | Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth: Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013: 315-333 | |
| 2012 | ||
| c7 | Nir Bitansky, Alessandro Chiesa: Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. CRYPTO 2012: 255-272 | |
| c6 | Nir Bitansky, Omer Paneth: From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique. FOCS 2012: 223-232 | |
| c5 | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. ITCS 2012: 326-349 | |
| c4 | ||
| c3 | ||
| i10 | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. IACR Cryptology ePrint Archive 2012: 95 (2012) | |
| i9 | Nir Bitansky, Alessandro Chiesa: Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits. IACR Cryptology ePrint Archive 2012: 461 (2012) | |
| i8 | Nir Bitansky, Sanjam Garg, Daniel Wichs: Why "Fiat-Shamir for Proofs" Lacks a Proof. IACR Cryptology ePrint Archive 2012: 705 (2012) | |
| i7 | Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth: Succinct Non-Interactive Arguments via Linear Interactive Proofs. IACR Cryptology ePrint Archive 2012: 718 (2012) | |
| i6 | Nir Bitansky, Omer Paneth: On the Impossibility of Approximate Obfuscation and Applications to Resettable Cryptography. IACR Cryptology ePrint Archive 2012: 729 (2012) | |
| 2011 | ||
| c2 | Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum: Program Obfuscation with Leaky Hardware. ASIACRYPT 2011: 722-739 | |
| i5 | Nir Bitansky, Ran Canetti, Shai Halevi: Leakage Tolerant Interactive Protocols. IACR Cryptology ePrint Archive 2011: 204 (2011) | |
| i4 | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again. IACR Cryptology ePrint Archive 2011: 443 (2011) | |
| i3 | Nir Bitansky, Omer Paneth: From Point Obfuscation To 3-round Zero-Knowledge. IACR Cryptology ePrint Archive 2011: 493 (2011) | |
| i2 | Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum: Program Obfuscation with Leaky Hardware. IACR Cryptology ePrint Archive 2011: 660 (2011) | |
| 2010 | ||
| c1 | Nir Bitansky, Ran Canetti: On Strong Simulation and Composable Point Obfuscation. CRYPTO 2010: 520-537 | |
| i1 | Nir Bitansky, Ran Canetti: On Strong Simulation and Composable Point Obfuscation. IACR Cryptology ePrint Archive 2010: 414 (2010) | |
Data released under the ODC-BY 1.0 license — See also our legal information page