A review on pairing based cryptography in Wireless Sensor Networks

This paper, presents a detailed review of the works on pairing algorithm and its application in Identity-Based Encryption (IBE) scheme for Wireless Sensor Networks (WSNs). WSNs device is a device that resource constrained, limited memory storage and open to a third party attack. This issue has been widely recognized and much research has been in this area, improving the hardware and the software. The main focus of many scholars was on the pairing algorithm which applied with Identity Based Scheme. By investigating works on pairing, studies found that, Ate pairing is currently the fastest pairing algorithm available. This research is hope to enhance current understanding on the 32-bit platform on the future work.

[1]  Michael Scott,et al.  On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves , 2009, Pairing.

[2]  Frederik Vercauteren,et al.  The Eta Pairing Revisited , 2006, IEEE Transactions on Information Theory.

[3]  Paulo S. L. M. Barreto,et al.  Efficient pairing computation on supersingular Abelian varieties , 2007, IACR Cryptol. ePrint Arch..

[4]  Frederik Vercauteren,et al.  Faster -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves , 2009, CHES.

[5]  Michael Scott,et al.  On the application of pairing based cryptography to wireless sensor networks , 2009, WiSec '09.

[6]  Ricardo Dahab,et al.  TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[7]  Tsuyoshi Takagi,et al.  Efficient Implementation of Pairing on BREW Mobile Phones , 2010, IWSEC.

[8]  Jiwu Huang,et al.  A note on the Ate pairing , 2008, International Journal of Information Security.

[9]  Iwan M. Duursma,et al.  Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d , 2003, ASIACRYPT.

[10]  Ricardo Dahab,et al.  Implementing Cryptographic Pairings over Barreto-Naehrig Curves , 2007, Pairing.

[11]  Eiji Okamoto,et al.  Optimised Versions of the Ate and Twisted Ate Pairings , 2007, IMACC.

[12]  Xiaotie Deng,et al.  TinyPairing: Computing Tate Pairing on Sensor Nodes with Higher Speed and Less Memory , 2009, 2009 Eighth IEEE International Symposium on Network Computing and Applications.

[13]  Hairong Qi,et al.  Revisiting Public-Key Cryptography for Wireless Sensor Networks , 2005, Computer.

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

[15]  Steven D. Galbraith,et al.  Implementing the Tate Pairing , 2002, ANTS.

[16]  Ricardo Dahab,et al.  TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks , 2008, 2008 5th International Conference on Networked Sensing Systems.

[17]  G. Frey,et al.  A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .

[18]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.