Modeling adaptive node capture attacks in multi-hop wireless networks

Ad Hoc Networks

Volumn 5, Issue 6, 2007, Pages 801-814

  Tague, Patrick ^a   Poovendran, Radha ^a  

^a University of Washington   (United States)

Author keywords

Adversary modeling; Integer programming; Key establishment; Node capture attacks

Indexed keywords

CONSTRAINT THEORY; DATA PRIVACY; HEURISTIC METHODS; INTEGER PROGRAMMING; NETWORK PROTOCOLS; POLYNOMIALS;

COST NODES; HEURISTIC ATTACKS; NODE CAPTURE ATTACKS; STORAGE RANDOMIZATION;

AD HOC NETWORKS;

EID: 34248339107     PISSN: 15708705     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.adhoc.2007.01.002     Document Type: Article

References (32)

1. Akyildiz I.F., Wang X., and Wang W. Wireless mesh networks: a survey. Computer Networks 47 4 (2005) 445-487
2. N. Gura, A. Patel, A. Wander, H. Eberle, S. C. Shantz, Comparing elliptic curve cryptography and RSA on 8-bit CPUs, in: Proceedings of the Sixth Workshop on Cryptographic Hardware and Embedded Systems (CHES'04), Cambridge, MA, USA, 2004, pp. 119-132.
3. V. Gupta, M. Millard, S. Fung, Y. Zhu, N. Gura, H. Eberle, S.C. Shantz, Sizzle: a standards-based end-to-end security architecture for the embedded internet, in: Proceedings of the Third IEEE Conference on Pervasive Computing and Communications (PerCom'05), Kauai, HI, USA, 2005, pp. 247-256.
4. L. Eschenauer, V.D. Gligor, A key-management scheme for distributed sensor networks, in: Proceedings of the Ninth ACM Conference on Computer and Communications Security (CCS'02), Washington, DC, USA, 2002, pp. 41-47.
5. H. Chan, A. Perrig, D. Song, Random key predistribution schemes for sensor networks, in: Proceedings of the IEEE Symposium on Security and Privacy, Oakland, CA, USA, 2003, pp. 197-213.
6. W. Du, J. Deng, Y.S. Han, P.K. Varshney, A pairwise key pre-distribution scheme for wireless sensor networks, in: Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03), Washington, DC, USA, 2003, pp. 42-51.
7. D. Liu, P. Ning, Establishing pairwise keys in distributed sensor networks, in: Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03), Washington, DC, USA, 2003, pp. 52-61.
8. M. Ramkumar, N. Memon, R. Simha, Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks, in: Proceedings of the IEEE Conference on Global Communications (GLOBECOM'03), San Francisco, CA, USA, 2003, pp. 1405-1409.
9. M. Ramkumar, N. Memon, An efficient random key pre-distribution scheme, in: Proceedings of the IEEE Conference on Global Communications (GLOBECOM'04), Dallas, TX, USA, 2004, pp. 2218-2223.
10. Liu D., Ning P., and Li R. Establishing pairwise keys in distributed sensor networks. ACM Transactions on Information and System Security 8 1 (2005) 41-77
11. Du W., Deng J., Han Y.S., Varshney P.K., Katz J., and Khalili A. A pairwise key predistribution scheme for wireless sensor networks. ACM Transactions on Information and System Security 8 2 (2005) 228-258
12. P. Tague, R. Poovendran, A general probabilistic model for improving key assignment in wireless networks, in: Proceedings of the Fourth International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'06), Boston, MA, USA, 2006.
13. R. Blom, An optimal class of symmetric key generation systems, in: Advances in Cryptology: Proceedings of the EUROCRYPT'84, LNCS 209, Paris, France, 1984, pp. 335-338.
14. C. Blundo, A.D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, M. Yung, Perfectly-secure key distribution for dynamic conferences, in: Advances in Cryptology: Proceedings of the CRYPTO'92, LNCS 740, Santa Barbara, CA, USA, 1992, pp. 471-486.
15. T. Leighton, S. Micali, Secret-key agreement without public-key cryptography, in: Advances in Cryptology: Proceedings of the CRYPTO'93, LNCS 773, Santa Barbara, CA, USA, 1993, pp. 456-479.
16. S.A. Çamtepe, B. Yener, Combinatorial design of key distribution mechanisms for distributed sensor networks, in: Proceedings of the Ninth European Symposium on Research in Computer Security (ESORICS'04), LNCS 3193, Sophia Antipolis, France, 2004, pp. 293-308.
17. J. Lee, D.R. Stinson, A combinatorial approach to key predistribution for distributed sensor networks, in: Proceedings of the IEEE Wireless Communication and Networking Conference (WCNC'05), Los Angeles, CA, USA, 2005, pp. 1200-1205.
18. H. Chan, A. Perrig, PIKE: Peer intermediaries for key establishment in sensor networks, in: Proceedings of the 24th Conference of the IEEE Communications Society (INFOCOM'05), Miami, FL, USA, 2005, pp. 524-535.
19. F. Stajano, R. Anderson, The resurrecting ducking: Security issues for ad-hoc wireless networks, in: Proceedings of the Seventh Annual International Workshop on Security Protocols, Cambridge, UK, 1999, pp. 172-194.
20. A. Perrig, R. Szewczyk, J.D. Tygar, V. Wen, D. Culler, SPINS: Security protocols for sensor networks, in: Proceedings of the Seventh Annual International Conference on Mobile Computing and Networking (MobiCom'01), Rome, Italy, 2001, pp. 189-199.
21. Wyner A.D. The wire-tap channel. Bell System Technical Journal 54 8 (1975) 1355-1387
22. D. Huang, M. Mehta, D. Medhi, L. Harn, Location-aware key management scheme for wireless sensor networks, in: Proceedings of the Second ACM Workshop on Security of Ad-Hoc and Sensor Networks (SASN'04), Washington, DC, USA, 2004, pp. 29-42.
23. B. Parno, A. Perrig, V. Gligor, Distributed detection of node replication attacks in sensor networks, in: Proceedings of the 2005 IEEE Symposium on Security and Privacy, Oakland, CA, USA, 2005.
24. Dolev D., and Yao A.C. On the security of public-key protocols. IEEE Transactions on Information Theory IT 29 2 (1983) 198-208
25. Horn R.A., and Johnson C.R. Matrix Analysis (1985), Cambridge University Press, Cambridge
26. Dobson G. Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Mathematics of Operations Research 7 4 (1982) 515-531
27. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (2000), MIT Press, McGraw-Hill
28. Garey M.R., and Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness (1979), W.H. Freeman & Co., New York
29. Menezes A., van Oorschot P., and Vanstone S. Handbook of Applied Cryptography (2001), CRC Press, Florida
30. Shamir A. How to share a secret. Communications of the ACM 22 11 (1979) 612-613
31. Cover T.M., and Thomas J.A. Elements of Information Theory. second ed. (2006), John Wiley & Sons Inc.
32. Feller W. An Introduction to Probability Theory and Its Applications vol. 1 (1957), John Wiley & Sons Inc., New York