From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again. - Nir Bitansky; Ran Canetti; Alessandro Chiesa; Eran Tromer (IACR Cryptol. ePrint Arch., 2011)

Program Obfuscation with Leaky Hardware. - Nir Bitansky; Ran Canetti; Shafi Goldwasser; Shai Halevi; Yael Tauman Kalai; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2011)

Leakage Tolerant Interactive Protocols. - Nir Bitansky; Ran Canetti; Shai Halevi (IACR Cryptol. ePrint Arch., 2011)

From Point Obfuscation To 3-round Zero-Knowledge. - Nir Bitansky; Omer Paneth (IACR Cryptol. ePrint Arch., 2011)

From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique. - Nir Bitansky; Omer Paneth (FOCS, 2012)

Point Obfuscation and 3-Round Zero-Knowledge. - Nir Bitansky; Omer Paneth (TCC, 2012)

Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits. - Nir Bitansky; Alessandro Chiesa (IACR Cryptol. ePrint Arch., 2012)

Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. - Nir Bitansky; Ran Canetti; Alessandro Chiesa; Eran Tromer (IACR Cryptol. ePrint Arch., 2012)

Why "Fiat-Shamir for Proofs" Lacks a Proof. - Nir Bitansky; Sanjam Garg; Daniel Wichs (IACR Cryptol. ePrint Arch., 2012)

On the Impossibility of Approximate Obfuscation and Applications to Resettable Cryptography. - Nir Bitansky; Omer Paneth (IACR Cryptol. ePrint Arch., 2012)

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. - Nir Bitansky; Alessandro Chiesa; Yuval Ishai; Rafail Ostrovsky; Omer Paneth (TCC, 2013)

Why "Fiat-Shamir for Proofs" Lacks a Proof. - Nir Bitansky; Dana Dachman-Soled; Sanjam Garg; Abhishek Jain 002; Yael Tauman Kalai; Adriana López-Alt; Daniel Wichs (TCC, 2013)

Obfuscation for Evasive Functions. - Boaz Barak; Nir Bitansky; Ran Canetti; Yael Tauman Kalai; Omer Paneth; Amit Sahai (IACR Cryptol. ePrint Arch., 2013)

How To Construct Extractable One-Way Functions Against Uniform Adversaries. - Nir Bitansky; Ran Canetti; Omer Paneth (IACR Cryptol. ePrint Arch., 2013)

Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall. - Nir Bitansky; Ran Canetti; Omer Paneth; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input. - Nir Bitansky; Ran Canetti; Omer Paneth; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. - Nir Bitansky; Ran Canetti; Henry Cohn; Shafi Goldwasser; Yael Tauman Kalai; Omer Paneth; Alon Rosen (CRYPTO (2), 2014)

Leakage-Tolerant Computation with Input-Independent Preprocessing. - Nir Bitansky; Dana Dachman-Soled; Huijia Lin (CRYPTO (2), 2014)

Succinct Randomized Encodings and their Applications. - Nir Bitansky; Sanjam Garg; Sidharth Telang (IACR Cryptol. ePrint Arch., 2014)

ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. - Nir Bitansky; Omer Paneth (IACR Cryptol. ePrint Arch., 2014)

On Strong Simulation and Composable Point Obfuscation. - Nir Bitansky; Ran Canetti (J. Cryptol., 2014)

Getting inside the adversary's head: new directions in non- black- box knowledge extraction - Nir Bitansky (2014)

On the Cryptographic Hardness of Finding a Nash Equilibrium. - Nir Bitansky; Omer Paneth; Alon Rosen (Electron. Colloquium Comput. Complex., 2015)

A Note on Perfect Correctness by Derandomization. - Nir Bitansky; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2015)

Time-Lock Puzzles from Randomized Encodings. - Nir Bitansky; Shafi Goldwasser; Abhishek Jain 002; Omer Paneth; Vinod Vaikuntanathan; Brent Waters (IACR Cryptol. ePrint Arch., 2015)

Succinct Randomized Encodings and their Applications. - Nir Bitansky; Sanjam Garg; Huijia Lin; Rafael Pass; Sidharth Telang (IACR Cryptol. ePrint Arch., 2015)

Perfect Structure on the Edge of Chaos. - Nir Bitansky; Omer Paneth; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Indistinguishability Obfuscation: from Approximate to Exact. - Nir Bitansky; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2015)

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. - Nir Bitansky; Omer Paneth (SIAM J. Comput., 2015)

Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. - Nir Bitansky; Omer Paneth; Daniel Wichs (TCC (A1), 2016)

Structure vs Hardness through the Obfuscation Lens. - Nir Bitansky; Akshay Degwekar; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2016)

3-Message Zero Knowledge Against Human Ignorance. - Nir Bitansky; Zvika Brakerski; Yael Tauman Kalai; Omer Paneth; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2016)

On Removing Graded Encodings from Functional Encryption. - Nir Bitansky; Huijia Lin; Omer Paneth (IACR Cryptol. ePrint Arch., 2016)

On the Existence of Extractable One-Way Functions. - Nir Bitansky; Ran Canetti; Omer Paneth; Alon Rosen (SIAM J. Comput., 2016)

On Virtual Grey Box Obfuscation for General Circuits. - Nir Bitansky; Ran Canetti; Yael Tauman Kalai; Omer Paneth (Algorithmica, 2017)

Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs. - Nir Bitansky (Electron. Colloquium Comput. Complex., 2017)

Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. - Nir Bitansky; Omer Paneth; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2017)

The Hunting of the SNARK. - Nir Bitansky; Ran Canetti; Alessandro Chiesa; Shafi Goldwasser; Huijia Lin; Aviad Rubinstein; Eran Tromer (J. Cryptol., 2017)

One-Message Zero Knowledge and Non-Malleable Commitments. - Nir Bitansky; Huijia Lin (IACR Cryptol. ePrint Arch., 2018)

Weak Zero-Knowledge Beyond the Black-Box Barrier. - Nir Bitansky; Omer Paneth (IACR Cryptol. ePrint Arch., 2018)

Indistinguishability Obfuscation from Functional Encryption. - Nir Bitansky; Vinod Vaikuntanathan (J. ACM, 2018)

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. - Nir Bitansky; Ran Canetti; Sanjam Garg; Justin Holmgren; Abhishek Jain 002; Huijia Lin; Rafael Pass; Sidharth Telang; Vinod Vaikuntanathan (SIAM J. Comput., 2018)

On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. - Nir Bitansky; Akshay Degwekar (IACR Cryptol. ePrint Arch., 2019)

On Oblivious Amplification of Coin-Tossing Protocols. - Nir Bitansky; Nathan Geier (IACR Cryptol. ePrint Arch., 2019)

Distributional Collision Resistance Beyond One-Way Functions. - Nir Bitansky; Iftach Haitner; Ilan Komargodski; Eylon Yogev (IACR Cryptol. ePrint Arch., 2019)

On Round Optimal Statistical Zero Knowledge Arguments. - Nir Bitansky; Omer Paneth (IACR Cryptol. ePrint Arch., 2019)

Post-Quantum Zero Knowledge in Constant Rounds. - Nir Bitansky; Omri Shmueli (IACR Cryptol. ePrint Arch., 2019)

Weak Zero-Knowledge beyond the Black-Box Barrier. - Nir Bitansky; Dakshita Khurana; Omer Paneth (SIAM J. Comput., 2019)

Characterizing Deterministic-Prover Zero Knowledge. - Nir Bitansky; Arka Rai Choudhuri (IACR Cryptol. ePrint Arch., 2020)

Weakly Extractable One-Way Functions. - Nir Bitansky; Noa Eizenstadt; Omer Paneth (IACR Cryptol. ePrint Arch., 2020)

On the Cryptographic Hardness of Local Search. - Nir Bitansky; Idan Gerichter (IACR Cryptol. ePrint Arch., 2020)

From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. - Nir Bitansky; Ryo Nishimaki; Alain Passelègue; Daniel Wichs (J. Cryptol., 2020)

Classical Binding for Quantum Commitments. - Nir Bitansky; Zvika Brakerski (IACR Cryptol. ePrint Arch., 2021)

Post-quantum Resettably-Sound Zero Knowledge. - Nir Bitansky; Michael Kellner 001; Omri Shmueli (IACR Cryptol. ePrint Arch., 2021)

Non-malleable Commitments against Quantum Attacks. - Nir Bitansky; Huijia Lin; Omri Shmueli (IACR Cryptol. ePrint Arch., 2021)

Structure Versus Hardness Through the Obfuscation Lens. - Nir Bitansky; Akshay Degwekar; Vinod Vaikuntanathan (SIAM J. Comput., 2021)

Constructive Post-Quantum Reductions. - Nir Bitansky; Zvika Brakerski; Yael Tauman Kalai (IACR Cryptol. ePrint Arch., 2022)

PPAD is as Hard as LWE and Iterated Squaring. - Nir Bitansky; Arka Rai Choudhuri; Justin Holmgren; Chethan Kamath; Alex Lombardi; Omer Paneth; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2022)

Statistically Sender-Private OT from LPN and Derandomization. - Nir Bitansky; Sapir Freizeit (IACR Cryptol. ePrint Arch., 2022)

Succinct Non-Interactive Arguments via Linear Interactive Proofs. - Nir Bitansky; Alessandro Chiesa; Yuval Ishai; Rafail Ostrovsky; Omer Paneth (J. Cryptol., 2022)

Batch Proofs are Statistically Hiding. - Nir Bitansky; Chethan Kamath; Omer Paneth; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2023)

Non-interactive Universal Arguments. - Nir Bitansky; Omer Paneth; Dana Shamir; Tomer Solomon (IACR Cryptol. ePrint Arch., 2023)

Bootstrapping Homomorphic Encryption via Functional Encryption. - Nir Bitansky; Tomer Solomon (IACR Cryptol. ePrint Arch., 2023)

Reusable Online-Efficient Commitments. - Nir Bitansky; Omer Paneth; Dana Shamir (CRYPTO (8), 2024)

Dot-Product Proofs and Their Applications. - Nir Bitansky; Ron D. Rothblum; Prahladh Harsha; Yuval Ishai; David J. Wu 001 (Electron. Colloquium Comput. Complex., 2024)

Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes. - Nir Bitansky; Sapir Freizeit (IACR Cryptol. ePrint Arch., 2024)

Amplification of Non-Interactive Zero Knowledge, Revisited. - Nir Bitansky; Nathan Geier (IACR Cryptol. ePrint Arch., 2024)

Succinct Randomized Encodings from Non-compact Functional Encryption, Faster and Simpler. - Nir Bitansky; Rachit Garg (IACR Cryptol. ePrint Arch., 2024)

Additive Randomized Encodings from Public Key Encryption. - Nir Bitansky; Saroja Erabelli; Rachit Garg 001 (CRYPTO (4), 2025)

Succinct Randomized Encodings from Laconic Function Evaluation, Faster and Simpler. - Nir Bitansky; Rachit Garg 001 (EUROCRYPT (7), 2025)

Additive Randomized Encodings from Public Key Encryption. - Nir Bitansky; Saroja Erabelli; Rachit Garg (IACR Cryptol. ePrint Arch., 2025)

Shuffling is Universal: Statistical Additive Randomized Encodings for All Functions. - Nir Bitansky; Saroja Erabelli; Rachit Garg 001; Yuval Ishai (IACR Cryptol. ePrint Arch., 2025)