The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Random key predistribution schemes for sensor networks
Open accessAbstract
Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys scheme, we trade off the unlikeliness of a large-scale network attack in order to significantly strengthen random key predistribution's strength against smaller-scale attacks. Second, in the multipath-reinforcement scheme, we show how to strengthen the security between any two nodes by leveraging the security of other links. Finally, we present the random-pairwise keys scheme, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation.
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
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 method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
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
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
Self-citationZhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
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
Self-citationA 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
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
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
Self-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
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757
The quest for security in mobile ad hoc networks
Hubaux, J., Buttyán, L., & Capkun, S. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501436.501437 · Cited by 730
Fiat, A., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_40 · Cited by 728
Providing robust and ubiquitous security support for mobile ad-hoc networks
Jiej, Petros, Z., Luo, H., Lu, S., & Zhang, L. (2001) · Proceedings Ninth International Conference on Network Protocols ICNP 2001 ICNP-01 · doi:10.1109/icnp.2001.992905 · Cited by 688
CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY
Carman, D. W., Kruus, P. S., & Matt, B. J. (2000) · Cited by 620
An evaluation of directory schemes for cache coherence
Agarwal, A. K., Simoni, R., Hennessy, J. L., & Horowitz, M. (1998) · doi:10.1145/285930.285995 · Cited by 420
Key infection: smart trust for smart dust
Anderson, R., Chan, H., & Perrig, A. (2004) · Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004. · doi:10.1109/icnp.2004.1348111 · Cited by 245
Self-citationSelf-healing key distribution with revocation
Staddon, J., Miner, S., Franklin, M., Balfanz, D., Malkin, M., & Dean, D. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004375 · Cited by 219
Long-Lived Broadcast Encryption
Garay, J. A., Staddon, J., & Wool, A. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_21 · Cited by 136
Secret-Key Agreement without Public-Key Cryptography
Leighton, T., & Micali, S. M. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_39 · Cited by 117
Pgp in constrained wireless devices
Brown, M., Cheung, D., Hankerson, D., Hernandez, J. L., Kirkup, M., & Menezes, A. (2000) · Cited by 107
Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices
Wong, D. S., & Chan, A. H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_17 · Cited by 79
Fully-fledged two-way public key authentication and key agreement for low-cost terminals
Beller, M. J., & Yacobi, Y. (1993) · Electronics Letters · doi:10.1049/el:19930666 · Cited by 70
Key establishment protocols for secure mobile communications: A selective survey
Boyd, C., & Mathuria, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0053746 · Cited by 63
Making home automation communications secure
Bergstrom, P., Driscoll, K. R., & Kimball, J. H. (2001) · Computer · doi:10.1109/2.955099 · Cited by 52
Cited by
TinySec: a link layer security architecture for wireless sensor networks
Karlof, C., Sastry, N., & Wagner, D. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031515 · Cited by 1,612
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 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
Self-citationA Survey on Security and Privacy Issues in Internet-of-Things
Yang, Y., Wu, L., Yin, G., Li, L., & Zhao, H. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2694844 · Cited by 1,278
Security of the Internet of Things: perspectives and challenges
Jing, Q., Vasilakos, A. V., Wan, J., Lu, J., & Qiu, D. (2014) · Wireless Networks · doi:10.1007/s11276-014-0761-7 · Cited by 1,245
Metadata
- Authors
- Chan, H., Perrig, A., & Song, D.
- Venue
- Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
- Publisher
- IEEE Comput. Soc
- Published
- 2004-05-13
- Pages
- 197-213
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2117984332
- Cited by
- 2,826
- References
- 27
- FWCI
- 107.38
- Type
- conference paper
- 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.