Compact hierarchical identity-based encryption based on a harder decisional problem
From MaRDI portal
Publication:5259051
DOI10.1080/00207160.2014.912278zbMath1375.94126OpenAlexW2066252938WikidataQ121174662 ScholiaQ121174662MaRDI QIDQ5259051
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
standard modelgeneric modelhard problemshierarchical identity-based encryptiondecisional assumptions
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Cites Work
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
- Delegating Capabilities in Predicate Encryption Systems
- Security Analysis of the Strong Diffie-Hellman Problem
- 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
- Discrete logarithm problems with auxiliary inputs