Vulnerability of Blockchain Technologies to Quantum Attacks
- URL: http://arxiv.org/abs/2105.01815v1
- Date: Wed, 5 May 2021 01:01:42 GMT
- Title: Vulnerability of Blockchain Technologies to Quantum Attacks
- Authors: Joseph J. Kearney, Carlos A. Perez-Delgado
- Abstract summary: Quantum computation represents a threat to many cryptographic protocols in operation today.
It has been estimated that by 2035, there will exist a quantum computer capable of breaking the vital cryptographic scheme RSA2048.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum computation represents a threat to many cryptographic protocols in
operation today. It has been estimated that by 2035, there will exist a quantum
computer capable of breaking the vital cryptographic scheme RSA2048. Blockchain
technologies rely on cryptographic protocols for many of their essential
sub-routines. Some of these protocols, but not all, are open to quantum
attacks. Here we analyze the major blockchain-based cryptocurrencies deployed
today -- including Bitcoin, Ethereum, Litecoin and ZCash, and determine their
risk exposure to quantum attacks. We finish with a comparative analysis of the
studied cryptocurrencies and their underlying blockchain technologies and their
relative levels of vulnerability to quantum attacks.
Related papers
- 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.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
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) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - 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) - Token Spammers, Rug Pulls, and SniperBots: An Analysis of the Ecosystem of Tokens in Ethereum and in the Binance Smart Chain (BNB) [50.888293380932616]
We study the ecosystem of the tokens and liquidity pools.
We find that about 60% of tokens are active for less than one day.
We estimate that 1-day rug pulls generated $240 million in profits.
arXiv Detail & Related papers (2022-06-16T14:20:19Z) - 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 Advantage on Proof of Work [0.0]
We make the case that quantum devices provide a computational advantage in performing Proof-of-Work (PoW) in the context of Bitcoin.
This has strong consequences regarding both quantum-based attacks on the integrity of the entirety of the blockchain, as well as more legitimate uses of quantum computation for the purpose of mining Bitcoin and other cryptocurrencies.
arXiv Detail & Related papers (2021-05-05T01:27:31Z) - 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.