Noncommutative Lightweight Signcryption for Wireless Sensor Networks

Key management techniques for secure wireless-sensor-networks-based applications must minimally incorporate confidentiality, authenticity, integrity, scalability, and flexibility. Signcryption is the proper primitive to do this. However, existing signcryption schemes are heavyweight and not suitable for resource-limited sensors. In this paper, we at first propose a braid-based signcryption scheme and then develop a key establishment protocol for wireless sensor networks. From the complexity view, our proposal is 215 times faster than RSA-based ones. As far as we know, our proposal is the first signcryption scheme based on noncommutative algebraic structures.

[1]  Patrick Dehornoy,et al.  Using shifted conjugacy in braid-based cryptography , 2006, ArXiv.

[2]  Jung Hee Cheon,et al.  New Public-Key Cryptosystem Using Braid Groups , 2000, CRYPTO.

[3]  Hideki Imai,et al.  How to Construct Efficient Signcryption Schemes on Elliptic Curves , 1998, Inf. Process. Lett..

[4]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[5]  James Hughes,et al.  A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem , 2002, ACISP.

[6]  Yuliang Zheng,et al.  Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.

[7]  Volker Gebhardt,et al.  Conjugacy in Garside groups III: Periodic braids , 2006 .

[8]  Patrick Dehornoy.  Braid-based cryptography , 2004 .

[9]  Jianhong Zhang,et al.  A Novel Identity-Based Multi-Signcryption Scheme , 2009 .

[10]  Alexander W. Dent,et al.  Hybrid Signcryption Schemes with Outsider Security , 2005, ISC.

[11]  Longjun Zhang,et al.  A signcryption scheme for WEP in WLAN based on bilinear pairings , 2010, 2010 International Conference on Computer Application and System Modeling (ICCASM 2010).

[12]  Delaram Kahrobaei,et al.  Non-commutative digital signatures , 2012, Groups Complex. Cryptol..

[13]  Yuliang Zheng,et al.  Practical Signcryption , 2010, Information Security and Cryptography.

[14]  Volker Gebhardt,et al.  Conjugacy in Garside groups I: cyclings, powers and rigidity , 2006, math/0605230.

[15]  Iris Anshel,et al.  New Key Agreement Protocols in Braid Group Cryptography , 2001, CT-RSA.

[16]  Vladimir Shpilrain,et al.  An Authentication Scheme Based on the Twisted Conjugacy Problem , 2008, ACNS.

[17]  Jang-Won Lee,et al.  Towards generating secure keys for braid cryptography , 2007, Des. Codes Cryptogr..

[18]  Mohsen Toorani,et al.  A directly public verifiable signcryption scheme based on elliptic curves , 2009, 2009 IEEE Symposium on Computers and Communications.

[19]  Minyi Guo,et al.  HARVEST: A Task-objective Efficient Data Collection Scheme in Wireless Sensor and Actor Networks , 2011, 2011 Third International Conference on Communications and Mobile Computing.

[20]  Wenbo Mao,et al.  Two Birds One Stone: Signcryption Using RSA , 2003, CT-RSA.

[21]  Mianxiong Dong,et al.  TinyBee: Mobile-Agent-Based Data Gathering System in Wireless Sensor Networks , 2009, 2009 IEEE International Conference on Networking, Architecture, and Storage.

[22]  Volker Gebhardt,et al.  Conjugacy in Garside groups II: structure of the ultra summit set , 2006 .

[23]  Jang-Won Lee,et al.  New Signature Scheme Using Conjugacy Problem , 2002, IACR Cryptol. ePrint Arch..

[24]  Jung Hee Cheon,et al.  An Efficient Implementation of Braid Groups , 2001, ASIACRYPT.

[25]  Andrei V. Kelarev,et al.  Braid-based cryptography , 2005 .

[26]  Samuel Maffre.  A Weak Key Test for Braid Based Cryptography , 2006 .

[27]  Tatsuaki Okamoto,et al.  How to Enhance the Security of Public-Key Encryption at Minimum Cost , 1999, Public Key Cryptography.

[28]  Zhenfu Cao,et al.  One-more matching conjugate problem and security of braid-based signatures , 2007, ASIACCS '07.

[29]  Don Coppersmith.  Modifications to the Number Field Sieve , 2004, Journal of Cryptology.

[30]  W. Marsden.  I and J , 2012 .

[31]  Maxim Prasolov.  Small braids having a big Ultra Summit Set , 2009 .

[32]  Zhenfu Cao,et al.  New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems , 2010, Inscrypt.

[33]  Peng Ning,et al.  2008 International Conference on Information Processing in Sensor Networks TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks ∗ , 2022 .

[34]  D. Goldfeld,et al.  An algebraic method for public-key cryptography , 1999 .

[35]  Zhenfu Cao,et al.  Transitive Signatures from Braid Groups , 2007, INDOCRYPT.

[36]  Tim Güneysu,et al.  MicroECC: A Lightweight Reconfigurable Elliptic Curve Crypto-processor , 2011, 2011 International Conference on Reconfigurable Computing and FPGAs.

[37]  Yupu Hu,et al.  Post-Quantum Secure Hybrid Signcryption from Lattice Assumption , 2012 .

[38]  Zhenfu Cao,et al.  New public key cryptosystems based on non-Abelian factorization problems , 2013, Secur. Commun. Networks.

[39]  Zhenfu Cao,et al.  Conjugate adjoining problem in braid groups and new design of braid-based signatures , 2010, Science China Information Sciences.

[41]  Ron Steinfeld,et al.  A Signcryption Scheme Based on Integer Factorization , 2000, ISW.

[42]  Ueli Maurer,et al.  Abstract Models of Computation in Cryptography , 2005, IMACC.

[43]  Fahad Bin Muhaya,et al.  Lattice‐based signcryption , 2013, Concurr. Comput. Pract. Exp..

[44]  Esam A. A. A. Hagras,et al.  Energy efficient key management scheme based on elliptic curve signcryption for Wireless Sensor Networks , 2011, 2011 28th National Radio Science Conference (NRSC).