On the application of Pairing Based Cryptography to Wireless Sensor Networks

Proceedings of the 2nd ACM Conference on Wireless Network Security, WiSec'09

Volumn , Issue , 2009, Pages 1-12

  Szczechowiak, Piotr ^a   Kargl, Anton ^b   Scott, Michael ^a   Collier, Martin ^a  

^a DUBLIN CITY UNIVERSITY   (Ireland)

^b SIEMENS AG   (Germany)

Author keywords

Implementation; Pairing Based Cryptography; Security protocols; Wireless Sensor Networks

Indexed keywords

ELLIPTIC CURVE CRYPTOGRAPHY; IMPLEMENTATION; IN-DEPTH STUDY; KEY EXCHANGE; KEY EXCHANGE PROTOCOLS; NODE COMPROMISE; NON-INTERACTIVE; PAIRING-BASED CRYPTOGRAPHY; RESEARCH RESULTS; RESOURCE-CONSTRAINED; SECURITY PROTOCOLS; SENSOR DEVICE; SYSTEM LEVELS;

CRYPTOGRAPHY; INTERNET; NETWORK PROTOCOLS; NETWORK SECURITY; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 70349154616     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514274.1514276     Document Type: Conference Paper

References (48)

1. Atmel. ATmega128(L) datasheet, 2006. http://www.atmel.com.
2. P. S. L. M. Barreto, S. Galbraith, C. O'hEigeartaigh, and M. Scott. Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography, 42:239-271, 2007.
3. P. S. L. M. Barreto, H. Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Advances in Cryptology-Crypto '2002, volume 2442 of Lecture Notes in Computer Science, pages 354-368. Springer-Verlag, 2002.
4. E.-O. Blaß and M. Zitterbart. Towards Acceptable Public-Key Encryption in Sensor Networks. In The 2nd, Int'l Workshop on Ubiquitous Computing. ACM SIGMIS, May 2005.
5. M. Bodrato. Towards optimal Toom-Cook multiplication for univariate and multivariate polynomials in characteristic 2 and 0. In C. Carlet and B. Sunar, editors, WAIFI 2007 proceedings, volume 4547 of LNCS, pages 116-133. Springer, June 2007. http://bodrato.it/papers/#WAIFI2007.
6. S. Chatterjee, P. Sarkar, and R. Barua. Efficient computation of tate pairing in projective coordinate over general characteristic fields. In Information Security and Cryptology UICISC 2004, volume 3506 of Lecture Notes in Computer Science, pages 168U-181, 2005.
7. B. Doyle, S. Bell, A. F. Smeaton, K. McCusker, and N. O'Connor. Security considerations and key negotiation techniques for power constrained sensor networks. The Computer Journal (Oxford University Press), 49(4):443-453, 2006.
8. R. Dupont and A. Enge. Provably secure non-interactive key distribution based on pairings. Discrete Appl. Math., 154(2):270-276, 2006.
9. K. Fong, D. Hankerson, J. Lopez, and A. Menezes. Field inversion and point halving revisited. IEEE Transactions on Computers, 53(8): 1047-1059, 2004.
10. D. Freeman, M. Scott, and E. Teske. A taxonomy of pairing-friendly elliptic curves. Cryptology ePrint Archive, Report 2006/372, 2006. http://eprint.iacr.org/2006/372.
11. S. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. In Algorithm, Number Theory Symposium - ANTS V, volume 2369 of Lecture Notes in Computer Science, pages 324-337. Springer-Verlag, 2002.
12. S. Galbraith, K. Paterson, and N. Smart. Pairings for cryptographers. Cryptology ePrint Archive, Report 2006/165, 2006. http://eprint.iacr.org/ 2006/165.
13. S. Galbraith and V. Rotger. Easy decision diffie-hellman groups. LMS Journal of Computation and, Mathematics, 7:201-218, 2004.
14. N. Gura, A. Patel, A. Wander, H. Eberle, and S. C. Shantz. Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs. In Workshop on Cryptographic Hardware and Embedded Systems (CUES'04), pages 119-132, 2004.
15. D. Hankerson, A. Menezes, and S. Vanstone. Guide to Elliptic Curve Cryptography. Springer, 2004.
16. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-efficient communication protocol for wireless microsensor networks. In HICSS, 2000.
17. F. Hess, N. Smart, and F. Vercauteren. The Eta pairing revisited. IEEE Transactions on Information Theory, 52(10), 2006. http://eprint.iacr.org/ 2006/110.
18. Intel-Corporation. Intel Xscale Microarchitecture Datasheet, 2000. http://www.intel.com.
19. 613), 2005. http://perso.univrennesl.fr/reynald.lercier/file/ nmbrJL05a.html.
20. C. Karlof, N. Sastry, and D. Wagner. Tinysec: A link layer security architecture for Wireless Sensor Networks. In 2nd, ACM SensSys, pages 162-175, Nov 2004.
21. 4M) multiplier for use in pairing based cryptosystems. In T. Rissa, S. J. E. Wilton, and P. H. W. Leong, editors, FPL, pages 594-597. IEEE, 2005.
22. T. Kleinjung. Discrete logarithms in GF(p) - 160 digits, 2007. http://www.nabble.com/Discrete-logarithms-in-GF(p)-160-digits-td8810595.html.
23. D. E. Knuth. The art of computer programming, volume 2. Addison-Wesley Longman Publishing Co., Inc., 1997.
24. A. K. Lenstra. Unbelievable security. Matching AES security using public key systems. In Advances in Cryptology - Asiacrypt 2001, volume 2248, pages 67-86. Springer-Verlag, 2001.
25. S. Lindsey and C. S. Raghavendra. Pegasis: Power-efficient gathering in sensor information systems, 2002.
26. A. Liu, P. Kampanakis, and P. Ning. Tinyecc: Elliptic Curve Cryptography for sensor networks (ver. 1.0), February 2007. http://discovery.csc.ncsu.edu/ software/TinyECC/.
27. D. J. Malan, M. Welsh, and M. D. Smith. A Public-Key Infrastructure for key distribution in TinyOS based on Elliptic Curve Cryptography. In 1st IEEE Intl' Conf. on Sensor and Ad Hoc Communications and Networks (SECON'04), 2004.
28. K. McCusker, N. O'Connor, and D. Diamond. Low-energy finite field arithmetic primitives for implementing security in Wireless Sensor Networks. In 2006 Intl' Conf. on Communications, CircuiTS aND sYstems, volume III - Computer, Optical and Broadband; Communications; Computational Intelligence, pages 1537-1541, 2006.
29. A. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
30. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals, E84-A(5):1234-1243, 2001.
31. P. Montgomery. Modular multiplication without division. Mathematics of Computation, 44(170):519-521, 1985.
32. L. B. Oliveira, R. Dahab, J. Lopez, F. Daguano, and A. A. F. Loureiro. Identity-based encryption for sensor networks. In 5th IEEE International Conference on Pervasive Computing and Communications Workshops PERCOMW '07, pages 290-294, 2007.
33. L. B. Oliveira, M. Scott, J. Lopez, and R. Dahab. TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks. Cryptology ePrint Archive, Report 2007/482, 2007. http://eprint.iacr. org/.
34. L. Oliviera, D. Aranha, E. Morais, F. Daguano, J. Lopez, and R. Dahab. Tinytate: Computing the tate pairing in resource-constrained sensor nodes. In 6th IEEE Inernational Symposium on Network COmputing and Applications - NCA 2007, 2007.
35. A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. D. Tygar. SPINS: Security protocols for sensor networks. Wireless Networks, 8(5):521-534, Sept. 2002. Also appeared in MobiCom'01.
36. R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. The 2000 Symposium on Cryptography and Information Security, Okinawa, Japan, 2000.
37. M. Scott. Computing the Tate pairing. In CT-RSA, volume 3376 of Lecture Notes in Computer Science, pages 293-304. Springer-Verlag, 2005.
38. M. Scott. Implementing cryptographic pairings. In Pairing 2007, volume 4575 of Lecture Notes in Computer Science, pages 177-196. Springer-Verlag, 2007.
39. M. Scott. MIRACL - Multiprecision Integer and Rational Arithmetic C/C++ Library, 2007. http://ftp.computing.dcu.ie/pub/crypto/miracl.zip.
40. m). Cryptology ePrint Archive, Report 2007/192, 2007. http://eprint.iacr.org/.
41. M. Scott and P. Szczechowiak. Optimizing multiprecision multiplication for public key cryptography. Cryptology ePrint Archive, Report 2007/299, 2007. http://eprint.iacr.org/2007/299.
42. D. Seal. ARM Architecture Reference Manual. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2000.
43. m) on 8-bit MICAz mote. Cryptology ePrint Archive, Report 2008/122, 2008. http://eprint.iacr.org/.
44. P. Szczechowiak, L. Oliviera, M. Scott, M. Collier, and R. Dahab. NanoECC: Testing the limits of Elliptic Curve Cryptography in Sensor Networks. In Wireless Sensor Networks - EWSN 2008, volume 4913 of Lecture Notes in Computer Science, pages 305-320. Springer-Verlag, 2008.
45. Texas-Instruments. MSP 430F1611 Datasheet, 2002. http://www.ti.com.
46. H. Wang, B. Sheng, and Q. Li. Elliptic Curve Cryptography based access control in sensor networks. International Journal of Security and Networks (IJSN). Special Issue on Security Issues on Sensor Networks, 1(3/4):127-137, 2006.
47. R. J. Watro, D. Kong, S. fen Cuti, C. Gardiner, C. Lynn, and P. Kruus. Tinypk: securing sensor networks with public key technology. In 2nd, ACM Workshop on Security of ad, hoc and Sensor Networks (SASN'04), pages 59-64, Washington, DC, October 2004.
48. S. Zhu, S. Setia, and S. Jajodia. LEAP: efficient security mechanisms for large-scale distributed sensor networks. In 10th ACM conference on Computer and communication security (CCS'03), pages 62-72. ACM Press, 2003.