The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks
Abstract
Secure communications in wireless sensor networks operating under adversarial conditions require providing pairwise (symmetric) keys to sensor nodes. In large scale deployment scenarios, there is no priory knowledge of post deployment network configuration since nodes may be randomly scattered over a hostile territory. Thus, shared keys must be distributed before deployment to provide each node a key-chain. For large sensor networks it is infeasible to store a unique key for all other nodes in the key-chain of a sensor node. Consequently, for secure communication either two nodes have a key in common in their key-chains and they have a wireless link between them, or there is a path, called key-path, among these two nodes where each pair of neighboring nodes on this path have a key in common. Length of the key-path is the key factor for efficiency of the design. This paper presents novel deterministic and hybrid approaches based on Combinatorial Design for deciding how many and which keys to assign to each key-chain before the sensor network deployment. In particular, Balanced Incomplete Block Designs (BIBD) and Generalized Quadrangles (GQ) are mapped to obtain efficient key distribution schemes. Performance and security properties of the proposed schemes are studied both analytically and computationally. Comparison to related work shows that the combinatorial approach produces better connectivity with smaller key-chain sizes
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
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
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
SPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
CRC Handbook of Combinatorial Designs
(1996) · Discrete Mathematics and Its Applications · doi:10.1201/9781420049954 · Cited by 1,738
Projective Geometries over Finite Fields
Hirschfeld, J. W. P. (1998) · doi:10.1093/oso/9780198502951.001.0001 · Cited by 1,549
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 - CCS '02 · doi:10.1145/586115.586117 · Cited by 1,442
Establishing pairwise keys in distributed sensor networks
Liu, D., & Ning, P. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948119 · Cited by 1,354
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
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Zhu, S., Setia, S., & Jajodia, S. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948120 · Cited by 1,117
A pairwise key pre-distribution scheme for wireless sensor networks
Du, W., Deng, J., Han, Y. S., & Varshney, P. K. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948118 · Cited by 1,107
A pairwise key predistribution scheme for wireless sensor networks
Du, W., Deng, J., Han, Y. S., Varshney, P. K., Katz, J., & Khalili, A. (2005) · ACM Transactions on Information and System Security · doi:10.1145/1065545.1065548 · Cited by 1,038
Perfectly-Secure Key Distribution for Dynamic Conferences
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., & Yung, M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_33 · Cited by 1,030
An Optimal Class of Symmetric Key Generation Systems
Blom, R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_22 · Cited by 933
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
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
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757
(2004) · Thammasat University Digital Collections · doi:10.1007/b97564 · Cited by 427
Key distribution mechanisms for wireless sensor networks : a survey
Camtepe, S. A., & Yener, B. (2005) · Cited by 398
Self-citationEstablishing 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
Liu, D., & Ning, P. (2002) · NCSU Libraries Repository (North Carolina State University Libraries) · Cited by 242
A Performance Evaluation of Intrusion-Tolerant Routing in Wireless Sensor Networks
Deng, J., Han, R., & Mishra, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36978-3_23 · Cited by 209
Efficient self-healing group key distribution with revocation capability
Liu, D., Ning, P., & Sun, K. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948141 · Cited by 198
On communication security in wireless ad-hoc sensor networks
Slijepcevic, S., Potkonjak, M., Tsiatsis, V., Zimbeck, S., & Srivastava, M. B. (2003) · IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE) · doi:10.1109/enabl.2002.1030000 · Cited by 189
Some New Results on Key Distribution Patterns and Broadcast Encryption
Stinson, D. R., & van Trung, T. (1998) · Designs Codes and Cryptography · doi:10.1023/a:1008209004667 · Cited by 115
Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks
Camtepe, S. A., Yener, B., & Yung, M. M. (2006) · International Conference on Communications · doi:10.1109/icc.2006.255107 · Cited by 111
Self-citationA Combinatorial Approach to Threshold Schemes
Stinson, D. R., & Vanstone, S. A. (1988) · SIAM Journal on Discrete Mathematics · doi:10.1137/0401024 · Cited by 86
Security for Wireless Sensor Networks
Avancha, S., Undercoffer, J., Joshi, A., & Pinkston, J. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/1-4020-7884-6_12 · Cited by 62
A construction for authentication/secrecy codes from certain combinatorial designs
Stinson, D. R. (1988) · Journal of Cryptology · doi:10.1007/bf02351720 · Cited by 49
Cited by
Key management systems for sensor networks in the context of the Internet of Things
Roman, R., Alcaraz, C., Lopez, J., & Sklavos, N. (2011) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2011.01.009 · Cited by 295
NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks
Szczechowiak, P., Oliveira, L. B., Scott, M., Collier, M., & Dahab, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77690-1_19 · Cited by 291
Wireless sensor network key management survey and taxonomy
Zhang, J., & Varadharajan, V. (2010) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2009.10.001 · Cited by 275
Metadata
- Authors
- Camtepe, S. A., & Yener, B.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2007-04
- Volume
- 15
- Issue
- 2
- Pages
- 346-358
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2171829409
- Cited by
- 365
- References
- 29
- FWCI
- 51.68
- Type
- journal article
- 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.