Quantum protocol for electronic voting without election authorities

• URL: http://arxiv.org/abs/2107.14719v2
• Date: Mon, 18 Jul 2022 12:56:37 GMT
• Title: Quantum protocol for electronic voting without election authorities
• Authors: Federico Centrone, Eleni Diamanti and Iordanis Kerenidis
• Abstract summary: We present a quantum protocol that exploits an untrusted source of multipartite entanglement to carry out an election without relying on election authorities, simultaneous broadcasting or computational assumptions, and whose result is publicly verifiable. The level of security depends directly on the fidelity of the shared multipartite entangled quantum state, and the protocol can be readily implemented for a few voters with state-of-the-art photonic technology.
• Score: 3.4806267677524896
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Electronic voting is a very useful but challenging internet-based protocol that despite many theoretical approaches and various implementations with different degrees of success, remains a contentious topic due to issues in reliability and security. Here we present a quantum protocol that exploits an untrusted source of multipartite entanglement to carry out an election without relying on election authorities, simultaneous broadcasting or computational assumptions, and whose result is publicly verifiable. The level of security depends directly on the fidelity of the shared multipartite entangled quantum state, and the protocol can be readily implemented for a few voters with state-of-the-art photonic technology.

Related papers

• Experimental Quantum Electronic Voting [0.27998963147546146]
  We present an information-theoretically secure and efficient electronic voting protocol that does not rely on election authorities.<n>Our experiment is based on a high-performance source of Greenberger-Horne-Zeilinger (GHZ) states.<n>The protocol is well-suited for secure board-level elections within organizations or small-scale governmental contexts.
  arXiv  Detail & Related papers  (2025-12-03T16:21:32Z)
• Experimental quantum voting using photonic GHZ states [0.0]
  Quantum communication protocols seek to leverage the unique properties of quantum systems for coordination or communication tasks.<n>We experimentally implement a recently proposed election protocol, where no one, including a potential central authority, can know the preferred candidate of any voter other than themself.<n>We conduct a four-party election, generating and distributing four-partite GHZ states with $approx 89%$ fidelity and successfully recording voters' intentions.
  arXiv  Detail & Related papers  (2025-12-03T10:47:21Z)
• Quantum Voting Protocol for Centralized and Distributed Voting Based on Phase-Flip Counting [0.0]
  We introduce a novel quantum voting protocol that leverages quantum superposition and entanglement to achieve secure, anonymous voting.<n>Our approach utilizes phase-flip encoding on entangled candidate states, where votes are recorded as controlled phase operations conditioned on voter identity registers.<n>The protocol ensures voter anonymity through quantum superposition, prevents double-voting through entanglement mechanisms, and can offer speedup potential for large-scale elections.
  arXiv  Detail & Related papers  (2025-10-17T02:14:54Z)
• A Quantum-Secure Voting Framework Using QKD, Dual-Key Symmetric Encryption, and Verifiable Receipts [0.4511923587827302]
  We introduce a quantum-secure voting framework that integrates Quantum Key Distribution (QKD), Dual-Key Symmetric Encryption, and verifiable receipt mechanisms.<n>The framework enables voters to establish encryption keys securely, cast encrypted ballots, and verify their votes through receipt-based confirmation.<n>Results demonstrate that the system can process large numbers of votes efficiently with low latency and minimal error rates.
  arXiv  Detail & Related papers  (2025-10-03T20:13:30Z)
• Quantum Internet in a Nutshell -- Advancing Quantum Communication with Ion Traps [25.519081784735068]
  We study the incorporation of small quantum error correction codes into quantum communication protocols.<n>We find that these codes can help to suppress the noise level and to monitor the noise profile of the channel.
  arXiv  Detail & Related papers  (2025-07-18T22:07:54Z)
• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• Towards efficient and secure quantum-classical communication networks [47.27205216718476]
  There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC) We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
  arXiv  Detail & Related papers  (2024-11-01T23:36:19Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party. We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Quantum voting machine encoded with microwave photons [14.028819697729048]
  We propose a simple quantum voting machine using microwave photon qubit encoding. The voting outcome is solely tied to the total number of affirmative votes. Quantum voting machine can be implemented as long as the multi-control single-phase quantum phase gate is realized in other physical systems.
  arXiv  Detail & Related papers  (2024-06-27T13:40:17Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
  Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing. We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
  arXiv  Detail & Related papers  (2023-11-23T12:40:47Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Semi-device independent nonlocality certification for near-term quantum networks [46.37108901286964]
  Bell tests are the most rigorous method for verifying entanglement in quantum networks. If there is any signaling between the parties, then the violation of Bell inequalities can no longer be used. We propose a semi-device independent protocol that allows us to numerically correct for effects of correlations in experimental probability distributions.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state [1.2094859111770522]
  In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.
  arXiv  Detail & Related papers  (2022-07-11T15:17:58Z)
• Efficient Quantum Voting with Information-Theoretic Security [0.0]
  We show that the use of quantum networks can enable information-theoretic security for the desirable aspects of a distributed voting scheme. In our approach, ballot information is encoded in quantum states that enable an exponential reduction in communication complexity.
  arXiv  Detail & Related papers  (2021-12-28T18:10:44Z)
• Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds [0.0]
  Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks. We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
  arXiv  Detail & Related papers  (2021-02-25T15:58:09Z)
• Client-Server Identification Protocols with Quantum PUF [1.4174475093445233]
  We propose two identification protocols based on the emerging hardware secure solutions, the quantum Physical Unclonable Functions (qPUFs) The first protocol allows a low-resource party to prove its identity to a high-resource party and in the second protocol, it is vice-versa. Unlike existing identification protocols based on Quantum Read-out PUFs which rely on the security against a specific family of attacks, our protocols provide provable exponential security against any Quantum Polynomial-Time adversary with resource-efficient parties.
  arXiv  Detail & Related papers  (2020-06-08T12:35:09Z)
• Genuine Network Multipartite Entanglement [62.997667081978825]
  We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$. We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
  arXiv  Detail & Related papers  (2020-02-07T13:26:00Z)
• Experimental quantum conference key agreement [55.41644538483948]
  Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement. We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre.
  arXiv  Detail & Related papers  (2020-02-04T19:00:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.