Revisiting random key pre-distribution schemes for wireless sensor networks

Proceedings of the 2004 ACM Workshop on Security of Ad Hoc and Sensor Networks, SASN'04

Volumn , Issue , 2004, Pages 43-52

  Hwang, Joengmin ^a   Kim, Yongdae ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Key pre distribution; Wireless sensor network

Indexed keywords

BROADCASTING; COMPUTER NETWORKS; CRYPTOGRAPHY; DATA COMMUNICATION SYSTEMS; NETWORK PROTOCOLS; PROBABILISTIC LOGICS; SENSORS; ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; IDENTIFICATION (CONTROL SYSTEMS); PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES; SECURITY OF DATA; SECURITY SYSTEMS;

COMPONENT THEORY; KEY PRE-DISTRIBUTION; RESOURCE CONSTRAINED NODES; WIRELESS SENSOR NETWORKS; KEY MANAGEMENT; RANDOM GRAPH THEORY;

WIRELESS TELECOMMUNICATION SYSTEMS; COMPUTER NETWORKS;

EID: 14844335004     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1029102.1029111     Document Type: Conference Paper

References (21)

1. μamps: μ-adaptive multi-domain power aware sensors. http://www-mtl.mit.edu/research/icsystems/uamps.
2. Wireless integrated network sensors, ucla. http://wwv.janet.ucla.edu/ WINS.
3. N. Alon and J. Spencer. The probabilistic method. In Wiley-Interscience, 2000.
4. R. Blom. An optimal class of symmetric key generation systems. In EUROCRYPT 84, 1985.
5. C. Blundo, A. D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. In Crypto, 1992.
6. H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In IEEE Symposium on Research in Security and Privacy, 2003.
7. 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 Conference of the IEEE Communications Society (Infocom), 2004.
8. W. Du, J. Deng, Y. S. Han, and P. K. Varshney. A pairwise key pre-distribution scheme for wireless sensor networks. In ACM Conference on Computer and Communications Security (CCS), 2003.
9. P. Erdös and A. Rényi. On the evolution of random graph. Institute of Mathematics Hungarian Academy of Sciences, 1959.
10. L. Eschenauer and V. D. Gligor. A key-management scheme for distributed sensor networks. In ACM Conference on Computer and communication Security (CCS), 2004.
11. T. Hou and V. Li. Transmission range control in multihop packet radio networks. In IEEE Transaction on Communications, 1986.
12. S. Janson, T. Luczak, and A. Rucinski. Random Graphs. Wiley, 2000.
13. J. M. Kahn, R. H. Katz, and K. S. J. Pister. Next century challenges: Mobile networking for smart dust. In Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), 1999.
14. L. Kleinrock and J. Silvester. Optimum transmission radii for packet radio networks or why six is a magic number. In IEEE National Telecommunication Conference, 1978.
15. D. Liu and P. Ning. Establishing pairwise keys in distributed sensor networks. In ACM Conference on Computer and Communications Security (CCS), 2003.
16. A. M. R. D. Pietro and L. V. Mancini. Efficient and resilient key discovery based on pseudo-random key pre-deployment. In 4th IEEE Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, 2004.
17. J. Spencer. The strange logic of random graphs. In Algorithms and Combinatorics, 2000.
18. H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. In IEEE Transaction on Communications, 1984.
19. D. D. Wentzloff, B. H. Calhoun, R. Min, A. Wang, and N. Ickes. Design considerations for next generation wireless power-aware microsensor nodes. In International Conference on VLSI Design, 2004.
20. F. Xue and P. R. Kumar. The number of neighbors needed for connectivity of wireless networks. In Wireless Networks, 2004.
21. S. Zhu, S. Setia, and S. Jajodia. Leap: Efficient security mechanisms for large-scale distributed sensor networks. In 10th ACM Conference on Computer and Communication Security (CCS), 2003.