The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Random key-assignment for secure Wireless Sensor Networks
Abstract
A distributed Wireless Sensor Network (WSN) is a collection of n sensors with limited hardware resources. Sensors can exchange messages via Radio Frequency (RF), whose range usually covers only a limited number of other sensors. An interesting problem is how to implement secure pair-wise communications among any pair of sensors in a WSN. A WSN requires completely distributed solutions which are particularly challenging due to the limited resources and the size of the network. Moreover, WSNs can be subject to several security threats, including the physical compromising of a sensor. Hence, any solution for secure pairwise communications should tolerate the collusion of a set of corrupted sensors. This paper describes a probabilistic model and two protocols to establish a secure pair-wise communication channel between any pair of sensors in the WSN, by assigning a small set of random keys to each sensor. We build, based on the first Direct Protocol, a second Co-operative Protocol. The Co-operative Protocol is adaptive: its security properties can be dynamically changed during the life-time of the WSN. Both protocols also guarantee implicit and probabilistic mutual authentication without any additional overhead and without the presence of a base station. The performance of the Direct Protocol is analytically characterized while, for the Co-operative Protocol, we provide both analytical evaluations and extensive simulations. For example, the results show that, assuming each sensor stores 120 keys, in a WSN composed of 1024 sensors with 32 corrupted sensors the probability of a channel corruption is negligible in the case of the Co-operative Protocol.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A review of current routing protocols for ad hoc mobile wireless networks
Royer, E. M., & Toh, C.-K. (1999) · IEEE Personal Communications · doi:10.1109/98.760423 · Cited by 3,763
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586117 · Cited by 3,541
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
System architecture directions for networked sensors
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.356998 · Cited by 3,084
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
SPINS: security protocols for sensor networks
Perrig, A., Szewczyk, R., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
Perkins, C. E. (2008) · Cited by 1,889
Next century challenges: mobile networking for “Smart Dust”
Kahn, J. M., Katz, R. H., & Pister, K. S. J. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313558 · Cited by 1,660
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
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
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
Distributed clustering for ad hoc networks
Basagni, S. (2003) · Proceedings of the ... International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN) · doi:10.1109/ispan.1999.778957 · Cited by 1,021
Max-min d-cluster formation in wireless ad hoc networks
Amis, A. D., Prakash, R., Vuong, T. H. P., & Huynh, D. T. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832171 · Cited by 985
Dynamic power management in wireless sensor networks
Sinha, A., & Chandrakasan, A. (2001) · IEEE Design & Test of Computers · doi:10.1109/54.914626 · Cited by 711
CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY
Carman, D. W., Kruus, P. S., & Matt, B. J. (2000) · Cited by 620
Key agreement in dynamic peer groups
Steiner, M., Tsudik, G., & Waidner, M. (2000) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.877936 · Cited by 601
Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach
Zhu, S., Xu, S., Setia, S., & Jajodia, S. (2004) · 11th IEEE International Conference on Network Protocols, 2003. Proceedings. · doi:10.1109/icnp.2003.1249782 · Cited by 344
New multiparty authentication services and key agreement protocols
Ateniese, G., Steiner, M., & Tsudik, G. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839937 · Cited by 295
Providing secrecy in key management protocols for large wireless sensors networks
Pietro, R. D., Mancini, L. V., & Jajodia, S. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00046-5 · Cited by 64
Self-citationSecurity requirements for cryptographic modules
(1994) · doi:10.6028/nist.fips.140-1 · Cited by 59
Cited by
Internet of things: Vision, applications and research challenges
Miorandi, D., Sicari, S., De Pellegrini, F., & Chlamtac, I. (2012) · Ad Hoc Networks · doi:10.1016/j.adhoc.2012.02.016 · Cited by 3,578
The sybil attack in sensor networks: analysis & defenses
Newsome, J., Shi, E., Song, D., & Perrig, A. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984660 · Cited by 1,305
A survey of security issues in wireless sensor networks
Wang, Y., Attebury, G., & Ramamurthy, B. (2006) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2006.315852 · Cited by 898
Establishing pairwise keys in distributed sensor networks
Liu, D., Ning, P., & Li, R. (2005) · ACM Transactions on Information and System Security · doi:10.1145/1053283.1053287 · Cited by 812
Sensor network security: a survey
Chen, X., Makki, K., Yen, K., & Pissinou, N. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090205 · Cited by 599
Metadata
- Authors
- Di Pietro, R., Mancini, L. V., & Mei, A.
- Venue
- Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
- Publisher
- ACM
- Published
- 2003-10-31
- Pages
- 62-71
- OpenAlex
- W2052050157
- Cited by
- 257
- References
- 22
- FWCI
- 9.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.