Omer Paneth

According to our database1, Omer Paneth authored at least 40 papers between 2011 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Incrementally Verifiable Computation via Incremental PCPs.
IACR Cryptology ePrint Archive, 2019

How to Delegate Computations Publicly.
IACR Cryptology ePrint Archive, 2019

On Round Optimal Statistical Zero Knowledge Arguments.
IACR Cryptology ePrint Archive, 2019

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

2018
On Publicly Verifiable Delegation From Standard Assumptions.
IACR Cryptology ePrint Archive, 2018

Weak Zero-Knowledge Beyond the Black-Box Barrier.
IACR Cryptology ePrint Archive, 2018

2017
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments.
IACR Cryptology ePrint Archive, 2017

Multi-Collision Resistance: A Paradigm for Keyless Hash Functions.
Electronic Colloquium on Computational Complexity (ECCC), 2017

On Virtual Grey Box Obfuscation for General Circuits.
Algorithmica, 2017

2016
On Removing Graded Encodings from Functional Encryption.
IACR Cryptology ePrint Archive, 2016

3-Message Zero Knowledge Against Human Ignorance.
IACR Cryptology ePrint Archive, 2016

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

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

2015
On the Equivalence of Obfuscation and Multilinear Maps.
IACR Cryptology ePrint Archive, 2015

Delegating RAM Computations.
IACR Cryptology ePrint Archive, 2015

On Obfuscation with Random Oracles.
IACR Cryptology ePrint Archive, 2015

Perfect Structure on the Edge of Chaos.
IACR Cryptology ePrint Archive, 2015

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation.
IACR Cryptology ePrint Archive, 2015

Time-Lock Puzzles from Randomized Encodings.
IACR Cryptology ePrint Archive, 2015

On the Cryptographic Hardness of Finding a Nash Equilibrium.
Electronic Colloquium on Computational Complexity (ECCC), 2015

2014
Publicly Verifiable Non-Interactive Arguments for Delegating Computation.
IACR Cryptology ePrint Archive, 2014

Key Derivation From Noisy Sources With More Errors Than Entropy.
IACR Cryptology ePrint Archive, 2014

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity.
IACR Cryptology ePrint Archive, 2014

ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation.
IACR Cryptology ePrint Archive, 2014

On the Existence of Extractable One-Way Functions.
IACR Cryptology ePrint Archive, 2014

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

2013
On the Achievability of Simulation-Based Security for Functional Encryption.
IACR Cryptology ePrint Archive, 2013

Verifiable Set Operations over Outsourced Databases.
IACR Cryptology ePrint Archive, 2013

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

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

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

Protecting Obfuscation Against Algebraic Attacks.
IACR Cryptology ePrint Archive, 2013

Obfuscation for Evasive Functions.
IACR Cryptology ePrint Archive, 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

2012
On the Impossibility of Approximate Obfuscation and Applications to Resettable Cryptography.
IACR Cryptology ePrint Archive, 2012

Succinct Non-Interactive Arguments via Linear Interactive Proofs.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2011


  Loading...