Versatile identity-based signatures for authentication in multi-user settings

This paper proposes a new identity-based signature scheme. The new scheme is proven to be existentially unforgeable against Chosen-Principle and Chosen-Message CP-CM attackers who are the strongest attackers so far defined for identity-based signatures. The security of our scheme relies on the standard Computational Diffie-Hellman CDH assumption. The proof is given in the random oracle model where a hash function is modelled as random oracle. Analysis shows that our scheme is also more efficient than the state of the art in terms of computation and communication. We finally improve the basic scheme by eliminating the single-point problem, allow using as a proxy signature scheme and enable fast verification in multi-user settings. The basic scheme and its extensions show that our proposal is versatile to realise efficient and secure authentication in various scenarios.

[1]  Mihir Bellare,et al.  Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions , 2003, EUROCRYPT.

[2]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[3]  Doan B. Hoang,et al.  Multi-layer security analysis and experimentation of high speed protocol data transfer for GRID , 2012, Int. J. Grid Util. Comput..

[4]  Mihir Bellare,et al.  Fast Batch Verification for Modular Exponentiation and Digital Signatures , 1998, IACR Cryptol. ePrint Arch..

[5]  Yupu Hu,et al.  New Identity-based Short Signature Without Random Oracles , 2011 .

[6]  Hairong Qi,et al.  Self-certified group key generation for ad hoc clusters in wireless sensor networks , 2005, Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005..

[7]  Jacques Stern,et al.  Security Arguments for Digital Signatures and Blind Signatures , 2015, Journal of Cryptology.

[8]  Yue Wang,et al.  A new proxy blind signature scheme , 2012, Int. J. Grid Util. Comput..

[9]  Brent Waters,et al.  Identity-Based Encryption Secure against Selective Opening Attack , 2011, TCC.

[10]  Dan Boneh,et al.  Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..

[11]  Yue Wang,et al.  Fairness electronic payment protocol , 2012, Int. J. Grid Util. Comput..

[12]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[13]  Jianfeng Ma,et al.  A method for efficient parallel computation of Tate pairing , 2012, Int. J. Grid Util. Comput..

[14]  Brent Waters,et al.  Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.

[15]  Deepa Kundur,et al.  Distributed Secret Sharing for Discrete Memoryless Networks , 2008, IEEE Transactions on Information Forensics and Security.

[16]  L. Washington.  Elliptic Curves: Number Theory and Cryptography , 2003 .

[17]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[18]  Hiroshi Shigeno,et al.  P2P video-on-demand streaming using caching and reservation scheme based on video popularity , 2012, Int. J. Grid Util. Comput..

[19]  Dan Boneh,et al.  Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups , 2008, Journal of Cryptology.

[20]  N. Asokan,et al.  Key agreement in ad hoc networks , 2000, Comput. Commun..

[21]  Vipul Goyal,et al.  Reducing Trust in the PKG in Identity Based Cryptosystems , 2007, CRYPTO.

[22]  Josep Domingo-Ferrer,et al.  Balanced Trustworthiness, Safety, and Privacy in Vehicle-to-Vehicle Communications , 2010, IEEE Transactions on Vehicular Technology.