Experimental demonstration of a two-voter quantum anonymous voting prototype with continuous variables

Le résumé fourni par la source

Classical electronic voting is increasingly being adopted for Internet-based elections, requiring system designs that ensure fairness, legitimacy, verifiability, and voter anonymity-thereby preserving ballot confidentiality, uniqueness, and integrity. Quantum voting can provide information-theoretic security against repudiation and forgery in such systems. However, compared to classical voting protocols, current quantum voting protocols often suffer from limited efficiency, high cost, and implementation complexity. Here, we introduce a streamlined and efficient quantum voting architecture that simplifies the process by eliminating the privacy amplification step in the voting phase while incorporating authority-assisted anonymity, while maintaining full voter authentication, voting, and tallying capabilities. In an experimental demonstration of a quantum voting network, two voters achieved authentication rates of 336 and 406 times per second over 50 km of single-mode fiber, and signed voting files of 25.02 kbit and 56.29 kbit at a quantum signing rate of 966 times per second, resulting in total voting rates of 244 and 279 times per second, respectively. This work represents the first experimental implementation of a continuous-variable (CV)-based quantum anonymous voting prototype. The architecture is designed to be compatible with existing coherent optical communication networks and provides a practical quantum-enhanced building block toward future voting systems.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.