This article examines the problem of mutual identification and authentication of users in an unreliable blockchain-based environment. We propose a protocol based on post-quantum cryptography that allows for mutual identification and authentication in distributed registries. The protocol is based on ZKP technology, the basic properties of which have been proven using lemmas. The protocol also used post-quantum cryptography methods, which are considered to be secure for quantum computers. This article presents the results of an experimental evaluation of the protocol’s characteristics. For example, the average protocol execution time is 18 ms. This article also presents a model of the intruder with its capabilities and limitations, as well as the results of attack modeling, which confirm that obtaining secret information from transmitted messages is a complex computational task, even when using a quantum computer. Compromising the server will not lead to the disclosure of the secret, since it is transmitted as a signature created using lattice cryptography.
This article examines the problem of mutual identification and authentication of users in an unreliable blockchain-based environment. We propose a protocol based on post-quantum cryptography that allows for mutual identification and authentication in distributed registries. The protocol is based on ZKP technology, the basic properties of which have been proven using lemmas. The protocol also used post-quantum cryptography methods, which are considered to be secure for quantum computers. This article presents the results of an experimental evaluation of the protocol’s characteristics. For example, the average protocol execution time is 18 ms. This article also presents a model of the intruder with its capabilities and limitations, as well as the results of attack modeling, which confirm that obtaining secret information from transmitted messages is a complex computational task, even when using a quantum computer. Compromising the server will not lead to the disclosure of the secret, since it is transmitted as a signature created using lattice cryptography.
The fast growth of quantum computing makes the old modes of cryptography, be it RSA or ECC, weak to quantum attacks, especially when it employs Shor's algorithm. Threatening also builds up on the post-quantum age regarding blockchain technology and its external cryptography, which secures reliable transactions and authentication. This study will address the importance of quantum resistant blockchain authentication protocols for the security of decentralized systems against any forward-looking quantum-enabled attacks. This paper goes through different classifications of post-quantum cryptography like lattice-based, hash-based, multivariate polynomial, and code-based cryptography, taking an effort to analyze their compatibility with blockchain use cases.[8] Moreover, we also introduce the innovative quantum-resistant authentication model designed to enhance security while not compromising upon efficiency.[2] [3] Our proposed model would ensure scalability and less computational overhead by partially providing immunity to quantum adversaries through its underlying use of post-quantum signature schemes and lightweight key exchange mechanisms. This research aims at laying the foundation for developing a secure blockchain ecosystem against quantum threats, heading toward a resistant future-proof decentralized infrastructure. [4] [5]
In emerging environments such as cloud computing and the Internet of Things (IoT), secure authentication and key negotiation play a crucial role in protecting data transmitted over public networks. However, many existing authentication protocols are still designed based on classical public-key cryptography primitives, and quantum computing may threaten their security. To address this challenge, we propose a post-quantum authentication and key agreement protocol that uses the lattice-based Kyber key encapsulation mechanism (KEM). Our proposed protocol integrates cryptographic authentication, smart card protection, and post-quantum key encapsulation mechanisms, enabling mutual authentication between users and servers and securely establishing session keys. The security of the protocol is formally analyzed in the Real-or-Random (ROR) model under the random oracle assumption and the IND-CCA security of the underlying KEM scheme. Furthermore, through informal security analysis, we have further demonstrated that the protocol possesses important security properties, including anonymity, untraceability, perfect forward confidentiality, and resistance to known attacks. In addition, the computational cost and communication overhead of the proposed scheme are evaluated and compared with several representative authentication protocols. The results show that the proposed protocol can provide strong security while maintaining low computational cost and communication overhead.
Blockchain technology has gained significant prominence in recent years due to its public, distributed, and decentration characteristics, which was widely applied in all walks of life requiring distributed trustless consensus. However, the most cryptographic protocols used in the current blockchain networks are susceptible to the quantum attack with rapid development of a sufficiently large quantum computer. In this paper, we first give an overview of the vulnerabilities of the modern blockchain networks to a quantum adversary and some potential post-quantum mitigation methods. Then, a new lattice-based signature scheme has been proposed, which can be used to secure the blockchain network over existing classical channels. Meanwhile, the public and private keys are generated by the Bonsai Trees technology withRandBasisalgorithm from the root keys, which not only ensure the randomness, but also construct the lightweight nondeterministic wallets. Then, the proposed scheme can be proved secure in random oracle model, and it is also more efficient than similar literatures. In addition, we also give the detailed description of the post-quantum blockchain transaction. Furthermore, this work can help to enrich the research on the future post-quantum blockchain (PQB).
The most recent quantum computers are capable of decoding secret encryption keys and opening up the network to attack by solving extremely difficult classical cryptography calculations. In contrast to the billions of years of calculation required by conventional computer equipment, they can nearly instantly solve complex mathematical calculations. The emergence of quantum computing and blockchains are two of the main technical developments both in academic and industry domains that are currently in progress. Researchers support the creation of innovative methods that incorporate encryption technology in the post-quantum computing. A lattice was utilized extensively in cryptography and those techniques were employed in both (a) cryptanalysis by utilizing lattice assumption to crack cryptosystems and (b) cryptography by exploiting challenging lattice problems in computational domain. The issues similar to the quantum attack and the execution of post-quantum signature verification in blockchains are a required scientific implementation in today’s world because blockchains have considerably advanced in recent years and learned numerous applications in various fields with the assumption that they will significantly improve their security. This chapter offers the theoretical underpinnings for current research in post-quantum cryptography that aims to integrate safe cryptographic primitives into blockchain technology.
With the development of quantum computing, classical cryptosystems (RSA, ECDSA) that ensure the security of distributed ledgers face an existential threat. This paper examines protocols for protecting personal data (PD) in blockchain, taking into account the “Harvest Now, Decrypt Later” strategy. We propose and formalize a family of protocols designed for storing and exchanging personal data in blockchain systems. The article describes in detail approaches to software implementations of smart contracts for the Ethereum (using ECIES (Elliptic Curve Integrated Encryption Scheme) and Keccak-256) and Hyperledger Fabric 2.5 (integrating NIST post-quantum standards: ML-KEM (Module-Lattice-Based Key Encapsulation Mechanism) and ML-DSA (Module-Lattice-Based Digital Signature Algorithm)) platforms based on the developed protocols. For all developed protocols, a Threat Agent Model (TAM) is presented, threat scenarios are examined, and resilience to typical attack scenarios is demonstrated. A comparative analysis of computational efficiency and overhead is conducted. The results show that using lattice cryptography provides high performance, but the 50-fold increase in signature size makes direct implementation of PQC (Post-Quantum Cryptography) in Layer 1 public networks economically unfeasible. A hybrid model and the use of Layer 2 to ensure quantum resistance are proposed.
Nowadays, blockchain has become one of the most cutting-edge technologies, which has been widely concerned and researched. However, the quantum computing attack seriously threatens the security of blockchain, and related research is still less. Targeting at this issue, in this paper, we present the definition of post-quantum blockchain (PQB) and propose a secure cryptocurrency scheme based on PQB, which can resist quantum computing attacks. First, we propose a signature scheme based on lattice problem. We use lattice basis delegation algorithm to generate secret keys with selecting a random value, and sign message by preimage sampling algorithm. In addition, we design the first-signature and last-signature in our scheme, which are defined as double-signature. It is used to reduce the correlation between the message and the signature. Second, by combining the proposed signature scheme with blockchain, we construct the PQB and propose this cryptocurrency scheme. Its security can be reduced to the lattice short integer solution (SIS) problem. At last, through our analysis, the proposed cryptocurrency scheme is able to resist the quantum computing attack and its signature satisfies correctness and one-more unforgeability under the lattice SIS assumption. Furthermore, compared with previous signature schemes, the sizes of signature and secret keys are relatively shorter than that of others, which can decrease the computational complexity. These make our cryptocurrency scheme more secure and efficient.