Export citation

Export citation

Choose format for download:

Download Citation
  • Access by Xinjiang University

Quantum Protocol for Electronic Voting without Election Authorities

Federico Centrone1,2,*, Eleni Diamanti1,†, and Iordanis Kerenidis2,‡

  • 1Sorbonne Université, CNRS, LIP6, 4 place Jussieu, Paris F-75005, France
  • 2Université de Paris, CNRS, IRIF, 8 Place Aurélie Nemours, Paris 75013, France

  • *fcentrone@icfo.net
  • eleni.diamanti@lip6.fr
  • jkeren@irif.fr

Phys. Rev. Applied 18, 014005 – Published 5 July, 2022

DOI: https://doi.org/10.1103/PhysRevApplied.18.014005

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.

Physics Subject Headings (PhySH)

Article Text

References (12)

  1. H. Bar-El, Why secure e-voting is so hard to get. Archived from Hagai Bar-El on Security on 2015-09-12.
  2. K. Thompson, Reflections on trusting trust, Commun. ACM 27, 761 (1984).
  3. A. L. Abba, M. Awad, Z. Al-Qudah, and A. H. Jallad, in 2017 International Conference on Electrical and Computing Technologies and Applications (ICECTA) (IEEE, 2017), p. 1.
  4. M. Arapinis, E. Kashefi, N. Lamprou, and A. Pappa, Definitions and analysis of quantum e-voting protocols, ACM Trans. Quantum Computing 2, 1 (2021).
  5. I. Chillotti, N. Gama, M. Georgieva, and M. Izabachène, in Post-Quantum Cryptography. PQCrypto 2016. Lecture Notes in Computer Science, Vol. 9606 (Springer, Cham, 2016), p. 245.
  6. A. Broadbent and A. Tapp, in Advances in Cryptology—ASIACRYPT 2007. Lecture Notes in Computer Science, Vol. 4833 (Springer Berlin Heidelberg, Berlin, Heidelberg, 2007), p. 410.
  7. A. Pappa, A. Chailloux, S. Wehner, E. Diamanti, and I. Kerenidis, Multipartite Entanglement Verification Resistant Against Dishonest Parties, Phys. Rev. Lett. 108, 260502 (2012).
  8. W. McCutcheon, A. Pappa, B. A. Bell, A. McMillan, A. Chailloux, T. Lawson, M. Mafu, D. Markham, E. Diamanti, I. Kerenidis, J. G. Rarity, and M. S. Tame, Experimental verification of multipartite entanglement in quantum networks, Nat. Commun. 7, 13251 (2016).
  9. R. Yehia, E. Diamanti, and I. Kerenidis, Composable security for multipartite entanglement verification, Phys. Rev. A 103, 052609 (2021).
  10. Q.-L. Wang, C.-H. Yu, F. Gao, H.-Y. Qi, and Q.-Y. Wen, Self-tallying quantum anonymous voting, Phys. Rev. A 94, 022333 (2016).
  11. A. Unnikrishnan, I. J. MacFarlane, R. Yi, E. Diamanti, D. Markham, and I. Kerenidis, Anonymity for Practical Quantum Networks, Phys. Rev. Lett. 122, 240501 (2019).
  12. B. Chevallier-Mames, P.-A. Fouque, D. Pointcheval, J. Stern, and J. Traoré, in Towards Trustworthy Elections, Lecture Notes in Computer Science, Vol. 6000 (Springer Berlin Heidelberg, Berlin, Heidelberg, 2010), p. 191.

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation