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.
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
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
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
Kerberos: An Authentication Service for Open Network Systems
Steiner, J. G., Athena, Neuman, C., & Schiller, J. I. (1988) · Cited by 1,014
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
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
CEDAR: a core-extraction distributed ad hoc routing algorithm
Sivakumar, R., Sinha, P., & Bharghavan, V. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.779926 · Cited by 718
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
Publicly Verifiable Secret Sharing
Stadler, M. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_17 · Cited by 531
SDSI - A Simple Distributed Security Infrastructure
Lampson, B., & Rivest, R. L. (1996) · Cited by 480
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting
Schoenmakers, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_10 · Cited by 448
Society and Group Oriented Cryptography: a New Concept
Desmedt, Y. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_8 · Cited by 433
(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
WTCP: A Reliable Transport Protocol for Wireless Wide-Area Networks
Sinha, P., Nandagopal, T., Venkitaraman, N., Sivakumar, R., & Bharghavan, V. (2002) · Wireless Networks · doi:10.1023/a:1013702428498 · Cited by 248
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
WTCP: a reliable transport protocol for wireless wide-area networks
Sinha, P., Venkitaraman, N., Sivakumar, R., & Bharghavan, V. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313541 · Cited by 190
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
Shared Generation of Authenticators and Signatures (Extended Abstract)
Desmedt, Y., & Frankel, Y. (1991) · UCL Discovery (University College London) · Cited by 159
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
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
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
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.