Quantum-Resilient Consensus Mechanisms for Scalable Blockchain Networks using Lattice-based Cryptography

However, with the rapid development of quantum computing cracking the basic security algorithms of the current blockchain system, such as RSA and ECC, is a big threat. To tackle this critical issue, this work is aimed to develop a quantum resilient consensus scheme that combines in general purpose blockchain architectures with lattice based cryptographic primitives. This model is based on the hardness of lattice problems, which are believed to be resistant to even the attack of quantum; securing blockchain data long and immutably. Our contribution is a novel Proof of Work (PoW) and Proof of Stake (PoS) hybrid, combined with three primitives for secure identity management, digital signature and transaction validation, provided by Learning with Errors (LWE) and Ring-LWE. Quantum Resistance, Computational Complexity, Latency and Network Scalability of the proposed system is evaluated with respect to the classical methods and it is demonstrated that the proposed system is superior in all of these aspects. This marks a critical and one important step toward future proofing blockchain ecosystems as they will be forced into the quantum paradigm that will be inevitable.

Authors

Institutions

Publication Details

Published
2025-06-17
DOI
https://doi.org/10.1109/icicv64824.2025.11086031
Citations
14
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
34.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum-Resilient Consensus Mechanisms for Scalable Blockchain Networks using Lattice-based Cryptography

Judy Simon, Nellore Kapileswar
14 citations
Quantum Computing Algorithms and Architecture
34.73
article

Quantum-Resilient Consensus Mechanisms for Scalable Blockchain Networks using Lattice-based Cryptography

Judy Simon, Nellore Kapileswar
article en
14 citations

Abstract

However, with the rapid development of quantum computing cracking the basic security algorithms of the current blockchain system, such as RSA and ECC, is a big threat. To tackle this critical issue, this work is aimed to develop a quantum resilient consensus scheme that combines in general purpose blockchain architectures with lattice based cryptographic primitives. This model is based on the hardness of lattice problems, which are believed to be resistant to even the attack of quantum; securing blockchain data long and immutably. Our contribution is a novel Proof of Work (PoW) and Proof of Stake (PoS) hybrid, combined with three primitives for secure identity management, digital signature and transaction validation, provided by Learning with Errors (LWE) and Ring-LWE. Quantum Resistance, Computational Complexity, Latency and Network Scalability of the proposed system is evaluated with respect to the classical methods and it is demonstrated that the proposed system is superior in all of these aspects. This marks a critical and one important step toward future proofing blockchain ecosystems as they will be forced into the quantum paradigm that will be inevitable.

Saveetha University (IN)
Climate action
Openalex Percentile: Top 0%
Quantum Computing Algorithms and Architecture
34.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quantum-Resilient Consensus Mechanisms for Scalable Blockchain Networks using Lattice-based Cryptography — Judy Simon, Nellore Kapileswar · (2025) | TGRS Research Map | TGRS