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)
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Cryptographic agents: towards a unified theory of computing on encrypted data
- Generalized hardness assumption for self-bilinear map with auxiliary information
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- How to Generate and Use Universal Samplers
- On Removing Graded Encodings from Functional Encryption
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Multi-input non-interactive functional encryption: constructions and applications
- Efficient obfuscation for CNF circuits and applications in cloud computing
- Public key encryption with equality test from generic assumptions in the random oracle model
- Signatures Resilient to Uninvertible Leakage
- Function-private functional encryption in the private-key setting
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- White-box cryptography: don't forget about grey-box attacks
- Multilinear maps from obfuscation
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Multi-input functional encryption and its application in outsourcing computation
- Private functional encryption: indistinguishability-based definitions and constructions from obfuscation
- Multi-input functional encryption with unbounded-message security
- Title not available (Why is that?)
- Constraining pseudorandom functions privately
- From Minicrypt to Obfustopia via private-key functional encryption
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Breaking the sub-exponential barrier in obfustopia
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Lattice-based SNARGs and their application to more efficient obfuscation
- Algorithms for CRT-variant of approximate greatest common divisor problem
- On the complexity of compressing obfuscation
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Obfuscating circuits via composite-order graded encoding
- Software watermarking: a semantics-based approach
- Finding shortest lattice vectors in the presence of gaps
- Secure multiparty RAM computation in constant rounds
- Semi-adaptive security and bundling functionalities made generic and easy
- Adaptive simulation security for inner product functional encryption
- Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
- Simple and efficient FE for quadratic functions
- Practical witness-key-agreement for blockchain-based dark pools financial trading
- Attribute based encryption for deterministic finite automata from DLIN
- Offline witness encryption
- Candidate iO from homomorphic encryption schemes
- Compact NIZKs from standard assumptions on bilinear maps
- Optimal broadcast encryption from pairings and LWE
- Proofs of Work from worst-case assumptions
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
- Obfuscation combiners
- Efficient and Provable White-Box Primitives
- Title not available (Why is that?)
- Structure versus hardness through the obfuscation lens
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Hardness of \(k\)-LWE and applications in traitor tracing
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- On virtual grey box obfuscation for general circuits
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Practical multi-party quantum homomorphic encryption
- Dynamic collusion bounded functional encryption from identity-based encryption
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Decentralized multi-client functional encryption for inner product
- Functional encryption for cubic polynomials and implementation
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Efficient and scalable universal circuits
- mrNISC from LWE with polynomial modulus
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Candidate iO from homomorphic encryption schemes
- (Inner-product) functional encryption with updatable ciphertexts
- SNARGs for monotone policy batch NP
- Generic constructions of master-key KDM secure attribute-based encryption
- Computational wiretap coding from indistinguishability obfuscation
- The pseudorandom oracle model and ideal obfuscation
- Non-interactive anonymous router with quasi-linear router computation
- Compact NIZKs from standard assumptions on bilinear maps
- Quantum attribute-based encryption: a comprehensive study
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- Lower bounds for the number of decryption updates in registration-based encryption
- A survey on functional encryption
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Registered ABE via predicate encodings
- Registered (inner-product) functional encryption
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- Can PPAD hardness be based on standard cryptographic assumptions?
- Maliciously secure massively parallel computation for all-but-one corruptions
- A framework for statistically sender private OT with optimal rate
- Round-optimal black-box MPC in the plain model
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Registered attribute-based encryption
- Unbounded quadratic functional encryption and more from pairings
- Efficient and universally composable single secret leader election from pairings
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
- Streaming functional encryption
- Tracing quantum state distinguishers via backtracking
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)
