Simplified server-aided revocable identity-based encryption from lattices
From MaRDI portal
Publication:6173116
DOI10.1007/978-3-031-20917-8_6zbMath1518.94102MaRDI QIDQ6173116
Yan-Hua Zhang, Yu Pu Hu, Ximeng Liu
Publication date: 21 July 2023
Published in: Provable and Practical Security (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)
Cites Work
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Server-aided revocable identity-based encryption from lattices
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
- Generic construction of server-aided revocable hierarchical identity-based encryption
- Revocable identity-based encryption with server-aided ciphertext evolution
- Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Revocable Identity-Based Encryption from Lattices
- Identity-Based Cryptosystems and Signature Schemes
- Simplified Revocable Hierarchical Identity-Based Encryption from Lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Adaptive-ID Secure Revocable Identity-Based Encryption
- Revocable Identity-Based Encryption Revisited: Security Model and Construction
- Generic Constructions of Revocable Identity-Based Encryption
- Server-Aided Revocable Identity-Based Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
This page was built for publication: Simplified server-aided revocable identity-based encryption from lattices