Public Key Cryptography in Sensor Networks—Revisited
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
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
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 · cited 10×
“It is based on the factorization problem of large numbers and is therefore similar to the security of RSA with the same sized modulus.”
BackgroundMethodInfluentialA 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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Wireless sensor networks for habitat monitoring
Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R., & Anderson, J. (2002) · Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications · doi:10.1145/570738.570751 · Cited by 4,166
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
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · cited 3×
“The second algorithm, NtruEncrypt [12], was introduced in 1996 by Hoffstein, Pipher and Silverman.”
BackgroundMethodHandbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9780429466335 · Cited by 1,770
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Rabin, M. O. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,406
Computer Arithmetic: Algorithms and Hardware Designs
Parhami, B. (1999) · Cited by 1,146
Information Security and Privacy
Hutchison, D., Boyd, C., González Nieto, J., Weikum, G., Mitchell, J. C., Kleinberg, J. M., Takeo Kanade, A., Mattern, F., Naor, M., Nierstrasz, O., et al. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02620-1 · Cited by 1,040
(2000) · Lecture Notes in Computer Science · doi:10.1007/10722028 · Cited by 1,001
Vibration-to-electric energy conversion
Meninger, S., Mur-Miranda, J. O., Amirtharajah, R., Chandrakasan, A., & Lang, J. H. (2001) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.920820 · Cited by 867
Selecting Cryptographic Key Sizes
Lenstra, A. K., & Verheul, E. R. (2001) · Journal of Cryptology · doi:10.1007/s00145-001-0009-4 · Cited by 784
Self-powered signal processing using vibration-based power generation
Amirtharajah, R., & Chandrakasan, A. P. (1998) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.668982 · Cited by 621
CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY
Carman, D. W., Kruus, P. S., & Matt, B. J. (2000) · Cited by 620
Computer arithmetic: Algorithms and hardware designs
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90051-8 · Cited by 412
Koç, Ç. K., Naccache, D., & Paar, C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44709-1 · Cited by 391
(2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45238-6 · Cited by 286
A Survey of Optimization Techniques Targeting Low Power VLSI Circuits
Devadas, S., & Malik, S. (1995) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.1995.250098 · Cited by 245
Hoffstein, J., & Silverman, J. H. (2012) · De Gruyter eBooks · doi:10.1515/9783110881035.77 · Cited by 87
Design and Implementation of a True Random Number Generator Based on Digital Circuit Artifacts
Epstein, M., Hars, L., Krasinski, R., Rosner, M., & Zheng, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45238-6_13 · Cited by 85 · cited 1×
“For information on a compact implementation of an RNG based on digital artefacts requiring only a few hundred gates we refer to [21].”
MethodBailey, D. V., Coffin, D., Elbirt, A. J., Silverman, J. H., & Woodbury, A. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44709-1_22 · Cited by 72
Cited by
Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards
Baronti, P., Pillai, P., Chook, V. W. C., Chessa, S., Gotta, A., & Hu, Y. F. (2007) · Computer Communications · doi:10.1016/j.comcom.2006.12.020 · Cited by 1,430
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
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
A survey of security issues in mobile ad hoc and sensor networks
Djenouri, D., Khelladi, L., & Badache, A. N. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1593277 · Cited by 492
Securing wireless sensor networks: a survey
Zhou, Y., Fang, Y., & Zhang, Y. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2008.4625802 · Cited by 424
Metadata
- Authors
- Gaubatz, G., Kaps, J.-P., & Sunar, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 2-18
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W178881929
- Cited by
- 289
- References
- 23
- FWCI
- 22.90
- 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.