Indistinguishability obfuscation from compact functional encryption
From MaRDI portal
Recommendations
- Indistinguishability obfuscation from functional encryption
- When does functional encryption imply obfuscation?
- Breaking the sub-exponential barrier in obfustopia
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
Cites work
- Candidate Multilinear Maps from Ideal Lattices
- Computationally private randomizing polynomials and their applications
- Constrained pseudorandom functions and their applications
- Function-private identity-based encryption: hiding the function in functional encryption
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: new perspectives and lower bounds
- Functional signatures and pseudorandom functions
- Garbled RAM revisited
- How to garble RAM programs?
- Multi-input functional encryption
- On extractability obfuscation
- On the achievability of simulation-based security for functional encryption
- Practical multilinear maps over the integers
- Protecting obfuscation against algebraic attacks
- Two-round secure MPC from indistinguishability obfuscation
Cited in
(only showing first 100 items - show all)- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- Functional encryption against probabilistic queries: definition, construction and applications
- Multi-client attribute-based and predicate encryption, revisited
- Dynamic decentralized functional encryption: generic constructions with strong security
- Multi-client functional encryption with public inputs and strong security
- Predicate encryption from lattices: enhanced compactness and refined functionality
- On the black-box complexity of private-key inner-product functional encryption
- Multi-client attribute-based and predicate encryption from standard assumptions
- Multi-authority functional encryption with bounded collusions from standard assumptions
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Bounded collusion-resistant registered functional encryption for circuits
- Multi-input quadratic functional encryption: stronger security, broader functionality
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- On Removing Graded Encodings from Functional Encryption
- Structure-preserving compilers from new notions of obfuscations
- Candidate iO from homomorphic encryption schemes
- Functional broadcast encryption with applications to data sharing for cloud storage
- More efficient verifiable functional encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Indistinguishability obfuscation from well-founded assumptions
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- On constructing one-way permutations from indistinguishability obfuscation
- The pseudorandom oracle model and ideal obfuscation
- Multi-key and multi-input predicate encryption from learning with errors
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- Multi-input inner-product functional encryption from pairings
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Impossibility of simulation secure functional encryption even with random oracles
- Upgrading to functional encryption
- A simple construction of iO for Turing machines
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
- FE and iO for Turing machines from minimal assumptions
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Verifiable functional encryption
- Deniable fully homomorphic encryption from learning with errors
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Functional encryption without obfuscation
- Indistinguishability obfuscation from functional encryption
- Multi-input functional encryption with unbounded-message security
- Output-compressing randomized encodings and applications
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- A new paradigm for public-key functional encryption for degree-2 polynomials
- Limits on the power of indistinguishability obfuscation and functional encryption
- Delegating RAM computations with adaptive soundness and privacy
- Compactness vs collusion resistance in functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Functional Re-encryption and Collusion-Resistant Obfuscation
- Practical order-revealing encryption with limited leakage
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Breaking the sub-exponential barrier in obfustopia
- Lattice-based SNARGs and their application to more efficient obfuscation
- Nonmalleable digital lockers and robust fuzzy extractors in the plain model
- From Minicrypt to Obfustopia via private-key functional encryption
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- On constructing one-way permutations from indistinguishability obfuscation
- Universal ring signatures in the standard model
- Functional Encryption for Turing Machines
- Multi-input quadratic functional encryption from pairings
- Registered (inner-product) functional encryption
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- Simple and generic constructions of succinct functional encryption
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- On the complexity of compressing obfuscation
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Lower bounds on inner-product functional encryption from all-or-nothing encryption primitives
- Obfuscating pseudorandom functions is post-quantum complete
- Pseudorandom FE, iO and applications
- (Multi-input) \textsf{FE} for randomized functionalities, revisited
- Adaptively secure streaming functional encryption
- Multi-party functional encryption
- Semi-adaptive security and bundling functionalities made generic and easy
- Collusion-resistant functional encryption for RAMs
- Simple and efficient FE for quadratic functions
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Streaming functional encryption
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Adaptive multiparty NIKE
- How to use indistinguishability obfuscation
- Indistinguishability obfuscation
- Updatable policy-compliant signatures
- Cryptanalysis of candidate obfuscators for affine determinant programs
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Candidate iO from homomorphic encryption schemes
- Impossibility results for lattice-based functional encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- 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
- Lattice-based obfuscation from NTRU and equivocal LWE
- Pseudorandom obfuscation and applications
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- PKE and ABE with collusion-resistant secure key leasing
- Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
- Obfustopia built on secret-key functional encryption
- When does functional encryption imply obfuscation?
This page was built for publication: Indistinguishability obfuscation from compact functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457116)
