New Constructions of Hierarchical Identity-Based Signature in the Standard Model

Abstract:

In this paper, a new construct of hierarchical identity-based signature(HIBS) scheme is proposed at first. It has many advantages over those available, such as fully secure without using random oracles, efficient signing algorithm. Additionally, it is provably secure under the computational Diffie-Hellman(CDH) assumption. This assumption is more natural than many of the hardness assumptions recently introduced to HIBS in the standard model. However, the length of its private key and signature increases as the hierarchy depth expands. Then a modified scheme is presented. The signature of modified scheme consists of three group elements and the private keys size shrinks as the identity depth increases. Under the h-CDH assumption, it is provable security in full security model without using random oracles.

• Periodical: Key Engineering Materials (Volumes 474-476)
• Pages: 1356-1361
• DOI: https://doi.org/10.4028/www.scientific.net/KEM.474-476.1356
• Online since: April 2011
• Authors: Qing Wu, Su Xia Sun
• Keywords: CDH Assumption, h-CDH assumption, Hierarchical Identity-Based Encryption, Hierarchical Identity-Based Signature, Provable Security

References

[1] A. Shamir. Identity-based Cryptosystems and Signature Schemes. Proc. of CRYPTO 1984, Lecture Notes in Computer Science 196, pp.47-53(1985).

DOI: 10.1007/3-540-39568-7_5

[2] C. Gentry and A. Silverberg. Hierarchical ID-Based Cryptography". Proc. of ASIACRYPT 2002, Lecture Notes in Computer Science 2501, pp.548-566(2002).

DOI: 10.1007/3-540-36178-2_34

[3] J. Horwitz and B. Lynn. Towards Hierarchical Identity-Based Encryption. Proc. of EUROCRYPT 2002, Lecture Notes in Computer Science 2332, pp.466-481(2002).

DOI: 10.1007/3-540-46035-7_31

[4] D. Boneh, X. Boyen. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles. Proc. of EUROCRYPT 2004, Lecture Notes in Computer Science 3027, pp.223-238(2004).

DOI: 10.1007/978-3-540-24676-3_14

[5] D. Boneh, X. Boyen and E. Goh. Hierarchical Identity based encryption with constant ciphertext. Proc. of Eurocrypt 2005, Lecture Notes in Computer Science 3494, pp.440-456( 2005).

DOI: 10.1007/11426639_26

[6] Sherman S.M. Chow, Lucas C.K. Hui, S. Yiu, and K.P. Chow. Secure Hierarchical Identity Based Signature and Its Application. Proc. of ICICS 2004, Lecture Notes in Computer Science 3269, pp.480-494( 2004).

DOI: 10.1007/978-3-540-30191-2_37

[7] J. Lin and F.G. Zhang et al. A New Hierarchical ID-Based Cryptosystem and CCA-Secure PKE. Proc. of EUC Workshops 2006, Lecture Notes in Computer Science 4097, pp.362-371 (2006).

DOI: 10.1007/11807964_37

[8] T.H. Yuen and V.K. Wei. Constant-Size Hierarchical Identity-Based Signature/ Signcryption without Random Oracles. Cryptology ePrint Archive, Report 2005/4129(2005). http: /eprint. iacr. org.

[9] Sanjit Chattterjee and Palash Sarkar. Generalization of the Selectve-ID Security Model for HIBE Protocols. Proc. Of PKC 2006, Lecture Notes in Computer Science 3958, pp.241-256(2006).

DOI: 10.1007/11745853_16

[10] Man Ho Au and Joseph K. Liu et cl. Efficient Hierarchical Identity Based Signature in the Standard Model. http: /eprint. iacr. org/2006/080.

[11] L.Y. Zhang, Y.P. Hu and Q. Wu. New Construction of Short Hierarchical ID-Based Signature in the Standard Model. FUNDAMENTA INFORMATICAE, Vol. 90(1-2), 191-201 (2009).

DOI: 10.3233/fi-2009-0013

[12] Sanjit Chatterjee and Palash Sarkar. New Constructions of Constant Size Ciphertext HIBE Without Random Oracle. Proc. of ICISC 2006, Lecture Notes in Computer Science 4296, pp.310-327(2006).

DOI: 10.1007/11927587_26

[13] F. Zhang, R. Safavi-Naini,W. Susilo. An efficient signature scheme from bilinear pairings and its applications. Proc. of PKC 2004 , Lecture Notes in Computer Science 2947, pp.277-290(2004).

DOI: 10.1007/978-3-540-24632-9_20