| SEAR: a secure efficient ad hoc on demand routing protocol for wireless networks |
| Full text |
Pdf
(222 KB)
|
| Source
|
ASIAN ACM Symposium on Information, Computer and Communications Security
archive
Proceedings of the 2008 ACM symposium on Information, computer and communications security
table of contents
Tokyo, Japan
SESSION: Network security (II)
table of contents
Pages 201-204
Year of Publication: 2008
ISBN:978-1-59593-979-1
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 22, Downloads (12 Months): 160, Citation Count: 0
|
|
|
ABSTRACT
Multi-hop routing is essential to the operation of wireless ad hoc networks. Unfortunately, it is very easy for an adversary to forge or modify routing messages to inflict severe damage on the underlying routing protocol. In this paper, we present SEAR, a Secure Efficient Ad hoc Routing protocol for ad hoc networks that is mainly based on efficient symmetric cryptography, with asymmetric cryptography used only for the distribution of initial key commitments. We show, through both theoretical examination and simulations, that SEAR provides better security with significantly less overhead than other existing secure AODV protocols.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Y. Hu, D. Johnson, and A. Perrig. SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. Ad Hoc Networks, I:175--192, 2003.
|
 |
2
|
|
| |
3
|
|
 |
4
|
|
| |
5
|
A. Perrig, R. Canetti, D. Tygar, and D. Song. The TESLA broadcast authentication protocol. Cryptobytes, 5:2--13, 2002.
|
| |
6
|
|
 |
7
|
|
|