Large universe subset predicate encryption based on static assumption (without random oracle)

DOI10.1007/978-3-030-12612-4_4MaRDI QIDQ2290442zbMATH OpenOpenAlexFDO

Authors Sanjit Chatterjee, Sayantan Mukherjee

Publication date 28 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-12612-4_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Subset predicate encryption and its applications
• Practical large universe attribute-set based encryption in the standard model
• On black-box constructions of predicate encryption from trapdoor permutations
• Hierarchical Predicate Encryption for Inner-Products
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

Cited in

(2)

• CCA-secure ABE using tag and pair encoding
• Subset predicate encryption and its applications

This page was built for publication: Large universe subset predicate encryption based on static assumption (without random oracle)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290442)