A Survey of Public-Key Cryptographic Primitives in Wireless Sensor Networks
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Cryptographic primitives are fundamental building blocks for designing security protocols to achieve confidentiality, authentication, integrity and non-repudiation. It is not too much to say that the selection and integration of appropriate cryptographic primitives into the security protocols determines the largest part of the efficiency and energy consumption of the wireless sensor network (WSN). There are a number of surveys on security issues on WSNs, which, however, did not focus on public-key cryptographic primitives in WSNs. In this survey, we provide a deeper understanding of public-key cryptographic primitives in WSNs including identity-based cryptography and discuss their main directions and some open research issues that can be further pursued. We investigate state-of-the-art software implementation results of public-key cryptographic primitives in terms of execution time, energy consumption and resource occupation on constrained wireless devices choosing popular IEEE 802.15.4-compliant WSN hardware platforms, used in real-life deployments. This survey provides invaluable insights on public-key cryptographic primitives on WSN platforms, and solutions to find tradeoffs between cost, performance and security for designing security protocols in WSNs.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“This notion corresponds to a computational version of perfect secrecy introduced by Shannon [46].”
BackgroundPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 1×
“In fact, well-known PKEs such as the plain RSA [5] and ElGamal encryption scheme [60] are malleable.”
BackgroundNTRU: 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×
“Lattices have been studied by cryptographers for quite some time, both in the field of cryptanalysis [130]–[132] and as a source of hard problems on which to build encryption schemes [133]–[135].”
Background
Cited by
Differential Privacy Techniques for Cyber Physical Systems: A Survey
Hassan, M. U., Rehmani, M. H., & Chen, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2944748 · Cited by 564
Hassan, M. U., Rehmani, M. H., & Chen, J. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.02.060 · Cited by 520
Stellios, I., Kotzanikolaou, P., Psarakis, M., Alcaraz, C., & Lopez, J. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2855563 · Cited by 454
Ransomware threat success factors, taxonomy, and countermeasures: A survey and research directions
Al-rimy, B. A. S., Maarof, M. A., & Shaid, S. Z. M. (2018) · Computers & Security · doi:10.1016/j.cose.2018.01.001 · Cited by 383
A Review on Blockchain Technologies for an Advanced and Cyber-Resilient Automotive Industry
Fraga-Lamas, P., & Fernandez-Carames, T. M. (2019) · IEEE Access · doi:10.1109/access.2019.2895302 · Cited by 343
Metadata
- Authors
- Shim, K.-A.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2016
- Volume
- 18
- Issue
- 1
- Pages
- 577-601
- ISSN
- 1553-877X (ISSN-L)
- OpenAlex
- W2274609711
- Cited by
- 131
- References
- 6
- FWCI
- 14.97
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Survey of Public-Key Cryptographic Primitives in Wireless Sensor Networks. https://app.cochat.ai/papers/10.1109/comst.2015.2459691
- The paper
- Shim, K.-A. (2016). A Survey of Public-Key Cryptographic Primitives in Wireless Sensor Networks. IEEE Communications Surveys & Tutorials. https://doi.org/10.1109/comst.2015.2459691
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.