Functional encryption for bounded collusions, revisited
From MaRDI portal
Recommendations
- Functional encryption with bounded collusions via multi-party computation
- Optimal bounded-collusion secure functional encryption
- Dynamic collusion bounded functional encryption from identity-based encryption
- Functional Re-encryption and Collusion-Resistant Obfuscation
- Compactness vs collusion resistance in functional encryption
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Functional encryption: new perspectives and lower bounds
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Limits on the power of indistinguishability obfuscation and functional encryption
Cited in
(31)- Traitor-tracing from LWE made simple and attribute-based
- Stronger security for reusable garbled circuits, general definitions and attacks
- Functional encryption for cubic polynomials and implementation
- Impossibility results for lattice-based functional encryption schemes
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
- Dynamic collusion bounded functional encryption from identity-based encryption
- Optimal bounded-collusion secure functional encryption
- Succinct LWE sampling, random polynomials, and obfuscation
- Functional Re-encryption and Collusion-Resistant Obfuscation
- Functional encryption with bounded collusions via multi-party computation
- Adaptive simulation security for inner product functional encryption
- Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper)
- Reusable garbled circuits and succinct functional encryption
- Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
- Obfustopia built on secret-key functional encryption
- Bounded-collusion decentralized ABE with sublinear parameters
- Collusion-resistant functional encryption for RAMs
- Public-key watermarking schemes for pseudorandom functions
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- Lower bounds for lattice-based compact functional encryption
- Certified everlasting secure collusion-resistant functional encryption, and more
- FE for inner products and its application to multi-authority ABE
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- Public-key watermarkable PRFs with dynamic bounded collusion
- Predicate encryption from lattices: enhanced compactness and refined functionality
- Multi-authority functional encryption with bounded collusions from standard assumptions
- Bounded collusion-resistant registered functional encryption for circuits
This page was built for publication: Functional encryption for bounded collusions, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690192)
