Publication Type
Journal Article
Version
publishedVersion
Publication Date
10-2020
Abstract
Hierarchical identity-based signature (HIBS) plays a core role in a large community as it significantly reduces the workload of the root private key generator. To make HIBS still available and secure in post-quantum era, constructing lattice-based schemes is a promising option. In this paper, we present an efficient HIBS scheme in polynomial rings. Although there are many lattice-based signatures proposed in recent years, to the best of our knowledge, our HIBS scheme is the first ring-based construction. In the center of our construction are two new algorithms to extend lattice trapdoors to higher dimensions, which are non-trivial and of independent interest. With these techniques, the security of the new scheme can be proved, assuming the hardness of the Ring-SIS problem. Since operations in the ring setting are much faster than those over integers and the new construction is the first ring-base HIBS scheme, our scheme is more efficient and practical in terms of computation and storage cost when comparing to the previous constructions.
Keywords
HIBS, Lattice, Ring-SIS, Post-Quantum
Discipline
Information Security
Research Areas
Information Systems and Management
Publication
Computer Journal
Volume
63
Issue
10
First Page
1490
Last Page
1499
ISSN
0010-4620
Identifier
10.1093/comjnl/bxaa033
Publisher
Oxford University Press (OUP): Policy B - Oxford Open Option B
Citation
YANG, Zhichao; DUONG, Dung H.; SUSILO, Willy; YANG, Guomin; LI, Chao; and CHEN, Rongmao.
Hierarchical identity-based signature in polynomial rings. (2020). Computer Journal. 63, (10), 1490-1499.
Available at: https://ink.library.smu.edu.sg/sis_research/7328
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://doi.org/10.1093/comjnl/bxaa033
