CHAPTER 7 SUMMARY
7.2 Future Work
To provide efficient key management for wireless sensor networks, we propose a solution for establishing pairwise key between sensor nodes. However, within this research area, there are many other problems that have not been well solved. Some of the problems that we want to study in the future include end-to-end key establishment, group key management and key revocation.
• An end-to-end key is required when two nodes far away from each other want to ex- change their own information. It may be established by exploiting the pairwise keys of multiple hops or with the help of the base station. However, either approach involves high communication overhead and is head to be applied into wireless sensor networks. • Group key management is another challenging problem. Group keys are highly desired in
wireless sensor networks, because sensor nodes are often organized into groups or clusters to detect the events occurring locally. However, sensor nodes may frequently join and leave their groups due to unexpected failures, temporary disconnection, or node renew. Therefore, it is very hard to maintain group keys with low communication overhead while keeping strong resilience to key disclosure in wireless sensor networks. In addition,
group keys are often required to be self-healing for accommodating unreliable wireless communication, which greatly increases the complexity of group key management. • Another untouched problem in key management is the revocation of compromised keys
(or nodes). Majority voting is a promising solution to this problem. However, it cannot be applied trivially, because the compromised nodes whose keys should be revoked can also make use of the votes to attack benign nodes. A carefully designed voting scheme is necessary to tackle the key revocation problem.
For filtering false data injection and DoS attacks in wireless sensor networks, we come up with a solution that allows neighbor nodes to mutually monitor each other by exploiting the broadcast nature of wireless communication. However, this mutual monitoring approach brings two problems:
• Wireless communication is essentially unreliable and may not be bi-directional, which pose challenges to the implementation of mutual monitoring. We may enforce retrans- mission to overcome unreliability or eliminate directional links. However, this incurs high communication overhead and is inefficient for wireless sensor networks.
• Mutual monitoring requires that sensor nodes be awake always or within a long period. This causes conflicts with many energy-efficient approaches that turn off sensor nodes frequently to save energy of sensor nodes.
We will further investigate these two problems and keep on improving our proposed solution. For defending network coding against pollution attacks, we design a homomorphic signature scheme for securing normal network coding and further present a MAC-based approach for XOR network coding (including normal network coding). In the future, we would investigate other malicious attacks against network coding systems and study how to address them in the environments of wireless sensor networks. Some possible attacks that we have identified are as follows:
• So far, we assume there exists a single source within the networks. However, in wire- less sensor networks, it is quite likely that multiple sensor nodes may broadcast their
information simultaneously. In a network coding system with multiple sources, existing solutions addressing pollution attacks are no longer applicable, because the signatures (or the MACs) generated by different sources using different keys (or using different code- words) cannot be encoded together. So, multi-source poses new challenge to securing network coding against pollution attacks.
• Besides pollution attacks, the adversaries have other ways to prevent the sinks from recovering source messages. They can either selectively drop some messages, or generate new messages that are linearly dependent on previous ones. The purpose of both ways is to reduce the number of linearly independent messages received by the sinks. Introducing redundancy of source messages can solve the problem, however, it reduces the throughput of networks.
• The adversaries may even insert some false sources into network coding systems, which violates the security goal of authenticity. Our homomorphic signature scheme provides authenticity, however, our solution for XOR coding based on symmetric keys does not. So, how to achieving authenticity and integrity in XOR coding systems simultaneously is still an unsolved problem.
BIBLIOGRAPHY
[1] R. Ahlswede, N. Cai, S. Li, and R. Yeung, “Network Information Flow”, IEEE Transac- tions on Information Theory, Vol. 46, No. 4, pp. 1204–1216, 2000.
[2] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, ”A Survey on Sensor Net- works”, IEEE Communications Magazine, Vol. 40, No. 8, pp. 102–114, 2002.
[3] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, ”Wireless Sensor Networks: A Survey”, Computer Networks, Vol. 38, No. 4, pp. 393–422, 2002.
[4] P. Barreto, H. Kim, B. Lynn, and M. Scott, “Efficient Algorithms for Pairing-Based Cryptosystems”, in Proc. 22nd Annual International Cryptology Conference on Advances in Cryptology, LNCS, Vol. 2442, pp. 354–368, 2002.
[5] M. Bellare, J. Garay, and T. Rabin, “Fast Batch Verification for Modular Exponentiation and Digital Signatures”, in Proc. Advances in Cryptology (EUROCRYPT’98), LNCS, Vol. 1403, pp. 236–250, 1998.
[6] K. Bhattad and K. Narayanan, “Weakly Secure Network Coding”, in Proc. 1st Workshop on Network Coding, Theory, and Applications (NetCod), 2005.
[7] S. Biswas and R. Morris, “ExOR: Opportunistic MultiHop Routing for Wireless Networks” in Proc. ACM SIGCOMM, pp. 133–143, 2005.
[8] R. Blom, “An optimal class of symmetric key generation systems”, in Proc. EUROCRYPT, Advances in Cryptology, LNCS, Vol. 209, Springer, pp. 335–338, 1985.
[9] C. Blundo, A. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, “Perfectly-secure key distribution for dynamic conferences”, in Proc. CRYPTO, Advances in Cryptology, LNCS 740, Springer, pp. 471–486, 1993.
[10] D. Braginsky, and D. Estrin, “Rumor Routing Algorithm for Sensor Networks”, in Proc. WSNA, pp. 22–31, 2002.
[11] BTnode, http://www.btnode.ethz.ch/.
[12] N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less Low Cost Outdoor Localization for Very Small Devices”, IEEE Personal Communications Magazine, Vol. 7, No. 5, pp. 28–34, 2000.
[13] N. Cai and R. Yeung, “Secure Network Coding”, in Proc. International Symposium on Information Theory (ISIT), 2002.
[14] S. Capkun, and J. Hubaux, “Secure Positioning of Wireless Devices with Application to Sensor Networks”, in Proc. IEEE INFOCOM, 2005.
[15] D. Carman, B. Matt, and G. Cirincione, “Energy-efficient and Low-latency Key Manage- ment for Sensor Networks”, in 23rd Army Science Conference, 2002.
[16] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading Structure for Randomness in Wireless Opportunistic Routing”, in Proc. ACM SIGCOMM, pp. 169–180, 2007. [17] H. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor net-
works”, in Proc. IEEE Symposium on Security and Privacy, pp. 197–213, 2003.
[18] H. Chan, and A. Perrig, ”PIKE: Peer Intermediaries for Key Establishment in Sensor Networks”, in IEEE INFOCOM, 2005.
[19] D. Charles, K. Jian, and K. Lauter, “Signature for Network Coding”, Technique Report MSR-TR-2005-159, Microsoft, 2005.
[20] P. Chou, Y. Wu, and K. Jain, “Practical Network Coding”, in Proc. Allerton Conference on Communication, Control, and Computing, 2003.
[21] Committee on National Security Systems (CNSS) Instruction No. 4009, http://www.cnss.gov/Assets/pdf/cnssi 4009.pdf.
[22] W. Du, J. Deng, Y. S. Han, and P. K. Varshney, “A pairwise key pre-distribution scheme for wireless sensor networks”, in Proc. ACM CCS, pp. 42–51, 2003.
[23] W. Du, J. Deng, Y. S. Han, S. Chen, and P. K. Varshney, “A key management scheme for wireless sensor networks using deployment knowledge”, in Proc. IEEE INFOCOM, 2004. [24] B. Dutertre, S. Cheung, and J. Levy, “Lightweight Key Management in Wireless Sensor
Networks by Leveraging Initial Trust”, SRI Int., Tech. Rep. SRI-SDL-04-02, 2004. [25] L. Eschenauer, and V. D. Gligor, “A key-management scheme for distributed sensor net-
works”, in Proc. ACM CCS, pp. 41–47, 2002.
[26] J. Feldman, T. Malkin, C. Stein, and R. Servedio, “On the Capacity of Secure Network Coding”, in Proc. 42nd Annual Allerton Conference on Communication, Control, and Computing, 2004.
[27] C. Fragouli, J. Boudec, and J. Widmer, “Network Coding: An Instant Primer”, ACM SIGCOMM Computer Communication Review, Vol. 36, No. 1, 2006.
[28] S. Galbraith, K. Harrison, and D. Soldera, “Implementing the Tate Pairing”, in Proc. 5th Algorithmic Number Theory Symposium (ANTS V), LNCS, Vol. 2369, pp. 324–337, 2002. [29] C. Gkantsidis and P. Rodriguez, “Network Coding for Large Scale File Distribution”, in
Proc. IEEE INFOCOM, 2005.
[30] C. Gkantsidis and P. Rodriguez, “Cooperative Security for Network Coding File Distri- bution”, in Proc. IEEE INFOCOM, 2006.
[31] P. Gupta, and P. R. Kumar, “Critical power for asymptotic connectivity in wireless net- works”, in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, pp. 547–566, 1998.
[32] N. Gura, A. Patel, A. Wander, H. Eberle, and S. Shantz, “Comparing elliptic curve cryptography and RSA on 8-bit CPUs”, in Proc. Workshop on Cryptographic Hardware and Embedded Systems (CHES), LNCS, Vol. 3156, Springer, pp. 119–132, 2004.
[33] T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher, “Range- Free Localization Schemes in Large Scale Sensor Network”, in Proc. ACM MobiCom, pp. 81–95, 2003. [34] T. Ho, R. Koetter, M. M´edard, R. Karger, and M. Effros, “The Benefits of Coding over
Routing in a Randomized Setting” in Proc. International Symposium on Information Theory (ISIT), 2003.
[35] T. Ho, B. Leong, R. Koetter, M. M´eard, M. Effros, and D. Karger, “Byzantine Modifica- tion Detection in Multicast Networks Using Randomized Network Coding”, in Proc. 2004 IEEE International Symposium on Information Theory (ISIT), 2004.
[36] D. Huang, M. Mehta, D. Medhi, and L. Harn, ”Location-aware Key Management Scheme for Wireless Microsensor Networks”, in ACM SASN, 2004.
[37] D. Hwang, B. Lai, and I. Verbauwhede, “Energy-memory-security Tradeoffs in Distributed Sensor Networks”, in ADHOC-NOW, LNCS, Vol. 3158, 2004.
[38] J. Hwang, and Y. Kim, “Revisiting Random Key Pre-distribution for Sensor Networks”, in ACM SASN, 2004.
[39] S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. M´eard, “Resilient Network Coding in the Presence of Byzantine Adversaries”, in Proc. IEEE INFOCOM, 2007. [40] K. Jain, “Security Based on Network Topology against the Wiretapping Attack”, IEEE
Wireless Communications, Vol. 11, No. 1, pp. 68-71, 2004.
[41] A. Joux, “The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems”, in Proc. 5th Algorithmic Number Theory Symposium (ANTS V), LNCS, Vol. 2369, pp. 20–32, 2002.
[42] C. karlof, and D. Wagner, “Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures”, in Proc. 1st IEEE Int. Workshop on Sensor Network Protocols and Applications, pp. 113–127, 2003.
[43] B. Karp, and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, in Proc. ACM MobiCom, pp. 243–254, 2000.
[44] S. Katti, D. Katabi, W. Hu, H. Rahul, and M. M´edard, “The Importance of Being Op- portunistic: Practical Network Coding for Wireless Environments”, in Allerton, 2005. [45] S. Katti, H. Rahul, W. Hu, D. Katabi, M. M´edard, and J. Crowcroft, “XORs in The Air:
Practical Wireless Network Coding”, in Proc. ACM SIGCOMM, pp. 243–254, 2006. [46] S. Katti, S. Gollakota, and D. Katabi, “Embracing Wireless Interference: Analog Network
Coding”, in Proc. ACM SIGCOMM, pp. 397–408, 2007.
[47] M. Krohn, M. Freeman, and D. Mazieres, “On-the-fly Verification of Rateless Erase Codes for Efficient Content Distribution”, in Proc. IEEE Symposium on Security and Privacy, 2004.
[48] L. Lazos, and R. Poovendran, “SeRLoc: Secure Range-Independent Localization forWire- less Sensor Networks”, in Proc. ACM WiSe, pp. 21–30, 2004.
[49] L. Lazos, R. Poovendran, and S. Capkun, “ROPE: Robust Position Estimation in Wireless Sensor Networks”, in Proc. IPSN, pp. 324–331, 2005.
[50] S. Li, R. Yeung, and N. Cai, “Linear Network Coding”, IEEE Transactions on Information Theory, Vol 49, No. 2, pp. 371–381, 2003.
[51] D. Liu, and P. Ning, “Establishing pairwise keys in distributed sensor networks”, in Proc. ACM CCS, pp. 52–56, 2003.
[52] D. Liu, and P. Ning, “Location-based pairwise key establishment for static sensor net- works”, in ACM SASN, pp. 72–82, 2003.
[53] D. Liu, and P. Ning, “Improving key pre-distribution with deployment knowledge in static sensor networks”, ACM Transactions on Sensor Networks (ToSN), Vol. 1, No. 2, pp. 204– 239, 2005.
[54] A. Menezes, T. Okamoto, and S. Vanstone, “Reducing Elliptic Curve Logorithms to Lo- gorithms in a Finite Field”, IEEE Transactions on Information Theory, Vol 39, No. 5, pp. 1639–1646, 1993.
[55] MICAz, http://www.xbow.com/Products/Product pdf files/Wireless pdf/MICAz Datasheet.pdf. [56] V. Miller, “Short Programs for Functions over Curve”, unpublished manuscript,
http://crypto.stanford.edu/miller/miller.pdf, 1986.
[57] MIRACL, Multiprecision Integer and Rational Arithmetic C/C++ Library, http://www.shamus.ie/, Shamus Software Ltd.
[58] R. Nagpal, H. Shrobe, and J. Bachrach, “Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network”, in Proc. IPSN, LNCS, Vol. 2634, pp. 333–348, 2003.
[59] D. Nicolescu, and B. Nath, “Ad-Hoc Positioning Systems (APS)”, in Proc. IEEE GLOBE- COM, Vol. 5, pp. 2926–2931, 2001.
[60] M. D. Penrose, “The longest edge of the random minimum spanning tree”, The Annals of Applied Probability, Vol. 7, No. 2, pp. 340–361, 1997.
[61] M. D. Penrose, Geometric Random Graphs, Oxford University Press, 2003.
[62] D. Petrovic, K. Ramchandran, and J. Rabaey, “Overcoming Untuned Radios in Wireless Networks with Network Coding”, IEEE Transactions on Information Theory, Vol. 52, No. 6, pp. 2649–2657, 2006.
[63] A. Perrig, R. Szewczyk, V. Wen, D. Culer, and J. Tygar, “SPINS: Security Protocols for Sensor Networks”, in Proc. ACM MobiCom, pp. 189–199, 2001.
[64] B. Przydatek, D. Song, and A. Perrig, “SIA: Secure Information Aggregation in Sensor Networks”, in Proc. ACM SenSys, pp. 255–265, 2003.
[65] S. Ratnasamy, B. karp, L. Yin, F. Yu, D. Estrin, R. Govindan and S. Shenker, “GHT: A Grographic Hash Table for Data-Centric Storage”, in Proc. 1st ACM International Workshop on Wireless Sensor Networks and Applications, (WSNA’02), pp. 78–87, 2002. [66] K. Ren, W. Lou, and Y. Zhang, “LEDS: Providing Location-aware End-to-end Data
Security in Wireless Sensor Networks”, in Proc. IEEE INFOCOM, 2006.
[67] S. Sengupta, S. Rayanchu, and S. Banerjee, “An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing”, in Proc. IEEE INFOCOM, pp. 1028–1036, 2007.
[68] S. Shakkottai, R. Srikant, and N. Shroff, “Unreliable sensor grids: coverage, connectivity and diameter”, in Proc. IEEE INFOCOM, 2003.
[69] J. H. Spencer, The Strange Logic of Random Graphs, Springer, 2001.
[70] W. Stallings, Cryptography and Network Security: Principles and Practice, Second Edi- tion, Prentice Hall.
[71] TelosB, http://www.xbow.com/Products/Product pdf files/Wireless pdf/TelosB Datasheet.pdf. [72] A. Liu, P. Kampanakis, and P. Ning, TinyECC: Elliptic Curve Cryptography for Sensor
Networks, http://discovery.csc.ncsu.edu/software/TinyECC/. [73] TinyOS Community Forum, Available: http://www.tinyos.net.
[74] Ubiquitous Computing, http://www.ubiq.com/hypertext/weiser/UbiHome.html.
[75] D. Wang, D. Silva, and F. Kschischang, “Constricting the Adversary: A Broadcast Trans- formation for Network Coding”, in Proc. 45th Annual Allerton Conference on Communi- cation, Control and Computing, 2007.
[76] H.Wang, and Q. Li, “Efficient implementation of public key cryptosystems on mote sen- sors”, in Proc. ICICS, LNCS, Vol. 4307, pp. 519–528, 2006.
[77] R. Want, A. Hopper, V. Falc˜ao, and J. Gibbons, ”The Active Badge Location System”, ACM Transactions on Information Systems (TOIS), Vol. 10, No. 1, pp. 91–102, 1992. [78] Mark Weiser, http://www.ubiq.com/hypertext/weiser/.
[79] A. Woo, T. Tong, and D. Culler, “Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks”, in Proc. ACM SenSys, pp. 14–27, 2003.
[80] IEEE 802.15 Working Group for Wireless Personal Area Networks (WPAN), http://ieee802.org/15/.
[81] Y. Wu, P. Chou, and S. Kung,“Information Exchange in Wireless Networks with Network Coding and Physical-Layer Broadcast”, in Proc. 39th Annual Conference on Information Sciences and Systems (CISS), 2005.
[82] Xerox PARCTAB, http://www.ubiq.com/parctab/.
[83] Xerox Pad, http://www.ubiq.com/weiser/testbeddevices.htm.
[84] H. Yang, and S. Lu, “Commutative Cipher Based En-route Filtering in Wireless Sensor Networks”, in Proc. IEEE VTC, Vol. 2, pp. 1223–1227, 2004.
[85] H. Yang, F. Ye, Y. Yuan, S. Lu, and W. Arbaugh, “Toward Resilient Security in Wireless Sensor Networks”, in Proc. ACM MobiHoc, pp. 34–45, 2005.
[86] F. Ye, H. Luo, S. Lu, and L. Zhang, “Statistical En-route Detection and Filtering of Injected False Data in Sensor Networks”, in Proc. IEEE INFOCOM, 2004.
[87] Y. Yu, R. Govindan, and D. Estrin, “Geographical and Energy Aware Routing: A Re- cursive Data Dissemination Protocol for Wireless Sensor Networks”, Computer Science Department, University of California, Los Angeles, Tech. Rep. UCLA-CSD TR-01-0023, May 2001.
[88] Z. Yu, and Y. Guan, “A key pre-distribution scheme using deployment knowledge for wireless sensor networks”, in Proc. IEEE/ACM IPSN, 2005, pp. 261–268.
[89] Z. Yu, and Y. Guan, “A robust group-based key management scheme for wireless sensor networks”, in Proc. IEEE WCNC, Vol. 4, pp. 1915–1920, 2005.
[90] Z. Yu, and Y. Guan, “A Dynamic En-Route Scheme for Filtering False Data Injection in Wireless Sensor Networks”, in Proc. IEEE INFOCOM, 2006.
[91] Zhen Yu, Yawen Wei, Bhuvaneswari Ramkumar, and Yong Guan, “An Efficient Signature- based Scheme for Securing Network Coding against Pollution Attacks”, in Proc. IEEE INFOCOM, 2008.
[92] S. Zhang, S. Liew, and P. Lam, “Hot Topic: Physical-Layer Network Coding”, in Proc. MobiCom, pp. 358–365, 2006.
[93] F. Zhao, T. Kalker, M. M´edard, and K. J. Han, “Signatures for Content Distribution with Network Coding”, in Proc. International Symposium on Information Theory (ISIT), pp. 556–560, 2007.
[94] Y. Zhou, Y. Zhang, and Y. Fang, ”LLK: A Link-layer Key Establishment Scheme in Wireless Sensor Networks”, in IEEE WCNC, 2005.
[95] Y. Zhou, Y. Zhang, and Y. Fang, ”Key Establishment in Sensor Networks based on Triangle Grid Deployment Model”, in IEEE MILCOM, 2005.
[96] S. Zhu, S. Setia, and S. Jajodia, “LEAP: efficient security mechanisms for large-scale distributed sensor networks”, in Proc. ACM CCS, 2003, pp. 62–72.
[97] S. Zhu, S. Xu, S. Setia, and S. Jajodia, “Establishing pairwise keys for secure commu- nication in ad hoc networks: a probabilistic approach”, in Proc. IEEE ICNP, 2003, pp. 326–335.
[98] S. Zhu, S. Setia, S. Jajodia, and P. Ning, “An Interleaved Hop-by-Hop Authentication Scheme for Filtering of Injected False Data in Sensor Networks”, in Proc. IEEE Symposium on Security and Privacy, pp. 259–271, 2004.