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)- Gap MCSP is not (Levin) NP-complete in obfustopia
- Combiners for functional encryption, unconditionally
- Cryptography with updates
- From FE combiners to secure MPC and back
- Lower bounds for lattice-based compact functional encryption
- From cryptomania to obfustopia through secret-key functional encryption
- Multi-input attribute based encryption and predicate encryption
- Obfuscation combiners
- Amplifying the security of functional encryption, unconditionally
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- On virtual grey box obfuscation for general circuits
- Succinct randomized encodings from laconic function evaluation, faster and simpler
- Succinct LWE sampling, random polynomials, and obfuscation
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Time-lock puzzles from lattices
- Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Hierarchical functional encryption for quadratic transformation
- Constrained pseudorandom functions from functional encryption
- Homomorphic indistinguishability obfuscation and its applications
- A simple inner-product functional encryption scheme from the inverse-DDH assumption
- Witness encryption and null-iO from evasive LWE
- Dynamic collusion bounded functional encryption from identity-based encryption
- One-Way Functions and (Im)perfect Obfuscation
- Optimal bounded-collusion secure functional encryption
- Indistinguishability obfuscation: from approximate to exact
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Cryptography. Abstracts from the workshop held January 19--24, 2025
- Adaptively simulation-secure attribute-hiding predicate encryption
- Functional encryption for cubic polynomials and implementation
- A minor note on obtaining simpler iO constructions via depleted obfuscators
- Cryptanalyses of Candidate Branching Program Obfuscators
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- 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
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)
