Quantum-secured blockchain

INTRODUCTION

• Quantum computers threaten ECDSA and RSA signatures [5] via Shor’s algorithm [7] and speed hash inversion quadratically via Grover’s algorithm [8], enabling a 51-percent mining attack.Post-quantum signatures rely on unproven assumptions, are computationally intensive, and do not address mining-hashrate dominance.Source: INTRODUCTION · pp. 1–2
• The proposed platform combines signature-free Byzantine broadcast with QKD authentication and was experimentally implemented using an urban QKD network.The four-node, six-link setup used urban-fiber QKD to generate keys for two links; the remaining four links generated keys classically.Source: INTRODUCTION · pp. 2–3
• QKD supplies pairwise secret keys for authentication tags on classical messages, with a small shared seed key enabling authentication of later QKD sessions.The tags use information-theoretically secure Toeplitz hashing.Source: INTRODUCTION · p. 2
• The broadcast protocol reaches Byzantine agreement when fewer than n/3 parties are dishonest, reconciling transactions into identical blocks and removing forks.It tolerates some faulty nodes or communication channels; quantum channels are required only to generate private keys.Source: INTRODUCTION · p. 3
• Stored databases remain vulnerable to forged histories; the described attack requires compromising at least one-third of nodes, while longer hashes counter Grover’s quadratic speedup.The attack scenario alters a past transaction, searches for same-block transaction variants with the same hash, and substitutes the forged database.Source: INTRODUCTION · p. 3
• After two communication rounds, the broadcast protocol excluded node D’s double-spending transaction and formed a block containing only legitimate transactions.The test used three legitimate transactions and three inconsistent versions of a transaction from node D.Source: Figure 2 · p. 3, INTRODUCTION · p. 3

CONCLUSION AND OUTLOOK

• The protocol was experimentally tested using a three-party urban fiber QKD network in Moscow.It provides information-theoretically secure authentication over a network in which each pair of nodes is connected by a QKD link.Source: CONCLUSION AND OUTLOOK · p. 4
• Instead of assigning block creation to individual miners, the protocol uses information-theoretically secure broadcast so all nodes agree on new blocks on equal terms.Source: CONCLUSION AND OUTLOOK · p. 4
• The protocol is designed to maintain transaction transparency and integrity against quantum-algorithm attacks, and the authors say the results open possibilities for scalable quantum-safe blockchains.If realized, such a platform could limit economic and social risks from breakthroughs in quantum computation.Source: CONCLUSION AND OUTLOOK · p. 4
• Current QKD key-generation rates are described as sufficient for large-scale blockchain operation, while satellite QKD and quantum repeaters could support a worldwide QKD network and global-scale platforms.The passage refers to the prospective “quantum Internet”.Source: CONCLUSION AND OUTLOOK · p. 4
• A future quantum Internet would let members access the global QKD network from any station, authenticate to others with private seed keys, and enact transactions while preserving anonymity.Source: CONCLUSION AND OUTLOOK · p. 4
• Other research avenues include quantum multiparty consensus, QKD approaches, quantum digital signatures [41], more efficient quantum consensus algorithms [43], and quantum-channel studies.The passage notes experimental studies of these approaches, including metropolitan networks.Source: CONCLUSION AND OUTLOOK · p. 4

• A blockchain stores consecutive records in copies held by participating nodes, without a central controller; accepted consensus rules govern its construction and operation.Source: Appendix A · p. 4
• Transactions are signed records broadcast to maintaining nodes, and the public-key signature triplet verifies that the author identified by its public key possesses the corresponding secret key.Source: Appendix A · pp. 4–5
• Transactions are pooled and aggregated into periodically proposed blocks to address ordering and validity; proposers check transactions, link the prior block’s hash, meet network rules, and broadcast for node verification.Source: Appendix A · p. 4
• Near-simultaneous non-identical blocks can split miners temporarily; the longest-chain rule selects the winning branch, and block reliability grows with depth.Source: Appendix A · pp. 4–5
• Hashes map arbitrary-length strings to fixed-length outputs with unpredictable changes after input modification; Grover’s algorithm gives only quadratic speedup for inversion and collision problems.Source: Appendix A · p. 5

AUTHENTICATION

• QKD can generate the necessary-length private key, provided Alice and Bob begin with a small seed key to authenticate themselves.Source: AUTHENTICATION · p. 5
• When Bob’s recomputed hash tag matches Alice’s, he can be certain the message arrived from her.Alice generates the tag using their shared private key.Source: AUTHENTICATION · p. 5
• The protocol uses Toeplitz hashing for computational simplicity.It defines message length as lM and hash-tag length as lh.Source: AUTHENTICATION · p. 5
• TS is an lh × lM Toeplitz matrix generated from a string S of length lh + lM − 1; ri is an lh-bit string, and ⊕ denotes bitwise XOR.Both S and ri are private and taken from the shared key Kaut.Source: AUTHENTICATION · p. 5
• An eavesdropper’s probability of correctly guessing a modified message’s hash tag is at most 2^-lh.Source: AUTHENTICATION · p. 5
• For a message series, S can be reused without compromising security, but ri must be generated anew for each message.This consumes lh key bits per message.Source: AUTHENTICATION · p. 5
• In the experiment, the hash-tag length was lh = 40 and the message length was lM = 222.Source: AUTHENTICATION · p. 5

APPENDIX C. BROADCAST PROTOCOL AND BLOCK CONSTRUCTION

• With pairwise authenticated channels, nodes use Byzantine agreement to obtain a shared vector whose honest-node entries equal their private values.The protocol aims for all honest nodes to obtain the same interactive consistency vector despite up to m faulty nodes.Source: Appendix C · p. 5
• Communication begins with nodes transmitting their private values, then proceeds in rounds where they relay information received in the previous round.Lamport, Shostak and Pease proved the vector can be obtained in no more than m + 1 rounds for m < n/3.Source: Appendix C · p. 5
• Each node’s private value comprises its received transaction pool, its own transactions, and its admissibility opinions; the resulting vector enables honest nodes to build a block with all admissible transactions.The appendix identifies these values as the inputs for block construction.Source: Appendix C · pp. 5–6
• The original protocol becomes exponentially data-intensive when many nodes are cheating or unavailable, motivating further research on efficient consensus.The authors note classical blockchain networks face the same challenge and have learned to handle it efficiently.Source: Appendix C · p. 6

APPENDIX D. QKD NETWORK

• The experimental setup uses a modular QKD device [47] driven by an NI PCIe-7811R card, with a Spartan-6-controlled LDI-DFB2.5G semiconductor laser generating optical pulses.Source: Appendix D · p. 6