On statistically secure obfuscation with approximate correctness

DOI10.1007/978-3-662-53008-5_19MaRDI QIDQ2829230zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• One-Way Functions and (Im)perfect Obfuscation
• Indistinguishability obfuscation: from approximate to exact
• scientific article; zbMATH DE number 1842483
• On Best-Possible Obfuscation
• On the impossibility of approximate obfuscation and applications to resettable cryptography

Cites work

• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• A Note on the (Im)possibility of Using Obfuscators to Transform Private-Key Encryption into Public-Key Encryption
• A Pseudorandom Generator from any One-way Function
• A theory of the learnable
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Computational Complexity
• Constrained pseudorandom functions and their applications
• Functional signatures and pseudorandom functions
• How to use indistinguishability obfuscation
• Impossibility of VBB obfuscation with ideal constant-degree graded encodings
• Indistinguishability obfuscation: from approximate to exact
• Limits of provable security for homomorphic encryption
• Lower bounds on assumptions behind indistinguishability obfuscation
• NP is as easy as detecting unique solutions
• On Best-Possible Obfuscation
• On best-possible obfuscation
• On obfuscation with random oracles
• On the (im)possibility of obfuscating programs
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
• On the impossibility of approximate obfuscation and applications to resettable cryptography
• Output-compressing randomized encodings and applications

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)