Source-linked AI summary
Quantum-secured blockchain
E. O. Kiktenko, N. O. Pozhar, M. N. Anufriev, A. S. Trushechkin, R. R. Yunusov, Y. V. Kurochkin, A. I. Lvovsky, A. K. Fedorov
TL;DR
Current blockchains depend on digital signatures and hash-based mechanisms that quantum computers can attack. The paper combines QKD authentication with a signature-free broadcast protocol and experimentally realizes it over an urban fiber network, reporting a quantum-safe blockchain design with prospects for scalable deployment.
Problem
Quantum computers threaten blockchain digital signatures and can gain a mining advantage through faster hash searches, while post-quantum signatures retain unproven assumptions and do not address mining domination.
Method
The platform combines signature-free BFT broadcast for block agreement with QKD-derived, information-theoretically secure authentication over a two-layer network.
Results
The authors experimentally tested the protocol using an urban fiber QKD network and a three-party urban fiber network QKD in Moscow.
Takeaways & Limitations
The protocol maintains transaction transparency and integrity against quantum-algorithm attacks and opens possibilities for scalable quantum-safe blockchain platforms.
Takeaways & Limitations
Stored databases remain somewhat vulnerable to offline Grover-based forgery, although longer block hashes and compromising at least one-third of nodes constrain the attack.
Abstract
from arXiv · showhide
Blockchain is a distributed database which is cryptographically protected against malicious modifications. While promising for a wide range of applications, current blockchain platforms rely on digital signatures, which are vulnerable to attacks by means of quantum computers. The same, albeit to a lesser extent, applies to cryptographic hash functions that are used in preparing new blocks, so parties with access to quantum computation would have unfair advantage in procuring mining rewards. Here we propose a possible solution to the quantum era blockchain challenge and report an experimental realization of a quantum-safe blockchain platform that utilizes quantum key distribution across an urban fiber network for information-theoretically secure authentication. These results address important questions about realizability and scalability of quantum-safe blockchains for commercial and governmental applications.
INTRODUCTION
Blockchains provide decentralized, transparent, tamper-resistant record keeping, but their reliance on computational assumptions exposes digital signatures and hashing to quantum attacks. The paper proposes combining a signature-free broadcast protocol with QKD authentication and demonstrates the approach experimentally.
- Blockchain foundations: Blockchains use linked blocks, cryptographic hashes, and digital signatures to maintain transparent, tamper-resistant transaction records.Changing a block changes its hash and requires subsequent blocks to be modified.
- Quantum threats: Quantum computers threaten blockchain security because Shor’s algorithm can efficiently solve the mathematical problems underlying ECDSA and RSA signatures.These signatures rely on computationally hard factorization or discrete-logarithm problems.
- Quantum threats: Grover’s algorithm could provide a quadratic speedup for inverse-hash searches, enabling a 51-percent attack that monopolizes block mining.Such an attack could sabotage other transactions or prevent attackers’ own spending transactions from being recorded.
- Limits of existing defenses: Post-quantum signatures may protect transaction signing, but they rely on unproven assumptions, impose computational costs, and do not prevent quantum domination of mining hashrate.The paper identifies this as an incomplete solution to the broader quantum-era blockchain challenge.
- Proposed direction: The proposed platform combines signature-free BFT broadcast with QKD-based authentication and experimentally demonstrates the scheme in an urban QKD network.QKD supplies information-theoretically secure authentication, while a small pre-shared seed key supports authentication in subsequent sessions.
QUANTUM-SECURED BLOCKCHAIN
The protocol replaces miner-led block creation with decentralized Byzantine agreement and uses a two-layer QKD/classical network for information-theoretically secure authentication. Experiments show that inconsistent transactions can be excluded while legitimate transactions form the block, although stored databases remain somewhat vulnerable.
- Network architecture: The two-layer network uses pairwise QKD channels to establish private keys and classical messages authenticated with Toeplitz-hash tags.Quantum channels generate keys; the data-intensive broadcast communication remains on the classical layer.
- Block formation: Transactions are aggregated into blocks without classical digital signatures or individual miners, removing two attack surfaces associated with quantum computers.The design addresses fabricated transactions and disproportionately fast quantum mining.
- Block formation: The broadcast protocol reaches Byzantine agreement when fewer than n/3 parties are dishonest, allowing decentralized block formation on equal terms.All nodes participate in agreeing on a new block rather than concentrating block development in individual miners.
- Security boundary: The protocol protects transaction distribution and block formation against quantum attacks, but stored databases remain somewhat vulnerable to offline forgery attacks.The paper states that increasing block-hash length to about the square of its safe non-quantum value can address the quadratic Grover speedup.
- Experimental demonstration: The experiment uses a four-node, six-link network, with QKD-generated authentication keys on two links and classical key generation on the remaining four.The implementation uses an urban fiber QKD network.
- Experimental demonstration: After the second communication round, the protocol removes node D’s double-spending transaction and forms a block containing only legitimate transactions.Nodes A, B, and C submit consistent transactions, while node D sends different versions to different parties.
CONCLUSION AND OUTLOOK
The work develops and experimentally tests a quantum-safe blockchain using QKD-based information-theoretic authentication and a broadcast protocol for equal-term block agreement. The authors report scalability prospects for large-scale and potentially global platforms, while identifying related quantum-network technologies as alternative directions.
- CONCLUSION AND OUTLOOK: The protocol was experimentally tested on a three-party urban fibre-network QKD system in Moscow.
- CONCLUSION AND OUTLOOK: The protocol combines QKD-based information-theoretic authentication with a broadcast protocol that replaces miner-centered block creation with equal-term node agreement.All nodes participate in reaching agreement about new blocks rather than concentrating block development in individual miners.
- CONCLUSION AND OUTLOOK: The authors state that the protocol maintains transaction transparency and integrity against attacks using quantum algorithms.
- CONCLUSION AND OUTLOOK: Typical current QKD key-generation rates are reported as sufficient for operating large-scale blockchain platforms based on the protocol.
- CONCLUSION AND OUTLOOK: A future quantum Internet could extend the platforms to global scale, while quantum multiparty consensus, other QKD approaches, and quantum digital signatures remain alternative directions.
APPENDIX A. BLOCKCHAIN WORKFLOW
This appendix defines conventional blockchain components and describes how transactions become blocks through distributed storage, consensus rules, validation, linking, and fork resolution. It also introduces digital signatures and cryptographic hashes as core security mechanisms.
- Definitions: A blockchain is a distributed database whose consecutive blocks are copied across participating nodes without a single control center.
- Definitions: Distributed consensus consists of rules governing blockchain construction and operation that are accepted by the maintaining nodes.
- Transactions: Transactions record transfers or other elementary events, are digitally signed, and are sent to all nodes maintaining the blockchain.
- Blocks: Blocks aggregate new transactions at regular intervals because network latency makes immediate agreement on transaction order and validity difficult.
- Blocks: Block creation involves validating transactions, combining them with the previous block’s hash, satisfying network rules, and broadcasting the result for verification.
- Forks: Forks temporarily divide the community, after which the longest-chain rule selects a branch whose reliability increases with depth.
- Cryptographic mechanisms: Grover’s algorithm provides only a quadratic speedup for inverting hash functions and finding collisions.
- Cryptographic mechanisms: Digital signatures verify message authorship using secret and public keys, while cryptographic hashes map arbitrary-length strings to fixed-length, unpredictable outputs.
APPENDIX B. INFORMATION-THEORETICALLY SECURE AUTHENTICATION
The authentication appendix describes message authentication using shared QKD-derived private keys and Toeplitz hashing. It specifies the hash-tag construction, its forgery bound, and the key-consumption rate used in the experiment.
- Authentication: QKD can generate the shared private key needed for authentication after a small seed key authenticates the initial session.
- Authentication: A recipient authenticates a message by recomputing its hash tag and accepting it when the computed and received tags coincide.
- Toeplitz hashing: The protocol uses Toeplitz hashing, where the tag combines a Toeplitz matrix, the message, and a fresh bit string through bitwise XOR.
- Toeplitz hashing: The probability that an eavesdropper correctly guesses a modified message’s tag is at most 2^-lh.
- Key consumption: The matrix-generating string can be reused, while a fresh ri consumes lh key bits per message; the experiment used lh = 40 and lM = 222.
APPENDIX C. BROADCAST PROTOCOL AND BLOCK CONSTRUCTION
The broadcast protocol reaches Byzantine agreement by exchanging node values over authenticated pairwise channels and constructing a common consistency vector. In the blockchain implementation, these values represent transaction pools and admissibility opinions used to create blocks.
- Protocol setup: The protocol operates among n nodes with pairwise authenticated channels, each holding a private value Vi.
- Byzantine agreement: Its goal is for honest nodes to obtain the same n-dimensional consistency vector while preserving each honest node’s private value in the corresponding component.
- Communication rounds: Nodes first transmit their values and then relay information received in prior rounds to construct the consistency vector.
- Byzantine agreement: Lamport, Shostak, and Pease proved that the consistency vector can be obtained in at most m + 1 rounds when m < n/3.
- Block construction: In this blockchain, each Vi contains a node’s transaction pool and its opinions on transaction admissibility.
- Block construction: After obtaining the consistency vector, honest nodes create a block containing the complete set of admissible pooled transactions.
- Limitation: The original protocol becomes exponentially data-intensive when many nodes are cheating or nonoperational, motivating further work on efficient consensus.
APPENDIX D. QKD NETWORK
The experimental QKD network is based on a modular device driven by dedicated FPGA-controlled hardware.
- QKD network: The experiment uses a recently developed modular QKD device.The device is driven by a National Instruments NI PCIe-7811R card.
- QKD network: An FPGA board controls a semiconductor laser to generate optical pulses.The setup uses an LDI-DFB2.5G semiconductor laser controlled by a Spartan-6 FPGA board.
- QKD network: The hardware implementation is built around a National Instruments NI PCIe-7811R card and Spartan-6 FPGA board.