ACM Transactions on Computer Systems (TOCS)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ACM SIGOPS Operating Systems Review
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Security Goals: Packet Trajectories and Strand Spaces
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Modern Cryptography: Theory and Practice
Modern Cryptography: Theory and Practice
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Modeling vulnerabilities of ad hoc routing protocols
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
A Survey of Secure Wireless Ad Hoc Routing
IEEE Security and Privacy
Towards provable security for ad hoc routing protocols
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Provable security of on-demand distance vector routing in wireless ad hoc networks
ESAS'05 Proceedings of the Second European conference on Security and Privacy in Ad-Hoc and Sensor Networks
On identifying malicious nodes in ad hoc networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
A new security scheme for on-demand source routing in mobile ad hoc networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes
IEEE Transactions on Mobile Computing
Adaptive Threat Modeling for Secure Ad Hoc Routing Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
Secure neighbor discovery in wireless networks: formal investigation of possibility
Proceedings of the 2008 ACM symposium on Information, computer and communications security
A Secure Hybrid Wireless Mesh Protocol for 802.11s Mesh Network
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Automated Evaluation of Secure Route Discovery in MANET Protocols
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
TSR: trust-based secure MANET routing using HMMs
Proceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks
Towards provable secure neighbor discovery in wireless networks
Proceedings of the 6th ACM workshop on Formal methods in security engineering
An attacker model for MANET routing security
Proceedings of the second ACM conference on Wireless network security
Securing Layer-2 Path Selection in Wireless Mesh Networks
Information Security Applications
Let's Get Physical: Models and Methods for Real-World Security Protocols
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Black-hole-resistant ENADAIR-based routing protocol for Mobile Ad hoc Networks
International Journal of Security and Networks
An efficient authentication and key management protocol for hierarchical ad hoc sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
An efficient secure data dissemination scheme for grid structure Wireless Sensor Networks
International Journal of Security and Networks
Key distribution in mobile ad hoc networks based on message relaying
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
An analytical model of routing, misbehavior, and countermeasures in mobile ad hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Castor: scalable secure routing for ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Two secure and energy-saving spontaneous ad-hoc protocol for wireless mesh client networks
Journal of Network and Computer Applications
Resilient Security Mechanism for Wireless Ad hoc Network
Wireless Personal Communications: An International Journal
Simulations, models, and testbeds: A mutual catalysis
Performance Evaluation
Formal Reasoning about Physical Properties of Security Protocols
ACM Transactions on Information and System Security (TISSEC)
Prevention of wormhole attacks in mobile commerce based on non-infrastructure wireless networks
Electronic Commerce Research and Applications
Formal security analysis of Ariadne secure routing protocol using model checking
International Journal of Ad Hoc and Ubiquitous Computing
SHWMP: a secure hybrid wireless mesh protocol for IEEE 802.11s wireless mesh networks
Transactions on Computational Science VI
Analysing routing protocols: four nodes topologies are sufficient
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Hash chains at the basis of a secure reactive routing protocol
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
A secure on-demand source routing scheme using hierarchical clustering in mobile ad hoc networks
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
A proof technique for security assessment of on-demand ad hoc routing protocols
International Journal of Security and Networks
| Hi-index | 0.00 |
Routing is one of the most basic networking functions in mobile ad hoc networks. Hence, an adversary can easily paralyze the operation of the network by attacking the routing protocol. This has been realized by many researchers and several "secure” routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. We propose a mathematical framework in which security can be precisely defined and routing protocols for mobile ad hoc networks can be proved to be secure in a rigorous manner. Our framework is tailored for on-demand source routing protocols, but the general principles are applicable to other types of protocols too. Our approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but, to the best of our knowledge, it has not been applied in the context of ad hoc routing so far. We also propose a new on-demand source routing protocol, called endairA, and we demonstrate the use of our framework by proving that it is secure in our model.