Title: Efficient hierarchical identity-based signatures from lattices

Authors: Miaomiao Tian; Liusheng Huang; Wei Yang

Addresses: School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China ' School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China ' School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China

Abstract: Lattice-based hierarchical identity-based signature (HIBS) schemes are receiving significant attention due to provable security reductions and potential security for quantum computers. However, most of the existing HIBS schemes based on lattices are less efficient for practical applications. To make lattice-based HIBS schemes become more practical, this paper presents an efficient HIBS scheme from lattices. Both the secret key size and the signature length of our proposal are much shorter than those of other lattice-based HIBS proposals. Our scheme is proven to be strongly unforgeable against adaptive identity attacks in the random oracle model. The security of the construction relies on the standard short integer solution (SIS) assumption.

Keywords: identity-based cryptography; digital signatures; lattices; efficiency; hierarchical identity-based signatures; HIBS; secret key size; signature length; adaptive identity attacks; random oracle model; security.

DOI: 10.1504/IJESDF.2013.054403

International Journal of Electronic Security and Digital Forensics, 2013 Vol.5 No.1, pp.1 - 10

Received: 21 Jul 2012
Accepted: 08 Oct 2012

Published online: 26 Jul 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article