The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Providing robust and ubiquitous security support for mobile ad-hoc networks
Abstract
Providing security support for mobile ad-hoc networks is challenging for several reasons: (a) wireless networks are susceptible to attacks ranging from passive eavesdropping to active interfering, occasional break-ins by adversaries may be inevitable in a large time window; (b) mobile users demand "anywhere, anytime" services; (c) a scalable solution is needed for a large-scale mobile network. In this paper, we describe a solution that supports ubiquitous security services for mobile hosts, scales to network size, and is robust against break-ins. In our design, we distribute the certification authority functions through a threshold secret sharing mechanism, in which each entity holds a secret share and multiple entities in a local neighborhood jointly provide complete services. We employ localized certification schemes to enable ubiquitous services. We also update the secret shares to further enhance robustness against break-ins. Both simulations and implementation confirm 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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“The concepts of threshold secret sharing [14] [2] [4] [12] [15] and secret share updates [7] [5] are not new, and have been studied in the cryptography context.”
BackgroundDynamic 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
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
Cryptography and Network Security: Principles and Practice
Stallings, W. (1998) · Cited by 4,392
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
Adaptive clustering for mobile wireless networks
Lin, C. R., & Gerla, M. (1997) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.622910 · Cited by 1,533
A comparison of mechanisms for improving TCP performance over wireless links
Balakrishnan, H., Padmanabhan, V. N., Seshan, S., & Katz, R. H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650137 · Cited by 1,395
A practical scheme for non-interactive verifiable secret sharing
Feldman, P. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.4 · Cited by 1,125
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
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
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
Denial of service in sensor networks
Wood, A. D., & Stankovic, J. A. (2002) · Computer · doi:10.1109/mc.2002.1039518 · Cited by 1,711
Packet leashes: a defense against wormhole attacks in wireless networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (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.1209219 · Cited by 1,513
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
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 key management scheme for wireless sensor networks using deployment knowledge
Du, W., Deng, J., Han, Y. S., Chen, S., & Varshney, P. K. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354530 · Cited by 919
Security in mobile ad hoc networks: challenges and solutions
Yang, H., Luo, H., Ye, F., Lu, S., & Zhang, L. (2004) · IEEE Wireless Communications · doi:10.1109/mwc.2004.1269716 · Cited by 879
Self-citationSelf-organized public-key management for mobile ad hoc networks
Capkun, S., Buttyan, L., & Hubaux, J. (2003) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2003.1195151 · Cited by 826
Wormhole attacks in wireless networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861394 · Cited by 660
Rushing attacks and defense in wireless ad hoc network routing protocols
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2003) · Proceedings of the 2nd ACM workshop on Wireless security · doi:10.1145/941311.941317 · Cited by 638
TinyPK: securing sensor networks with public key technology
Watro, R., Kong, D., Cuti, S.-F., Gardiner, C., Lynn, C., & Kruus, P. (2004) · Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/1029102.1029113 · Cited by 635
An Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETs
Liu, K., Deng, J., Varshney, P. K., & Balakrishnan, K. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1036 · Cited by 472
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
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
Metadata
- Authors
- Jiej, Petros, Z., Luo, H., Lu, S., & Zhang, L.
- Venue
- Proceedings Ninth International Conference on Network Protocols ICNP 2001 ICNP-01
- Publisher
- IEEE
- Published
- 2001
- Pages
- 251-260
- OpenAlex
- W2537170501
- Cited by
- 688
- References
- 33
- FWCI
- 16.59
- 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.