On the impossibility of approximate obfuscation and applications to resettable cryptography

DOI10.1145/2488608.2488639zbMath1293.94055OpenAlexW2161196440MaRDI QIDQ5495794

Nir Bitansky, Omer Paneth

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2488608.2488639

zbMATH Keywords

zero-knowledgeobfuscationresettable cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (19)

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Impossibility of simulation secure functional encryption even with random oracles ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Pattern matching on encrypted streams ⋮ White box traitor tracing ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Watermarking Cryptographic Capabilities ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ Post-quantum resettably-sound zero knowledge ⋮ On the impossibility of purely algebraic signatures ⋮ Non-interactive secure computation from one-way functions ⋮ Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings ⋮ On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models ⋮ Contention in Cryptoland: Obfuscation, Leakage and UCE ⋮ Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security ⋮ Secure software leasing ⋮ On Statistically Secure Obfuscation with Approximate Correctness ⋮ On the Existence of Extractable One-Way Functions

This page was built for publication: On the impossibility of approximate obfuscation and applications to resettable cryptography