Security for wireless sensor networks using identity-based cryptography

Security for Wireless Sensor Networks using Identity-Based Cryptography

Volumn , Issue , 2012, Pages 1-207

  Patil, Harsh Kupwade ^a   Szygenda, Stephen A ^b  

^a Fish & Richardson PC   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ENERGY EFFICIENCY; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

CROSS-LAYER DESIGN; CRYPTOGRAPHIC SCHEMES; ELLIPTIC CURVE CRYPTOGRAPHY; ID-BASED CRYPTOGRAPHY; IDENTITY BASED CRYPTOGRAPHY; KEY MANAGEMENT MECHANISM; LAYERED APPROACHES; SECURITY SOLUTIONS;

WIRELESS SENSOR NETWORKS;

EID: 84938362699     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (180)

1. Akyildiz, I. F., W. Su, Y. Sankarasubramaniam, and E. Cayirci. Wireless sensor networks: A survey. Computer Networks 38, no. 4 (March 2002): 393–422.
2. Byoung-Kug, Kim, Hong Sung-Kwa, Jeong Young-Sik, and Eom Doo-Seop. The study of applying sensor networks to a smart home. Fourth International Conference on Networked Computing and Advanced Information Management. IEEE, 2008, 676–681.
3. Chatzigiannakis, I., A. Kinalis, and S. Nikoletseas. Sink mobility protocols for data collection in wireless sensor networks. Proceeding of the 4th ACM Workshop on Mobility Management and Wireless Access. ACM, 2006, 52–59.
4. Chee-Yee, Chong, and S. P. Kumar. Sensor networks: Evolution, opportunities, and challenges. Proceedings of the IEEE 91, no. 8 (2003): 1247–1256.
5. Chen, Lei, Shuang Yang, and Ying Xi. Based on ZigBee wireless sensor network the monitoring system design for chemical production process toxic and harmful gas. International Conference on Computer, Mechatronics, Control and Electronic Engineering (CMCE). IEEE, 2010, 425–428.
6. Chong, C.Y., S. Mori, and K. C. Chang. Distributed multitarget multisensor tracking. In Y. Bar-Shalom (ed.), Multitarget-Multisensor Tracking: Applications and Advances. Artech House, 1990, 247–295.
7. Cook, B., S. Lanzisera, and K. Pister. SoC issues for RF smart dust. Proceedings of IEEE (IEEE) 94, no. 6 (2006): 1177–1196.
8. IEEE Std. 802.15.4—2003: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE, 2003.
9. Jafari, R., A. Encarnacao, A. Zahoory, F. Dabiri, H. Noshadi, and M. Sarrafzadeh. Wireless sensor networks for health monitoring. Proceedings of 2nd Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services. IEEE, 2005, 479–481.
10. Khan, A., and L. Jenkins. Undersea wireless sensor network for ocean pollution prevention. Proceedings of 3rd International Conference on Communication Systems Software and Middleware and Workshops. IEEE, 2008, 2–8.
11. Ko, JeongGil, Chenyang Lu, M. B. Srivastava, J. A. Stankovic, A. Terzis, and M. Welsh. Wireless sensor networks for healthcare. Proceedings of the IEEE (IEEE) 98, no. 11 (October 2010): 1947–1960.
12. Kumar, S., and D. Shepherd. SensIT: Sensor information technology for the warfighter. Proceedings of 4th International Conference on Information Fusion. IEEE, 2001, 3–9.
13. Lai, Xin, Jun Li, Wei Zhong, and Yuan Cao. Fast and accurate WSN positioning in emergency logistics. Second International Conference on Networks Security Wireless Communications and Trusted Computing (NSWCTC). IEEE, 2010, 277–280.
14. Lee, Sang Hyuk, Soobin Lee, Heecheol Song, and Hwang Soo Lee. Wireless sensor network design for tactical military applications: Remote large-scale environments. Proceedings of the 28th IEEE Conference on Military Communications. IEEE, 2009, 1–7.
15. Myers, C., A. Oppenheim, R. Davis, and W. Dove. Knowledge based speech analysis and enhancement. International Conference on Acoustics, Speech and Signal Processing. IEEE, 1984, 162–165.
16. Nakayama, H., N. Ansari, A. Jamalipour, and Y. Nemot. Fault-resilient sensing in wireless sensor networks. Computer Communications 30, no. 11 (2007): 2375–2384.
17. Naumowicz, T., et al. Wireless sensor network for habitat monitoring on Skomer Island. Proceedings of 35th Conference on Local Computer Networks (LCN). IEEE, 2010, 882–889.
18. Ni, S., Y. Tseng, Y. Chen, and J. Sheu. The broadcast storm problem in a mobile ad hoc network. Proceedings of ACM MOBICOM. ACM, 1999, 151–162.
19. Pierret, R. F. Introduction to Microelectronic Fabrication. Addison-Wesley, 1990.
20. Pillai, P., and K. G. Shin. Real-time dynamic voltage scaling for low-power embedded operating systems. Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles. ACM, 2001, 89–102.
21. Proceedings of the Distributed Sensor Nets Workshop. Pittsburgh. Department of Computer Science, Carnegie Mellon University, 1978.
22. Rajagopalan, R., and X. Varshney. Data-aggregation techniques in sensor networks: A survey. IEEE Communications and Surveys and Tutorials, 2006: 48–63.
23. Rashid, R., and G. Robertson. Accent: A communication oriented network operating system kernel. Proceedings of 8th Symposium on Operating Systems. ACM, 1981, 64–75.
24. Rashid, R., et al. Mach: A system software kernel. 34th Computer Society International Conference (COMPCON). IEEE, 1989, 176–178.
25. Senturia, S. D. Microsystem Design. Kluwer Academic, 2001.
26. Shah, R., S. Roy, S. Jain, and W. Brunette. Data mules: Modeling and analysis of a threetier architecture for sparse sensor networks. Ad Hoc Networks (Elsevier) 1, no. 2–3 (2003): 215–233.
27. Tavli, B., and W. Heinzelman. Mobile Ad Hoc Networks: Energy-Efficient Real-Time Data Communications. Springer-Verlag, 2005.
28. Verdone, R., D. Dardari, G. Mazzini, and A. Conti. Wireless Sensor and Actuator Networks. Elsevier UK, 2008.
29. Werner-Allen, G., J. Johnson, M. Ruiz, J. Lees, and M. Welsh. Monitoring volcanic eruptions with a wireless sensor network. Proceeedings of the Second European Workshop on Wireless Sensor Networks. IEEE, 2005, 108–120.
30. Anand, M., Z. G. Ives, and I. Lee. Quantifying eavesdropping vulnerability in sensor networks. Departmental papers, Department of Computer & Information Science, University of Pennsylvania, 2005.
31. Douceur, J. R. The sybil attack. First International Workshop on Peer-to-Peer Systems (IPTPS ‘02). 2002.
32. Healy, M., T. Newe, and E. Lewis. Security for wireless sensor networks: A review. SAS 2009— IEEE Sensors Applications Symposium. IEEE, 2009, 80–85.
33. Karlof, C., and D. Wagner. Secure routing in wireless sensor networks: Attacks and counter-measures. First International Workshop on Sensor Network Protocols and Applications. IEEE, 2003, 113–127.
34. Karlof, C., N. Sastry, and D. Wagner. TinySec: A link layer security architecture for wireless sensor networks. Second ACM Conference on Embedded Networked Sensor Systems. ACM, 2004, 162–175.
35. Newsome, J., E. Shi, D. Song, and A. Perrig. The sybil attack in sensor networks: Analysis & defenses. Third International Symposium on Information Processing in Sensor Networks, IPSN. IEEE, 2004, 259–268.
36. Perrig, A., R. Szewczyk, J. Tygar, V. Wen, and D. Culler. SPINS: Security protocols for sensors. Wireless Networks 8, no. 5 (2002): 521–534.
37. Perrig, A., J. Stankovic, and D. Wagner. Security in wireless sensor networks. Communications of the ACM 47, no. 6 (June 2004): 53–57.
38. Sun, Z., X.-G. Zhang, H. Li, and A. Li. The application of TinyOS beaconing WSN routing protocol in mine safety monitoring. International Conference on Mechtronic and Embedded Systems and Applications, MESA. IEEE, 2008, 415–419.
39. Xu, W., W. Trappe, Y. Zhang, and T Wood. Proceedings of the Sixth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc ‘05). ACM, 2005, 48-57.
40. Xu, W., W. Trappe, and Y. Zhang. Defending wireless sensor networks from radio interference through channel adaptation. ACM Transactions on Sensor Networks, 4, no. 4 (August 2008).
41. Boneh, D., and X. Boyen. Efficient selective-ID secure identity-based encryption without random oracles. Lecture Notes in Computer Science (Springer-Verlag) 3027 (2004): 223–238.
42. Boneh, D., and M. Franklin. Identity-based encryption from theWeil pairing. Lecture Notes in Computer Science (Springer-Verlag) 2139 (2001): 213–229.
43. Boneh, D., and H. Shacham. Group signatures with verifier-local revocation. ACM Conference on Computer and Communications Security. ACM, 2004, 168–177.
44. Boneh, D., B. Lynn, and H. Shacham. Short signatures from the Weil pairing. Journal of Cryptology (2004): 297–319.
45. Cohen, H., and G. Frey. Elliptic and Hyperelliptic Curve Cryptography. Edited by K. H. Rosen. Chapman & Hall/CRC Press, 2006.
46. Diffie, W., and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory (IEEE) IT-22 (1976): 644–654.
47. ElGamal, T. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory (IEEE) 31, no. 4 (1984): 469–472.
48. Joux, A. A one round protocol for tripartite Diffie–Hellman. Lecture Notes in Computer Science (Springer-Verlag) 1838 (2000): 385–394.
49. Koblitz, N. Elliptic curve cryptosystems. Mathematics of Computation 48, no. 177 (1987): 203–209.
50. Lenstra, H. W. Factoring integers with elliptic curves. Annals of Mathematics 126, no. 3 (1987): 649–673.
51. Menezes, A. Elliptic Curve Public Key Cryptosystems. Kluwer Academic, 1993.
52. Rivest, R., A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM (ACM) 21, no. 2 (1978): 120–126.
53. Sakai, R., K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. The 2000 Symposium on Cryptography and Information Security.
54. Simmons, G. J. Contemporary Cryptology: The Science of Information Integrity. Wiley-IEEE Press, 1999.
55. Washington, L. C. Elliptic Curves: Number Theory and Cryptography. Chapman & Hall/CRC Press, 2003.
56. Baek, J., and Y. Zheng. Identity-based threshold decryption. Lecture Notes in Computer Science (Springer-Verlag) 2947 (2004): 262–276.
57. Boneh, D., and X. Boyen. Efficient selective-ID secure identity-based encryption without random oracles. Lecture Notes in Computer Science (Springer-Verlag) 3027 (2004): 223–238.
58. Boneh, D., and M. Franklin. Identity-based encryption from the Weil pairing. Lecture Notes in Computer Science (Springer-Verlag) 2139 (2001): 213–229.
59. Boneh, D., C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. Lecture Notes in Computer Science (Springer-Verlag) 2656 (2003): 416–432.
60. Boneh, D., B. Lynn, and H. Shacham. Short signatures from the Weil pairing. Journal of Cryptology (Springer-Verlag), 2004: 297–319.
61. Cocks, C. An identity based encryption scheme based on quadratic residues. Cryptography and in Coding—Institute of Mathematics and Its Applications International Conference on Cryptography and Coding—Proceedings of IMA 2001, LNCS (Springer-Verlag) 2260 (2001): 360–363.
62. Diffie, W., and M. Hellman. New directions in cryptography. IEEE Transactions of Information Theory 22 (1976): 644–654.
63. Elgamal, T. A public key cryptosystem and a signature scheme based on discrete logarithms. Transactions on Information Theory 31, no. 4 (1985): 469–472.
64. Gentry, C., and A. Silverberg. Hierarchical ID-based cryptography. Lecture Notes in Computer Science (Springer-Verlag) 2501 (2002): 548–566.
65. Hess, F. Efficient identity based signature schemes based on pairings. Selected Areas in Cryptography: 9th Annual International Workshop (Lecture Notes in Computer Science) (Springer-Verlag) 2595 (2003): 310–324.
66. Horwitz, J., and B. Lynn. Toward hierarchical identity-based encryption. EUROCRYPT’02, Lecture Notes in Computer Science (Springer) 2332 (2002): 466–481.
67. Joux, A. A one round protocol for tripartite Diffie–Hellman. Lecture Notes in Computer Science (Springer-Verlag) 1838 (2000): 385–394.
68. Libert, B., and J. Quisquater. Efficient revocation and threshold pairing based cryptosystems. Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing. ACM (2003): 163–171.
69. Lee, B., C. Boyd, E. Dawson, K. Kim, and J. Yang. Secure key issuing in ID-based cryptography. Conferences in Research and Practice in Information Technology (2004): 69–74.
70. Maurer, U. M. Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. Lecture Notes in Computer Science (Springer) 839 (1994): 271–281.
71. Okamoto, T., and D. Pointcheval. The gap-problems: A new class of problems for the security of cryptographic. Lecture Notes in Computer Sciences (Springer-Verlag) 1992 (2001): 104–118.
72. Rivest, R., A. Shamir, and L. Adleman. A method of obtaining digital signatures and public-key cryptosystems. Communications (ACM) 21, no. 2 (1978): 120–126.
73. Sakai, R., K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. The 2000 Symposium on Cryptography and Information Security (2000).
74. Shamir, A. Identity-based cryptosystems and signature schemes. Advances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science (Springer-Verlag) 196 (1984): 47–53.
75. Susilo, W., and Y. Mu. Non-interactive deniable ring authentication. Lecture Notes in Computer Science (Springer-Verlag) 2971 (2003): 386–401.
76. Zhang, F., and K. Kim. ID-based blind signature and ring signature from pairings. Lecture Notes of Computer Science (Springer-Verlag) 2501 (2002): 629–637.
77. Zhang, F., R. Safavi-Naini, and W. Susilo. An efficient signature scheme from bilinear pairings and its applications. Lecture Notes in Computer Science (Springer-Verlag) 2947 (2004): 277–290.
78. Bellare, M., C. Namprempre, and G. Neven. Security proofs for identitybased identification and signature schemes. Proceedings of Eurocrypt. Springer-Verlag, 2004, 268–286.
79. Cao, X., W. Kou, L. Dang, and B. Zhao. IMBAS: Identity-based multi-user broadcast authentication in wireless sensor networks. Computer Communication (Elsevier) 31 (2008): 659–667.
80. Carbunar, B., Y. Yu, L. Shi, M. Pearce, and V. Vasudevan. Query privacy in wireless sensor networks. Sensor, Mesh and Ad Hoc Communications and Networks. IEEE, 2007, 203–212.
81. Gorantla, M. C., C. Boyd, and J. M. González Nieto. ID-based one pass authenticated key establishment. Proceedings of the Sixth Australasian Conference on Information Security. 2008, 39–46.
82. Huang, Q., J. Cukier, H. Kobayashi, B. Liu, and J. Zhang. Fast Authenticated Key Establishment Protocols for Organizing Sensor Networks. Workshop on Sensor Networks and Applications (WSNA). ACM, 2003, 141–150.
83. Karlof, C., N. Sastry, and D. Wagner. TinySec: A link layer security architecture for wireless sensor networks. Second ACM Conference on Embedded Networked Sensor Systems. ACM, 2004, 162–175.
84. Liu, D, and P. Ning. Efficient distribution of key chain commitments for broadcast authentication in distributed sensor networks. 10th Annual Network and Distributed System Security. 2003, 263–276.
85. Merkle, R. C. Protocols for Public Key Cryptosystems. Symposium on Security and Privacy. IEEE, 1980, 122–134.
86. Mitzenmacher, M. Compressed bloom filters. Edited by ACM. Transactions on Networking 10, no. 5 (2002).
87. Naccache, D., and J. Stern. Signing on a postcard. Proceedings of Financial Cryptography. Springer-Verlag, 2000, 121–135.
88. Nyberg, K., and R. A. Rueppel. A new signature scheme based on the DSA giving message recovery. 1st ACM Conference on Computer and Communications Security. ACM, 1993, 58–61.
89. Perrig, A., R. Canetti, J. D. Tygar, and D. Song. Efficient authentication and signing of multicast streams over lossy channels. Symposium on Security and Privacy. IEEE, 2000, 56–73.
90. Perrig, A., R. Szewczyk, V. Wen, D. Culler, and D. Tygar. SPINS: Security protocols for sensor networks. Edited by ACM. Proceedings of MobiCom. Rome, 2001, 189–199.
91. Ren, K., W. Lou, and Y. Zhang. Multi-user broadcast authentication in wireless sensor networks. Proceedings of Sensor, Mesh and Ad Hoc Communications and Networks. IEEE, 2012, 223–232.
92. Schnorr, C. P. Efficient signature generation for smart card. Journal of Crytology 4, no. 3 (1991): 161–174.
93. Tian, X., D. Wong, and R. Zhu. Analysis and improvement of an authenticated key exchange protocol for sensor networks. Communications Letters (IEEE) 9, no. 11 (2005): 970–972.
94. Wander, A. S., N. Gura, H. Eberle, V. Gupta, and S. C. Shantz. Energy analysis of public-key cryptography for wireless sensor networks. Third IEEE International Conference on Pervasive Computing and Communications. IEEE, 2005, 324–328.
95. Watro, R., D. Kong, S. Cuti, C. Gardiner, C. Lynn, and P. Kruus. TinyPK: Securing sensor networks with public key technology. 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks. ACM, 2004, 59–64.
96. Aranha, D., R. Dahab, J. López, and L. Oliveira. Efficient implementation of elliptic curve cryptography in wireless sensors. Advances in Mathematics of Communications 4, no. 2 (2010): 169–187.
97. Bellare, M., and P. Rogaway. Random oracle models are practical: A paradigm for designing efficient protocols. Proceedings of the 1st ACM Conference on Computer and Communications Security (CCS’93). ACM, 1993, 62–73.
98. Blom, R. An optimal class of symmetric key generation systems. Advances in Cryptology: Proceedings of Eurocrypt ‘84, 1984, 335–338.
99. Blundo, C., A. D. Santis, A. Herzberg, and S. Kutten. Perfectly-secure key distribution for dynamic conferences. Advances in Cryptology-Crypto ‘92 (Berlin: Springer-Verlag), 1992, 471–486.
100. Boneh, D., and M. Franklin. Identity-based encryption from the Weil pairing. Lecture Notes in Computer Science (Springer-Verlag) 2139 (2001): 213–229.
101. Camtepe, S., and B. Yener. Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE Transactions on Networking (IEEE) 15, no. 2 (2007): 346–358.
102. Chan, H., Perrig, A., and D. Song. Random key pre-distribution schemes for sensor networks. Proceedings of the 2003 IEEE Symposium on Security and Privacy. IEEE, 2003, 197–213.
103. Du, W., J. Deng, Y. Han, and P. Varshney. A pairwise key pre-distribution scheme for wireless sensor networks. Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS 2003). ACM, 2003, 42–51.
104. Eschenauer, L., and V. D. Gligor. A key management scheme for distributed sensor networks. Proceedings of the 9th ACM Conference on Computer and Communication Security. ACM, 2002.
105. Gemmell, P. An introduction to threshold cryptography. CryptoBytes, a technical newsletter of RSA Laboratories 2, no. 7 (1997): 7–11.
106. Joux A. A one round protocol for tripartite Diffie-Hellman. Proceedings of Algorithmic Number Theory Symposium – ANTS IV, Lecture Notes in Computer Science (Springer-Verlag) 1838 (2000): 385–394.
107. Lee, J., and D. Stinson. Deterministic key predistribution schemes for distributed sensor networks. Lecture Notes in Computer Science (Springer-Verlag) 3357 (2005): 294–307.
108. Liu, D., and P. Ning. Establishing pairwise keys in distributed sensor networks. Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS 2003). ACM, 2003, 52–61.
109. Lynn, B. Authenticated identity-based encryption. Cryptology ePrint Archive-2002/072, 2002
110. Matsumoto, T., and H. Imai. On the key predistribution system: A practical solution to the key distribution problem. CRYPTO ‘87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. Springer-Verlag, 1988, 185–193.
111. Merkle, R. Protocols for public key cryptosystems. Proceedings of the IEEE Symposium on Research in Security and Privacy. IEEE, 1980, 122–134.
112. Perrig, A., R. Szewczyk, J. Tygar, V. Wen, and D. Culler. SPINS: Security protocols for sensor. Wireless Networks 8, no. 5 (2002): 521–534.
113. Sakai R., K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. 2000 Symposium on Cryptography and Information Security – SCIS’2000. Okinawa, Japan, January 2000.
114. Shamir, A. Identity-based cryptosystems and signature schemes. Advances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science (Springer-Verlag) 196 (1984): 47–53.
115. Al-Karaki, J. N., and A. E. Kamal. Routing techniques in wireless sensor networks: A survey. Wireless Communications (IEEE) 11 (2004): 6–28.
116. Akyildiz, I. F., M. C. Vuran, and O. B. Akan. A cross-layer protocol for wireless sensor networks. Proceedings of Information Science and Systems. 2006.
117. Aranha, D., R. Dahab, J. López, and L. Oliveira. Efficient implementation of elliptic curve cryptography in wireless sensors. Advances in Mathematics of Communications 4, no. 2 (2010): 169–187.
118. Boneh, D., and M. Franklin. Identity-based encryption from the Weil pairing. Lecture Notes in Computer Science (Springer-Verlag) 2139 (2001): 213–229.
119. Banerjee, P., D. Jacobson, and S. N. Lahiri. Security and performance analysis of a secure clustering protocol for sensor networks. Network Computing and Application (IEEE), 2007, 145–152.
120. Chan, H., and A. Perrig. ACE: An emergent algorithm for highly uniform cluster formation. Lecture Notes in Computer Science (Springer) 2920 (2004): 154–171.
121. Ganesan, D., R. Govindan, S. Shenker, and D. Estrin. Highly-resilient, energy-efficient multipath routing in wireless sensor networks. Mobile Computing and Communications Review (ACM SIGMOBILE) 5, no. 4 (2001): 10–24.
122. Haas, Z., and M. Pearlman. The performance of query control scheme for the zone routing protocol. Transactions on Networking (IEEE), 2001, 427–438.
123. Heinzelman, W., A. Chandrakasan, and H. Balakrishnan. An application specific protocol architecture for wireless microsensor networks. Transactions on Wireless Communications (IEEE) 1, no. 4 (2002): 660–670.
124. Johnson, D., and D. Maltz. Dynamic source routing. Mobile Computing (Kulwer Academic Press), 1996, 153–181.
125. Khalili, A., J. Katz, and A. Arbaugh. Towards secure key distribution in truly ad-hoc network. Symposium on Applications and the Internet Workshops. IEEE, 2003, 342–346.
126. Kuo-Feng, S., W. Wei-Tong, and C. Wen-Chung. Detecting Sybil attacks in wireless sensor networks using neighboring information. Computer Networks (Elsevier) 53, no. 18 (December 2009): 3042–3056.
127. Lindsey, S., and C. S. Raghavendra. PEGASIS: Power-efficient gathering in sensor information systems. Proceedings of Aerospace Conference. IEEE, 2002, 1125–1130.
128. Lu, H., J. Li, and H. Kameda. A secure routing protocol for cluster-based wireless sensor networks using id-based digital signature. Global Telecommunications Conference. IEEE, 2010, 1–5.
129. Mallanda, C., S. Basavaraju, A. Kulshrestha, R. Kannan, A. Durresi, and S. S. Iyengar. Secure cluster based energy aware routing for wireless sensor networks. Proceedings of International Conference on Wireless Networks. CSREA, 2004, 461–466.
130. Maurer, U. M., and Y. Yacobi. A non-interactive public-key distribution system. Designs, Codes and Cryptography (Kluwer) 9, no. 3 (1996): 305–316.
131. Newsome, J., E. Shi, D. Song, and A. Perrig. The Sybil attack in sensor networks: analysis & defenses. Third International Symposium on Information Processing in Sensor Networks, IPSN. IEEE, 2004, 259–268.
132. Oliveira, L. B., A. Ferreira, M. A. Vilaça, H. C. Wong, M. Bern, R. Dahab, and A. F. F. Loureiro. SecLEACH—On the security of clustered sensor networks. Signal Processing (Elsevier) 87, no. 12 (2007): 2882–2895.
133. Perkins, C., and E. Royer. Ad-hoc on-demand distance vector routing. Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications. 1999, 90–100.
134. Perkins, C., and P. Bhagwat. Highly dynamic destination sequenced distance-vector routing for mobile computers. ACM’s Computer Communication Review (ACM), 1994, 234–244.
135. Perrig, A., R. Szewczyk, J. Tygar, V. Wen, and D. Culler. SPINS: security protocols for sensor. Wireless Networks 8, no. 5 (2002): 521–534.
136. Rivest, R. L. The RC5 Encryption Algorithm. Leuven Workshop on Fast Software Encryption. Springer, 1995, 86–96.
137. Shah, R. C., S. Roy, S. Jain, and W. Brunette. Data MULEs: modeling a three-tier architecture for sparse sensor networks. Sensor Network Protocols and Applications. IEEE, 2003, 30–41.
138. Shakkottai, S., T. S. Rappaport, and P. C. Karlsson. Cross-layer design for wireless networks. Communications Magazine (IEEE) 2003, 74–80.
139. Xiao, Y., X. Shen, and D. Du. Wireless network security. Springer, 2007.
140. Yarvis, M., N. Kushalnagar, H. Singh, A. Rangarajan, Y. Liu, and S. Singh. Exploiting Heterogeneity in Sensor Networks. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, 2005, 878–890.
141. Yia, S., J. Heo, Y. Cho, and J. Hong. PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks. Computer Communications (Elsevier) 30, no. 14–15 (2007): 2842–2852.
142. Yu, Y., R. Govindan, and D. Estrin. Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. Tech Report, UCLA, 2001.
143. ElBatt, T., and A. Ephremides. Joint scheduling and power control for wireless ad hoc networks. IEEE Transactions on Wireless Communications 3, no. 1 (2004): 74–85.
144. Floyd, S. TCP and explicit congestion notification. SIGCOMM Computer Communication Review 24, no. 5 (1994): 8–23.
145. Larzon, L.-A., U. Bodin, and O. Schelen. Hints and notifications. Wireless Communications and Networking Conference. IEEE, 2002, 635–641.
146. Raisinghani, V. T., and S. Iyer. Cross-layer design optimizations in wireless protocol stacks.
147. Computer Communication 27 (2004): 720–724.
148. Saglam, O., and M. E. Dalkılıc. A self organizing multihop clustering protocol for wireless sensor networks. Fifth International Conference on Mobile Ad-hoc and Sensor Networks. IEEE, 2009a, 33–40.
149. Saglam, O., and M. E. Dalkılıc. Cross layer implementation of key establishment protocols in wireless sensor networks. International Symposium on Computer and Information Sciences. IEEE, 2009b, 346–351.
150. Shakkottai, S., T. S. Rappaport, and P. C. Karlsson. Cross-layer design for wireless networks. Communications Magazine . IEEE, 41, no. 10 (2003): 74–80.
151. Zhengrong, Ji, Y. Yang, Z. Junlan, T. Mineo, and R. Bagrodia. Exploiting medium access diversity in rate adaptive wireless LANs. MobiCom ‘04. ACM, n.d., 345–359.
152. Barreto, L. M., S. Galbraith, C. O’Heigeartaigh, and M. Scott. Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography 42 (2007): 239–271.
153. Brickell, E. F., D. M. Gordon, K. S. McCurley, and D. B. Wilson. Fast exponentiation with precomputation. Advances in Cryptology-Proceedings of EUROCRYPT 1992, Lecture Notes in Computer Science. Springer-Verlag, 1993, 200–207.
154. Certicom. Standards for efficient cryptography – SEC 2: Recommended elliptic curve domain parameters. Certicom, 2000.
155. Comba, P. Exponentiation cryptosystems on the IBM PC. IBM System (1990): 526–538.
156. Eberle, H., A. Wander, N. Gura, S. Chang-Shantz, and V. Gupta. Architectural extensions for elliptic curve cryptography over GF(2m) on 8-bit microprocessors. 16th International Conference on Application-Specific Systems, Architectures and Processors. IEEE, 2005, 343–349.
157. Fong, K., D. Hankerson, J. Lopez, and A. Menezes. Field inversion and point halving revisited. IEEE Transactions on Computers 53 (2004): 1047–1059.
158. Gura, N., A. Patel, A. Wander, H. Eberle, and S. C. Shantz. Comparing elliptic curve cryptography and RSA on 8-bit CPUs. 6th International Workshop on Cryptographic Hardware and Embedded Systems (Lecture Notes in Computer Science). Springer, 2004, 119–132.
159. Hankerson, D., L. J. Hernandez, and A. Menezes. Software implementation of elliptic curve cryptography over binary fields. Cryptographic Hardware and Embedded Systems-CHES 2000: Lecture Notes in Computer Science. Springer, 2000, 1–24.
160. Knuth, D. E. The art of computer programming. Addison-Wesley Longman, 1997.
161. Koyama, K., and Y. Tsuruoka. Speeding up elliptic cryptosystems by using a signed binary window method. Advances in Cryptology; Lecture notes in Computer Science (Springer-Verlag) 740 (1993): 345–357.
162. Lim, C. H., and P. J. Lee. More flexible exponentiation with precomputation. 14th Annual International Cryptology Conference on Advances in Cryptology. Springer-Verlag, 1994, 95–107.
163. Liu, A., and P. Ping. TinyECC: A configurable library for elliptic curve cryptography in wireless sensor networks. 7th International Conference on Information Processing in Sensor Networks. IEEE, 2008, 245–256.
164. Lopez, J., and R. Dahab. High-speed software multiplication in GF(2m) without precomputation. INDOCRYPT: First International Conference on Progress in Cryptology. Springer-Verlag, 2000, 203–212.
165. Malan, D. J., M. Welsh, and M. D. Smith. A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography. IEEE SECON 2004: 1st Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (Oct. 4–7, 2004). IEEE, 2004, 71–80
166. Miyaji, A., T. Ono, and H. Cohen. Efficient elliptic curve exponentiation. International
167. Conference on Information and Communications Security: Lecture Notes in Computer Science. Springer-Verlag, 1997, 282–290.
168. Montgomery, P. Modular multiplication without division. Mathematics of Computation (American Mathematical Society) 44 (1985): 519–521.
169. NIST. Recommended elliptic curves for Federal government use. National Institute of Standards and Technology, 1999. http://csrc.nist.gov/groups/ST/toolkit/documents/dss/NISTReCur.doc
170. Paar, C. Implementation options for finite field arithmetic for elliptic curve cryptosystems. Invited presentation at the 3rd Workshop on Elliptic Curve Cryptography (ECC’99). 1999.
171. Pohlig, S., and M. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. Edited by IEEE. Transactions on Information Theory 24 (1978): 106–110.
172. Pollard, J. M. Monte Carlo methods for index computation (mod p). Mathematics of Computation (American Mathematical Society) 32 (1978): 918–924.
173. Seo, S. C., D. Han, and S. Hong. TinyECCK: Efficient elliptic curve cryptography implementation over G(2) on 8-bit MICAz mote. IEICE Transactions. IEICE, 2008.
174. Shantz, S. C. From Euclid’s GCD to Montegomery multiplication to the great divide. TR-2001-95 2001, Sun Microsystems Laboratories, 2001.
175. Szczechowiak, P. Cryptographic key distribution in wireless sensor networks using bilinear pairings. Ph.D. thesis, Dublin City University, 2010.
176. Szczechowiak, P, L. B. Oliveira, M. Scott, M. Collier, and R. Dahab. NanoECC: Testing the limits of elliptic curve cryptography in sensor networks. European Conference on Wireless Sensor Networks, Lecture Notes in Computer Science. Springer, 2008, 305–320.
177. Uhsadel, L., A. Poschmann, and C. Paar. Enabling full-size public-key algorithms on 8-bit sensor nodes. European Workshop on Security and Privacy in Ad Hoc and Sensor Networks: Lecture Notes in Computer Science. Springer, 2007, 73–86.
178. Wang, H., B. Sheng, and Q. Li. Elliptic curve cryptography based access control in sensor networks. International Journal of Security and Networks 1 (2006): 127–137.
179. Woodbury, A. D., D. V. Bailey, and C. Paar. Elliptic curve cryptography on smart cards without coprocessors. The Fourth Smart Card Research and Advanced Applications. 2000.
180. Yan, H., and Z. J. Shi. Studying software implementations of elliptic curve cryptography. 3rd International Conference on Information Technology: New Generations. IEEE, 2006, 78–83.