A pairwise key predistribution scheme for wireless sensor networks

ACM Transactions on Information and System Security

Volumn 8, Issue 2, 2005, Pages 228-258

  Du, Wenliang ^a,e   Deng, Jing ^b   Han, Yunghsiang S ^c   Varshney, Pramod K ^a   Katz, Jonathan ^d   Khalili, Aram ^d  

^a SYRACUSE UNIVERSITY   (United States)

^b UNIVERSITY OF NEW ORLEANS   (United States)

^c NATIONAL TAIPEI UNIVERSITY   (Taiwan)

^d UNIVERSITY OF MARYLAND   (United States)

^e Syracuse University   (United States)

Author keywords

Key predistribution; Security; Wireless sensor networks

Indexed keywords

KEY AGREEMENT; KEY PREDISTRIBUTION; RELATED KEY ATTACKS; WIRELESS SENSOR NETWORK (WSN);

GRAPH THEORY; PROBABILITY; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY; SERVERS; TELECOMMUNICATION NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

SECURITY OF DATA;

EID: 23244467182     PISSN: 10949224     EISSN: None     Source Type: Journal    
DOI: 10.1145/1065545.1065548     Document Type: Review

References (18)

1. AKYILDIZ, I. F., SU, W., SANKARASUBRAMANIAM, Y., AND CAYIRCI, E. 2002. A survey on sensor networks. IEEE Communications Magazine 40, 8 (Aug.), 102-114.
2. ANDERSON, R. AND KUHN, M. 1996. Tamper resistance - A cautionary note. In Proceedings of the 2nd Usenix Workshop on Electronic Commerce. 1-11.
3. BELLARE, M., KILIAN, J., AND ROGAWAY, P. 2000. The security of the cipher block chaining message authentication code. Journal of Computer and System Sciences 61, 3, 362-399.
4. BELLARE, M. AND ROGAWAY, P. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security. 62-73.
5. BLOM, R. 1985. An optimal class of symmetric key generation systems. In Advances in Cryptology: Proceedings of EUROCRYPT 84, T. Beth, N. Cot, and I. Ingemarsson, Eds. Lecture Notes in Computer Science, vol. 209, Springer-Verlag, Berlin, 335-338.
6. BLUNDO, C., SANTIS, A. D., HERZBERG, A., KUTTEN, S., VACCARO, U., AND YUNG, M. 1993. Perfectly-secure key distribution for dynamic conferences. In Lecture Notes in Computer Science, vol. 740, 471-486.
7. CHAN, H., PERRIG, A., AND SONG, D. 2003. Random key predistribution schemes for sensor networks. In IEEE Symposium on Security and Privacy, Berkeley, CA. 197-213.
8. CROSSBOW TECHNOLOGY, INC. Available at http://www.xbow.com/.
9. Du, W., DENG, J., HAN, Y. S., AND VARSHNEY, P. 2003. A pairwise key predistribution scheme for wireless sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security. 42-51.
10. ERDOS AND RÉNYI. 1959. On random graphs I. Publ. Math. Debrecen 6, 290-297.
11. 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. 41-47.
12. KAHN, J., KATZ, R., AND PISTER, K. 1999. Next century challenges: Mobile networking for smart dust. In Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom). 483-492.
13. 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. 52-61.
14. MACWILLIAMS, F. AND SLOANE, N. 1977. The Theory of Error-Correcting Codes. Elsevier Science, New York.
15. MALKHI, D., REITER, M., WOOL, A., AND WRIGHT, R. N. 2001. Probabilistic quorum systems. Information and Computation 170, 2, 184-206.
16. NEUMAN, B. C. AND Tso, T. 1994. Kerberos: An authentication service for computer networks. IEEE Communications 32, 9 (Sept.), 33-38.
17. PERRIG, A., SZEWCZYK, R., WEN, V., CULLAR, D., AND TYGAR, J. 2001. SPINS: Security protocols for sensor networks. In Proceedings of the 7th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom). 189-199.
18. PETERSON, W. W. 1972. Error-Correcting Codes, 2nd ed. MIT Press, Cambridge, MA.