Secure Routing in Wireless Sensor Networks

  • Jamil Ibriq
  • Imad Mahgoub
  • Mohammad Ilyas

Abstract

Wireless sensor networks (WSNs) have attractive features that make them applicable to every facet of our daily lives. WSNs can be rapidly deployed in inaccessible areas at a fraction of the cost of wired networks. Sensor devices in WSNs are unattended throughout their lifetime and hence do not require any maintenance. The application possibilities of WSNs are enormous. Their present potential ranges from managing traffic signals to monitoring patients’ heartbeats. Their future potential is enormous; they can be used to measure almost every physical phenomenon and thus change the way we interact with the world around us and with farreaching social implications.

Keywords

Sensor Network Sensor Node Wireless Sensor Network Cluster Head Dynamic Source Route 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 27.1.
    D. Estrin, D. Culler, K. Pister, G. Sukhatme: Connecting the physical world with pervasive networks, IEEE Pervasive Comput. 1(1), 59–69 (2002)CrossRefGoogle Scholar
  2. 27.2.
    K. Akkaya, M. Younis: An energy-aware QoS routing protocol for wireless sensor networks, Proc. 23rd Int. Conference on Distributed Computing Systems Workshops (ICDCSW’03), Providence, Rhode Island, USA, May 2003 (2003) pp. 710–715Google Scholar
  3. 27.3.
    D. Braginsky, D. Estrin: Rumor routing algorithm for sensor networks, Proc. 1st Workshop on Sensor Networks and Applications (WSNA), Atlanta, GA, USA, October 2002 (2002) pp. 22–31Google Scholar
  4. 27.4.
    N. Bulusu, D. Estrin, L. Firod, J. Heidemann: Scalable coordination for wireless sensor networks: Self-configuring localization systems, Proc. 6th Int. Symposium on Communication Theory and Applications (ISCTA’01), Ambleside, Lake District, UK, July 2001 (2001)Google Scholar
  5. 27.5.
    J. Chang, L. Tassiulas: Maximum lifetime routing in wireless sensor network, IEEE/ACM Trans. Netw. 12(4), 609–619 (2004)CrossRefGoogle Scholar
  6. 27.6.
    M. Chu, H. Haussecker, F. Zhao: Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks, Technical Report, TR No. P2001-10113, Xerox Palo Alto Research Center, Palo Alto, CA, USA (May 2001)Google Scholar
  7. 27.7.
    K. Dasgupta, K. Kalpakis, P. Namjoshi: Maximum lifetime data gathering and aggregation in wireless sensor networks, Technical Report, TR No. CS-01-12, University of Maryland, Baltimore, MD, USA, (August 2002)Google Scholar
  8. 27.8.
    K. Dasgupta, K. Kalpakis, P. Namjoshi: An efficient clustering-based heuristic for data gathering and aggregation in sensor networks, Proc. IEEE Wireless Communications and Networking Conference (WCNC’03), New Orleans, Louisiana, USA, March 2003 (2003) pp. 1948–1953, Vol. 3Google Scholar
  9. 27.9.
    S. Ganeriwal, M.B. Srivastava: Reputation-based framework for high integrity sensor networks, Proc. 2nd Workshop on Security of Ad hoc and Sensor Networks (SASN’04), Washington DC, USA, October 2004 (2004) pp. 66–77Google Scholar
  10. 27.10.
    D. Ganesan, R. Govindan, S. Shenker, D. Estrin: Highly-resilient, energy-efficient multipath routing in wireless sensor networks, ACM Mob. Comput. Commun. Rev. 5(4), 11–25 (2001)CrossRefGoogle Scholar
  11. 27.11.
    P. Ganesan, R. Venugopalan, P. Peddabachagari, A. Dean, F. Mueller, M. Sichitiu: Analyzing and modeling encryption overhead for sensor network nodes, Proc. 2nd ACM Int. Conference on Wireless Sensor Networks and Applications (WSNA’03), San Diego, CA, USA, September 2003 (2003) pp. 151–159Google Scholar
  12. 27.12.
    W. Heinzelman, A. Chandrakasan, H. Balakrishnan: Energy-efficient communication protocol for wireless microsensor networks, Proc. 33rd Annual Hawaii Int. Conference on System Sciences (HICSS’00), Maui, Hawaii, USA, January 2000 (2000) p. 10, Vol. 2Google Scholar
  13. 27.13.
    W. Heinzelman, J. Kulik, H. Balakrishnan: Adaptive protocols for information dissemination in wireless sensor networks, Proc. 5th Annual ACM/IEEE Int. Conference on Mobile Computing and Networking (MobiCom’99), Seattle, WA, August 1999 (1999) pp. 174–185Google Scholar
  14. 27.14.
    C. Intanagonwiwat, R. Govindan, D. Estrin: Directed diffusion: A scalable and robust communication paradigm for sensor networks, Proc. 6th Annual ACM/IEEE Int. Conference on Mobile Computing and Networking (MobiCom’00), Boston, MA, USA, August 2000 (2000) pp. 56–67Google Scholar
  15. 27.15.
    K. Kalpakis, K. Dasgupta, P. Namjoshi: Maximum lifetime data gathering and aggregation in wireless sensor networks, Technical Report, TR CS-02-12, University of Maryland, Baltimore, Maryland (August 2002)Google Scholar
  16. 27.16.
    B. Karp, H. Kung: GPSR: greedy perimeter stateless routing for wireless networks, Proc. 6th Annual ACM/IEEE Int. Conference on Mobile Computing and Networks (MobiCom’00), Boston, MA, August 2000 (2000) pp. 243–254, , Vol. 3Google Scholar
  17. 27.17.
    S. Lindsey, C. Raghavendra, K. Sivalingam: Data gathering in sensor networks using the energy*delay metric, Proc. IPDPS Workshop on Issues in Wireless Networks and Mobile Computing, San Francisco, CA, USA, April 2001 (2001) p. 188Google Scholar
  18. 27.18.
    S. Lindsey, C.S. Raghavendra: PEGASIS: power efficient gathering in sensor information systems, Proc. IEEE Aerospace Conference, Big Sky, Montana, USA, March 2002 (2002) pp. 1125–1130, Vol. 3Google Scholar
  19. 27.19.
    A. Manjeshwar, D. Agrawal: TEEN: A protocol for enhanced efficiency in wireless sensor networks, Proc. 15th Int. Parallel and Distributed Processing Symposium (IPDPS’01), San Francisco, CA, USA, April 2001 (2001) pp. 2009–2015Google Scholar
  20. 27.20.
    V. Rodoplu, T. Ming: Minimum energy mobile wireless networks, IEEE J. Sel. Areas Commun. 17(8), 1333–1344 (1999)CrossRefGoogle Scholar
  21. 27.21.
    N. Sadagopan, B. Krishnamachari, A. Helmy: The ACQUIRE mechanism for efficient querying in sensor networks, Proc. 1st Int. Workshop on Sensor Network Protocol and Applications, Anchorage, Alaska, USA, May 2003 (2003) pp. 145–155Google Scholar
  22. 27.22.
    R.C. Shah, J.M. Rabaey: Energy aware routing for low energy ad hoc sensor networks, Proc. IEEE Wireless Communications and Networking Conference (WCNC’02), Orlando, FL, USA, March 2002 (2002) pp. 350–355, Vol. 1Google Scholar
  23. 27.23.
    I. Stojmenovic, X. Lin: GEDIR: Loop-free location based routing in wireless networks, Int. Conference on Parallel and Distributed Computing and Systems, Boston, MA, USA, November 1999 (1999)Google Scholar
  24. 27.24.
    Y. Xu, J. Heidemann, D. Estrin: Geography-informed energy conservation for ad hoc routing, Proc. 7th Annual ACM/IEEE Int. Conference on Mobile Computing and Networking (MobiCom’01), Rome, Italy, July 2001 (2001) pp. 70–84Google Scholar
  25. 27.25.
    Y. Yao, J. Gehrke: The COUGAR approach to in-network query processing in sensor networks, ACM SIGMOD Rec. 31(3), 9–18 (2002)CrossRefGoogle Scholar
  26. 27.26.
    M. Ilyas, I. Mahgoub (Eds.): Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems (CRC Press, Boca Raton, FL 2005)Google Scholar
  27. 27.27.
    I. Mahgoub, M. Ilyas (Eds.): Sensor Network Protocols (CRC Press, Boca Raton, FL 2006)Google Scholar
  28. 27.28.
    Y. Yu, D. Estrin, R. Govindan: Geographical and energy-aware routing: a recursive data dissemination protocol for wireless sensor networks, Technical Report, TR-01-0023, University of California at Los Angeles, Computer Science Department, Los Angeles, CA (August 2001)Google Scholar
  29. 27.29.
    J. Broch, D. Maltz: The dynamic source routing protocol for mobile ad hoc network, IETF Internet Drafts, draft-ietf-manet-dsr-02.txt (June 1999)Google Scholar
  30. 27.30.
    V. Park, S. Corson: Temporally-ordered routing algorithm (TORA) version 1, IETF Internet Drafts, draft-ietf-manet-tora-spec-02.txt (October 1999)Google Scholar
  31. 27.31.
    C. Perkins, P. Bhagwat: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, Proc. Conference on Communications Architectures, Protocols and Applications, London, UK, August 1994 (1994) pp. 234–244Google Scholar
  32. 27.32.
    C. Perkins, E. Royer: Ad-hoc on-demand distance vector routing, Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 99), New Orleans, LA, USA, February 1999 (1999) pp. 90–100Google Scholar
  33. 27.33.
    W. Ye, J. Heidemann, D. Estrin: An energy-efficient MAC protocol for wireless sensor networks, Proc. 21st Int. Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’02), June 2002 (2002) pp. 1567–1576, Vol. 3Google Scholar
  34. 27.34.
    J. Ibriq, I. Mahgoub: A secure hierarchical routing protocol for wireless sensor networks, Proc. 10th IEEE Int. Conference on Communication Systems (ICCS’06), Singapore, October 2006 (2006) pp. 1–6Google Scholar
  35. 27.35.
    T. Park, K. Shin: LiSP: A lightweight security protocol for wireless sensor networks, Trans. Embed. Comput. Syst. 3(3), 634–660 (2004)CrossRefGoogle Scholar
  36. 27.36.
    A. Perrig, R. Szewczyk, V. Wen, D. Culler, J. Tygar: SPINS: Security protocols for sensor networks, Proc. 7th Annual ACM/IEEE Int. Conference on Mobile Computing and Networks (MobiCom’01), Rome, Italy, July 2001 (2001) pp. 189–199Google Scholar
  37. 27.37.
    B. Przydatek, D. Song, A. Perrig: SIA: Secure information aggregation in sensor networks, Proc. 1st Int. Conference on Embedded Networked Sensor Systems (SenSys’03), Los Angeles, CA, USA, November 2003 (2003) pp. 255–265Google Scholar
  38. 27.38.
    S. Slijepcevic, M. Potkonjak, V. Tsiatsis, S. Zimbeck, M. Srivastava: On communication security in wireless ad-hoc sensor networks, Proc. 11th IEEE Int. Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE’02), Pittsburgh, PA, USA, June 2002 (2002) pp. 139–144Google Scholar
  39. 27.39.
    J. Yin, S. Madria: Secrout: a secure routing protocol for sensor networks, Proc. IEEE 20th Int. Conference on Advanced Information Networking and Applications (AINA’06), Vienna, Austria, April 2006 (2006) pp. 18–20Google Scholar
  40. 27.40.
    S. Zhu, S. Setia, S. Jajodia: LEAP: Efficient security mechanisms for large-scale distributed sensor networks, Proc. 10th ACM Conference on Computer and Communication Security, Washington, DC, USA, October 2003 (2003) pp. 62–72Google Scholar
  41. 27.41.
    M. Tubaishat, J. Yin, B. Panja, S. Madria: A secure hierarchical model for sensor network, ACM SIGMOD Rec. 33(1), 7–13 (2004)CrossRefGoogle Scholar
  42. 27.42.
    J. Ibriq, I. Mahgoub: Cluster-based routing in wireless sensor networks: issues and challenges, Proc. 2004 Int. Symposium on Performance Evaluation of Computer and Telecommunication Systems, San Jose, CA, USA, July 2004 (2004) pp. 759–766Google Scholar
  43. 27.43.
    I. Mahgoub, M. Ilyas (Eds.): SMART DUST: Sensor Network Applications, Architecture, and Design (CRC Press, Boca Raton, FL 2006)Google Scholar
  44. 27.44.
    G.J. Pottie, W.J. Kaiser: Wireless integrated network sensors, Commun. ACM 43(5), 51–58 (2000)CrossRefGoogle Scholar
  45. 27.45.
    J. Garcia-Luna-Aceves, S. Mrthy: An efficient routing protocol for wireless networks, ACM Mob. Netw. Appl. J. 1(2), 183–197 (1996)CrossRefGoogle Scholar
  46. 27.46.
    Z. J. Haas, M. R. Pearlman: The zone routing protocol (ZRP) for ad hoc networks, IETF Internet Drafts, draft-ietf-manet-zrp-02.txt (June 1999)Google Scholar
  47. 27.47.
    D. Carman, P. Kruus, B. Matt: Constraints and approaches for distributed sensor network security, Technical Report TR No. 00-010, NAI Labs, The Security Research Division, Glenwood, MD, USA (September 2000)Google Scholar
  48. 27.48.
    F. Stajano, R. Anderson: The resurrecting duckling: security issues for ad-hoc wireless networks:, 1999 AT&T Software Symposium, September 1999 (1999) pp. 172–194Google Scholar
  49. 27.49.
    D. Estrin, D. Culler, K. Pister, G. Sukhatme: Connecting the physical world with pervasive networks, IEEE Pervasive Comput. 1(1), 59–69 (2002)CrossRefGoogle Scholar
  50. 27.50.
    C. Karlof, D. Wagner: Secure routing in wireless sensor networks: Attacks and countermeasures, Proc. 1st IEEE Int. Workshop on Sensor Network Protocols and Applications (SNPA’03), Anchorage, Alaska, USA, May 2003 (2003) pp. 113–127Google Scholar
  51. 27.51.
    L. Hu, D. Evans: Using directional antennas to prevent wormhole attacks, Network and Distributed System Security Symposium (NDSS’04), San Diego, February 2004 (2004)Google Scholar
  52. 27.52.
    A. Patcha, A. Mishra: Collaborative security architecture for black hole attack prevention in mobile ad hoc networks, Proc. of RAWCON’03 (2003) pp. 75–78Google Scholar
  53. 27.53.
    W. Wang, B. Bhargava: Visualization of wormholes in sensor networks, ACM Workshop on Wireless Security (WiSe 2004), Philadelphia, PA, October 2004 (2004) pp. 51–60Google Scholar
  54. 27.54.
    J. Zhen, S. Srinivas: Preventing replay attacks for secure routing in ad hoc networks,. In: ADHOC-NOW 2003, Lecture Notes in Computer Science, Vol. 2865, ed. by S. Pierre, M. Barbeau, E. Kranakis (Springer, Berlin Heidelberg 2003) pp. 140–150Google Scholar
  55. 27.55.
    Y. Hu, A. Perrig, D. Johnson: Packet leashes: a defense against wormhole attacks in wireless ad hoc networks, Proc. IEEE 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’03), San Francisco, CA, USA, April 2003 (2003)Google Scholar
  56. 27.56.
    N. Song, L. Qian, X. Li: Wormhole attacks detection in wireless ad hoc networks: A statistical analysis approach, Proc. 19th IEEE Int. Parallel and Distributed Processing Symposium (IPDPS’05) (2005)Google Scholar
  57. 27.57.
    J. Douceur: The Sybil attack: 1st Int. Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, USA, March 2002, ed. by P. Druschel, F. Kaashoek, A. Rowstron (2002) pp. 251–260Google Scholar
  58. 27.58.
    C. Schurgers, M. Srivastava: Energy efficient routing in wireless sensor networks, Proc.Military Communications Conference (MILCOM 2001) on Communications for Network-Centric Operations: Creating the Information Force, McLean, VA, USA, October 2001 (2001) pp. 357–361, Vol. 1Google Scholar
  59. 27.59.
    A. Manjeshwar, D. Agrawal: APTEEN: A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks, Proc. Int. Parallel and Distributed Processing Symposium (IPDPS’02), Ft. Lauderdale, FL, USA, April 2002 (2002) pp. 195–202Google Scholar
  60. 27.60.
    L. Subramanian, R. H. Katz: An architecture for building self configurable systems, Proc. IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHoc’00), Boston, MA, August 2000 (2000) pp. 63–73Google Scholar
  61. 27.61.
    M. Younis, M. Youssef, K. Arisha: Energy-aware routing in cluster-based sensor networks, Proc. 10th IEEE/ACM Int. Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS’02), Fort Worth, TX, USA, October 2002 (2002) pp. 129–136Google Scholar
  62. 27.62.
    O. Younis, S. Fahmy: Distributed clustering in ad-hoc sensor networks: A hybrid, energy-efficient approach, IEEE Trans. Mob. Comput. 3(4), 366–379 (2004)CrossRefGoogle Scholar
  63. 27.63.
    F. Ye, A. Chen, S. Lu, L. Zhang: A scalable solution to minimum cost forwarding in large sensor networks, Proc. 10th Int. Conference on Computer Communications and Networks, Scottsdale, Arizona, USA, October 2001 (2001) pp. 304–309Google Scholar
  64. 27.64.
    M.J. Beller, Y. Yacobi: Fully-fledged two-way public key authentication and key agreement for low-cost terminals, Electron. Lett. 29(11), 999–1001 (1993)CrossRefGoogle Scholar
  65. 27.65.
    R. Blom: An optimal class of symmetric key generation systems,. In: Advances in Cryptology: Proceedings of EuroCrypt’84, Lecture Notes in Computer Science, Vol. 209, ed. by T. Beth, N. Cot, I. Ingemarsson (Springer, Berlin 1984) pp. 335–338Google Scholar
  66. 27.66.
    C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, M. Yung: Perfectly-secure key distribution for dynamic conferences. In: Advances in Cryptology – Crypto’92, Lecture Notes in Computer Science, Vol. 740, ed. by F. Ernest Brickell (Springer, Berlin 1992) pp. 471–486Google Scholar
  67. 27.67.
    M. Bohge, W. Trappe: An authentication framework for hierarchical ad hoc sensor networks, Proc. 2003 ACM Workshop on Wireless Security (WiSE’03), San Diego, CA, USA, September 2003 (2003) pp. 79–87Google Scholar
  68. 27.68.
    H. Chan, A. Perrig, D. Song: Random key predistribution schemes for sensor networks, Proc. IEEE Symposium on Security and Privacy, Berkeley, CA, USA, 11–14 May 2003 (2003) pp. 197–213Google Scholar
  69. 27.69.
    H. Chan, A. Perrig: PIKE: peer intermediaries for key establishment in sensor networks, Proc. IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Miami, FL, USA, March 2005 (2005) pp. 524–535, Vol. 1Google Scholar
  70. 27.70.
    W. Du, J. Deng, Y. Han, S. Chen, P. Varshney: A key management scheme for wireless sensor networks using deployment knowledge, Proc. 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), Hong Kong, PR China, March 2004 (2004) pp. 586–597, Vol. 1Google Scholar
  71. 27.71.
    W. Du, J. Deng, Y. Han, P. Varshney: A pairwise key pre-distribution scheme for wireless sensor networks, Proc. 10th ACM Conference on Computer and Communication Security (CCS’03), Washington, D.C., USA, October 2003 (2003) pp. 42–51Google Scholar
  72. 27.72.
    L. Eschenauer, V. Gligor: A key-management scheme for distributed sensor networks, Proc. 9th ACM Conference on Computer and Communications Security, Washington, DC, USA, November 2002 (2002) pp. 41–47Google Scholar
  73. 27.73.
    D. Huang, M. Mehta, D. Medhi, L. Harn: Location-aware key management scheme for wireless sensor networks, Proc. 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN’04), Washington DC, USA, October 2004 (2004), pp 29–42Google Scholar
  74. 27.74.
    B. Lai, S. Kim, I. Verbauwhede: Scalable session key construction protocol for wireless sensor networks, IEEE Workshop on Large Scale RealTime and Embedded Systems (LARTES), Austin, TX, USA, December 2002 (2002)Google Scholar
  75. 27.75.
    J. Lee, D.R. Stinson: Deterministic key predistribution schemes for distributed sensor networks, Proc. 11th Int. Workshop on Selected Areas in Cryptography, SAC 2004 Waterloo, Canada, August 2004 (2004) pp. 294–307Google Scholar
  76. 27.76.
    D. Liu, P. Ning: Efficient distribution of key chain commitments for broadcast authentication in distributed sensor networks, 10th Annual Network and Distributed System Security Symposium, San Diago, CA, USA, February 2003 (2003)Google Scholar
  77. 27.77.
    D. Liu, P. Ning: Location-based pairwise key establishments for static sensor networks, Proc. 1st ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN’03), Fairfax, VA, USA, October 2003 (2003) pp. 72–82Google Scholar
  78. 27.78.
    D. Liu, P. Ning, W. Du: Group-based key pre-distribution in wireless sensor networks, Proc. 4th ACM Workshop on Wireless Security (WiSe’05), Cologne, Germany, September 2005 (2005) pp. 11–20Google Scholar
  79. 27.79.
    D. Liu, P. Ning, R. Li: Establishing pairwise keys in distributed sensor networks, ACM Trans. Inf. Syst. Secur. 8(1), 41–77 (2005)CrossRefGoogle Scholar
  80. 27.80.
    R. Watro, D. Kong, S. Cuti, C. Gardiner, C. Lynn, P. Kruus: TinyPK: Securing sensor networks with public key technology, Proc. 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN’04), Washington, DC, USA, October 2004 (2004) pp. 59–64Google Scholar
  81. 27.81.
    L. Zhou, J. Ni, C.V. Ravishankar: Efficient key establishment for group-based wireless sensor deployments, Proc. 4th ACM workshop on Wireless security (WiSe’05), September 2005 (2005) pp. 1–10Google Scholar
  82. 27.82.
    H. Krawczyk, M. Bellare, R. Canetti: HMAC: keyed-hashing for message authentication, RFC 2104 (February 1997) Google Scholar
  83. 27.83.
    W. Diffie, M.E. Hellman: Privacy and authentication: an introduction to cryptography, Proc. IEEE 67(3), 397–427 (1979)CrossRefGoogle Scholar
  84. 27.84.
    O. Goldreich, S. Goldwasser, S. Micali: How to construct random functions, J. ACM 33(4), 792–807 (1986)CrossRefMathSciNetGoogle Scholar
  85. 27.85.
    A. Perrig, R. Canetti, J. Tygar, D. Song: The TESLA broadcast authentication protocol, RSA Cryptobytes 5(2), 2–13 (2002)Google Scholar
  86. 27.86.
    R.L. Rivest: The RC5 encryption algorithm, Proc. 1st Workshop on Fast Software Encryption, Leuven, Belgium, December 1995 (1995) pp. 86–96Google Scholar
  87. 27.87.
    S. Goldwasser, S. Micali: Probabilistic encryption, J. Comput. Syst. Sci. 28(2), 270–299 (1984)MATHCrossRefMathSciNetGoogle Scholar
  88. 27.88.
    R. L. Rivest: The MD5 message-digest algorithm, RFC 1321 (1992)Google Scholar
  89. 27.89.
    S. Setia, S. Koussih, S. Jajodia, E. Harder: Kronos: A scalable group re-keying approach, Proc. IEEE Symposium on Security and Privacy (S&P 2000), Oakland, CA, USA, May 2000 (2000)Google Scholar
  90. 27.90.
    Z. Haas, M. Pearlman: The performance of query control schemes for the zone routing protocol, Proc. ACM SIGCOMM’98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Vancouver, British Columbia, Canada, August 1998 (1998) pp. 167–177Google Scholar
  91. 27.91.
    L. Zhou, F. Schneider, R. Van Renesse: COCA: A secure distributed online certification authority, ACM Trans. Comput. Syst. 20(4), 329–368 (2002)CrossRefGoogle Scholar
  92. 27.92.
    D. Boneh, H. Shacham: Fast variants of RSA, RSA Cryptobytes 5(1), 1–9 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jamil Ibriq
    • 1
  • Imad Mahgoub
    • 2
  • Mohammad Ilyas
    • 2
  1. 1.Department of Mathematics and Computer ScienceDickinson State UniversityDickinsonUSA
  2. 2.Department of Computer Science & EngineeringFlorida Atlantic UniversityBoca RatonUSA

Personalised recommendations