Compactness vs collusion resistance in functional encryption
From MaRDI portal
Recommendations
- Functional encryption with bounded collusions via multi-party computation
- Collusion-resistant functional encryption for RAMs
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Optimal bounded-collusion secure functional encryption
Cites work
- scientific article; zbMATH DE number 2086721 (Why is no real title available?)
- A punctured programming approach to adaptively secure functional encryption
- An equational approach to secure multi-party computation
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constant-round concurrent zero-knowledge from indistinguishability obfuscation
- Cryptanalysis of the multilinear map over the integers
- Equational security proofs of oblivious transfer protocols
- From selective to adaptive security in functional encryption
- Function-private functional encryption in the private-key setting
- Functional Re-encryption and Collusion-Resistant Obfuscation
- Functional encryption: new perspectives and lower bounds
- Functional encryption: origins and recent developments
- Graph-induced multilinear maps from lattices
- How to use indistinguishability obfuscation
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- New Multilinear Maps Over the Integers
- Obfuscating circuits via composite-order graded encoding
- On best-possible obfuscation
- On the (im)possibility of obfuscating programs
- Practical multilinear maps over the integers
- Protecting obfuscation against algebraic attacks
- Reusable garbled circuits and succinct functional encryption
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Time-lock puzzles from randomized encodings
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Cited in
(22)- Indistinguishability obfuscation from bilinear maps and LPN variants
- On Removing Graded Encodings from Functional Encryption
- The pseudorandom oracle model and ideal obfuscation
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- FE and iO for Turing machines from minimal assumptions
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Functional encryption for bounded collusions, revisited
- Single-key to multi-key functional encryption with polynomial loss
- Functional Re-encryption and Collusion-Resistant Obfuscation
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Simple and generic constructions of succinct functional encryption
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Collusion-resistant functional encryption for RAMs
- Streaming functional encryption
- Obfustopia built on secret-key functional encryption
- Combiners for functional encryption, unconditionally
- Lower bounds for lattice-based compact functional encryption
- From cryptomania to obfustopia through secret-key functional encryption
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Optimal bounded-collusion secure functional encryption
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
This page was built for publication: Compactness vs collusion resistance in functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181036)
