| 2026 | CRYPTO | Security Amplification via Robust Indistinguishability Combiners. | Benny Applebaum, Nir Bitansky, Nathan Geier |
| 2026 | CRYPTO | Fair-Weather No More: Guaranteed Efficiency in Secure Group Messaging. | James Bartusek, Nir Bitansky, Yevgeniy Dodis, Rachit Garg, David J. Wu |
| 2026 | STOC | Shuffling Is Universal: Statistical Additive Randomized Encodings for All Functions. | Nir Bitansky, Saroja Erabelli, Rachit Garg, Yuval Ishai |
| 2025 | CRYPTO | Additive Randomized Encodings from Public Key Encryption. | Nir Bitansky, Saroja Erabelli, Rachit Garg |
| 2025 | EuroCrypt | Succinct Randomized Encodings from Laconic Function Evaluation, Faster and Simpler. | Nir Bitansky, Rachit Garg |
| 2024 | CRYPTO | Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes. | Nir Bitansky, Sapir Freizeit |
| 2024 | CRYPTO | Amplification of Non-interactive Zero Knowledge, Revisited. | Nir Bitansky, Nathan Geier |
| 2024 | CRYPTO | Reusable Online-Efficient Commitments. | Nir Bitansky, Omer Paneth, Dana Shamir |
| 2024 | FOCS | Dot-Product Proofs and Their Applications. | Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu |
| 2024 | STOC | Batch Proofs Are Statistically Hiding. | Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2023 | CRYPTO | Non-interactive Universal Arguments. | Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon |
| 2022 | CRYPTO | Constructive Post-Quantum Reductions. | Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai |
| 2022 | CRYPTO | Statistically Sender-Private OT from LPN and Derandomization. | Nir Bitansky, Sapir Freizeit |
| 2022 | EuroCrypt | Non-malleable Commitments Against Quantum Attacks. | Nir Bitansky, Huijia Lin, Omri Shmueli |
| 2022 | TCC | 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 |
| 2021 | TCC | Classical Binding for Quantum Commitments. | Nir Bitansky, Zvika Brakerski |
| 2021 | TCC | Post-quantum Resettably-Sound Zero Knowledge. | Nir Bitansky, Michael Kellner, Omri Shmueli |
| 2020 | STOC | Post-quantum zero knowledge in constant rounds. | Nir Bitansky, Omri Shmueli |
| 2020 | TCC | Characterizing Deterministic-Prover Zero Knowledge. | Nir Bitansky, Arka Rai Choudhuri |
| 2020 | TCC | Weakly Extractable One-Way Functions. | Nir Bitansky, Noa Eizenstadt, Omer Paneth |
| 2019 | CRYPTO | On Round Optimal Statistical Zero Knowledge Arguments. | Nir Bitansky, Omer Paneth |
| 2019 | EuroCrypt | Distributional Collision Resistance Beyond One-Way Functions. | Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev |
| 2019 | STOC | Weak zero-knowledge beyond the black-box barrier. | Nir Bitansky, Dakshita Khurana, Omer Paneth |
| 2019 | TCC | On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. | Nir Bitansky, Akshay Degwekar |
| 2018 | STOC | Multi-collision resistance: a paradigm for keyless hash functions. | Nir Bitansky, Yael Tauman Kalai, Omer Paneth |
| 2018 | TCC | One-Message Zero Knowledge and Non-malleable Commitments. | Nir Bitansky, Huijia Lin |
| 2017 | CRYPTO | Structure vs. Hardness Through the Obfuscation Lens. | Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan |
| 2017 | EuroCrypt | On Removing Graded Encodings from Functional Encryption. | Nir Bitansky, Huijia Lin, Omer Paneth |
| 2017 | EuroCrypt | A Note on Perfect Correctness by Derandomization. | Nir Bitansky, Vinod Vaikuntanathan |
| 2017 | TCC | Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. | Nir Bitansky |
| 2016 | TCC | 3-Message Zero Knowledge Against Human Ignorance. | Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan |
| 2016 | TCC | From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. | Nir Bitansky, Ryo Nishimaki, Alain Passelgue, Daniel Wichs |
| 2016 | TCC | Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. | Nir Bitansky, Omer Paneth, Daniel Wichs |
| 2016 | TCC | Indistinguishability Obfuscation: From Approximate to Exact. | Nir Bitansky, Vinod Vaikuntanathan |
| 2015 | FOCS | On the Cryptographic Hardness of Finding a Nash Equilibrium. | Nir Bitansky, Omer Paneth, Alon Rosen |
| 2015 | FOCS | Indistinguishability Obfuscation from Functional Encryption. | Nir Bitansky, Vinod Vaikuntanathan |
| 2015 | STOC | Succinct Randomized Encodings and their Applications. | Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang |
| 2015 | TCC | ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. | Nir Bitansky, Omer Paneth |
| 2014 | CRYPTO | 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 |
| 2014 | CRYPTO | On Virtual Grey Box Obfuscation for General Circuits. | Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth |
| 2014 | CRYPTO | Leakage-Tolerant Computation with Input-Independent Preprocessing. | Nir Bitansky, Dana Dachman-Soled, Huijia Lin |
| 2014 | STOC | On the existence of extractable one-way functions. | Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen |
| 2014 | TCC | Obfuscation for Evasive Functions. | Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai |
| 2013 | STOC | Recursive composition and bootstrapping for SNARKS and proof-carrying data. | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer |
| 2013 | STOC | On the impossibility of approximate obfuscation and applications to resettable cryptography. | Nir Bitansky, Omer Paneth |
| 2013 | TCC | Succinct Non-interactive Arguments via Linear Interactive Proofs. | Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth |
| 2013 | TCC | Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. | Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth |
| 2013 | TCC | Why "Fiat-Shamir for Proofs" Lacks a Proof. | Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana Lpez-Alt, Daniel Wichs |
| 2012 | CRYPTO | Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. | Nir Bitansky, Alessandro Chiesa |
| 2012 | FOCS | From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique. | Nir Bitansky, Omer Paneth |
| 2012 | TCC | Leakage-Tolerant Interactive Protocols. | Nir Bitansky, Ran Canetti, Shai Halevi |
| 2012 | TCC | Point Obfuscation and 3-Round Zero-Knowledge. | Nir Bitansky, Omer Paneth |
| 2011 | ASIACRYPT | Program Obfuscation with Leaky Hardware. | Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum |
| 2010 | CRYPTO | On Strong Simulation and Composable Point Obfuscation. | Nir Bitansky, Ran Canetti |