Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
6-2016
Abstract
In this paper, we propose a hierarchical identity-based encryption (HIBE) scheme in the random oracle (RO) model based on the learning with rounding (LWR) problem over small modulus $q$. Compared with the previous HIBE schemes based on the learning with errors (LWE) problem, the ciphertext expansion ratio of our scheme can be decreased to 1/2. Then, we utilize the HIBE scheme to construct a deterministic hierarchical identity-based encryption (D-HIBE) scheme based on the LWR problem over small modulus. Finally, with the technique of binary tree encryption (BTE) we can construct HIBE and D-HIBE schemes in the standard model based on the LWR problem over small modulus.
Keywords
(hierarchical) identity-based encryption; deterministic (hierarchical) identity-based encryption; learning with rounding
Discipline
Information Security
Research Areas
Cybersecurity
Areas of Excellence
Digital transformation
Publication
ASIA CCS '16: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, Xi'an, China, May 30 - June 3
First Page
907
Last Page
912
ISBN
9781450342339
Identifier
10.1145/2897845.2897922
Publisher
ACM
City or Country
New York
Citation
FANG, Fuyang; LI, Bao; LU, Xianhui; LIU, Yamin; JIA, Dingding; and XUE, Haiyang.
(Deterministic) hierarchical identity-based encryption from learning with rounding over small modulus. (2016). ASIA CCS '16: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, Xi'an, China, May 30 - June 3. 907-912.
Available at: https://ink.library.smu.edu.sg/sis_research/9181
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1145/2897845.2897922