A proof technique for security assessment of on-demand ad hoc routing protocols

Authors:
István Vajda
Affiliations:
Department of Informatics, Technical University of Budapest, 1521 Budapest, Pf. 91, Hungary
Venue:
International Journal of Security and Networks
Year:
2014

Citing 10
Cited 0

A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Securing ad hoc routing protocols

WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
A Secure Routing Protocol for Ad Hoc Networks

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
The Sybil Attack

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
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
Ariadne: a secure on-demand routing protocol for ad hoc networks

Wireless Networks
Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a technique for security proofs for on-demand routing protocols. The idea is to break down the security requirement against the protocol into the security requirement against a single honest protocol machine. The practical income is a simplified approach that provides also guidelines for designing provably secure protocols.