A Light-Weight Rainbow Signature Scheme for WSN

Since the wireless sensor network (WSN) is limited by power, computation capability and storage resources, it is difficult for the existed cryptographic schemes which are based on the traditional symmetric or public key cryptography to adapt to these restrictions. Till  now, most studies are based on the Elliptic Digital Signature  Algorithm (ECDSA), however, which have heavy energy consumption and cost much verification time, they are still  not suitable for the WSN. Thus it is necessary to find a new cryptography to provide the security for the WSN. In this  paper, firstly, we propose a light-weight rainbow signature (LWRS) scheme based on Shamir's minus method, and the performances of it has been evaluated with respect to the memory and computation time. Secondly, by choosing the proper number of variables, we use the scheme between the nodes or between the WSN and the business platform of the internet of things. Meanwhile, we set up the layer of the LWRS the same as that of the cluster WSN. That is, the ordinary node has the lowest energy and corresponds to the first layer of the LWRS scheme. Finally, we give the security analysis of the LWRS scheme. More specifically speaking, by choosing the appropriate number of oil-vinegar variables, our scheme can resist general attacks, rank reduction attacks and oil-vinegar attacks, etc.

[1]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[2]  David Boyle,et al.  Securing Wireless Sensor Networks: Security Architectures , 2008, J. Networks.

[3]  XiaoYang,et al.  Energy efficient Chessboard Clustering and routing in heterogeneous sensor networks , 2006 .

[4]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[5]  Xiaojiang Du,et al.  Energy efficient Chessboard Clustering and routing in heterogeneous sensor networks , 2006, Int. J. Wirel. Mob. Comput..

[6]  Ming Lu Study on Secret Key Management Project of WSN Based on ECC , 2012, J. Networks.

[7]  Jintai Ding,et al.  Secure Electronic Voting , 2006, Advances in Information Security.

[8]  Ricardo Dahab,et al.  NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks , 2008, EWSN.

[9]  Suresh Singh,et al.  Exploiting heterogeneity in sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  Adi Shamir,et al.  Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations , 2000, EUROCRYPT.

[11]  Peter Langendörfer,et al.  How public key cryptography influences wireless sensor node lifetime , 2006, SASN '06.

[12]  Jean Charles Faugère,et al.  A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.

[13]  Jintai Ding,et al.  Rainbow, a New Multivariable Polynomial Signature Scheme , 2005, ACNS.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[16]  Sasikanth Avancha,et al.  Security for Sensor Networks , 2004 .

[17]  Donggang Liu,et al.  Establishing pairwise keys in distributed sensor networks , 2005, TSEC.

[18]  Adi Shamir,et al.  Efficient Signature Schemes Based on Birational Permutations , 1993, CRYPTO.

[19]  Mingyan Liu,et al.  Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[20]  Jacques Patarin,et al.  Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.

[21]  Ariel Shamir,et al.  Cryptanalysis of the oil and vinegar signature scheme , 1998 .

[22]  Xi-Jin Tang,et al.  Applying Dixon Resultants in Cryptography , 2007 .

[23]  Louis Goubin,et al.  C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai , 1998, ASIACRYPT.

[24]  Jean-Charles Faugère,et al.  On the Security of UOV , 2008, IACR Cryptol. ePrint Arch..