default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmer Paneth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c40]Nir Bitansky, Omer Paneth, Dana Shamir:
Reusable Online-Efficient Commitments. CRYPTO (8) 2024: 3-35- [c39]Cody Freitag, Omer Paneth, Rafael Pass:
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. EUROCRYPT (4) 2024: 112-141 - [c38]Maya Farber Brodsky, Arka Rai Choudhuri
, Abhishek Jain, Omer Paneth:
Monotone-Policy Aggregate Signatures. EUROCRYPT (4) 2024: 168-195 - [c37]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan:
Batch Proofs Are Statistically Hiding. STOC 2024: 435-443 - [i44]Carsten Baum, Jens Berlips, Walther Chen, Hongrui Cui, Ivan Damgård, Jiangbin Dong, Kevin M. Esvelt, Mingyu Gao, Dana Gretton, Leonard Foner, Martin Kysel, Kaiyi Zhang, Juanru Li, Xiang Li, Omer Paneth, Ronald L. Rivest, Francesca Sage-Ling, Adi Shamir, Yue Shen, Meicen Sun, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Yun Wang, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu, Haoling Zhang:
A system capable of verifiably and privately screening global DNA synthesis. CoRR abs/2403.14023 (2024) - [i43]Maya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain, Omer Paneth:
Monotone-Policy Aggregate Signatures. IACR Cryptol. ePrint Arch. 2024: 899 (2024) - 2023
- [c36]Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon:
Non-interactive Universal Arguments. CRYPTO (2) 2023: 132-158 - [c35]Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth:
SNARGs for Monotone Policy Batch NP. CRYPTO (2) 2023: 252-283 - [i42]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. Electron. Colloquium Comput. Complex. TR23 (2023) - [i41]Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon:
Non-interactive Universal Arguments. IACR Cryptol. ePrint Arch. 2023: 458 (2023) - [i40]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. IACR Cryptol. ePrint Arch. 2023: 754 (2023) - [i39]Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth:
SNARGs for Monotone Policy Batch NP. IACR Cryptol. ePrint Arch. 2023: 1050 (2023) - [i38]Omer Paneth, Rafael Pass:
Incrementally Verifiable Computation via Rate-1 Batch Arguments. IACR Cryptol. ePrint Arch. 2023: 1394 (2023) - 2022
- [j5]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-Interactive Arguments via Linear Interactive Proofs. J. Cryptol. 35(3): 15 (2022) - [c34]Omer Paneth, Rafael Pass:
Incrementally Verifiable Computation via Rate-1 Batch Arguments. FOCS 2022: 1045-1056 - [c33]Shany Ben-David, Yael Tauman Kalai, Omer Paneth:
Verifiable Private Information Retrieval. TCC (3) 2022: 3-32 - [c32]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum:
PPAD is as Hard as LWE and Iterated Squaring. TCC (2) 2022: 593-622 - [i37]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum:
PPAD is as Hard as LWE and Iterated Squaring. IACR Cryptol. ePrint Arch. 2022: 1272 (2022) - [i36]Shany Ben-David, Yael Tauman Kalai, Omer Paneth:
Verifiable Private Information Retrieval. IACR Cryptol. ePrint Arch. 2022: 1560 (2022) - 2021
- [j4]Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith:
Reusable Fuzzy Extractors for Low-Entropy Distributions. J. Cryptol. 34(1): 2 (2021) - 2020
- [c31]Yael Tauman Kalai, Omer Paneth, Lisa Yang:
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness. CRYPTO (3) 2020: 652-673 - [c30]Nir Bitansky, Noa Eizenstadt, Omer Paneth:
Weakly Extractable One-Way Functions. TCC (1) 2020: 596-626 - [i35]Nir Bitansky, Noa Eizenstadt, Omer Paneth:
Weakly Extractable One-Way Functions. IACR Cryptol. ePrint Arch. 2020: 1421 (2020)
2010 – 2019
- 2019
- [c29]Nir Bitansky, Omer Paneth:
On Round Optimal Statistical Zero Knowledge Arguments. CRYPTO (3) 2019: 128-156 - [c28]Nir Bitansky, Dakshita Khurana, Omer Paneth:
Weak zero-knowledge beyond the black-box barrier. STOC 2019: 1091-1102 - [c27]Yael Tauman Kalai, Omer Paneth, Lisa Yang:
How to delegate computations publicly. STOC 2019: 1115-1124 - [c26]Moni Naor, Omer Paneth, Guy N. Rothblum:
Incrementally Verifiable Computation via Incremental PCPs. TCC (2) 2019: 552-576 - [i34]Yael Kalai, Omer Paneth, Lisa Yang:
How to Delegate Computations Publicly. IACR Cryptol. ePrint Arch. 2019: 603 (2019) - [i33]Nir Bitansky, Omer Paneth:
On Round Optimal Statistical Zero Knowledge Arguments. IACR Cryptol. ePrint Arch. 2019: 640 (2019) - [i32]Moni Naor, Omer Paneth, Guy N. Rothblum:
Incrementally Verifiable Computation via Incremental PCPs. IACR Cryptol. ePrint Arch. 2019: 1407 (2019) - 2018
- [c25]Nir Bitansky, Yael Tauman Kalai, Omer Paneth:
Multi-collision resistance: a paradigm for keyless hash functions. STOC 2018: 671-684 - [i31]Yael Kalai, Omer Paneth, Lisa Yang:
On Publicly Verifiable Delegation From Standard Assumptions. IACR Cryptol. ePrint Arch. 2018: 776 (2018) - [i30]Nir Bitansky, Omer Paneth:
Weak Zero-Knowledge Beyond the Black-Box Barrier. IACR Cryptol. ePrint Arch. 2018: 895 (2018) - 2017
- [j3]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. Algorithmica 79(4): 1014-1051 (2017) - [c24]Nir Bitansky, Huijia Lin, Omer Paneth:
On Removing Graded Encodings from Functional Encryption. EUROCRYPT (2) 2017: 3-29 - [c23]Omer Paneth, Guy N. Rothblum:
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments. TCC (2) 2017: 283-315 - [i29]Nir Bitansky, Omer Paneth, Yael Tauman Kalai:
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i28]Nir Bitansky, Yael Tauman Kalai, Omer Paneth:
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. IACR Cryptol. ePrint Arch. 2017: 488 (2017) - [i27]Omer Paneth, Guy N. Rothblum:
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments. IACR Cryptol. ePrint Arch. 2017: 903 (2017) - 2016
- [b1]Omer Paneth:
Foundations and applications of program obfuscation. Boston University, USA, 2016 - [j2]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the Existence of Extractable One-Way Functions. SIAM J. Comput. 45(5): 1910-1952 (2016) - [c22]Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith:
Reusable Fuzzy Extractors for Low-Entropy Distributions. EUROCRYPT (1) 2016: 117-146 - [c21]Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters:
Time-Lock Puzzles from Randomized Encodings. ITCS 2016: 345-356 - [c20]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan:
3-Message Zero Knowledge Against Human Ignorance. TCC (B1) 2016: 57-83 - [c19]Yael Tauman Kalai, Omer Paneth:
Delegating RAM Computations. TCC (B2) 2016: 91-118 - [c18]Nir Bitansky, Omer Paneth, Daniel Wichs:
Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. TCC (A1) 2016: 474-502 - [i26]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan:
3-Message Zero Knowledge Against Human Ignorance. IACR Cryptol. ePrint Arch. 2016: 213 (2016) - [i25]Nir Bitansky, Huijia Lin, Omer Paneth:
On Removing Graded Encodings from Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 962 (2016) - 2015
- [j1]Nir Bitansky, Omer Paneth:
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. SIAM J. Comput. 44(5): 1325-1383 (2015) - [c17]Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. FOCS 2015: 1480-1498 - [c16]Nir Bitansky, Omer Paneth:
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. TCC (2) 2015: 401-427 - [c15]Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Obfuscation with Random Oracles. TCC (2) 2015: 456-467 - [i24]Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. Electron. Colloquium Comput. Complex. TR15 (2015) - [i23]Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Obfuscation with Random Oracles. IACR Cryptol. ePrint Arch. 2015: 48 (2015) - [i22]Nir Bitansky, Omer Paneth, Daniel Wichs:
Perfect Structure on the Edge of Chaos. IACR Cryptol. ePrint Arch. 2015: 126 (2015) - [i21]Nir Bitansky, Omer Paneth:
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. IACR Cryptol. ePrint Arch. 2015: 369 (2015) - [i20]Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters:
Time-Lock Puzzles from Randomized Encodings. IACR Cryptol. ePrint Arch. 2015: 514 (2015) - [i19]Omer Paneth, Amit Sahai:
On the Equivalence of Obfuscation and Multilinear Maps. IACR Cryptol. ePrint Arch. 2015: 791 (2015) - [i18]Yael Tauman Kalai, Omer Paneth:
Delegating RAM Computations. IACR Cryptol. ePrint Arch. 2015: 957 (2015) - 2014
- [c14]Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen:
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. CRYPTO (2) 2014: 71-89 - [c13]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. CRYPTO (2) 2014: 108-125 - [c12]Ran Canetti, Abhishek Jain, Omer Paneth:
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity. CRYPTO (2) 2014: 337-350 - [c11]Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Protecting Obfuscation against Algebraic Attacks. EUROCRYPT 2014: 221-238 - [c10]Ran Canetti, Omer Paneth, Dimitrios Papadopoulos, Nikos Triandopoulos:
Verifiable Set Operations over Outsourced Databases. Public Key Cryptography 2014: 113-130 - [c9]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the existence of extractable one-way functions. STOC 2014: 505-514 - [c8]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. TCC 2014: 26-51 - [i17]Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin:
Key Derivation From Noisy Sources With More Errors Than Entropy. IACR Cryptol. ePrint Arch. 2014: 243 (2014) - [i16]Nir Bitansky, Omer Paneth:
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 295 (2014) - [i15]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the Existence of Extractable One-Way Functions. IACR Cryptol. ePrint Arch. 2014: 402 (2014) - [i14]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. IACR Cryptol. ePrint Arch. 2014: 554 (2014) - [i13]Ran Canetti, Abhishek Jain, Omer Paneth:
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity. IACR Cryptol. ePrint Arch. 2014: 633 (2014) - [i12]Omer Paneth, Guy N. Rothblum:
Publicly Verifiable Non-Interactive Arguments for Delegating Computation. IACR Cryptol. ePrint Arch. 2014: 981 (2014) - [i11]Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. IACR Cryptol. ePrint Arch. 2014: 1029 (2014) - 2013
- [c7]Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O'Neill, Omer Paneth, Giuseppe Persiano:
On the Achievability of Simulation-Based Security for Functional Encryption. CRYPTO (2) 2013: 519-535 - [c6]Nir Bitansky, Omer Paneth:
On the impossibility of approximate obfuscation and applications to resettable cryptography. STOC 2013: 241-250 - [c5]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013 - [c4]Ran Canetti, Huijia Lin, Omer Paneth:
Public-Coin Concurrent Zero-Knowledge in the Global Hash Model. TCC 2013: 80-99 - [c3]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013: 315-333 - [i10]Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O'Neill, Omer Paneth, Giuseppe Persiano:
On the Achievability of Simulation-Based Security for Functional Encryption. IACR Cryptol. ePrint Arch. 2013: 364 (2013) - [i9]Nir Bitansky, Ran Canetti, Omer Paneth:
How To Construct Extractable One-Way Functions Against Uniform Adversaries. IACR Cryptol. ePrint Arch. 2013: 468 (2013) - [i8]Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Protecting Obfuscation Against Algebraic Attacks. IACR Cryptol. ePrint Arch. 2013: 631 (2013) - [i7]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall. IACR Cryptol. ePrint Arch. 2013: 641 (2013) - [i6]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. IACR Cryptol. ePrint Arch. 2013: 668 (2013) - [i5]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 701 (2013) - [i4]Ran Canetti, Omer Paneth, Dimitrios Papadopoulos, Nikos Triandopoulos:
Verifiable Set Operations over Outsourced Databases. IACR Cryptol. ePrint Arch. 2013: 724 (2013) - 2012
- [c2]Nir Bitansky, Omer Paneth:
From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique. FOCS 2012: 223-232 - [c1]Nir Bitansky, Omer Paneth:
Point Obfuscation and 3-Round Zero-Knowledge. TCC 2012: 190-208 - [i3]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-Interactive Arguments via Linear Interactive Proofs. IACR Cryptol. ePrint Arch. 2012: 718 (2012) - [i2]Nir Bitansky, Omer Paneth:
On the Impossibility of Approximate Obfuscation and Applications to Resettable Cryptography. IACR Cryptol. ePrint Arch. 2012: 729 (2012) - 2011
- [i1]Nir Bitansky, Omer Paneth:
From Point Obfuscation To 3-round Zero-Knowledge. IACR Cryptol. ePrint Arch. 2011: 493 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
