Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

DOI10.1137/14095772XzbMath1348.94048OpenAlexW2474861573WikidataQ57568016 ScholiaQ57568016MaRDI QIDQ2816296

Mariana Raykova, Sanjam Garg, Shai Halevi, Brent Waters, Amit Sahai, Craig Gentry

Publication date: 4 July 2016

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/14095772x

zbMATH Keywords

functional encryptionobfuscationpredicate encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (only showing first 100 items - show all)

Identity-based re-encryption scheme with lightweight re-encryption key generation ⋮ Adaptive Simulation Security for Inner Product Functional Encryption ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ How to Compute in the Presence of Leakage ⋮ The Journey from NP to TFNP Hardness ⋮ A New Functional Encryption for Multidimensional Range Query (Short Paper) ⋮ Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper) ⋮ Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge ⋮ Attribute-based versions of Schnorr and ElGamal ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Verifiable Computation for Randomized Algorithm ⋮ Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation ⋮ Receiver Selective Opening Security from Indistinguishability Obfuscation ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Standard Security Does Not Imply Indistinguishability Under Selective Opening ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Semi-adaptive Security and Bundling Functionalities Made Generic and Easy ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ Access Control Encryption: Enforcing Information Flow with Cryptography ⋮ Bad Directions in Cryptographic Hash Functions ⋮ Watermarking Cryptographic Capabilities ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ Cryptanalysis of multilinear maps from ideal lattices: revisited ⋮ On the power of rewinding simulators in functional encryption ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ Verifiable Functional Encryption ⋮ How to Generate and Use Universal Samplers ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ Efficient and Provable White-Box Primitives ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Decentralized multi-client functional encryption for set intersection with improved efficiency ⋮ Verifiable functional encryption using Intel SGX ⋮ Leakage-Resilient IND-CCA KEM from the Extractable Hash Proofs with Indistinguishability Obfuscation ⋮ One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model ⋮ Distributed Pseudorandom Functions for General Access Structures in NP ⋮ Modeling Random Oracles Under Unpredictable Queries ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Finding Shortest Lattice Vectors in the Presence of Gaps ⋮ Round-Optimal Password-Based Group Key Exchange Protocols in the Standard Model ⋮ 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 ⋮ Functional Encryption for Turing Machines ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Reconfigurable Cryptography: A Flexible Approach to Long-Term Security ⋮ Multilinear Maps from Obfuscation ⋮ Perfect Structure on the Edge of Chaos ⋮ Cryptographic Assumptions: A Position Paper ⋮ How to Avoid Obfuscation Using Witness PRFs ⋮ Cutting-Edge Cryptography Through the Lens of Secret Sharing ⋮ Functional Encryption Without Obfuscation ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Contention in Cryptoland: Obfuscation, Leakage and UCE ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ Multi-input Functional Encryption and Its Application in Outsourcing Computation ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information ⋮ Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions ⋮ Offline Witness Encryption ⋮ Constrained PRFs for Unbounded Inputs with Short Keys ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs ⋮ Signatures Resilient to Uninvertible Leakage ⋮ Shorter Circuit Obfuscation in Challenging Security Models ⋮ Bounded KDM Security from iO and OWF ⋮ A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation ⋮ 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 ⋮ Cryptanalysis of GGH15 Multilinear Maps ⋮ Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 ⋮ Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE ⋮ Circular Security Separations for Arbitrary Length Cycles from LWE ⋮ On the Existence of Extractable One-Way Functions ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Fine-Grained Cryptography ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ How to Use Indistinguishability Obfuscation: Deniable Encryption, and More ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Complexity of Public-Key Cryptography ⋮ Pseudorandom Functions: Three Decades Later ⋮ Homomorphic Encryption ⋮ The Complexity of Differential Privacy ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier

Uses Software

• fhe

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Practical Multilinear Maps over the Integers
• Attribute-Based Encryption for Circuits from Multilinear Maps
• Functional Encryption: New Perspectives and Lower Bounds
• On the Achievability of Simulation-Based Security for Functional Encryption
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• How to Obfuscate Programs Directly
• Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
• Identity-Based Cryptosystems and Signature Schemes
• Functional Encryption: Definitions and Challenges
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Functional Encryption for Inner Product Predicates from Learning with Errors
• Trapdoors for hard lattices and new cryptographic constructions
• Fully Homomorphic Encryption over the Integers
• Perfect Non-interactive Zero Knowledge for NP
• Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
• On Best-Possible Obfuscation
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Candidate Multilinear Maps from Ideal Lattices
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Obfuscating Circuits via Composite-Order Graded Encoding
• Advances in Cryptology - EUROCRYPT 2004
• Computational Complexity
• Fuzzy Identity-Based Encryption
• On the (im)possibility of obfuscating programs
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Witness encryption and its applications
• Attribute-based encryption for circuits
• Reusable garbled circuits and succinct functional encryption

This page was built for publication: Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits