论文信息 - Comparing Performance of Hierarchical Identity-Based Signature Schemes

Comparing Performance of Hierarchical Identity-Based Signature Schemes

The key escrow problem and high computational cost are the two major problems that hinder the wider adoption of hierarchical identity-based signature (HIBS) scheme. HIBS schemes with either escrow-free (EF) or online/offline (OO) model have been proved secure in our previous work. However, there is no much EF or OO scheme that has been evaluated experimentally. In this letter, several EF/OO HIBS schemes are considered. We study the algorithmic complexity of the schemes both theoretically and experimentally. Scheme performance and practicability of EF and OO models are discussed. key words: identity-based signature, computational complexity, paring based cryptography

[1] Craig Gentry,et al. Hierarchical ID-Based Cryptography , 2002, ASIACRYPT.

[2] Siu-Ming Yiu,et al. Secure Hierarchical Identity Based Signature and Its Application , 2004, ICICS.

[3] Ali Al Imem. Comparison and evaluation of digital signature schemes employed in ndn network , 2015, ArXiv.

[4] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[5] Jinshu Su,et al. An Escrow-Free Hierarchical Identity-Based Signature Model for Cloud Storage , 2015, ICA3PP.

[6] Ilsun You,et al. An escrow-free online/offline HIBS scheme for privacy protection of people-centric sensing , 2016, Secur. Commun. Networks.

[7] Jung Hee Cheon,et al. An Identity-Based Signature from Gap Diffie-Hellman Groups , 2003, Public Key Cryptography.

[8] Xiaofeng Wang,et al. An Online/Offline HIBS Scheme for Privacy Protection of People-centric Sensing , 2015, 2015 International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration.