Paper 2024/026
Towards Compact Identity-based Encryption on Ideal Lattices
Abstract
Basic encryption and signature on lattices have comparable efficiency to their classical counterparts in terms of speed and key size. However, Identity-based Encryption (IBE) on lattices is much less efficient in terms of compactness, even when instantiated on ideal lattices and in the Random Oracle Model (ROM). This is because the underlying preimage sampling algorithm used to extract the users' secret keys requires huge public parameters. In this work, we specify a compact IBE instantiation for practical use by introducing various optimizations. Specifically, we first propose a modified gadget to make it more suitable for the instantiation of practical IBE. Then, by incorporating our gadget and the non-spherical Gaussian technique, we provide an efficient preimage sampling algorithm, based on which, we give a specification of a compact IBE on ideal lattice. Finally, two parameter sets and a proof-of-concept implementation are presented. Given the importance of the preimage sampling algorithm in lattice-based cryptography, we believe that our technique can also be applied to the practical instantiation of other advanced cryptographic schemes.
Note: Accepted to CT-RSA 2024
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Lattice; Preimage sampling; IBE
- Contact author(s)
-
hwjia @ gzhu edu cn
yphu @ mail xidian edu cn
ctang @ gzhu edu cn
wanglin4math @ outlook com - History
- 2024-01-08: approved
- 2024-01-08: received
- See all versions
- Short URL
- https://ia.cr/2024/026
- License
-
CC BY-SA
BibTeX
@misc{cryptoeprint:2024/026,
author = {Huiwen Jia and Yupu Hu and Chunming Tang and Lin Wang},
title = {Towards Compact Identity-based Encryption on Ideal Lattices},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/026},
year = {2024},
url = {https://eprint.iacr.org/2024/026}
}
