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)

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)

Public-Coin Concurrent Zero-Knowledge in the Global Hash Model. - Ran Canetti; Huijia Lin; Omer Paneth (TCC, 2013)

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

Protecting Obfuscation Against Algebraic Attacks. - Boaz Barak; Sanjam Garg; 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)

Verifiable Set Operations over Outsourced Databases. - Ran Canetti; Omer Paneth; Dimitrios Papadopoulos 001; Nikos Triandopoulos (IACR Cryptol. ePrint Arch., 2013)

On the Achievability of Simulation-Based Security for Functional Encryption. - Angelo De Caro; Vincenzo Iovino; Abhishek Jain 002; Adam O'Neill; Omer Paneth; Giuseppe Persiano (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)

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

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity. - Ran Canetti; Abhishek Jain 002; Omer Paneth (IACR Cryptol. ePrint Arch., 2014)

Key Derivation From Noisy Sources With More Errors Than Entropy. - Ran Canetti; Benjamin Fuller 001; Omer Paneth; Leonid Reyzin (IACR Cryptol. ePrint Arch., 2014)

Publicly Verifiable Non-Interactive Arguments for Delegating Computation. - Omer Paneth; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2014)

On the Cryptographic Hardness of Finding a Nash Equilibrium. - Nir Bitansky; Omer Paneth; Alon Rosen (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)

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

On Obfuscation with Random Oracles. - Ran Canetti; Yael Tauman Kalai; Omer Paneth (IACR Cryptol. ePrint Arch., 2015)

Delegating RAM Computations. - Yael Tauman Kalai; Omer Paneth (IACR Cryptol. ePrint Arch., 2015)

On the Equivalence of Obfuscation and Multilinear Maps. - Omer Paneth; Amit Sahai (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)

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)

Foundations and applications of program obfuscation - Omer Paneth (2016)

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

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

On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments. - Omer Paneth; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2017)

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

On Publicly Verifiable Delegation From Standard Assumptions. - Yael Kalai; Omer Paneth; Lisa Yang 001 (IACR Cryptol. ePrint Arch., 2018)

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

How to Delegate Computations Publicly. - Yael Kalai; Omer Paneth; Lisa Yang 001 (IACR Cryptol. ePrint Arch., 2019)

Incrementally Verifiable Computation via Incremental PCPs. - Moni Naor; Omer Paneth; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2019)

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

Delegation with Updatable Unambiguous Proofs and PPAD-Hardness. - Yael Tauman Kalai; Omer Paneth; Lisa Yang 001 (CRYPTO (3), 2020)

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

Reusable Fuzzy Extractors for Low-Entropy Distributions. - Ran Canetti; Benjamin Fuller 001; Omer Paneth; Leonid Reyzin; Adam D. Smith 001 (J. Cryptol., 2021)

Verifiable Private Information Retrieval. - Shany Ben-David; Yael Tauman Kalai; Omer Paneth (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)

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)

SNARGs for Monotone Policy Batch NP. - Zvika Brakerski; Maya Farber Brodsky; Yael Tauman Kalai; Alex Lombardi; Omer Paneth (IACR Cryptol. ePrint Arch., 2023)

Incrementally Verifiable Computation via Rate-1 Batch Arguments. - Omer Paneth; Rafael Pass (IACR Cryptol. ePrint Arch., 2023)

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

Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. - Cody Freitag; Omer Paneth; Rafael Pass (EUROCRYPT (4), 2024)

A system capable of verifiably and privately screening global DNA synthesis. - Carsten Baum; Jens Berlips; Walther Chen; Hongrui Cui; Ivan Damgård; Jiangbin Dong; Kevin M. Esvelt; Mingyu Gao 001; Dana Gretton; Leonard Foner; Martin Kysel; Kaiyi Zhang 001; et al. (CoRR, 2024)

Monotone-Policy Aggregate Signatures. - Maya Farber Brodsky; Arka Rai Choudhuri; Abhishek Jain 002; Omer Paneth (IACR Cryptol. ePrint Arch., 2024)