Indistinguishability Obfuscation: From Approximate to Exact

DOI10.1007/978-3-662-49096-9_4zbMath1388.94034OpenAlexW2293301337MaRDI QIDQ2796119

Vinod Vaikuntanathan, Nir Bitansky

Publication date: 23 March 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/111073

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (26)

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ A note on perfect correctness by derandomization ⋮ Semi-adaptive Security and Bundling Functionalities Made Generic and Easy ⋮ From FE combiners to secure MPC and back ⋮ Verifiable Functional Encryption ⋮ Statistically sender-private OT from LPN and derandomization ⋮ On the complexity of compressing obfuscation ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Functional Encryption for Turing Machines ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Perfect Structure on the Edge of Chaos ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Combiners for functional encryption, unconditionally ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ Obfuscation Combiners ⋮ On Statistically Secure Obfuscation with Approximate Correctness ⋮ Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium ⋮ A Note on Perfect Correctness by Derandomization ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• On hiding information from an oracle
• Computationally private randomizing polynomials and their applications
• Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
• Indistinguishability Obfuscation: From Approximate to Exact
• Functional Encryption Without Obfuscation
• Time-Lock Puzzles from Randomized Encodings
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Cryptanalysis of GGH Map
• Key Homomorphic PRFs and Their Applications
• Practical Multilinear Maps over the Integers
• Constrained Pseudorandom Functions and Their Applications
• Security Analysis of Multilinear Maps over the Integers
• Witness Encryption from Instance Independent Assumptions
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
• The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Cryptanalysis of the Multilinear Map over the Integers
• How to Obfuscate Programs Directly
• Black-box obfuscation for d-CNFs
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
• New Multilinear Maps Over the Integers
• Indistinguishability Obfuscation from Compact Functional Encryption
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• A Framework for Efficient and Composable Oblivious Transfer
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Candidate Multilinear Maps from Ideal Lattices
• Fully homomorphic encryption using ideal lattices
• How to use indistinguishability obfuscation
• Verifiable Random Functions from Weaker Assumptions
• ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
• Obfuscation of Probabilistic Circuits and Applications
• Graph-Induced Multilinear Maps from Lattices
• Obfuscating Circuits via Composite-Order Graded Encoding
• Advances in Cryptology - EUROCRYPT 2004
• On the (im)possibility of obfuscating programs
• Functional Signatures and Pseudorandom Functions
• Protecting Obfuscation against Algebraic Attacks
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

This page was built for publication: Indistinguishability Obfuscation: From Approximate to Exact