Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Pioneering Developments in Computer Science & Digital Technologies (IC2SDT)

Byzantine Resilient Multi Criteria Leader Election in Quantum Communication Networks Using VIKOR

Suresh Kumar Jha, Ketan Anand, Aditya Narayan Hati

Published Dec 4, 2025• 1 citation
Publisher

Abstract

In developing quantum-classical network infrastructures, where coordination, entanglement distribution, and time-sensitive control rely on a stable and reliable coordinator, reliable leader election is crucial. In this work, we present VIKOR-BFT, a leader election scheme that integrates a lightweight data-sanitization stage with the VIKOR multi-criteria ranking mechanism to improve resilience against Byzantine behaviour. To understand its practical behaviour, we developed a Python-based prototype and evaluated the protocol under a range of adversarial and high-load scenarios. The study indicates that VIKOR-BFT keeps latency growth moderate even as the network scales and sustains throughput values above 100 tx/s in networks of roughly 500 nodes. In comparison with PBFT and an optimized PBFT variant, the proposed method reduces message complexity by almost two orders of magnitude without compromising the correctness of leader selection. Under 15% and 25% Byzantine participation, the protocol continues to select an honest leader in more than 90% and 75% of the trials, respectively. Overall, the findings suggest that VIKOR-BFT provides a scalable and practically viable option for secure leader election in hybrid quantum-classical communication environments.

DOI
10.1109/ic2sdt68218.2025.11383779

Related papers

W-State Leader Election for PBFT Based Quantum Leader Election

Juan Pablo Robledo Meza, Jelena Mišić, Vojislav B. Mišić

We propose a quantum leader election protocol for high-traffic permissioned blockchains, leveraging multipartite$W$-states combined with a CSMA/CA-style INTENT/ACK handshake. Our design distributes a full W-state locally to each validator, enabling collision detection through single-qubit measurement and ensuring fairness without requiring global entanglement distribution. We formalize three approaches to improve performance, Exponential Backoff, Fixed$W$-state, and Closing Window, respectively, and analyze their expected termination times, showing that the Closing Window variant provides the best convergence behavior. Using Qiskit simulations, we evaluate correctness and demonstrate that$W$-state-based election integrates naturally with PBFT-style consensus layers.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•1 citation

Hyper-Reliable Distributed Consensus in MDI-QKD Trusted Node Networks Through Dynamic Multi-Metric Fusion

Freederia AI Researcher

**Abstract:** This paper introduces a novel approach to achieving robust and high-throughput distributed consensus within MDI-QKD trusted node networks. Existing consensus protocols struggle to maintain performance under varying node reliability and network latency. We propose a Dynamic Multi-Metric Fusion (DMMF) protocol that combines traditional Byzantine Fault Tolerance (BFT) with a layered evaluation pipeline, incorporating logical consistency checks, code and formula verification, novel output analysis, and dynamic impact forecasting based on historical performance. This allows for adaptive weighting of node contributions based on real-time trustworthiness assessments, significantly enhancing network resilience and throughput compared to static BFT implementations. The system offers an immediate pathway to commercial deployment, bolstering the security and scalability of quantum key distribution networks.

•Nov 23, 2025•0 citations

Counterfactual Quantum Byzantine Consensus for Human-Centric Metaverse

Saw Nang Paing, Jason William Setiawan, Muhammad Asad Ullah +4 more

Quantum Byzantine fault tolerance (BFT) consensus is a secure and reliable mechanism that enables network nodes to reach an agreement even in the presence of faulty nodes, by using distributed private correlated lists. It plays a crucial role in developing the blockchain-based Metaverse to ensure its integrity and security. In this paper, we propose a counterfactual quantum BFT (CQ-BFT) protocol for a multipartite network using counterfactual unitary telecomputation with the chained quantum Zeno gates. This consensus protocol achieves an agreement among the parties without the passage of any physical particles through the quantum channel. Due to the unique properties of counterfactual communication, we demonstrate that the CQ-BFT protocol can operate in the absence of a shared phase reference and provide a quantum layer of security and robustness against dephasing noise, fulfilling the stringent requirements of blockchain technology. In addition, we analyze the performance tradeoff of the CQ-BFT protocol in terms of the three pillars of blockchain—i.e., security, scalability, and decentralization. The human-centric Metaverse could leverage high degrees of security, noise resilience, and fault tolerance of the CQ-BFT protocol to enhance its underlying network infrastructure. This protocol leads to more robust and immersive virtual environments that prioritize the needs and experiences of Metaverse users.

IEEE Journal on Selected Areas in Communications•Dec 21, 2023•20 citations

An Information-theoretical Secured Byzantine-fault Tolerance Consensus in Quantum Key Distribution Network

Yi Luo, Haokun Mao, Qiong Li

Quantum key distribution (QKD) networks is expected to provide information-theoretical secured (ITS) communication over long distances. QKD networks based trusted relay architecture are now the most widely used scheme in practice. However, it is an unrealistic assumption that all relays are fully trustable in complex networks. In the past, only a few studies have theoretically analyzed the case of passive eavesdropping attack by dishonest relays and corresponding defense method. However, we have found that active attacks by dishonest relays can be more threatening. With the consideration of passive and active attacks, we treat dishonest relays as Byzantine nodes and analyzes the upper limit of Byzantine nodes that the QKD network can accommodate. In this paper, we propose an ITS Byzantine-fault tolerance (BFT) QKD network scheme to achieve end-to-end key distribution based on point-to-point QKD links. To ensure consistency and provide BFT ability in the QKD network, we design an ITSBFT-consensus protocol for this network scheme. To ensure the information-theoretic security of consensus, we design a temporary signature scheme based on point-to-point QKD link keys. To prevent Byzantine nodes from disrupting the execution process of key distribution, we design an end-to-end key distribution scheme combined with consensus. We theoretically analyze proposed ITSBFT-QKD network scheme from four aspects: QKD key distribution security, temporary signature security, consensus security, and leader election fairness. The simulation result proved the feasibility and demonstrate the performance.

arXiv:2204.09832•Apr 21, 2022•0 citations

QRaft: Quantum-Enhanced Raft Protocol Using QRNG and QKD for Secure Distributed Consensus

Youssif Khalid Mahmoud Attia

This paper introduces a quantum-enhanced variant of the Raft consensus protocol by integrating Quantum Random Number Generators (QRNG) and Quantum Key Distribution (QKD) to improve both timing election accuracy and inter-node communication security. The proposed model optimizes leader election by utilizing quantum-generated entropy, eliminating predictability and delays caused by pseudo-random behaviors. Furthermore, QKD enables secure, tamper-resistant communication between nodes, strengthening the protocol’s resilience against classical and quantum-level attacks. Experimental analysis and theoretical comparisons highlight the efficiency and security advantages over the classical Raft. This contribution demonstrates the potential of quantum technologies in modernizing distributed consensus mechanisms.

Novel Intelligent and Leading Emerging Sciences Conference (NILES)•Oct 25, 2025•0 citations

Secure Byzantine Fault Tolerance Mechanisms for Quantum Computing

Monika Anand, Pramod Kumar, Rakeshnag Dasari +3 more

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.

OPJU International Technology Conference on Smart Computing for Innovation and Advancement in Industry (OTCON)•Apr 9, 2025•1 citation
In developing quantum-classical network infrastructures, where coordination, entanglement distribution, and time-sensitive control rely on a stable and reliable coordinator, reliable leader election is crucial. In this work, we present VIKOR-BFT, a leader election scheme that integrates a lightweight data-sanitization stage with the VIKOR multi-criteria ranking mechanism to improve resilience against Byzantine behaviour. To understand its practical behaviour, we developed a Python-based prototype and evaluated the protocol under a range of adversarial and high-load scenarios. The study indicates that VIKOR-BFT keeps latency growth moderate even as the network scales and sustains throughput values above 100 tx/s in networks of roughly 500 nodes. In comparison with PBFT and an optimized PBFT variant, the proposed method reduces message complexity by almost two orders of magnitude without compromising the correctness of leader selection. Under 15% and 25% Byzantine participation, the protocol continues to select an honest leader in more than 90% and 75% of the trials, respectively. Overall, the findings suggest that VIKOR-BFT provides a scalable and practically viable option for secure leader election in hybrid quantum-classical communication environments.
We propose a quantum leader election protocol for high-traffic permissioned blockchains, leveraging multipartiteWWW-states combined with a CSMA/CA-style INTENT/ACK handshake. Our design distributes a full W-state locally to each validator, enabling collision detection through single-qubit measurement and ensuring fairness without requiring global entanglement distribution. We formalize three approaches to improve performance, Exponential Backoff, FixedWWW-state, and Closing Window, respectively, and analyze their expected termination times, showing that the Closing Window variant provides the best convergence behavior. Using Qiskit simulations, we evaluate correctness and demonstrate thatWWW-state-based election integrates naturally with PBFT-style consensus layers.
**Abstract:** This paper introduces a novel approach to achieving robust and high-throughput distributed consensus within MDI-QKD trusted node networks. Existing consensus protocols struggle to maintain performance under varying node reliability and network latency. We propose a Dynamic Multi-Metric Fusion (DMMF) protocol that combines traditional Byzantine Fault Tolerance (BFT) with a layered evaluation pipeline, incorporating logical consistency checks, code and formula verification, novel output analysis, and dynamic impact forecasting based on historical performance. This allows for adaptive weighting of node contributions based on real-time trustworthiness assessments, significantly enhancing network resilience and throughput compared to static BFT implementations. The system offers an immediate pathway to commercial deployment, bolstering the security and scalability of quantum key distribution networks.
Quantum Byzantine fault tolerance (BFT) consensus is a secure and reliable mechanism that enables network nodes to reach an agreement even in the presence of faulty nodes, by using distributed private correlated lists. It plays a crucial role in developing the blockchain-based Metaverse to ensure its integrity and security. In this paper, we propose a counterfactual quantum BFT (CQ-BFT) protocol for a multipartite network using counterfactual unitary telecomputation with the chained quantum Zeno gates. This consensus protocol achieves an agreement among the parties without the passage of any physical particles through the quantum channel. Due to the unique properties of counterfactual communication, we demonstrate that the CQ-BFT protocol can operate in the absence of a shared phase reference and provide a quantum layer of security and robustness against dephasing noise, fulfilling the stringent requirements of blockchain technology. In addition, we analyze the performance tradeoff of the CQ-BFT protocol in terms of the three pillars of blockchain—i.e., security, scalability, and decentralization. The human-centric Metaverse could leverage high degrees of security, noise resilience, and fault tolerance of the CQ-BFT protocol to enhance its underlying network infrastructure. This protocol leads to more robust and immersive virtual environments that prioritize the needs and experiences of Metaverse users.
Quantum key distribution (QKD) networks is expected to provide information-theoretical secured (ITS) communication over long distances. QKD networks based trusted relay architecture are now the most widely used scheme in practice. However, it is an unrealistic assumption that all relays are fully trustable in complex networks. In the past, only a few studies have theoretically analyzed the case of passive eavesdropping attack by dishonest relays and corresponding defense method. However, we have found that active attacks by dishonest relays can be more threatening. With the consideration of passive and active attacks, we treat dishonest relays as Byzantine nodes and analyzes the upper limit of Byzantine nodes that the QKD network can accommodate. In this paper, we propose an ITS Byzantine-fault tolerance (BFT) QKD network scheme to achieve end-to-end key distribution based on point-to-point QKD links. To ensure consistency and provide BFT ability in the QKD network, we design an ITSBFT-consensus protocol for this network scheme. To ensure the information-theoretic security of consensus, we design a temporary signature scheme based on point-to-point QKD link keys. To prevent Byzantine nodes from disrupting the execution process of key distribution, we design an end-to-end key distribution scheme combined with consensus. We theoretically analyze proposed ITSBFT-QKD network scheme from four aspects: QKD key distribution security, temporary signature security, consensus security, and leader election fairness. The simulation result proved the feasibility and demonstrate the performance.
This paper introduces a quantum-enhanced variant of the Raft consensus protocol by integrating Quantum Random Number Generators (QRNG) and Quantum Key Distribution (QKD) to improve both timing election accuracy and inter-node communication security. The proposed model optimizes leader election by utilizing quantum-generated entropy, eliminating predictability and delays caused by pseudo-random behaviors. Furthermore, QKD enables secure, tamper-resistant communication between nodes, strengthening the protocol’s resilience against classical and quantum-level attacks. Experimental analysis and theoretical comparisons highlight the efficiency and security advantages over the classical Raft. This contribution demonstrates the potential of quantum technologies in modernizing distributed consensus mechanisms.
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.