A canonical seed assignment model for key predistribution in wireless sensor networks

ACM Transactions on Sensor Networks

Volumn 3, Issue 4, 2007, Pages

  Tague, Patrick ^a,b   Poovendran, Radha ^a,b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b University of Washington   (United States)

Author keywords

Key establishment; Key predistribution; Network models; Sensor networks

Indexed keywords

KEY ESTABLISHMENT; KEY PREDISTRIBUTION; NETWORK MODELS; SECURE NETWORK;

GRAPH THEORY; PROBABILITY DISTRIBUTIONS; SECURITY OF DATA; WIRELESS SENSOR NETWORKS;

SYSTEMS ANALYSIS;

EID: 35349015881     PISSN: 15504859     EISSN: 15504867     Source Type: Journal    
DOI: 10.1145/1281492.1281494     Document Type: Article

References (35)

1. ALON, N. 1991. Probabilistic methods in extremal finite set theory. In Extremal Problems for Finite Sets, 39-57.
2. ANDERSON, R. 2001. Security Engineering: A Guide to Building Dependable Distributed Systems. John Wiley & Sons, Inc., New York.
3. ASADA, G., DONG, M., LIN, T., NEWBERG, F., POTTIE, G., MARCY, H., AND KAISER, W. 1998. Wireless integrated network sensors: Low-power systems on a chip. In Proceedings of the 24th IEEE European Solid-State Circuits Conference (ESSCIRC'98). The Hague, The Netherlands, 9-12.
4. BETTSTETTER, C. 2002. On the minimum node degree and connectivity of a wireless multihop network. In Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'02). Lausanne, Switzerland, 80-91.
5. BLOM, R. 1984. An optimal class of symmetric key generation systems. In Advances in Cryptology: Proceedings of the EUROCRYPT'84. Paris, France. Lecture Notes in Computer Science, vol. 209, 335-338.
6. BLUNDO, C., SANTIS, A. D., HERZBERG, A., KUTTEN, S., VACCARO, U., AND YUNG, M. 1992. Perfectlysecure key distribution for dynamic conferences. In Advances in Cryptology: Proceedings of the CRYPTO'92. Santa Barbara, CA, Lecture Notes in Computer Science, vol. 740, 471-486.
7. CARMAN, D. W., KRUUS, P. S., AND MATT, B. J. 2000. Constraints and approaches for distributed sensor network security. Tech. rep. #00-010, NAI Labs.
8. ÇAMTEPE, S. A. AND YENER, B. 2004. Combinatorial design of key distribution mechanisms for distributed sensor networks. In Proceedings of the 9th European Symposium on Research in Computer Security (ESORICS'04). Sophia Antipolis, France. Lecture Notes in Computer Science, vol. 3193. 293-308.
9. CHAN, H. AND PERRIG, A. 2005. PIKE: Peer intermediaries for key establishment in sensor networks. In Proceedings of the 24th Conference of the IEEE Communications Society (INFOCOM'05). Miami, FL, 524-535.
10. CHAN, H., PERRIG, A., AND SONG, D. 2003. Random key predistribution schemes for sensor networks. In Proceedings of the IEEE Symposium on Security and Privacy. Oakland, CA, 197-213.
11. CRESSIE, N. 1993. Statistics for Spatial Data. John Wiley and Sons, Inc., New York.
12. DI PIETRO, R., MANCINI, L. V., AND MEI, A. 2003. Random key assignment for secure wireless sensor networks. In Proceedings of the ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN03). Fairfax, VA, 62-71.
13. DU, W., DENG, J., HAN, Y. S., AND VARSHNEY, P. K. 2003. A pairwise key pre-distribution scheme for wireless sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). Washington, DC, 42-51.
14. DU, W., WANG, R., AND NING, R 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). Urbana-Champaign, IL, 58-67.
15. DYER, M., FENNER, T., FRIEZE, A., AND THOMASON, A. 1995. On key storage in secure networks. J. Cryptol. 8, 189-200.
16. ERDÖS, P., FRANKL, P., AND FÜREDI, Z. 1982. Families of finite sets in which no set is covered by the union of two others. J. Combinat. Theory, Series A 33, 158-166.
17. ERDÖS, P., FRANKL, P., AND FÜREDI, Z. 1985. Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51, 1-2.
18. ESCHENAUER, L. AND GLIGOR, V. D. 2002. A key-management scheme for distributed sensor networks. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS'02). Washington, DC, 41-47.
19. FELLER, W. 1957. An Introduction to Probability Theory and Its Applications, vol. 1. John Wiley and Sons, Inc., New York, NY
20. GAUBATZ, G., KAPS, J. P., OZTURK, E., AND SUNAR, B. 2005. State of the art in ultra-low power public key cryptography for wireless sensor networks. In Proceedings of the 3rd IEEE Conference on Pervasive Computing and Communications (PerCom'05). Kauai, HI, 146-150.
21. GONG, L. AND WHEELER, D. J. 1990. A matrix key distribution scheme. J Cryptol. 2, 1, 51-59.
22. 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 Conference on Pervasive Computing and Communications (PerCom'05). Kauai, HI, 247-256.
23. 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 Workshop on Cryptographic Hardware and Embedded Systems (CHES'04). Cambridge, MA, 119-132.
24. HILL, J., SZEWCZYK, R., WOO, A., HOLLAR, S., CULLER, D., AND PISTER, K. 2000. System architecture directions for networked sensors. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX). Cambridge, MA, 93-104.
25. JOHNSON, B. R. 1980. An elementary proof of inclusion-exclusion formulas. Amer. Math. Month. 87, 9, 750-751.
26. LEE, J. AND STINSON, D. R. 2004. Deterministic key predistribution schemes for distributed sensor networks. In Selected Areas in Cryptography (SAC2004). Waterloo, Ontario, Canada. Lecture Notes in Computer Science, vol. 3357, 294-307.
27. LEIGHTON, T. AND MICALI, S. 1993. Secret-key agreement without public-key cryptography. In Advances in Cryptology: Proceedings of (CRYPTO'93). Santa Barbara, CA. Lecture Notes in Computer Science, vol. 773, 456-479.
28. LIU, D. AND NING, P. 2003. Establishing pairwise keys in distributed sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). Washington, DC, 52-61.
29. LIU, D., NING, P., AND LI, R. 2005. Establishing pairwise keys in distributed sensor networks. ACM Trans. Inform. Syst. Secur. 8, 1, 41-77.
30. MITCHELL, C. J. AND PIPER, F. C. 1988. Key storage in secure networks. Discrete Appl. Math. 21, 215-228.
31. PENROSE, M. 1999. On k-connectivity for a geometric random graph. W. Rand. Struct. Algor. 15, 2, 145-164.
32. RAMKUMAR, M. AND MEMON, N. 2004. An efficient random key pre-distribution scheme. In Proceedings of the IEEE Conference on Global Communications (GLOBECOM'04). Dallas, TX, 2218-2223.
33. RAMKUMAR, M., MEMON, N., AND SIMHA, R. 2003. Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks. In Proceedings of the IEEE Conference on Global Communications (GLOBECOM'03). San Francisco, CA, 1405-1409.
34. STAJANO, F. AND ANDERSON, R. 1999. The resurrecting ducking: Security issues for ad-hoc wireless networks. In Proceedings of the 7th Annual International Workshop on Security Protocols. Cambridge, UK, 172-194.
35. ZHU, S., XU, S., SETIA, S., AND JAJODIA, S. 2003. Establishing pair-wise keys for secure communication in ad hoc networks: A probabilistic approach. In Proceedings of the 11th IEEE International Conference on Network Protocols (ICNF03). Atlanta, GA, 326-335.