Indistinguishability Obfuscation: From Approximate to Exact

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Theory of Cryptography Conference

• Publication date

  2016-01-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-49096-9_4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Completeness theorems for non-cryptographic fault-tolerant distributed computation

  2019cited by this paper
• Time-Lock Puzzles from Randomized Encodings

  2016cited by this paper
• Cryptanalysis of GGH Map

  2016cited by this paper
• Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings

  2016influential reference
• Cryptanalysis of the New CLT Multilinear Map over the Integers

  2016cited by this paper
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models

  2016cited by this paper
• Indistinguishability Obfuscation from Compact Functional Encryption

  2015influential reference
• More on Impossibility of Virtual Black-Box Obfuscation in Idealized Models

  2015cited by this paper
• Obfuscation of Probabilistic Circuits and Applications

  2015influential reference
• A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation

  2015cited by this paper
• Verifiable Random Functions from Weaker Assumptions

  2015cited by this paper
• Indistinguishability Obfuscation from Functional Encryption

  2015influential reference
• Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption

  2015cited by this paper
• How to Obfuscate Programs Directly

  2015cited by this paper
• Graph-Induced Multilinear Maps from Lattices

  2015cited by this paper
• A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation

  2015cited by this paper
• On Obfuscation with Random Oracles

  2015cited by this paper
• ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation

  2015cited by this paper
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations

  2015cited by this paper
• The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically

  2014influential reference
• Fully Secure Functional Encryption without Obfuscation

  2014cited by this paper
• Cryptanalysis of the Multilinear Map over the Integers

  2014cited by this paper
• Security Analysis of Multilinear Maps over the Integers

  2014cited by this paper
• Witness Encryption from Instance Independent Assumptions

  2014cited by this paper
• One-Way Functions and (Im)Perfect Obfuscation

  2014cited by this paper
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

  2014cited by this paper
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings

  2014cited by this paper
• How to use indistinguishability obfuscation: deniable encryption, and more

  2014cited by this paper
• Immunizing Multilinear Maps Against Zeroizing Attacks

  2014cited by this paper
• Black-box obfuscation for d-CNFs

  2014cited by this paper
• The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator

  2014cited by this paper
• Protecting Obfuscation against Algebraic Attacks

  2014cited by this paper
• Functional Signatures and Pseudorandom Functions

  2014cited by this paper
• Key Homomorphic PRFs and Their Applications

  2013cited by this paper
• Practical Multilinear Maps over the Integers

  2013cited by this paper
• Delegatable pseudorandom functions and applications

  2013cited by this paper
• Candidate Multilinear Maps from Ideal Lattices

  2013cited by this paper
• Constrained Pseudorandom Functions and Their Applications

  2013cited by this paper
• Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

  2013cited by this paper
• From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique

  2012cited by this paper
• Functional encryption: a new vision for public-key cryptography

  2012cited by this paper
• Functional Encryption with Bounded Collusions via Multi-party Computation

  2012cited by this paper
• Candidate Multilinear Maps from Ideal Lattices and Applications

  2012cited by this paper
• Definitional Issues in Functional Encryption

  2010cited by this paper
• Improved Delegation of Computation using Fully Homomorphic Encryption

  2010cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009cited by this paper
• On the impossibility of obfuscation with auxiliary input

  2005cited by this paper
• COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS

  2005cited by this paper
• Immunizing Encryption Schemes from Decryption Errors

  2004influential reference
• Derandomization in Cryptography

  2003cited by this paper
• Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials

  2002cited by this paper
• Simple extractors for all min-entropies and a new pseudo-random generator

  2001cited by this paper
• On the (im)possibility of obfuscating programs

  2001cited by this paper
• Efficient oblivious transfer protocols

  2001influential reference
• Zaps and their applications

  2000cited by this paper
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

  1999cited by this paper
• A Pseudorandom Generator from any One-way Function

  1999cited by this paper
• Lower Bounds for Discrete Logarithms and Related Problems

  1997cited by this paper
• Random Oracles Are Practical: a Paradigm for Designing Eecient Protocols

  1995cited by this paper
• Random oracles are practical: a paradigm for designing efficient protocols

  1993cited by this paper
• Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)

  1992cited by this paper
• Bit commitment using pseudorandomness

  1989cited by this paper
• Hardness vs. randomness

  1988cited by this paper
• Completeness theorems for non-cryptographic fault-tolerant distributed computation

  1988cited by this paper
• On Hiding Information from an Oracle

  1987cited by this paper
• How to construct random functions

  1986cited by this paper
• How to generate and exchange secrets

  1986cited by this paper
• SRI International

  1982cited by this paper

• On the Invalidity of LV16/Lin17 Obfuscation Schemes

  2023cites this paper
• A Note on Copy-Protection from Random Oracles

  2022cites this paper
• Statistically Sender-Private OT from LPN and Derandomization

  2022cites this paper
• New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries

  2021cites this paper
• Combiners for Functional Encryption, Unconditionally

  2020cites this paper
• Cryptographic Obfuscation: A Survey

  2020cites this paper
• On Perfect Correctness in (Lockable) Obfuscation

  2019cites this paper
• From FE Combiners to Secure MPC and Back

  2019cites this paper
• The Birth of Cryptographic Obfuscation -- A Survey

  2018cites this paper
• On the Complexity of Compressing Obfuscation

  2018cites this paper
• On Secure and Usable Program Obfuscation: A Survey

  2017cites this paper
• Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption

  2017influential citation
• Robust Transfroming Combiners from iO to FE Prabhanjan Ananth

  2017influential citation
• On Removing Graded Encodings from Functional Encryption

  2017cites this paper
• A Note on Perfect Correctness by Derandomization

  2017cites this paper
• Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions

  2017cites this paper
• Obfuscation Combiners

  2016cites this paper
• Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes

  2016influential citation
• On Statistically Secure Obfuscation with Approximate Correctness

  2016cites this paper
• Advances in Cryptology – CRYPTO 2016

  2016cites this paper
• Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security

  2016cites this paper
• Online-Offline Functional Encryption for Bounded Collusions

  2016cites this paper
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

  2016influential citation