Generic construction of server-aided revocable hierarchical identity-based encryption
From MaRDI portal
Publication:2057130
DOI10.1007/978-3-030-71852-7_5zbMath1479.94223OpenAlexW3138116855MaRDI QIDQ2057130
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-71852-7_5
Related Items (1)
Cites Work
- Unnamed Item
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Identity-based encryption from the Diffie-Hellman assumption
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
- Identity-Based Cryptosystems and Signature Schemes
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- Server-Aided Revocable Identity-Based Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
This page was built for publication: Generic construction of server-aided revocable hierarchical identity-based encryption