Indistinguishability obfuscation from functional encryption
From MaRDI portal
Cited in
(22)- Lattice-based obfuscation from NTRU and equivocal LWE
- Pseudorandom obfuscation and applications
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
- Succinct randomized encodings from laconic function evaluation, faster and simpler
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Hierarchical functional encryption for quadratic transformation
- Homomorphic indistinguishability obfuscation and its applications
- A simple inner-product functional encryption scheme from the inverse-DDH assumption
- Dynamic decentralized functional encryption: generic constructions with strong security
- Predicate encryption from lattices: enhanced compactness and refined functionality
- On the black-box complexity of private-key inner-product functional encryption
- Multi-authority functional encryption with bounded collusions from standard assumptions
- Towards general-purpose program obfuscation via local mixing
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Bounded collusion-resistant registered functional encryption for circuits
- Indistinguishability obfuscation from well-founded assumptions
- Lower bounds on inner-product functional encryption from all-or-nothing encryption primitives
- Obfuscating pseudorandom functions is post-quantum complete
- Adaptively secure streaming functional encryption
- Proofs of no intrusion
- Lower bounds on the overhead of indistinguishability obfuscation
This page was built for publication: Indistinguishability obfuscation from functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946893)
