# Quantum anonymous voting with anonymity check

**Authors:** Dmitri Horoshko, Sergei Kilin

arXiv: 0911.5605 · 2014-09-24

## TL;DR

This paper introduces a quantum anonymous voting protocol that ensures unconditional voter privacy and allows voters to verify the anonymity of the process through entanglement checks, preventing cheating by the tallyman.

## Contribution

It presents a novel quantum voting protocol where ballots are returned for verification, enhancing security and transparency over previous methods.

## Key findings

- The protocol guarantees unconditional voter privacy.
- Cheating attempts by the tallyman can be detected through entanglement destruction.
- Voters can verify the integrity of the vote counting process.

## Abstract

We propose a new protocol for quantum anonymous voting having serious advantages over the existing protocols: it protects both the voters from a curious tallyman and all the participants from a dishonest voter in unconditional way. The central idea of the protocol is that the ballots are given back to the voters after the voting process, which gives a possibility for two voters to check the anonymity of the vote counting process by preparing a special entangled state of two ballots. Any attempt of cheating from the side of the tallyman results in destroying the entanglement, which can be detected by the voters.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/0911.5605/full.md

## References

9 references — full list in the complete paper: https://tomesphere.com/paper/0911.5605/full.md

---
Source: https://tomesphere.com/paper/0911.5605