The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Abstract
In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to trace network routes and infer the motion pattern of nodes at the end of those routes may pose a serious threat to covert operations. We propose ANODR, an anonymous on-demand routing protocol for mobile ad hoc networks deployed in hostile environments. We address two closely related problems: For route anonymity, ANODR prevents strong adversaries from tracing a packet flow back to its source or destination; for location privacy, ANODR ensures that adversaries cannot discover the real identities of local transmitters. The design of ANODR is based on "broadcast with trapdoor information", a novel network security concept which includes features of two existing network and security mechanisms, namely "broadcast" and "trapdoor information". We use simulations and implementation to validate the effectiveness of our design.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
A highly adaptive distributed routing algorithm for mobile wireless networks
Park, V. D., & Corson, M. S. (2002) · Proceedings of INFOCOM '97 · doi:10.1109/infcom.1997.631180 · Cited by 2,234
HMAC: Keyed-Hashing for Message Authentication
Krawczyk, H., Bellare, M., & Canetti, R. (1997) · doi:10.17487/rfc2104 · Cited by 2,031
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
Ariadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
A hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
Anonymous connections and onion routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668972 · Cited by 1,063
The TESLA Broadcast Authentication Protocol
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6073610 · Cited by 842
Anonymity, Unobservability, and Pseudonymity — A Proposal for Terminology
Pfitzmann, A., & Köhntopp, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_1 · Cited by 763
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
Herzberg, A., Jarecki, S., Krawczyk, H., & Yung, M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_27 · Cited by 738
(1915) · Journal of Education · doi:10.1177/002205741508200834 · Cited by 616
Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems
Raymond, J.-F. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_2 · Cited by 422
Stop- and- Go-MIXes Providing Probabilistic Anonymity in an Open System
Kesdogan, D., Egner, J., & Büschkes, R. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49380-8_7 · Cited by 285
Selecting Cryptographic Key Sizes: Extended Abstract
Lenstra, A. K., & Verheul, E. R. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-46588-1_30 · Cited by 265
How to generate cryptographically strong sequences of pseudo random bits
Blum, M., & Micali, S. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.72 · Cited by 252
A protocol for anonymous communication over the Internet
Shields, C., & Levine, B. N. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352607 · Cited by 218
ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead
Pfitzmann, A., Pfitzmann, B., & Waidner, M. (1991) · Informatik-Fachberichte · doi:10.1007/978-3-642-76462-2_32 · Cited by 216
Statistically Unique and Cryptographically Verifiable (SUCV) Identifiers and Addresses.
Montenegro, G., & Castelluccia, C. (2002) · Cited by 141
Project “anonymity and unobservability in the Internet”
Berthold, O., Federrath, H., & Köhntopp, M. (2000) · Computers, Freedom and Privacy · doi:10.1145/332186.332211 · Cited by 138
Anonymous Connections and Onion Routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · doi:10.21236/ada465335 · Cited by 124
Pgp in constrained wireless devices
Brown, M., Cheung, D., Hankerson, D., Hernandez, J. L., Kirkup, M., & Menezes, A. (2000) · Cited by 107
ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead
Pfitzmann, A., Pfitzmann, B., & Waidner, M. (1991) · Kommunikation in Verteilten Systemen · Cited by 91
Cited by
The security and privacy of smart vehicles
Hubaux, J. P., Capkun, S., & Luo, J. (2004) · IEEE Security & Privacy Magazine · doi:10.1109/msp.2004.26 · Cited by 793
Secure positioning in wireless networks
Capkun, S., & Hubaux, J.-P. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861380 · Cited by 400
On physical-layer identification of wireless devices
Danev, B., Zanetti, D., & Capkun, S. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379782 · Cited by 304
Metadata
- Authors
- Kong, J., & Hong, X.
- Venue
- Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
- Publisher
- ACM
- Published
- 2003-06
- Pages
- 291-302
- OpenAlex
- W2168812739
- Cited by
- 432
- References
- 26
- FWCI
- 12.67
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.