The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Self-securing ad hoc wireless networks
Abstract
Mobile ad hoc networking offers convenient infrastructure-free communication over the shared wireless channel. However, the nature of ad hoc networks makes them vulnerable to security attacks. Examples of such attacks include passive eavesdropping over the wireless channel, denial of service attacks by malicious nodes as well as attacks from compromised nodes or stolen devices. Unlike their wired counterpart, infrastructureless ad hoc networks do not have a clear line of defense, and every node must be prepared for encounters with an adversary. Therefore, a centralized or hierarchical network security solution does not work well. This work provides scalable, distributed authentication services in ad hoc networks. Our design takes a self-securing approach, in which multiple nodes (say, k) collaboratively provide authentication services for any node in the network. This paper follows the design guidelines of [7] and makes several new contributions. We first formalize a localized trust model that lays the foundation for the design, and then expand the adversary model that the system should handle. We further propose refined localized certification services, and develop a new scalable solution of share updates to resist more powerful adversaries. Finally, the new solution is evaluated through simulations. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Mitigating routing misbehavior in mobile ad hoc networks
Marti, S., Giuli, T. J., Lai, K., & Baker, M. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345955 · Cited by 3,415
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Intrusion detection in wireless ad-hoc networks
Zhang, Y., & Lee, W. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345958 · Cited by 1,100
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
Abdul-Rahman, A., & Hailes, S. (1997) · Proceedings of the 1997 workshop on New security paradigms - NSPW '97 · doi:10.1145/283699.283739 · Cited by 699
SDSI - A Simple Distributed Security Infrastructure
Lampson, B., & Rivest, R. L. (1996) · Cited by 480
(1998) · Defense Technical Information Center (DTIC) · Cited by 419
How to share a function securely
De Santis, A., Desmedt, Y., Frankel, Y., & Yung, M. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195405 · Cited by 328
Garfinkel, S., & Russell, D. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 293
An overview of PKI trust models
Perlman, R. (1999) · IEEE Network · doi:10.1109/65.806987 · Cited by 283
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
Optimal-resilience proactive public-key cryptosystems
Frankel, Y., Gemmell, P., MacKenzie, P. D., & Yung, M. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646127 · Cited by 217
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90256-2 · Cited by 213
Robust and Efficient Sharing of RSA Functions
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_13 · Cited by 189
Frankel, Y., Gemmell, P., MacKenzie, P. D., & Yung, M. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052254 · Cited by 168
Increasing availability and security of an authentication service
Gong, L. (1993) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.223866 · Cited by 115
Building intrusion tolerant applications
Malkin, M., Wu, T. D., & Boneh, D. (2002) · DARPA Information Survivability Conference and Exposition · doi:10.1109/discex.2000.824963 · Cited by 107
Robust and Efficient Sharing of RSA Functions
Gennaro, R., Rabin, T., Jarecki, S., & Krawczyk, H. (2007) · Journal of Cryptology · doi:10.1007/s00145-007-0201-2 · Cited by 89
Security on the move: indirect authentication using Kerberos
Fox, A., & Gribble, S. D. (1996) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/236387.236439 · Cited by 79
Maintaining Authenticated Communication in the Presence of Break-Ins
Canetti, R., Halevi, S., & Herzberg, A. (2000) · Journal of Cryptology · doi:10.1007/s001459910004 · Cited by 42
Cited by
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00008-8 · Cited by 2,937
Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks
Zhong, S., Chen, J., & Yang, Y. R. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209220 · Cited by 1,219
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. (2003) · Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003. · doi:10.1109/snpa.2003.1203362 · Cited by 1,001
A survey on peer-to-peer key management for mobile ad hoc networks
Merwe, J. V. D., Dawoud, D., & McDonald, S. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216371 · Cited by 343
Metadata
- Authors
- Luo, H., Zerfos, P., Kong, J., Lu, S., & Zhang, L.
- Venue
- Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-25
- Pages
- 567-574
- OpenAlex
- W2132130537
- Cited by
- 358
- References
- 24
- FWCI
- 22.77
- 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.