Beating the fault-tolerance bound and security loopholes for Byzantine
agreement with a quantum solution
- URL: http://arxiv.org/abs/2206.09159v3
- Date: Wed, 22 Nov 2023 08:33:55 GMT
- Title: Beating the fault-tolerance bound and security loopholes for Byzantine
agreement with a quantum solution
- Authors: Chen-Xun Weng, Rui-Qi Gao, Yu Bao, Bing-Hong Li, Wen-Bo Liu, Yuan-Mei
Xie, Yu-Shuo Lu, Hua-Lei Yin, Zeng-Bing Chen
- Abstract summary: We propose a Byzantine agreement framework with unconditional security to break the $1/3$ fault-tolerance bound.
Our work strictly obeys two Byzantine conditions and can be extended to any number of players without requirements for multiparticle entanglement.
Our work indicates the quantum advantage in terms of consensus problems and suggests an important avenue for quantum blockchain and quantum consensus networks.
- Score: 12.059343107638188
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Byzantine agreement, the underlying core of blockchain, aims to make every
node in a decentralized network reach consensus. Classical Byzantine agreements
unavoidably face two major problems. One is $1/3$ fault-tolerance bound, which
means that the system to tolerate $f$ malicious players requires at least
$3f+1$ players. The other is the security loopholes from its classical
cryptography methods. Here, we propose a Byzantine agreement framework with
unconditional security to break this bound with nearly $1/2$ fault tolerance
due to multiparty correlation provided by quantum digital signatures.
\textcolor{black}{It is intriguing that quantum entanglement is not necessary
to break the $1/3$ fault-tolerance bound, and we show that weaker correlation,
such as asymmetric relationship of quantum digital signature, can also work.}
Our work strictly obeys two Byzantine conditions and can be extended to any
number of players without requirements for multiparticle entanglement. We
experimentally demonstrate three-party and five-party consensus for a digital
ledger. Our work indicates the quantum advantage in terms of consensus problems
and suggests an important avenue for quantum blockchain and quantum consensus
networks.
Related papers
- Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement [1.77513002450736]
It is well known that a trusted setup allows one to solve the Byzantine agreement problem in the presence of $tn/2$ corruptions.
We propose a compiler that transforms any pair of resilience-optimal Byzantine agreement protocols into one that is crypto-agnostic.
Our results improve the state-of-the-art in bit complexity by at least two factors of $n$ and provide either early stopping (deterministic) or expected constant round complexity (randomized)
arXiv Detail & Related papers (2024-10-15T23:44:29Z) - Demonstration of quantum-digital payments [36.136619420474766]
We show how quantum light can secure daily digital payments by generating inherently unforgeable quantum cryptograms.
Unlike previously proposed protocols, our solution does not depend on long-term quantum storage or trusted agents and authenticated channels.
It is practical with near-term technology and may herald an era of quantum-enabled security.
arXiv Detail & Related papers (2023-05-23T20:20:14Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - 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) - Quantum Prudent Contracts with Applications to Bitcoin [0.38073142980733]
We show how to implement prudent contracts -- a non-trivial subset of the functionality that a network such as Bitcoin provides.
Our one-shot signature construction can be used to upgrade the Bitcoin network to a quantum payment scheme.
Our approach requires a universal large-scale quantum computer and long-term quantum memory.
arXiv Detail & Related papers (2022-04-27T09:48:35Z) - Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
We construct the first fully homomorphic encryption scheme with certified deletion.
Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
arXiv Detail & Related papers (2022-03-03T10:07:32Z) - 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) - Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs"
We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM)
As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
arXiv Detail & Related papers (2020-09-29T08:41:53Z) - A Quantum Money Solution to the Blockchain Scalability Problem [3.89615163169501]
We give the first example of the use of smart contracts in a quantum setting.
We describe a simple hybrid classical-quantum payment system whose main ingredients are a classical blockchain capable of handling stateful smart contracts.
Our hybrid payment system employs quantum states as banknotes and a classical blockchain to settle disputes and to keep track of the valid serial numbers.
arXiv Detail & Related papers (2020-02-27T09:40:18Z)
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.