Vulnerability of network traffic under node capture attacks using circuit theoretic analysis

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 664-672

  Tague, Patrick ^a   Slater, David ^a   Rogers, Jason ^b   Poovendran, Radha ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b NAVAL RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK TRAFFICS; NODE CAPTURE ATTACKS;

CRYPTOGRAPHY; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; INTERNET; MATHEMATICAL PROGRAMMING; NETWORK PROTOCOLS; NETWORKS (CIRCUITS); NONLINEAR PROGRAMMING; NUCLEAR PROPULSION; ROUTING PROTOCOLS;

COMPUTER NETWORKS;

EID: 51349151780     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.41     Document Type: Conference Paper

References (17)

1. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. CRC, 1996.
2. L. Eschenauer and V. D. Gligor, "A key-management scheme for distributed sensor networks," in Proc. 9th ACM Conference on Computer and Communications Security (CCS'02), Washington, DC, USA, Nov. 2002, pp. 41-47.
3. H. Chan, A. Perrig, and D. Song, "Random key predistribution schemes for sensor networks," in Proc. 2003 IEEE Symposium on Security and Privacy, Oakland, CA, USA, May 2003, pp. 197-213.
4. W. Du, J. Deng, Y. S. Han, P. K. Varshney, J. Katz, and A. Khalili, "A pairwise key predistribution scheme for wireless sensor networks," ACM Trans. Information and System Security, vol. 8, no. 2, pp. 228-258, May 2005.
5. D. Liu, P. Ning, and R. Li, "Establishing pairwise keys in distributed sensor networks," ACM Trans. Information and System Security, vol. 8, no. 1, pp. 41-77, Feb. 2005.
6. P. Tague and R. Poovendran, "A canonical seed assignment model for key predistribution in wireless sensor networks," ACM Transactions on Sensor Networks, vol. 3, no. 4, Oct. 2007.
7. _, "Modeling adaptive node capture attacks in multi-hop wireless networks," Ad Hoc Networks, vol. 5, no. 6, pp. 801-814, Aug. 2007.
8. N. Cai and R. W. Yeung, "Secure network coding," in Proc. 2002 IEEE International Symposium on Information Theory (ISIT'02), Lausanne, Switzerland, Jun./Jul. 2002, p. 323.
9. K. Jain, "Security based on network topology against the wiretapping attack," IEEE Wireless Communication, vol. 11, no. 1, pp. 68-71, Feb. 2004.
10. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. MIT Press, McGraw-Hill, 2000.
11. K. Akkaya and M. Younis, "A survey on routing protocols for wireless sensor networks," Ad Hoc Networks, vol. 3, no. 3, pp. 325-349, May 2005.
12. A. Shamir, "How to share a secret," Communications of the ACM, vol. 22, no. 11, pp. 612-613, Nov. 1979.
13. T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE International Symposium on Information Theory (ISIT'03), Yokohama, Japan, Jun./Jul. 2003, p. 441.
14. R. Diestel, Graph Theory, 3rd ed. Springer, 2005.
15. A. Bloch, "On methods for the construction of networks dual to nonplanar networks," Proceedings of the Physical Society, vol. 58, no. 6, pp. 677-694, Nov. 1946.
16. G. Dobson, "Worst-case analysis of greedy heuristics for integer programming with nonnegative data," Mathematics of Operations Research, vol. 7, no. 4, pp. 515-531, Nov. 1982.
17. V. Chvatel, "Greedy heuristic for the set-covering problem," Mathematics of Operations Research, vol. 4, no. 3, pp. 233-235, Aug. 1979.