Time Entangled Quantum Blockchain with Phase Encoding for Classical Data
- URL: http://arxiv.org/abs/2507.14839v1
- Date: Sun, 20 Jul 2025 06:50:41 GMT
- Title: Time Entangled Quantum Blockchain with Phase Encoding for Classical Data
- Authors: Ruwanga Konara, Kasun De Zoysa, Anuradha Mahasinghe, Asanka Sayakkara, Nalin Ranasinghe,
- Abstract summary: It is widely believed that there will be quantum hardware capable of compromising classical cryptography.<n>This is mainly due to the operational realizations of quantum algorithms such as Grover and Shor.<n>One approach to secure blockchain is to attempt to achieve information theoretical security by defining blockchain on quantum technologies.
- Score: 0.46797467897340006
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: With rapid advancements in quantum computing, it is widely believed that there will be quantum hardware capable of compromising classical cryptography and hence, the internet and the current information security infrastructure in the coming decade. This is mainly due to the operational realizations of quantum algorithms such as Grover and Shor, to which the current classical encryption protocols are vulnerable. Blockchains, i.e., blockchain data structures and their data, rely heavily on classical cryptography. One approach to secure blockchain is to attempt to achieve information theoretical security by defining blockchain on quantum technologies. There have been two conceptualizations of blockchains on quantum registers: the time-entangled Greenberger-Horne-Zeilinger (GHZ) state blockchain and the quantum hypergraph blockchain. On our part, an attempt is made to conceptualize a new quantum blockchain combining features of both these schemes to achieve the absolute security of the time-temporal GHZ blockchain and the scalability and efficiency of the quantum hypergraph blockchain in the proposed quantum blockchain protocol.
Related papers
- Q-PnV: A Quantum Consensus Mechanism for Security Consortium Blockchains [10.20686832651113]
We propose a novel quantum consensus mechanism, named Q-PnV.<n>This consensus mechanism is based on the classical Proof of Vote (PoV), integrating quantum voting, quantum digital signature and quantum random number generators (QRNGs)<n>Compared to the classical method, the quantum blockchain based on Q-PnV can resist quantum attacks and shows significant improvements in security and fairness, making it better suit-ed for the future quantum era.
arXiv Detail & Related papers (2024-12-09T09:24:04Z) - A Survey and Comparison of Post-quantum and Quantum Blockchains [4.965489431705061]
The rapid progress of quantum computing poses a significant threat to the security of existing blockchain technologies.
The emergence of Shor's and Grover's algorithms raises concerns regarding the compromise of the cryptographic systems underlying blockchains.
It is essential to develop methods that reinforce blockchain technology against quantum attacks.
arXiv Detail & Related papers (2024-09-02T16:20:22Z) - Towards A Post-Quantum Cryptography in Blockchain I: Basic Review on Theoretical Cryptography and Quantum Information Theory [0.0]
The invention of quantum computers was so revolutionary that they bring transformative challenges in a variety of fields.
It becomes inevitable to consider to implement a post-quantum cryptography, which is also referred to as quantum-resistant cryptography.
arXiv Detail & Related papers (2024-07-19T05:59:21Z) - The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - Towards post-quantum blockchain: A review on blockchain cryptography
resistant to quantum computing attacks [0.0]
This article studies current state of the art on post-quantum cryptosystems and how they can be applied to blockchains and DLTs.
It provides comparisons on the characteristics and performance of the most promising post-quantum public-key encryption and digital signature schemes for blockchains.
arXiv Detail & Related papers (2024-02-01T17:29:07Z) - Generative AI-enabled Blockchain Networks: Fundamentals, Applications,
and Case Study [73.87110604150315]
Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology.
In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
arXiv Detail & Related papers (2024-01-28T10:46:17Z) - When Quantum Information Technologies Meet Blockchain in Web 3.0 [86.91054991998273]
We introduce a quantum blockchain-driven Web 3.0 framework that provides information-theoretic security for decentralized data transferring and payment transactions.
We discuss the potential applications and challenges of implementing quantum blockchain in Web 3.0.
arXiv Detail & Related papers (2022-11-29T05:38:42Z) - An Evolutionary Pathway for the Quantum Internet Relying on Secure
Classical Repeaters [64.48099252278821]
We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle.
In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes.
We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
arXiv Detail & Related papers (2022-02-08T03:24:06Z) - Quantum-resistance in blockchain networks [46.63333997460008]
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks.
The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
arXiv Detail & Related papers (2021-06-11T23:39:25Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.