Compact hierarchical identity-based encryption based on a harder decisional problem

DOI10.1080/00207160.2014.912278zbMATH Open1375.94126OpenAlexW2066252938WikidataQ121174662 ScholiaQ121174662MaRDI QIDQ5259051FDOQ5259051

David Galindo

Publication date: 24 June 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.912278

zbMATH Keywords

standard modelgeneric modelhard problemshierarchical identity-based encryptiondecisional assumptions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
• Hierarchical ID-Based Cryptography
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
• Security Analysis of the Strong Diffie-Hellman Problem
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• Discrete logarithm problems with auxiliary inputs
• Delegating Capabilities in Predicate Encryption Systems
• Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem

Cited In (2)

• An identity-based encryption scheme with compact ciphertexts
• An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment

This page was built for publication: Compact hierarchical identity-based encryption based on a harder decisional problem

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