Omer Paneth

Computer Science · Physical Sciences

23h-index2.1kcitations82works2.92yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(68), Complexity and Algorithms in Graphs(42), Cryptographic Implementations and Security(29), Privacy-Preserving Technologies in Data(11), Adversarial Robustness in Machine Learning(11)

Publications82 total

How to Classically Verify a Quantum Cat without Killing It
arXiv (Cornell University)·2026Open Access
How to Classically Verify a Quantum Cat without Killing It
arXiv (Cornell University)·2026Open Access
Parallel Repetition for Post-Quantum Arguments
2025
Efficiently Batching Unambiguous Interactive Proofs
2025
Batch Proofs Are Statistically Hiding
2024· 9 citedOpen Access
A system capable of verifiably and privately screening global DNA synthesis
arXiv (Cornell University)·2024· 7 citedOpen Access
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
Lecture notes in computer science·2024· 1 cited
Reusable Online-Efficient Commitments
Lecture notes in computer science·2024
Monotone-Policy Aggregate Signatures
Lecture notes in computer science·2024· 9 cited
Non-interactive Universal Arguments
Lecture notes in computer science·2023· 1 cited
SNARGs for Monotone Policy Batch NP
Lecture notes in computer science·2023· 21 cited
Incrementally Verifiable Computation via Rate-1 Batch Arguments
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)·2022· 26 cited
Succinct Non-Interactive Arguments via Linear Interactive Proofs
Journal of Cryptology·2022· 20 citedOpen Access
PPAD is as Hard as LWE and Iterated Squaring
Lecture notes in computer science·2022· 21 cited
Verifiable Private Information Retrieval
Lecture notes in computer science·2022· 7 cited
Reusable Fuzzy Extractors for Low-Entropy Distributions
Journal of Cryptology·2020· 49 citedOpen Access
FOCS 2020 Program Committee
2020Open Access
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness
Lecture notes in computer science·2020· 14 citedOpen Access
Weakly Extractable One-Way Functions.
IACR Cryptology ePrint Archive·2020
Weakly Extractable One-Way Functions
Lecture notes in computer science·2020· 2 cited
page 1 of 5Next →

Frequent Co-authors

Nir Bitansky(28), Ran Canetti(18), Yael Tauman Kalai(16), Alon Rosen(8), Amit Sahai(4), Alessandro Chiesa(3), Yuval Ishai(3), Rafail Ostrovsky(3), Boaz Barak(3), Abhishek Jain(3), Shafi Goldwasser(3), Vinod Vaikuntanathan(3), Benjamin Fuller(3), Leonid Reyzin(3), Lisa Yang(3), Daniel Wichs(3), Guy N. Rothblum(3), Sanjam Garg(2), Adam Smith(2), Henry Cohn(2)