On Statistically Secure Obfuscation with Approximate Correctness
From MaRDI portal
Publication:2829230
DOI10.1007/978-3-662-53008-5_19zbMath1391.94734OpenAlexW2475892962MaRDI QIDQ2829230
Christina Brzuska, Nils Fleischhacker, Zvika Brakerski
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_19
Related Items (4)
One-Way Functions and (Im)perfect Obfuscation ⋮ Statistical difference beyond the polarizing regime ⋮ The final nail in the coffin of statistically-secure obfuscator ⋮ On the complexity of compressing obfuscation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On best-possible obfuscation
- NP is as easy as detecting unique solutions
- Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
- Indistinguishability Obfuscation: From Approximate to Exact
- Output-Compressing Randomized Encodings and Applications
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Limits of Provable Security for Homomorphic Encryption
- Constrained Pseudorandom Functions and Their Applications
- A Note on the (Im)possibility of Using Obfuscators to Transform Private-Key Encryption into Public-Key Encryption
- On Best-Possible Obfuscation
- A theory of the learnable
- A Pseudorandom Generator from any One-way Function
- How to use indistinguishability obfuscation
- On Obfuscation with Random Oracles
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- Computational Complexity
This page was built for publication: On Statistically Secure Obfuscation with Approximate Correctness
