On the Role of Hash-Based Signatures in Quantum-Safe Internet of Things: Current Solutions and Future Directions
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
The Internet of Things (IoT) is gaining ground as a pervasive presence around us by enabling miniaturized “things” with computation and communication capabilities to collect, process, analyze, and interpret information. Consequently, trustworthy data act as fuel for applications that rely on the data generated by these things, for critical decision-making processes, data debugging, risk assessment, forensic analysis, and performance tuning. Currently, secure and reliable data communication in IoT is based on public-key cryptosystems such as the elliptic curve cryptosystem (ECC). Nevertheless, the reliance on the security of de-facto cryptographic primitives is at risk of being broken by the impending quantum computers. Therefore, the transition from classical primitives to quantum-safe primitives is indispensable to ensure the overall security of data en route. In this article, we investigate applications of one of the postquantum signatures called hash-based signature (HBS) schemes for the security of IoT devices in the quantum era. We give a succinct overview of the evolution of HBS schemes with an emphasis on their construction parameters and associated strengths and weaknesses. Then, we outline the striking features of HBS schemes and their significance for IoT security in the quantum era. We also investigate the optimal selection of HBS in the IoT networks with respect to their performance-constrained requirements, resource-constrained nature, and design optimization objectives. In addition to ongoing standardization efforts, we also highlight current and future research and deployment challenges along with possible solutions. Finally, we outline the essential measures and recommendations that must be adopted by the IoT ecosystem while preparing for the quantum world.
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Internet of Things: A Survey on Enabling Technologies, Protocols, and Applications
Al-Fuqaha, A., Guizani, M., Mohammadi, M., Aledhari, M., & Ayyash, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2444095 · Cited by 8,630
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 2×
“In these real-world scenarios, the most widely used cryptographic schemes for digital signatures are RSA [4], digital signature algorithm (DSA) [5], and elliptic curve DSA (ECDSA) [6].”
MethodQuantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Report on Post-Quantum Cryptography
Chen, L., Jordan, S., Liu, Y.-K., Moody, D., Peralta, R., Perlner, R., & Smith-Tone, D. (2016) · doi:10.6028/nist.ir.8105 · Cited by 1,034 · cited 1×
“Furthermore, workshops and calls for proposals are initiated by the US National Institute of Standards and Technology (NIST) [56] in the Post-Quantum Cryptography Standardization project (evaluation of Round 2 candidate algorithms in the process [57]) and European Telecommunications Standards…”
MethodAnschuetz, E., Olson, J., Aspuru-Guzik, A., & Cao, Y. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-14082-3_7 · Cited by 104 · cited 1×
“However, it is expected that with the not-so-far arrival of quantum computers, these computational problems will be susceptible to quantum computer cryptanalysis using Shor’s quantum algorithm [8] and variational quantum factoring [9] and therefore, can be solved by quantum computers in polynomial time.”
Background
Cited by
Trustworthy digital twins in the industrial internet of things with blockchain
Suhail, S., Hussain, R., Jurdak, R., & Hong, C. S. (2022) · IEEE Internet Computing · doi:10.1109/mic.2021.3059320 · Cited by 154
Self-citationQuantum-resistance in blockchain networks
Allende, M., León, D. L., Cerón, S., Pareja, A., Pacheco, E., Leal, A., Da Silva, M., Pardo, A., Jones, D., Worrall, D. J., et al. (2023) · Scientific Reports · doi:10.1038/s41598-023-32701-6 · Cited by 109
Securing the future internet of things with post‐quantum cryptography
Kumar, A., Ottaviani, C., Gill, S. S., & Buyya, R. (2022) · SECURITY AND PRIVACY · doi:10.1002/spy2.200 · Cited by 108
Metadata
- Authors
- Suhail, S., Hussain, R., Khan, A., & Hong, C. S.
- Venue
- IEEE Internet of Things Journal
- Published
- 2021-01-01
- Volume
- 8
- Issue
- 1
- Pages
- 1-17
- ISSN
- 2327-4662 (ISSN-L)
- 2372-2541
- OpenAlex
- W3019520545
- Cited by
- 85
- References
- 8
- FWCI
- 3.41
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Role of Hash-Based Signatures in Quantum-Safe Internet of Things: Current Solutions and Future Directions. https://app.cochat.ai/papers/10.1109/jiot.2020.3013019
- The paper
- Suhail, S., Hussain, R., Khan, A., & Hong, C. S. (2021). On the Role of Hash-Based Signatures in Quantum-Safe Internet of Things: Current Solutions and Future Directions. IEEE Internet of Things Journal. https://doi.org/10.1109/jiot.2020.3013019
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.