On-line/off-line digital signatures
CRYPTO '89 Proceedings on Advances in cryptology
Safe kernel extensions without run-time checking
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A compact and fast hybrid signature scheme for multicast packet authentication
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Password authentication with insecure communication
Communications of the ACM
Implicit source routes for on-demand ad hoc network routing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Securing ad hoc routing protocols
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
An on-demand secure routing protocol resilient to byzantine failures
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
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
A Digital Signature Based on a Conventional Encryption Function
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
802.11 denial-of-service attacks: real vulnerabilities and practical solutions
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
A survey of active network research
IEEE Communications Magazine
Distributed quality-of-service routing in ad hoc networks
IEEE Journal on Selected Areas in Communications
TARP: trust-aware routing protocol
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A review of routing protocols for mobile ad hoc networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Hi-index | 0.00 |
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use demanding applications such as videoconferencing, Voice over IP, and streaming media when they are connected through an ad~hoc network. Because overprovisioning, a common technique in wired networks, is often impractical in wireless networks for reasons such as power, cost, and government regulation, Quality of Service (QoS) routing is even more important in wireless networks than in wired networks. Though a number of QoS-routing protocols have been proposed for use in ad~hoc networks, security of such protocols has not been considered. In this paper, we develop SQoS, a secure form of QoS-Guided Route Discovery for on-demand ad~hoc network routing. SQoS relies entirely on symmetric cryptography. Symmetric cryptographic primitives are three to four orders of magnitude faster (in computation time) than asymmetric cryptography. In addition, we show that in general, existing QoS-Guided Route Discovery can, for a single Route Discovery, transmit a number of packets exponential in the number of network nodes, creating an opportunity for Denial-of-Service (DoS) attacks. SQoS limits this overhead to be linear in the number of network nodes by providing the source with control over which Route Requests are forwarded.