Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

From MaRDI portal
Publication:2816296

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




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

Identity-based re-encryption scheme with lightweight re-encryption key generationAdaptive Simulation Security for Inner Product Functional EncryptionThe Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iOHow to Compute in the Presence of LeakageThe Journey from NP to TFNP HardnessA 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 KnowledgeAttribute-based versions of Schnorr and ElGamalLimits on the Power of Indistinguishability Obfuscation and Functional EncryptionSecure Multiparty RAM Computation in Constant RoundsStrong Hardness of Privacy from Weak Traitor TracingVerifiable Computation for Randomized AlgorithmPrivate Functional Encryption: Indistinguishability-Based Definitions and Constructions from ObfuscationReceiver Selective Opening Security from Indistinguishability ObfuscationDelegating RAM Computations with Adaptive Soundness and PrivacyStandard Security Does Not Imply Indistinguishability Under Selective OpeningSecure Obfuscation in a Weak Multilinear Map ModelVirtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic AgentsDeniable Attribute Based Encryption for Branching Programs from LWESemi-adaptive Security and Bundling Functionalities Made Generic and EasyFrom Cryptomania to Obfustopia Through Secret-Key Functional EncryptionSingle-Key to Multi-Key Functional Encryption with Polynomial LossCompactness vs Collusion Resistance in Functional EncryptionDesigning Proof of Human-Work Puzzles for Cryptocurrency and BeyondAccess Control Encryption: Enforcing Information Flow with CryptographyBad Directions in Cryptographic Hash FunctionsWatermarking Cryptographic CapabilitiesIndistinguishability Obfuscation for RAM Programs and Succinct Randomized EncodingsQuantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptionsCryptanalysis of multilinear maps from ideal lattices: revisitedOn the power of rewinding simulators in functional encryptionOn constructing one-way permutations from indistinguishability obfuscationOn Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for CircuitsMulti-input Functional Encryption with Unbounded-Message SecurityVerifiable Functional EncryptionHow to Generate and Use Universal SamplersCryptanalysis of the CLT13 multilinear mapEfficient and Provable White-Box PrimitivesMultikey Fully Homomorphic Encryption and ApplicationsDecentralized multi-client functional encryption for set intersection with improved efficiencyVerifiable functional encryption using Intel SGXLeakage-Resilient IND-CCA KEM from the Extractable Hash Proofs with Indistinguishability ObfuscationOne-Round Cross-Domain Group Key Exchange Protocol in the Standard ModelDistributed Pseudorandom Functions for General Access Structures in NPModeling Random Oracles Under Unpredictable QueriesPractical Order-Revealing Encryption with Limited LeakageFinding Shortest Lattice Vectors in the Presence of GapsRound-Optimal Password-Based Group Key Exchange Protocols in the Standard ModelImpossibility of VBB Obfuscation with Ideal Constant-Degree Graded EncodingsOn the Impossibility of Virtual Black-Box Obfuscation in Idealized ModelsLower Bounds on Assumptions Behind Indistinguishability ObfuscationIndistinguishability Obfuscation: From Approximate to ExactOutput-Compressing Randomized Encodings and ApplicationsFunctional Encryption for Turing MachinesOrder-Revealing Encryption and the Hardness of Private LearningReconfigurable Cryptography: A Flexible Approach to Long-Term SecurityMultilinear Maps from ObfuscationPerfect Structure on the Edge of ChaosCryptographic Assumptions: A Position PaperHow to Avoid Obfuscation Using Witness PRFsCutting-Edge Cryptography Through the Lens of Secret SharingFunctional Encryption Without ObfuscationOn Constructing One-Way Permutations from Indistinguishability ObfuscationContention in Cryptoland: Obfuscation, Leakage and UCEPoint-Function Obfuscation: A Framework and Generic ConstructionsMulti-input Functional Encryption and Its Application in Outsourcing ComputationCandidate Indistinguishability Obfuscation and Functional Encryption for All CircuitsGeneralized Hardness Assumption for Self-bilinear Map with Auxiliary InformationTuring Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded FunctionsOffline Witness EncryptionConstrained PRFs for Unbounded Inputs with Short KeysOn Adaptively Secure Multiparty Computation with a Short CRSOn the Implausibility of Constant-Round Public-Coin Zero-Knowledge ProofsSignatures Resilient to Uninvertible LeakageShorter Circuit Obfuscation in Challenging Security ModelsBounded KDM Security from iO and OWFA Unified Approach to Idealized Model Separations via Indistinguishability ObfuscationUniversal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness EncryptionObfuscation CombinersOn Statistically Secure Obfuscation with Approximate CorrectnessRevisiting the Cryptographic Hardness of Finding a Nash EquilibriumCryptanalysis of GGH15 Multilinear MapsAnnihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWECircular Security Separations for Arbitrary Length Cycles from LWEOn the Existence of Extractable One-Way FunctionsQuantum Homomorphic Encryption for Polynomial-Sized CircuitsSpooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument SystemsFully Secure Functional Encryption for Inner Products, from Standard AssumptionsFine-Grained CryptographyA Subfield Lattice Attack on Overstretched NTRU AssumptionsHow to Use Indistinguishability Obfuscation: Deniable Encryption, and MoreUnnamed ItemUnnamed ItemThe Complexity of Public-Key CryptographyPseudorandom Functions: Three Decades LaterHomomorphic EncryptionThe Complexity of Differential PrivacyWeak Zero-Knowledge beyond the Black-Box Barrier


Uses Software


Cites Work


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