Omer Paneth

Orcid: 0000-0001-8561-1123

According to our database1, Omer Paneth authored at least 53 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A system capable of verifiably and privately screening global DNA synthesis.
CoRR, 2024

Batch Proofs Are Statistically Hiding.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Monotone-Policy Aggregate Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Reusable Online-Efficient Commitments.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
SNARGs for Monotone Policy Batch NP.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Non-interactive Universal Arguments.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
PPAD is as Hard as LWE and Iterated Squaring.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Verifiable Private Information Retrieval.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Incrementally Verifiable Computation via Rate-1 Batch Arguments.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2020
Weakly Extractable One-Way Functions.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Delegation with Updatable Unambiguous Proofs and PPAD-Hardness.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Incrementally Verifiable Computation via Incremental PCPs.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

How to delegate computations publicly.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Weak zero-knowledge beyond the black-box barrier.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

On Round Optimal Statistical Zero Knowledge Arguments.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
On Publicly Verifiable Delegation From Standard Assumptions.
IACR Cryptol. ePrint Arch., 2018

Weak Zero-Knowledge Beyond the Black-Box Barrier.
IACR Cryptol. ePrint Arch., 2018

Multi-collision resistance: a paradigm for keyless hash functions.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

On Removing Graded Encodings from Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
Foundations and applications of program obfuscation
PhD thesis, 2016

Delegating RAM Computations.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

3-Message Zero Knowledge Against Human Ignorance.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Time-Lock Puzzles from Randomized Encodings.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Reusable Fuzzy Extractors for Low-Entropy Distributions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation.
SIAM J. Comput., 2015

On the Equivalence of Obfuscation and Multilinear Maps.
IACR Cryptol. ePrint Arch., 2015

Perfect Structure on the Edge of Chaos.
IACR Cryptol. ePrint Arch., 2015

On Obfuscation with Random Oracles.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

On the Cryptographic Hardness of Finding a Nash Equilibrium.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Publicly Verifiable Non-Interactive Arguments for Delegating Computation.
IACR Cryptol. ePrint Arch., 2014

Key Derivation From Noisy Sources With More Errors Than Entropy.
IACR Cryptol. ePrint Arch., 2014

Obfuscation for Evasive Functions.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

On the existence of extractable one-way functions.
Proceedings of the Symposium on Theory of Computing, 2014

Verifiable Set Operations over Outsourced Databases.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Protecting Obfuscation against Algebraic Attacks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

On Virtual Grey Box Obfuscation for General Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input.
IACR Cryptol. ePrint Arch., 2013

Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall.
IACR Cryptol. ePrint Arch., 2013

How To Construct Extractable One-Way Functions Against Uniform Adversaries.
IACR Cryptol. ePrint Arch., 2013

Public-Coin Concurrent Zero-Knowledge in the Global Hash Model.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Succinct Non-interactive Arguments via Linear Interactive Proofs.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

On the impossibility of approximate obfuscation and applications to resettable cryptography.
Proceedings of the Symposium on Theory of Computing Conference, 2013

On the Achievability of Simulation-Based Security for Functional Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Point Obfuscation and 3-Round Zero-Knowledge.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
From Point Obfuscation To 3-round Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2011


  Loading...