TY - GEN
T1 - Quantum Multi-Party Computation (QMPC) for Enhanced Blockchain Consensus
AU - Chong, Hsiau Chuen
AU - Law, K. L.Eddie
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - Fault-tolerant quantum computers threaten blockchains at both the signature layer (e.g., ECDSA) and the consensus layer (e.g., Grover-accelerated hash puzzles). Most 'post-quantum' proposals replace vulnerable primitives with Post Quantum Cryptography (PQC), leaving the consensus logic itself classical and quantum-accelerable. We present a quantumnative consensus protocol that uses multipartite entanglement to enforce core security properties at the level of physics. A post-quantum digital signature scheme is assumed only as a thin authentication layer for classical messages; the main logic resides in a Quantum Multi-Party Computation (QMPC) layer. Using distributed GHZ states and a sum-of-columns construction, nodes generate an information-theoretically secure random beacon and deterministically elect a round leader, after passing disturbance checks that detect tampering with high confidence. The beacon supports a standard BFT-style commit phase, yielding agreement, validity, and termination against a Quantum Polynomial Time (QPT) adversary corrupting fewer than one-third of the nodes. Quantum-circuit simulations of intercept-resend attacks validate the disturbance-detection mechanism and corroborate our theoretical analysis.
AB - Fault-tolerant quantum computers threaten blockchains at both the signature layer (e.g., ECDSA) and the consensus layer (e.g., Grover-accelerated hash puzzles). Most 'post-quantum' proposals replace vulnerable primitives with Post Quantum Cryptography (PQC), leaving the consensus logic itself classical and quantum-accelerable. We present a quantumnative consensus protocol that uses multipartite entanglement to enforce core security properties at the level of physics. A post-quantum digital signature scheme is assumed only as a thin authentication layer for classical messages; the main logic resides in a Quantum Multi-Party Computation (QMPC) layer. Using distributed GHZ states and a sum-of-columns construction, nodes generate an information-theoretically secure random beacon and deterministically elect a round leader, after passing disturbance checks that detect tampering with high confidence. The beacon supports a standard BFT-style commit phase, yielding agreement, validity, and termination against a Quantum Polynomial Time (QPT) adversary corrupting fewer than one-third of the nodes. Quantum-circuit simulations of intercept-resend attacks validate the disturbance-detection mechanism and corroborate our theoretical analysis.
KW - Blockchain Consensus
KW - PostQuantum Cryptography (PQC)
KW - Quantum Multi-Party Computation (QMPC)
KW - Quantum Security
KW - Random Beacon
UR - https://www.scopus.com/pages/publications/105040810930
U2 - 10.1109/QCNC69040.2026.00138
DO - 10.1109/QCNC69040.2026.00138
M3 - Conference contribution
AN - SCOPUS:105040810930
T3 - Proceedings - 2026 International Conference on Quantum Communications, Networking, and Computing, QCNC 2026
SP - 840
EP - 844
BT - Proceedings - 2026 International Conference on Quantum Communications, Networking, and Computing, QCNC 2026
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd International Conference on Quantum Communications, Networking, and Computing, QCNC 2026
Y2 - 6 April 2026 through 8 April 2026
ER -