The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Self-organized public-key management for mobile ad hoc networks
Open accessAbstract
In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. We propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.
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
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
A survey of mobility models for ad hoc network research
Camp, T., Boleng, J., & Davies, V. (2002) · Wireless Communications and Mobile Computing · doi:10.1002/wcm.72 · Cited by 4,621
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
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
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Small Worlds: The Dynamics of Networks between Order and Randomness
Watts, D. J. (1999) · Princeton University Press eBooks · doi:10.1515/9780691188331 · Cited by 2,105
Perkins, C. E. (2008) · Cited by 1,889
An Experimental Study of the Small World Problem
Travers, J., & Milgram, S. (1969) · Sociometry · doi:10.2307/2786545 · Cited by 1,863
A secure routing protocol for ad hoc networks
Sanzgiri, K., Dahill, B., Levine, B. N., Shields, C., & Belding-Royer, E. M. (2003) · 10th IEEE International Conference on Network Protocols, 2002. Proceedings. · doi:10.1109/icnp.2002.1181388 · Cited by 1,410
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Stajano, F., & Anderson, R. (2000) · Lecture Notes in Computer Science · doi:10.1007/10720107_24 · Cited by 1,160
Cited by
Random key predistribution schemes for sensor networks
Chan, H., Perrig, A., & Song, D. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199337 · Cited by 2,826
Lin, J., Yu, W., Zhang, N., Yang, X., Zhang, H., & Zhao, W. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2683200 · Cited by 2,793
Mobile ad hoc networking: imperatives and challenges
Chlamtac, I., Conti, M., & Liu, J. J.-N. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00013-1 · Cited by 1,349
A survey of security issues in mobile ad hoc and sensor networks
Djenouri, D., Khelladi, L., & Badache, A. N. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1593277 · Cited by 492
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
A survey on physical unclonable function (PUF)-based security solutions for Internet of Things
Shamsoshoara, A., Korenda, A., Afghah, F., & Zeadally, S. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107593 · Cited by 310
Internet of Things: Security and Solutions Survey
Sadhu, P. K., Yanambaka, V. P., & Abdelgawad, A. (2022) · Sensors · doi:10.3390/s22197433 · Cited by 299
Mobility helps security in ad hoc networks
Čapkun, S., Hubaux, J.-P., & Buttyán, L. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778422 · Cited by 257
Self-citation
Metadata
- Authors
- Capkun, S., Buttyan, L., & Hubaux, J.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2003-01
- Volume
- 2
- Issue
- 1
- Pages
- 52-64
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2117496982
- Cited by
- 826
- References
- 24
- FWCI
- 89.91
- Type
- journal article
- Language
- en
- Open access
- green
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.