Connectivity properties of secure wireless sensor networks

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

Volumn , Issue , 2004, Pages 53-58

  Di Pietro, Roberto ^a   Mancini, Luigi V ^a   Mei, Alessandro ^a   Panconesi, Alessandro ^a   Radhakrishnan, Jaikumar ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

Connectivity; Key management; Probabilistic key sharing; Random graphs; Sensor networks

Indexed keywords

COMPUTER NETWORKS; GRAPH THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMIZATION; PROBABILISTIC LOGICS; SECURITY OF DATA; SENSORS; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES; SECURITY SYSTEMS;

CONNECTIVITY; KEY MANAGEMENT; PROBABILISTIC KEY SHARING; RANDOM GRAPHS; SENSOR NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS; COMPUTER NETWORKS;

CONNECTIVITY; KEY MANAGEMENT; PROBABILISTIC KEY SHARING; RANDOM GRAPHS; SENSOR NETWORKS;

EID: 14844295528     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1029102.1029112     Document Type: Conference Paper

References (13)

1. S. Basagni, K. Herrin, D. Bruschi, and E. Rosti. Secure pebblenets. In Proceedings of the 2001 ACM International Symposium on Mobile ad hoc networking & computing, Long Beach, CA, USA. ACM Press., 2001.
2. rd ACM international symposium on Mobile ad hoc networking and computing, pages 80-91, 2002.
3. R. Blom. An optimal class of symmetric key generation systems. In Advances in Cryptology: Proceedings of EUROCRYPT '84, volume 338 of LNCS, 1985.
4. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. In Advances in Cryptology: Proceedings of CRYPTO '92, volume 740 of LNCS, 1993.
5. B. Bollobas. Modern Graph Theory. Springer, 1998.
6. D. W. Carman, P. S. Kruus, and B. J. Matt. Constraints and approaches for distributed sensor network security. Technical Report Technical Report 00-010, NAI Labs, 2000.
7. H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In Proceedings of the IEEE Symposium on Security and Privacy, 2003.
8. R. Di Pietro, L. V. Mancini, and S. Jajodia. Providing secrecy in key management protocols for large wireless sensors networks. Journal of AdHoc Networks, 1(4), 2003.
9. th ACM Conference on Computer and Communications Security (CCS '03), 2003.
10. P. Erdös and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5:17-61, 1960.
11. th ACM Conference on Computer and Communications Security (CCS '02), 2002.
12. th ACM Conference on Computer and Communications Security (CCS '03), 2003.
13. M. D. Penrose. On K-connectivity for a geometric random graph. Random Structures and Algorithms, 15(2):145-164, 1999.