Implementing public-key infrastructure for sensor networks

ACM Transactions on Sensor Networks

Volumn 4, Issue 4, 2008, Pages

  Malan, David J ^a   Welsh, Matt ^a   Smith, Michael D ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Diffie Hellman; DLP; ECC; ECDLP; Elliptic curve cryptography; MICA2; Motes; Sensor networks; TinyOS; TinySec

Indexed keywords

CRITICAL EVALUATION; DIFFIE-HELLMAN; DLP; ECC; ECDLP; ELLIPTIC CURVE CRYPTOGRAPHY; MICA2; MOTES; PUBLIC-KEY INFRASTRUCTURE; TINYOS; TINYSEC;

CRYPTOGRAPHY; SENSORS;

SENSOR NETWORKS;

EID: 51849124994     PISSN: 15504859     EISSN: 15504867     Source Type: Journal    
DOI: 10.1145/1387663.1387668     Document Type: Article

References (92)

1. ADLEMAN, L. M. 1979. A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In Proceeding of the 20th IEEE Foundation of Computer Science Symposium. 55-60.
2. ARAZI, O. AND QI, H. 2006. Load-balanced key establishment methodologies in wireless sensor networks. In Int. J. Secu. Networks. 1.
3. BARRETT, P. 1987. Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In Proceedings of Advances in Cryptology (CRYPTO'86), A. M. Odlyzko, Ed. Vol. 263.
4. BARWOOD, G. 1997. Elliptic curve cryptography FAQ v1.12 22nd. http://www.cryptoman.com/elliptic.htm.
5. BARWOOD, G. 2006. Pegwit (v8). http://www.george-barwood.pwp. blueyonder.co.uk/hp/v8/pegwit.htm.
6. BENENSON, Z., GEDICKE, N., AND RAIVIO, O. 2005. Realizing robust user authentication in sensor networks. In Proceedings of Workshop on Real-World Wireless Sensor Networks (REALWSN'05). Stockholm, Sweden.
7. BIHAM, E., BIRYUKOV, A., AND SHAMIR, A. 1999. Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials. Lecture Notes in Computer Science, Vol. 1592, 12- 23.
8. BLAKE, I., SEROUSSI, G., AND SMART, N. 1999. Elliptic curves in cryptography. LMS Lecture Note Series 265.
9. BLASS, E.-O. AND ZITTERBART, M. 2005. Towards acceptable public-key encryption in sensor networks. In Proceedings of the 1st International Workshop on Ubiquitous Computing (IWUC 2005).
10. BROWN, M., CHEUNG, D., HANKERSON, D., HERNANDEZ, J. L., KIRKUP, M., AND MENEZES, A. 2000. PGP in constrained wireless devices. In Proceedings of the 9th USENIX Security Symposium. USENIX Association.
11. CERPA, A., ELSON, J., ESTRIN, D., GIROD, L., HAMILTON, M., AND ZHAO, J. 2001. Habitat monitoring: application driver for wireless communications technology ACM SIGCOMM Comput. Comm. Rev. 31, 2 Supplement. ACM, NY.
12. CERTICOM CORPORATION. 2000. Remarks on the security of the elliptic curve cryptosystem. http://www.comms.engg.susx.ac.uk/fft/crypto/ EccWhite3.pdf.
13. CERTICOM CORPORATION. 2004. Standards for efficient cryptography group. http://www.secg.org/.
14. COHEN, H., MIYAJI, A., AND ONO, T. 1998. Efficient elliptic curve exponentiation using mixed coordinates. In Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT'98). Springer-Verlag, London, UK, 51-65.
15. CROSSBOW TECHNOLOGY, INC. 2004. MICA2: wireless measurement system. http://www.xbow.com/ Products/Product_pdf_files/ Wireless_pdf/6020-0042-0%4_A_MICA2.pdf.
16. DENG, J., HAN, R., AND MISHRA, S. 2006. Secure code distribution in dynamically programmable wireless sensor networks. In Proceedings of the 5th International Conference on Information Processing in Sensor Networks (IPSN'06). ACM Press, New York, NY, 292-300.
17. DENIS, T. S. 2004. LibTomCrypt. http://libtomcrypt.org/.
18. DIFFIE, W. AND HELLMAN, M. E. 1976. New directions in cryptography. IEEE Trans. Inf. Theor. IT-22, 6, 644-654.
19. DIFFIE, W., VAN OORSCHOT, P. C., AND WIENER, M. J. 1992. Authentication and authenticated key exchanges. Designs, Codes, Cryptogr. 2, 2, 107-125.
20. DRAGONGATE TECHNOLOGIES LIMITED. 2003. jBorZoi 0.9. http://dragongate-technologies.com/products.html.
21. DU, W., WANG, R., AND NING, P. 2005. An efficient scheme for authenticating public keys in sensor networks. In Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'05). ACM Press, New York, NY, 58-67.
22. n ). In Proceedings of Cryptographic Hardware and Embedded Systems (CHES). Springer, 381-399.
23. EVERYREADY BATTERY COMPANY. 2004. Engineering datasheet: Energizer No. X91. http://data.energizer.com/datasheets/library/ primary/alkaline/energizer%/consumer_oem/e91.pdf.
24. FREY, G. AND GANGL, H. 1998. How to disguise an elliptic curve (Weil descent). In Proceedings of Elliptic Curve Cryptography (ECC'98).
25. GAUBATZ, G., KAPS, J.-P., AND SUNAR, B. 2004. Public key cryptography in sensor networks- Revisited. In Proceedings of the 1st European Workshop on Security in Ad-hoc and Sensor Networks (ESAS'04). Lecture Notes in Computer Science, vol. 3313. Springer, 2-18.
26. GAUDRY, P., HESS, F., AND SMART, N. P. 2000. Constructive and destructive facets of Weil descent on elliptic curves. tech. rep. CSTR-00-016, Department of Computer Science, University of Bristol (Oct.).
27. GAY, D., LEVIS, P., VON BEHREN, R., WELSH, M., BREWER, E., AND CULLER, D. 2003. The nesC lan-guage:aholistic approachto networked embedded systems. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, NY.
28. GORDON, D. M. 1993. Discrete logarithms in GF(P) using the number field sieve. SIAM J. Discret. Math. 6, 1, 124-138.
29. GORDON, D. M. 1998. A survey of fast exponentiation methods. J. Algori. 27, 1, 129-146.
30. GUAJARDO, J., BLÜMEL, R., KRIEGER, U., AND PAAR, C. 2001. Efficient implementation of elliptic curve cryptosystems on the TI MSP430x33x family of microcontrollers. In Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography (PKC 2001). Springer, 365-382.
31. GUPTA, V., MILLARD, M., FUNG, S., ZHU, Y., GURA, N., EBERLE, H., AND SHANTZ, S. C. 2005. Sizzle: a standards-based end-to-end security architecture for the embedded Internet. In Proceedings of the 3rd IEEE International Conference on Pervasive Computing and Communications (PerCom). 247-256.
32. GURA, N., PATEL, A., WANDER, A., EBERLE, H., AND SHANTZ, S. C. 2004. Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In Proceedings of the 6th International Workshop on Cryptographic Hardware and Embedded Systems, Boston, Massachusetts.
33. HANDSCHUH, H. AND PAILLIER, P. 2000. Smart card crypto-coprocessors for public-key cryptography. Lecture Notes in Computer SCIENCE, J.-J. Quisquater and B. Schneier, Eds. Springer-Verlag, 386-394.
34. HANKERSON, D., HERNANDEZ, J. L., AND MENEZES, A. 2001. Software implementation of elliptic curve cryptography over binary fields. Lecture Notes in Computer Science, vol. 1965.
35. HASEGAWA, T., NAKAJIMA, J., AND MATSUI, M. 1999. A small and fast software implementation of elliptic curve cryptosystems over GF(p) on a 16-Bit microcomputer. IEICE Trans. Fundamentals E82-A, 1, 98-106.
36. HILL, J., SZEWCZYK, R., WOO, A., HOLLAR, S., CULLER, D. E., AND PISTER, K. S. J. 2000. System architecture directions for networked sensors. In Architectural Support for Programming Languages and Operating Systems. ACM SIGPLAN Notices, 35, 11(Nov.). 93-104.
37. IEEE COMPUTER SOCIETY. 2000. IEEE P1363 Standard Specifications for Public-Key Cryptography.
38. JOYE, M. AND YEN, S.-M. 2000. Optimal left-to-right binary signed-digit recoding. IEEE Trans. Comput. 49, 7, 740-748.
39. KARLOF, C., SASTRY, N., AND WAGNER, D. 2004a. TinySec: A Link Layer Security Architecture for Wireless Sensor Networks. In Proceedings of the 2nd ACM Conference on Embedded Networked Sensor Systems, Baltimore, Maryland.
40. KARLOF, C., SASTRY, N., AND WAGNER, D. 2004b. TinySec: link layer security for tiny devices. http: //www.cs.berkeley.edu/∼nks/tinysec/.
41. KOBLITZ, N. 1987. Elliptic curve cryptosystems. Mathematics of Computation 48, 203-209.
42. KOBLITZ, N. 1992. CM-curves with good cryptographic properties. In Proceedings of Advances in Cryptology (CRYPTO'91). 279-287.
43. KONG, F. AND LI, D. 2005. A note on signed binary window algorithm for elliptic curve cryptosys-tems. In Proceedings of the 4th International Conference on Cryptology and Network Security (CANS). 223-235.
44. KOTTAPALLI, V. A., KIREMIDJIAN, A. S., LYNCH, J. P., CARRYER, E., KENNY, T. W., LAW, K. H., AND LEI, Y. 2003. Two-tiered wireless sensor network architecture for structural health monitoring. Proceedings of the 10th Annual International Symposium on Smart Structures and Materials.
45. LAMACCHIA, B. A. AND ODLYZKO, A. M. 1991. Computation of discrete logarithms in prime fields. Lecture Notes in Computer Science, vol. 537, 616-618.
46. LENSTRA, A. K. AND VERHEUL, E. R. 1999. Selecting cryptographic key sizes. J. Cryptology.
47. LÓPEZ, J. AND DAHAB, R. 2000a. An overview of elliptic curve cryptography. Tech. rep., Institute of Computing, Sate University of Campinas, São Paulo, Brazil.
48. 2m. Tech. rep., Institute of Computing, Sate University of Campinas, São Paulo, Brazil.
49. MALAN, D. 2004. Crypto for tiny objects. Tech. rep. TR-04-04, Harvard University, Cambridge, MA. (Jan.).
50. MALAN, D., FULFORD-JONES, T., WELSH, M., AND MOULTON, S. 2004a. CodeBlue: an ad hoc sensor network infrastructure for emergency medical care. In Proceedings of the International Workshop on Wearable and Implantable Body Sensor Networks. London, United Kingdom.
51. MALAN, D. J., WELSH, M., AND SMITH, M. D. 2004b. A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography. In Proceedings of the 1st IEEE International Conference on Sensor and Ad Hoc Communications and Networks. Santa Clara, CA.
52. MARSAGLIA, G. 1994. The mother of all random generators. ftp://ftp.taygeta.com/pub/c/ mother.c.
53. MENEZES, A., VANSTONE, S., AND OKAMOTO, T. 1991. Reducing elliptic curve logarithms tologarithms in a finite field. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing. ACM Press, 80-89.
54. MESSERGES, T. S., CUKIER, J., KEVENAAR, T. A. M., PUHL, L., STRUIK, R., AND CALLAWAY, E. 2003. A security design for a general purpose, self-organizing, multihop ad hoc wireless network. In Proceedings of the ACM Workshop on Security of Ad Hoc and Sensor Networks, George Mason University, Fairfax, VA.
55. MILLER, V. 1986a. Uses of elliptic curves in cryptography. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 417-426.
56. MILLER, V. S. 1986b. Use of elliptic curves in cryptography. Lecture Notes in Computer Sciences. Springer-Verlag, New York, 417-426.
57. MÖLLER, B. 2004. Fractional windows revisited: improved signed-digit representations for efficient exponentiation. In Information Security and Cryptology (ICISC), Springer, 137-153.
58. MONTGOMERY, P. 1985. Modular multiplication without trial division. Math. Comput. 44, 170, 519-521.
59. NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY. 1988. SKIPJACK and KEA Algorithm Specifications. Computer Security Division.
60. NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY. 1994. Federal information processing standards publication 185. Escrowed Encryption Standard (EES).
61. NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY. 1999. Recommended elliptic curves for federal government use. http://csrc.nist.gov/CryptoToolkit/dss/ecdsa/NISTReCur.pdf.
62. NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY. 2003. Special publication 800-57: recommendation for key management.
63. NEST CHALLENGE ARCHITECTURE. 2002. http://www.tinyos. net/api.
64. NING, P. AND LIU, A. 2005. TinyECC: elliptic curve cryptography for sensor networks. http:// discovery.csc.ncsu.edu/software/ TinyECC/.
65. OKEYA, K., SCHMIDT-SAMOA, K., SPAHN, C., AND TAKAGI, T. 2004a. Lecture Notes inComputer Science, vol. 3152. Springer, Berlin, 123.
66. OKEYA, K., SCHMIDT-SAMOA, K., SPAHN, C., AND TAKAGI, T. 2004b. Signed binary representations revisited. Cryptology ePrint Archive, Report 2004/195. http://eprint.iacr.org/.
67. PAAR, C. 1999. Implementation options for finite field arithmetic for elliptic curve cryptosystems. In Proceedings of the 3rd Workshop on Elliptic Curve Cryptography (ECC'99).
68. PERLMAN, R. 2003. Course Notes Computer Science 243, Harvard University.
69. PERRIG, A., STANKOVIC, J., AND WAGNER, D. 2004. Security in wireless sensor networks. Comm. ACM 47, 6, 53-57.
70. PERRIG, A., SZEWCZYK, R., WEN, V., CULLER, D. E., AND TYGAR, J. D. 2001. SPINS: security protocols for sensor networks. In Mobile Computing and Networking. 189-199.
71. RABIN, M. 1979. Digitalized signatures and public-key functions as intractable as factorization. Tech. rep. MIT/LCS/TR-212, MIT.
72. REGEHR, J. 2004. John Regehr's Stack Bounding Page. http://www.cs.utah.edu/∼regehr/ stacktool/.
73. ROCHESTER INSTITUTE OF TECHNOLOGY. 2005. CISCO University Research Program Project. http: //www.ce.rit.edu/∼fxheec/ cisco_urp/docs/Main_ECC_Doc.htm.
74. ROSING, M. 1999. Implementing Elliptic Curve Cryptography. Manning Publications Co.
75. SCHROEPPEL, R., ORMAN, H., O'MALLEY, S., AND SPATSCHECK, O. 1995. Fast key exchange with elliptic curve systems. Lecture Notes in Computer Science, vol. 963.
76. SEO, S. C., KIM, H. C., AND RAMAKRISHNA, R. S. 2006. A new security protocol based on elliptic curve cryptosystems for security wireless sensor networks. In Proceedings of the 2nd International Workshop on Security in Ubiquitous Computing Systems (SECUBIQ 2006).
77. SHAMUS SOFTWARE LTD. 2004. Multiprecision integer and rational arithmetic C/C++ Library.http: //indigo.ie/∼mscott/ #Elliptic.
78. SHNAYDER, V., HEMPSTEAD, M., RONG CHEN, B., ALLEN, G. W., AND WELSH, M. 2004. Simulating the power consumption of large-scale sensor network applications. In Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems (SenSys'04). ACM Press, New York, 188-200.
79. SILVERMAN, J. AND SUZUKI, J. 1998. Elliptic curve discrete logarithms and the index calculus. In Proceedings of the International Conference on the Theory and Application of Cryptology (ASIACRYPT).
80. SOLINAS, J. 1999. Generalized Mersenne numbers. Tech. Rep. CORR-39, University of Waterloo.
81. SOLINAS, J. A. 1997. An improved algorithm for arithmetic on a family of elliptic curves. In Proceedings of the Advances in Cryptology (CRYPTO'97). 357-371.
82. TEXAS INSTRUMENTS. 2007. 2.4 GHz IEEE 802.15.4 / ZigBee-ready RF transceiver (Rev. B).
83. WANDER, A. S., GURA, N., EBERLE, H., GUPTA, V., AND SHANTZ, S. C. 2005. Energy analysis of public-key cryptography for wireless sensor networks. In Proceedings of the 3rd IEEE International Conference on Pervasive Computing and Communications (PERCOM'05). IEEE Computer Society, Washington, DC, 324-328.
84. WANG, H. AND LI, Q. 2006. Elliptic curve cryptography based access control in sensor networks. Int. J. Secur. Net. 1.
85. WATRO, R. 2003. Lightweight security for wireless networks of embedded systems. http://www. is.bbn.com/projects/lws-nest/bbn_nest_apr_03.ppt.
86. WATRO, R., KONG, D., FEN CUTI, S., GARDINER, C., LYNN, C., AND KRUUS, P. 2004. TinyPK: Securing sensor networks with public key technology. In Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'04). ACM Press, New York, NY, 59-64.
87. WEIMERSKIRCH, A., PAAR, C., AND SHANTZ, S. C. 2001. Elliptic curve cryptography on a Palm OS device. In Proceedings of the 6th Australasian Conference on Information Security and Privacy. Sydney, Australia.
88. WOOD, C. 2004. libecc. http://libecc.sourceforge.net/.
89. WOODBURY, A. D. 2001. Efficient algorithms for elliptic curve cryptosystems on embedded systems. http://www.wpi.edu/Pubs/ETD/Available/etd- 1001101-195321/unrestricted/ w%oodbury.pdf.
90. WOODBURY, A. D., BAILEY, D. V., AND PAAR, C. 2000. Elliptic curve cryptography on smart cards without coprocessors. In Proceedings of the 4th Smart Card Research and Advanced Applications Conference (CARDIS 2000). Bristol, UK.
91. ZAROLIAGIS, C. 2004. ECC-LIB: A library for elliptic curve cryptography. http://www.ceid. upatras.gr/faculty/zaro/software/ecc-lib/.
92. ZIGBEE ALLIANCE. 2004. http://www.zigbee.org/.