Quantum election scheme based on anonymous quantum key distribution
Rui-Rui Zhou, Li Yang

TL;DR
This paper introduces a secure quantum election protocol utilizing anonymous quantum key distribution with conjugate coding, ensuring privacy, fairness, and verifiability even with channel errors, without relying on entanglement.
Contribution
It presents a novel quantum election scheme that does not require entanglement and guarantees security properties under realistic quantum channel conditions.
Findings
Ensures privacy, fairness, and verifiability in large-scale elections.
Operates securely despite quantum channel loss and errors.
Does not depend on entanglement, simplifying implementation.
Abstract
An unconditionally secure authority-certified anonymous quantum key distribution scheme using conjugate coding is presented, base on which we construct a quantum election scheme without the help of entanglement state. We show that this election scheme ensures the completeness, soundness, privacy, eligibility, unreusability, fairness and verifiability of a large-scale election in which the administrator and counter are semi-honest. This election scheme can work even if there exist loss and errors in quantum channels. In addition, any irregularity in this scheme is sensible.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
