Sensor networks that are provably resilient

2006 Securecomm and Workshops

Volumn , Issue , 2006, Pages

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

^a ROMA TRE UNIVERSITY   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY DISTRIBUTIONS; PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES; RISK ASSESSMENT; SENSORS; WIRELESS SENSOR NETWORKS;

EXTENSIVE SIMULATIONS; HIGH PROBABILITY; MALICIOUS ATTACKS; MATHEMATICAL ANALYSES; PARAMETER CHOICE; SECURITY PROPERTIES;

SENSOR NETWORKS;

EID: 50049090165     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SECCOMW.2006.359569     Document Type: Conference Paper

References (22)

1. I. F. Akyildiz, Y. Sankarasubramaniam, W. Su, and E. Cayirci. Wireless sensor networks: a survey. Computer Networks, 38:393-422, 2002.
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. Haowen Chan, Adrian Perrig, and Dawn Song. Random key predistribution schemes for sensor networks. In Proceedings of the IEEE Symposium on Security and Privacy, pages 197-213, Oakland, California, USA, 11-14 May 2003.
7. th IEEE International Parallel and distributed Processing Symposium (IPDPS'04), 26-30 April 2004, Santa Fe, New Mexico, USA, pages 217-224, 2004.
8. Roberto Di Pietro, Luigi V. Mancini, and Alessandro Mei. Energy efficient node-to-node authentication and communication confidentiality in wireless sensor networks. Wireless Networks, to appear, 2006.
9. Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, and Jaikumar Radhakrishnan. Connectivity properties of secure wireless sensor networks. In Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks, pages 53-58. ACM Press, 2004.
10. Wenliang Du, Jing Deng, Yunghsiang S. Han, and Pramod K. Varshney. A pairwise key pre-distribution scheme for wireless sensor networks. In CCS '03: Proceedings of the 10th ACM conference on Computer and communications security, pages 42-51, New York, NY, USA, 2003. ACM Press.
11. P. Erdös and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5:17-61, 1960.
12. th ACM conference on Computer and communications security, pages 41-47. ACM Press, 2002.
13. K. B. Singer-Cohen J. A. Fill, E. R. Schenerman. Random intersection graphs when m = ω(n): An equivalence theorem relating the evolution of the g(n,m,p) and g(n,p) models. Random Structures and Algorithms, 16:156-176, 2000.
14. M. Karoński, E. R. Sheinerman, and K. B. Singer-Cohen. On random intersection graphs: the subgraph problem. Combinatorics, Probability and Computing, 8:131-159, 1999.
15. Donggang Liu and Peng Ning. Establishing pairwise keys in distributed sensor networks. In CCS '03: Proceedings of the 10th ACM conference on Computer and communications security, pages 52-61, New York, NY, USA, 2003. ACM Press.
16. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
17. M. D. Penrose. On k-connectivity for a geometric random graph. Random Structures and Algorithms, 15(2): 145-164, 1999.
18. th Annual International Conference on Mobile Computing and Networking, pages 189-199. ACM Press, 2001.
19. K. B. Singer-Cohen. Random intersection graphs. PhD thesis, Department of Mathematical Sciences, The Johns Hopkins University, 1995.
20. D. Stark. The vertex degree distribution of random intersection. Random Structures and Algorithms, 24:249-258, 2004.
21. D. J. Watts and S. H. Strogatz. Collective dynamics of "small world" networks. Nature, 393:440-442, 1998.
22. Sencun Zhu, Sanjeev Setia, and Sushil Jajodia. Leap: efficient security mechanisms for large-scale distributed sensor networks. In CCS '03: Proceedings of the 10th ACM conference on Computer and communications security, pages 62-72, New York, NY, USA, 2003. ACM Press.