Dynamic collusion bounded functional encryption from identity-based encryption
From MaRDI portal
Publication:2170069
Recommendations
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Functional encryption with bounded collusions via multi-party computation
- Optimal bounded-collusion secure functional encryption
- Functional encryption: new perspectives and lower bounds
- Functional encryption for bounded collusions, revisited
Cites work
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Bonsai trees, or how to delegate a lattice basis
- Bounded CCA2-Secure Encryption
- Bounded-collusion IBE from key homomorphism
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Collusion resistant traitor tracing from learning with errors
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Efficient lattice (H)IBE in the standard model
- Functional encryption for bounded collusions, revisited
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- Hardness of non-interactive differential privacy from one-way functions
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 2086699 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from well-founded assumptions
- New directions in cryptography
- Optimal bounded-collusion secure functional encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Semi-adaptive security and bundling functionalities made generic and easy
- Stronger security for reusable garbled circuits, general definitions and attacks
- Traitor-tracing from LWE made simple and attribute-based
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(14)- Functional encryption for bounded collusions, revisited
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Optimal bounded-collusion secure functional encryption
- Functional encryption with bounded collusions via multi-party computation
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- Functional encryption with secure key leasing
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- Public-key watermarkable PRFs with dynamic bounded collusion
- Multi-authority functional encryption with bounded collusions from standard assumptions
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Bounded collusion-resistant registered functional encryption for circuits
- Compact registered functional encryption for attribute-weighted sums with access control
This page was built for publication: Dynamic collusion bounded functional encryption from identity-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170069)
