Module Lattice-Based Post Quantum Secure Blockchain Empowered Authentication Framework for Autonomous Truck Platooning
Open accessThe DOI matches its Crossref record; 45 of the 46 references it cites were found in a registry or an index.
Abstract
Truck platooning uses networking technology and automated driving support systems to join multiple trucks in a group. When these vehicles interact for particular journey stages, such as on highways, they autonomously maintain a predefined, tight spacing among themselves. Platooning improves transportation by making better use of highways, delivering cargo faster, and minimizing congestion in traffic. Therefore, safety and platooning are two important attributes of an intelligent truck system. This paper discusses a quantum-safe blockchain-empowered authentication mechanism for autonomous truck platooning. The proposed idea is to use blockchain to combine multiple nodes and ensure authenticity with the help of an aggregation technique. The proposed design ensures authenticity to the system due to hard assumptions:1) Learning With Error (LWE) and 2) Short Integer Solution (SIS) on random module generated lattice. This paper uses operations over module lattices to be more efficient than general lattices. We can perform operations on module lattices with the help of fast algorithms for polynomial arithmetic.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This will further lower the efficiency of the platoon up to 44%.”
From Post-Quantum Weighted Anonymous Authentication for Hybrid VANET MAC Protocol (2026) · cites this paper as [25]
In the citing paper
“This means that the LBPQ architecture outperforms the existing blockchain structure overall.”
From Post-Quantum Weighted Anonymous Authentication for Hybrid VANET MAC Protocol (2026) · cites this paper as [25]
In the citing paper
“In LBPQ, transactions are executed for throughput, which shows that the data throughput of non-aggregated blockchain increased from 7-57 readings in one second with a mean ratio of 21.5%.”
From Post-Quantum Weighted Anonymous Authentication for Hybrid VANET MAC Protocol (2026) · cites this paper as [25]
In the citing paper
“For smooth communication between trucks without collision, a low latency is required in LBPQ [25], which leads to slower data delivery and high risks of collision.”
From Post-Quantum Weighted Anonymous Authentication for Hybrid VANET MAC Protocol (2026) · cites this paper as [25]
Citations
Cites
Bitcoin: A Peer-to-Peer Electronic Cash System
Wright, C. S. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.3440802 · Cited by 13,922
Bitcoin: A Peer-to-Peer Electronic Cash System
Squarepants, S. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.3977007 · Cited by 11,148
The Impact of Cooperative Adaptive Cruise Control on Traffic-Flow Characteristics
van Arem, B., van Driel, C. J. G., & Visser, R. (2006) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2006.884615 · Cited by 1,490
Bulletproofs: Short Proofs for Confidential Transactions and More
Bunz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., & Maxwell, G. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00020 · Cited by 1,154 · cited 1×
“There are mainly two categories of blockchain; (1) permissionless and (2) with permission [39].”
BackgroundMulti-signatures in the plain public-Key model and a general forking lemma
Bellare, M., & Neven, G. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180453 · Cited by 654 · cited 5×
“1) Fork (1) : In order to apply the Forking Lemma [43], we require a simulation C with input Gen (1 κ ) and output denoted as A .”
BackgroundMethodInfluentialWorst-case to average-case reductions for module lattices
Langlois, A., & Stehlé, D. (2015) · Designs, Codes and Cryptography · doi:10.1007/s10623-014-9938-4 · Cited by 643 · cited 2×
“…they generate full rank lattice Definition 9: Module Learning with Errors is a hard assumption, if ξ ← U ( Q k × ℓ q ), and e ← Q kq are known, then it is not easy to distinguish between e ∈ U ( Q k q ), and e = [ ξ | I k ] . s , where s ← U ( S ℓ + k ξ ), and S is distributed uniformly [36], [37].”
BackgroundA public-key cryptosystem with worst-case/average-case equivalence
Ajtai, M., & Dwork, C. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258604 · Cited by 642 · cited 1×
“Let R = [ x ] x n + 1 be ring consisting of polynomials at most n degree [33], [34], [35], and x n + 1 be finite quotient ring.”
BackgroundGenerating Hard Instances of Lattice ProblemsPreprint
Ajtai, M. (1996) · Electronic colloquium on computational complexity · Cited by 606
Blockchain-Based Dynamic Key Management for Heterogeneous Intelligent Transportation Systems
Lei, A., Cruickshank, H., Cao, Y., Asuquo, P., Ogah, C. P. A., & Sun, Z. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2740569 · Cited by 602 · cited 1×
“Guo et al. [18] proposed an architecture for blockchain including an event recording system in dynamic autonomous vehicles environment [19].”
BackgroundBlockchain for the Internet of Vehicles Towards Intelligent Transportation Systems: A Survey
Mollah, M. B., Zhao, J., Niyato, D., Guan, Y. L., Yuen, C., Sun, S., Lam, K.-Y., & Koh, L. H. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3028368 · Cited by 425 · cited 1×
“For example, establishing secure and reliable data sharing for V2V and V2I communication has been an important research topic in recent years [17].”
Background
Cited by
Navigating the quantum computing threat landscape for blockchains: A comprehensive survey
Khodaiemehr, H., Bagheri, K., & Feng, C. (2025) · Computer Science Review · doi:10.1016/j.cosrev.2025.100846 · Cited by 44
A Survey of Post-Quantum Cryptography Migration in Vehicles
Lohmiller, N., Kaniewski, S., Menth, M., & Heer, T. (2025) · IEEE Access · doi:10.1109/access.2025.3528562 · Cited by 36
Post-Quantum Weighted Anonymous Authentication for Hybrid VANET MAC Protocol
Ahmad, T., Hadi, M. U., Vassiliou, V., Nigar, N., Jhaveri, R. H., Abaker, M., & Gadekallu, T. R. (2026) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3582080 · Cited by 16
“For smooth communication between trucks without collision, a low latency is required in LBPQ [25], which leads to slower data delivery and high risks of collision.”
Data authorisation and validation in autonomous vehicles: a critical review
Alhabib, R., & Yadav, P. (2025) · Discover Applied Sciences · doi:10.1007/s42452-025-07333-2 · Cited by 13
Fault Tolerance and Fallback Strategies in Connected and Automated Vehicles: A Review
Rodríguez-Arozamena, M., Matute-Peaspan, J. A., Araluce, J., Perez, J., & Zubizarreta, A. (2025) · IEEE Open Journal of Intelligent Transportation Systems · doi:10.1109/ojits.2025.3583787 · Cited by 12
“The encryption based methods include cryptographic algorithms, which can be used to protect data from unauthorized access and secure the communication [124], [125], [126], [127], [128], [129], [130].”
Metadata
- Authors
- Chaudhary, D., Santhi, P., Durgarao, M. S. P., Padmavathi, A., Mehedi Hassan, M., & Fahad Alkhamees, B.
- Affiliations
- Amrita Vishwa Vidyapeetham (IN)
- Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology (IN)
- Department of Information Systems, College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia
- Venue
- IEEE Access
- Published
- 2024
- Volume
- 12
- Pages
- 105219-105233
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W4401070306
- Cited by
- 21
- References
- 46
- Citations by year
- 2026: 8 · 2025: 11 · 2024: 2
- FWCI
- 3.09
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- IEEE Access (publishedVersion, cc-by-nc-nd)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- King Saud University, Riyadh, Saudi Arabia, through the Researchers Supporting Project (RSP2024R493)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
- Keywords
- truck platooning, blockchain, post-quantum cryptography, lattice-based cryptography, module lattices, authentication mechanisms, learning with errors, polynomial arithmetic, autonomous vehicles
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.