Candidate indistinguishability obfuscation and functional encryption for all circuits
From MaRDI portal
Publication:2816296
DOI10.1137/14095772XzbMATH Open1348.94048OpenAlexW2474861573WikidataQ57568016 ScholiaQ57568016MaRDI QIDQ2816296FDOQ2816296
Authors: Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters 
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
Recommendations
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- On extractability obfuscation
- Limits on the power of indistinguishability obfuscation and functional encryption
Cites Work
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic encryption over the integers
- 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
- Computational Complexity
- Identity-based cryptosystems and signature schemes
- Functional encryption: definitions and challenges
- Functional encryption for inner product predicates from learning with errors
- Trapdoors for hard lattices and new cryptographic constructions
- Conjunctive, Subset, and Range Queries on Encrypted Data
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Title not available (Why is that?)
- Bit commitment using pseudorandomness
- (Leveled) fully homomorphic encryption without bootstrapping
- Attribute-based encryption for circuits from multilinear maps
- Title not available (Why is that?)
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Attribute-based encryption for circuits
- Practical multilinear maps over the integers
- Making NTRU as secure as worst-case problems over ideal lattices
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Perfect Non-interactive Zero Knowledge for NP
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- How to delegate and verify in public: verifiable computation from attribute-based encryption
- Title not available (Why is that?)
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- On Best-Possible Obfuscation
- Candidate Multilinear Maps from Ideal Lattices
- On the (im)possibility of obfuscating programs
- Functional encryption: new perspectives and lower bounds
- On the achievability of simulation-based security for functional encryption
- Functional encryption with bounded collusions via multi-party computation
- Reusable garbled circuits and succinct functional encryption
- Title not available (Why is that?)
- Obfuscating circuits via composite-order graded encoding
- Witness encryption and its applications
- How to obfuscate programs directly
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
Cited In (only showing first 100 items - show all)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Offline witness encryption with semi-adaptive security
- Reusable two-round MPC from LPN
- Deniable Attribute Based Encryption for Branching Programs from LWE
- The magic of ELFs
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Deniable fully homomorphic encryption from learning with errors
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Watermarking cryptographic functionalities from standard lattice assumptions
- Watermarking cryptographic capabilities
- Access Control Encryption for Equality, Comparison, and More
- Universal ring signatures in the standard model
- ABE for circuits with constant-size secret keys and adaptive security
- Multi-input quadratic functional encryption from pairings
- Efficient lattice-based inner-product functional encryption
- Attribute-based access control for inner product functional encryption from LWE
- Cross-domain attribute-based access control encryption
- Optimizing registration based encryption
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Contention in cryptoland: obfuscation, leakage and UCE
- Functional encryption: deterministic to randomized functions from simple assumptions
- On statistically secure obfuscation with approximate correctness
- The complexity of differential privacy
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Incompressible cryptography
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- On the multi-user security of short Schnorr signatures with preprocessing
- Unclonable polymers and their cryptographic applications
- Compact NIZKs from standard assumptions on bilinear maps
- Candidate obfuscation via oblivious LWE sampling
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Secure software leasing
- Towards accountability in CRS generation
- Reconfigurable cryptography: a flexible approach to long-term security
- Cryptography with updates
- Predicate encryption from bilinear maps and one-sided probabilistic rank
- BETA: biometric-enabled threshold authentication
- Universal proxy re-encryption
- Amplifying the security of functional encryption, unconditionally
- Verifiable registration-based encryption
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Fully-secure MPC with minimal trust
- Functional encryption for set intersection in the multi-client setting
- On Adaptively Secure Multiparty Computation with a Short CRS
- Witness encryption and null-iO from evasive LWE
- Statistical security in two-party computation revisited
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- (Commit-and-prove) predictable arguments with privacy
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- On succinct arguments and witness encryption from groups
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Multi-input quadratic functional encryption: stronger security, broader functionality
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
- Obfuscating finite automata
- Permuted puzzles and cryptographic hardness
- Another step towards realizing random oracles: non-malleable point obfuscation
- How to Compute in the Presence of Leakage
- Cryptanalysis of the CLT13 multilinear map
- Lattice-based cryptography: a survey
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- On extractability obfuscation
- An improved affine equivalence algorithm for random permutations
- Point-function obfuscation: a framework and generic constructions
- Fully secure functional encryption for inner products, from standard assumptions
- CCA-secure inner-product functional encryption from projective hash functions
- Multi-input inner-product functional encryption from pairings
- Simplifying design and analysis of complex predicate encryption schemes
- Registration-based encryption: removing private-key generator from IBE
- Upgrading to functional encryption
- A ciphertext-size lower bound for order-preserving encryption with limited leakage
- A simple construction of iO for Turing machines
- Fine-grained secure computation
- FE and iO for Turing machines from minimal assumptions
- Return of GGH15: provable security against zeroizing attacks
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
- Cutting-edge cryptography through the lens of secret sharing
- Strong hardness of privacy from weak traitor tracing
- Verifiable functional encryption
- How to build time-lock encryption
- Survey of information security
- Indistinguishability obfuscation from compact functional encryption
- Functional encryption without obfuscation
- Cryptanalysis of GGH15 multilinear maps
- Witness encryption from smooth projective hashing system
- Indistinguishability obfuscation from functional encryption
- On the power of rewinding simulators in functional encryption
- Multi-client functional encryption for separable functions
- Impossibility of VBB obfuscation with ideal constant-degree graded encodings
- Lower bounds on assumptions behind indistinguishability obfuscation
- Output-compressing randomized encodings and applications
Uses Software
This page was built for publication: Candidate indistinguishability obfuscation and functional encryption for all circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816296)
