| 2026 | EuroCrypt | On Succinct Non-interactive Secure Computation with Malicious Security. | Maya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain, Omer Paneth |
| 2025 | FOCS | On Succinct Obfuscation via Propositional Proofs. | Abhishek Jain, Zhengzhong Jin, Surya Mathialagan, Omer Paneth |
| 2024 | CRYPTO | Reusable Online-Efficient Commitments. | Nir Bitansky, Omer Paneth, Dana Shamir |
| 2024 | EuroCrypt | Monotone-Policy Aggregate Signatures. | Maya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain, Omer Paneth |
| 2024 | EuroCrypt | Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. | Cody Freitag, Omer Paneth, Rafael Pass |
| 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 |
| 2023 | CRYPTO | SNARGs for Monotone Policy Batch NP. | Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth |
| 2022 | FOCS | Incrementally Verifiable Computation via Rate-1 Batch Arguments. | Omer Paneth, Rafael Pass |
| 2022 | TCC | Verifiable Private Information Retrieval. | Shany Ben-David, Yael Tauman Kalai, Omer Paneth |
| 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 |
| 2020 | CRYPTO | Delegation with Updatable Unambiguous Proofs and PPAD-Hardness. | Yael Tauman Kalai, Omer Paneth, Lisa Yang |
| 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 | STOC | Weak zero-knowledge beyond the black-box barrier. | Nir Bitansky, Dakshita Khurana, Omer Paneth |
| 2019 | STOC | How to delegate computations publicly. | Yael Tauman Kalai, Omer Paneth, Lisa Yang |
| 2019 | TCC | Incrementally Verifiable Computation via Incremental PCPs. | Moni Naor, Omer Paneth, Guy N. Rothblum |
| 2018 | STOC | Multi-collision resistance: a paradigm for keyless hash functions. | Nir Bitansky, Yael Tauman Kalai, Omer Paneth |
| 2017 | EuroCrypt | On Removing Graded Encodings from Functional Encryption. | Nir Bitansky, Huijia Lin, Omer Paneth |
| 2017 | TCC | On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments. | Omer Paneth, Guy N. Rothblum |
| 2016 | EuroCrypt | Reusable Fuzzy Extractors for Low-Entropy Distributions. | Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith |
| 2016 | TCC | 3-Message Zero Knowledge Against Human Ignorance. | Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan |
| 2016 | TCC | Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. | Nir Bitansky, Omer Paneth, Daniel Wichs |
| 2016 | TCC | Delegating RAM Computations. | Yael Tauman Kalai, Omer Paneth |
| 2015 | FOCS | On the Cryptographic Hardness of Finding a Nash Equilibrium. | Nir Bitansky, Omer Paneth, Alon Rosen |
| 2015 | TCC | ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. | Nir Bitansky, Omer Paneth |
| 2015 | TCC | On Obfuscation with Random Oracles. | Ran Canetti, Yael Tauman Kalai, 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 | Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity. | Ran Canetti, Abhishek Jain, Omer Paneth |
| 2014 | EuroCrypt | Protecting Obfuscation against Algebraic Attacks. | Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai |
| 2014 | PKC | Verifiable Set Operations over Outsourced Databases. | Ran Canetti, Omer Paneth, Dimitrios Papadopoulos, Nikos Triandopoulos |
| 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 | CRYPTO | On the Achievability of Simulation-Based Security for Functional Encryption. | Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O'Neill, Omer Paneth, Giuseppe Persiano |
| 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 | Public-Coin Concurrent Zero-Knowledge in the Global Hash Model. | Ran Canetti, Huijia Lin, Omer Paneth |
| 2012 | FOCS | From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique. | Nir Bitansky, Omer Paneth |
| 2012 | TCC | Point Obfuscation and 3-Round Zero-Knowledge. | Nir Bitansky, Omer Paneth |