Efficient ID-based multiproxy multisignature without bilinear maps in ROM

Most of the previously proposed identity-based multiproxy multisignature (IBMPMS) schemes used pairings in their construction. But pairing is regarded as an expensive cryptographic primitive in terms of complexity. The relative computation cost of a pairing is approximately more than ten times of the scalar multiplication over elliptic curve group. So, to reduce running time, we first define a model of a secure MPMS scheme, then propose an IBMPMS scheme without using pairings. We also prove the security of our scheme against chosen message attack in random oracle model. Our scheme’s construction avoids bilinear pairing operations but still provides signature in the ID-based setting and reduces running time heavily. Therefore, proposed scheme is more applicable than previous schemes in terms of computational efficiency for practical applications.

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

[2]  Min-Shiang Hwang,et al.  An Ordered Multi-proxy Multi-signature Scheme , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

[3]  Sahadeo Padhye,et al.  An ID-based multi-proxy multi-signature scheme , 2010, 2010 International Conference on Computer and Communication Technology (ICCCT).

[4]  Kefei Chen,et al.  ID-based multi-proxy signature, proxy multi-signature and multi-proxy multi-signature schemes from bilinear pairings , 2005, Appl. Math. Comput..

[5]  Hwang Shin-Jia,et al.  New multi-proxy multi-signature schemes , 2004 .

[6]  Liqun Chen,et al.  Identity-based key agreement protocols from pairings , 2017, International Journal of Information Security.

[7]  Ashutosh Saxena,et al.  C R ] 2 0 D ec 2 00 6 Algorithms and Approaches of Proxy Signature : A Survey MANIK , 2008 .

[8]  Zhenfu Cao,et al.  An Efficient ID-Based Multi-proxy Multi-Signature Scheme , 2006, First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06).

[9]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[10]  Lifeng Guo,et al.  Insider attacks on multi-proxy multi-signature schemes , 2007, Comput. Electr. Eng..

[11]  Yuh-Dauh Lyuu,et al.  Cryptanalysis of and improvement on the Hwang-Chen multi-proxy multi-signature schemes , 2005, Appl. Math. Comput..

[12]  He Debiao,et al.  An ID-based proxy signature schemes without bilinear pairings , 2011 .

[13]  Joonsang Baek,et al.  Efficient online/offline identity-based signature for wireless sensor network , 2010, International Journal of Information Security.

[14]  Xiaoni Du,et al.  A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges , 2010, Inf. Sci..

[15]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[16]  Wenjing Lou,et al.  On Broadcast Authentication in Wireless Sensor Networks , 2007 .

[17]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[18]  M. Mambo,et al.  Proxy Signatures: Delegation of the Power to Sign Messages (Special Section on Information Theory and Its Applications) , 1996 .