On statistically secure obfuscation with approximate correctness
From MaRDI portal
Publication:2829230
DOI10.1007/978-3-662-53008-5_19zbMATH Open1391.94734OpenAlexW2475892962MaRDI QIDQ2829230FDOQ2829230
Authors: Zvika Brakerski, Christina Brzuska, Nils Fleischhacker 
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
Recommendations
Cites Work
- A Pseudorandom Generator from any One-way Function
- Title not available (Why is that?)
- Computational Complexity
- A theory of the learnable
- NP is as easy as detecting unique solutions
- Title not available (Why is that?)
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- How to use indistinguishability obfuscation
- On Best-Possible Obfuscation
- On the (im)possibility of obfuscating programs
- Title not available (Why is that?)
- On best-possible obfuscation
- Constrained pseudorandom functions and their applications
- Indistinguishability obfuscation: from approximate to exact
- 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
- Output-compressing randomized encodings and applications
- Limits of provable security for homomorphic encryption
- On obfuscation with random oracles
- Functional signatures and pseudorandom functions
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- A Note on the (Im)possibility of Using Obfuscators to Transform Private-Key Encryption into Public-Key Encryption
Cited In (8)
- The final nail in the coffin of statistically-secure obfuscator
- On perfect correctness in (lockable) obfuscation
- On the complexity of compressing obfuscation
- On the complexity of compressing obfuscation
- Statistical difference beyond the polarizing regime
- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
- One-Way Functions and (Im)perfect Obfuscation
- Indistinguishability obfuscation: from approximate to exact
This page was built for publication: On statistically secure obfuscation with approximate correctness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829230)
