Modeling and verifying ad hoc routing protocols

Proceedings - IEEE Computer Security Foundations Symposium

Volumn , Issue , 2010, Pages 59-74

  Arnaud, Mathilde ^a,b   Cortier, Véronique ^a   Delaune, Stéphanie ^b  

^a LORIA   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC ROUTING PROTOCOL; CONSTRAINT SOLVING; DECISION PROCEDURE; DETECTING ATTACKS; MALICIOUS NODES; MOBILE WIRELESS DEVICES; NETWORK TOPOLOGY; SECURITY PROTOCOLS; STANDARD SYMBOLIC MODEL; WIRELESS COMMUNICATIONS;

AD HOC NETWORKS; CALCULATIONS; CRYPTOGRAPHY; ELECTRIC NETWORK TOPOLOGY; MOBILE AD HOC NETWORKS; MOBILE TELECOMMUNICATION SYSTEMS; ROUTING PROTOCOLS; SECURITY SYSTEMS; WIRELESS TELECOMMUNICATION SYSTEMS;

NETWORK SECURITY;

EID: 77957579306     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2010.12     Document Type: Conference Paper

References (27)

1. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In Proc. 28th Symposium on Principles of Programming Languages (POPL'01), pages 104-115. ACM Press, 2001.
2. M. Abadi and A. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proc. 4th Conference on Computer and Communications Security (CCS'97), pages 36- 47. ACM Press, 1997.
3. G. Ács. Secure Routing in Multi-hop Wireless Networks. PhD thesis, Budapest University of Technology and Economics, 2009.
4. R. Amadio, D. Lugiez, and V. Vanackère. On the symbolic reduction of processes with cryptographic functions. Theoretical Computer Science, 290(1):695-740, 2002. (Pubitemid 35264438)
5. A. Armando et al. The AVISPA Tool for the automated validation of internet security protocols and applications. In Proc. 17th International Conference on Computer Aided Verification, CAV'2005, volume 3576 of LNCS, pages 281- 285. Springer, 2005.
6. M. Arnaud, V. Cortier, and S. Delaune. Modeling and verifying ad hoc routing protocols. Research Report LSV-10- 03, Laboratoire Spécification et V́erification, ENS Cachan, France, Feb. 2010. 36 pages.
7. B. Blanchet. An efficient cryptographic protocol verifier based on prolog rules. In Proc. 14th Computer Security Foundations Workshop (CSFW'01). IEEE Comp. Soc. Press, 2001.
8. B. Blanchet. An automatic security protocol verifier based on resolution theorem proving (invited tutorial). In Proc. 20th International Conference on Automated Deduction (CADE'05), 2005.
9. L. Buttyán and I. Vajda. Towards Provable Security for Ad Hoc Routing Protocols. In Proc. 2nd ACM workshop on Security of ad hoc and sensor networks (SASN'04), pages 94-105, New York, NY, USA, 2004. ACM.
10. J. Clark and J. Jacob. A survey of authentication protocol literature. http://www.cs.york.ac.uk/-jac/papers/drareviewps.ps 1997.
11. H. Comon-Lundh, V. Cortier, and E. Zalinescu. Deciding security properties for cryptographic protocols. Application to key cycles. ACM Transactions on Computational Logic (TOCL), 11(4):496-520, 2010.
12. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. Workshop on Formal Methods and Security Protocols, 1999.
13. Y.-C. Hu, A. Perrig, and D. Johnson. Ariadne: A Secure On- Demand Routing Protocol for Ad Hoc Networks. Wireless Networks, 11, January 2005.
14. Y.-C. Hu, A. Perrig, and D. B. Johnson. Wormhole attacks in wireless networks. Selected Areas in Communications, IEEE Journal on, 24(2):370-380, 2006.
15. D. Johnson, D. Maltz, and J. Broch. DSR: The Dynamic Source Routing Protocol for multi-hop wireless ad hoc networks. In Ad Hoc Networking, pages 139-172, 2001.
16. D. B. Johnson, D. A. Maltz, and J. Broch. DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks. In In Ad Hoc Networking, edited by Charles E. Perkins, Chapter 5, pages 139-172. Addison-Wesley, 2001.
17. L. Lazos, R. Poovendran, C. Meadows, P. Syverson, and L. W. Chang. Preventing wormhole attacks on wireless ad hoc networks: a graph theoretic approach. In Wireless Communications and Networking Conference, volume 2, pages 1193-1199 Vol. 2, 2005.
18. J. Millen and V. Shmatikov. Constraint solving for boundedprocess cryptographic protocol analysis. In Proc. 8th ACM Conference on Computer and Communications Security (CCS'01), 2001.
19. S. Nanz and C. Hankin. A Framework for Security Analysis of Mobile Wireless Networks. Theoretical Computer Science, 367(1):203-227, 2006.
20. P. Papadimitratos and Z. Haas. Secure routing for mobile ad hoc networks. In Proc. SCS Communication Networks and Distributed Systems Modelling Simulation Conference (CNDS), 2002.
21. L. C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6(1-2):85- 128, 1998.
22. C. E. Perkins and E. M. Belding-Royer. Ad-hoc on-demand distance vector routing. In Proc. 2nd Workshop on Mobile Computing Systems and Applications (WMCSA '99), pages 90-100, 1999.
23. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In Proc. 14th Computer Security Foundations Workshop (CSFW'01), pages 174-190. IEEE Comp. Soc. Press, 2001.
24. P. Schaller, B. Schmidt, D. Basin, and S. Capkun. Modeling and verifying physical properties of security protocols for wireless networks. In Proc. 22nd Computer Security Foundations Symposium (CSF'09). IEEE Comp. Soc. Press, 2009.
25. F. J. Thayer, J. C. Herzog, and J. D. Guttman. Strand spaces: Proving security protocols correct. Journal of Computer Security, 7(1), 1999.
26. S. Yang and J. S. Baras. Modeling vulnerabilities of ad hoc routing protocols. In Proc. 1st ACM Workshop on Security of ad hoc and Sensor Networks (SASN'03), 2003.
27. M. G. Zapata and N. Asokan. Securing ad hoc routing protocols. In Proc. 1st ACM workshop on Wireless SEcurity (WiSE'02), pages 1-10. ACM, 2002.