Secure Byzantine Fault Tolerance Mechanisms for Quantum Computing
Monika Anand, Pramod Kumar, Rakeshnag Dasari, Swaroop Reddy Gayam, İsa Bayhan, Mahendran N · 2025
Quantum computing in consumer applications strengthens blockchain consensus mechanisms against quantum threats. An innovative quantum-safe Byzantine Fault Tolerance (BFT) consensus technique strengthens consumer-oriented blockchain applications. This new method effortlessly integrates Quantum Key Distribution (QKD) networks to overcome public key digital signature weaknesses, boosting security. Using a unique blend of QKD and a multilinear hash function family, the suggested technique creates Multilinear Hash Unconditionally Secure Signature (MHUSS). Signatures generated by MHUSS are tamper-proof, irrefutable, and transferable. This powerful solution may be installed on existing consumer devices to add security. QSBFT addresses the consensus speed issues of older Byzantine Fault Tolerance approaches like PBFT. This approach benefits consumer apps that need fast, secure transactions. Adding a 'rapid G standard' dual consensus option and allowing nodes to vote on empty blocks reduces system communication frequency, simplifying consensus. Quantum-resistant framework improves security, system responsiveness, messaging, and consensus mechanism efficiency. This new framework provides higher throughput and latency, especially in consumer-centric scenarios, according to performance simulations and tests. This development in quantum-resistant blockchain technology for consumer application is considerable compared to the upgraded PBFT mechanism based on MHUSS. Security and efficiency are balanced, ensuring resilience as quantum computing capabilities evolve.