Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach

Proceedings - International Conference on Network Protocols, ICNP

Volumn 2003-January, Issue , 2003, Pages 326-335

  Zhu, Sencun ^a   Xu, Shouhuai ^b   Setia, Sanjeev ^a   Jajodia, Sushil ^a  

^a George Mason University   (United States)

^b University of Texas at San Antonio   (United States)

Author keywords

Ad hoc networks; Computer networks; Computer science; Cryptographic protocols; Information systems; Intelligent networks; Network servers; Peer to peer computing; Public key cryptography; Secure storage

Indexed keywords

AD HOC NETWORKS; COMPUTER NETWORKS; COMPUTER SCIENCE; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION SYSTEMS; INTELLIGENT NETWORKS; NETWORK PROTOCOLS; PEER TO PEER NETWORKS; PUBLIC KEY CRYPTOGRAPHY; SECURE COMMUNICATION; SERVERS; TELECOMMUNICATION NETWORKS;

COMPUTATIONALLY EFFICIENT; CRYPTOGRAPHIC PROTOCOLS; NETWORK SERVER; PEER-TO-PEER COMPUTING; PROBABILISTIC KEY SHARING; SECURE STORAGE; SYMMETRIC KEY CRYPTOGRAPHY; THRESHOLD SECRET SHARING;

NETWORK SECURITY;

EID: 84943553152     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2003.1249782     Document Type: Conference Paper

References (26)

1. B. Awerbuch, D. Holmer, C. Nita-Rotaru and H. Rubens. An On-Demand Secure Routing Protocol Resilient to Byzantine Failures. In ACM Workshop on Wireless Security (WiSe) 2002.
2. A. Bagchi, A. Chaudhary, M. Goodrich, and S. Xu. Constructing Disjoint Paths for Secure Communication. DISC'03, to appear.
3. M. Brown, D. Cheung, D. Hankerson, J. Hernandez, M. Kirkup, and A. Menezes. PGP in Constrained Wireless Devices. In 9th USENIX Security Symposium, pages 247261, August 2000.
4. R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, B. Pinkas, Multicast Security: A Taxonomy and Some Efficient Constructions. IEEE Infocom'99. Long Beach, CA, USA, Oct. 2001.
5. H. Chan, A. Perrig, D. Song. Random Key Predistribution Schemes for Sensor Networks. To appear in Proc. of the IEEE Security and Privacy Symposim 2003, May 2003.
6. D. Dolev. The Byzantine generals strike again. In J. of Algorithms, 3:14-30, 1982.
7. Y. Desmedt and Y. Wang. Perfectly secure message transmission revisited. In Advances in Cryptology EUROCRYPT '02, Lecture Notes in Computer Science (LNCS). Springer-Verlag, 2002.
8. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly Secure Message Transmission. JACM, (40)1, 1993, pp 17-47.
9. P. Erdos, P. Frankl, and Z. Furedi. Families of Finite Sets in Which no Set Is Covered by the Union of r Others. Israel J. Math. 51(1985), 75-89.
10. L. Eschenauer and V. Gligor. A Key-Management Scheme for Distributed Sensor Networks. In Proc. of ACM CCS 2002
11. M. Franklin and R. Wright. Secure communincation in minimal connectivity models. In Journal of Cryptology, 13(1):9-30, 2000.
12. O. Goldreich, S. Goldwasser, and S. Micali, How to Construct Random Functions, Journal of the ACM, vol. 33, no. 4, 1986, pp 210-217.
13. L. Gong. Increasing Availability and Security of an Authentication Service. IEEE Journal on Selected Areas in Communications, 11(5):657-662, 1993.
14. D. Johnson, D. Maltz, Y. Hu, J.Jetcheva. The Dynamic Souce Routing Protocol for Mobile Ad Hoc Networks. Internet-Draft, draft-ietf-manet-dsr-07.txt, February 2002.
15. J. Kohl and B. Neuman. The Kerberos Network Authentication Service (V5). RFC 1510, September 1993.
16. S. Kothari. Generalized Linear Threshold Scheme. Advances in Cryptology - CRYPTO'84, LNCS 196, pp 231-241, 1984.
17. R. Leung, J. Liu, E. Poon, Ah-Lot. Chan, B. Li. MP-DSR: A QoS-Aware Multi-Path Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks. In Proc. of 26th Annual IEEE Conference on Local Computer Networks (LCN 2001), 132-141.
18. S. Marti, T. Giuli, K. Lai, M. Baker. Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. In Proc. of ACM MOBICOM, 2000.
19. C. Mitchell and F. Piper. Key Storage in Secure Networks. Discrete Applied Mathematics. 21(1988). pp 215-228.
20. R. Needham and M. Schroeder. Using Encryption for Authentication in Large Networks of Computers. In Commuinications of the ACM 21(12): 993-999, 1978.
21. D. Otway, O. Rees, Efficient and Timely Mutual Authentication, Operating Systems Review, 21 (1987), 8-10.
22. V. Park and S. Corson. Temporaly-ordered routing algorithm. Internet Draft, August 1998.
23. A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. Tygar. SPINS: Security Protocols for Sensor Networks. In Seventh Annual ACM International Conference on Mobile Computing and Networks(Mobicom 2001), Rome Italy, July 2001.
24. F. Stajano and R. Anderson. The Resurrecting Ducking: Security Issues for Ad-hoc Wireless Networks. In the 7th International Workshop on Security Protocols,1999.
25. D. Stinson and R. Wei, Some New Bounds for Cover-Free Families. In J. Combin. Theory A, 90(2000), 224-234.
26. A. Shamir. How to Share a Secret. Comm. ACM, 22(11):612-613, 1979.