Subset predicate encryption and its applications
From MaRDI portal
Recommendations
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Large universe subset predicate encryption based on static assumption (without random oracle)
- Predicate encryption with partial public keys
- Predicate encryption from bilinear maps and one-sided probabilistic rank
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
Cited in
(9)- Large universe subset predicate encryption based on static assumption (without random oracle)
- Conversions among several classes of predicate encryption and applications to ABE with various compactness tradeoffs
- On black-box reductions between predicate encryption schemes
- An Efficient Predicate Encryption with Constant Pairing Computations and Minimum Costs
- Lightweight delegated subset test with privacy protection
- Predicate encryption with partial public keys
- On black-box constructions of predicate encryption from trapdoor permutations
- Homomorphic signatures for subset and superset mixed predicates and its applications
- Predicate encryption with selective-opening security for receivers: formal definition, generic construction, and concrete instantiations for several primitives
This page was built for publication: Subset predicate encryption and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166068)