QUANT-PHCRApr 2, 2013

Distributed quantum election scheme

arXiv:1304.0555v36 citations
Originality Incremental advance
AI Analysis

This addresses privacy concerns in electronic voting systems for secure elections, though it appears incremental as it builds on existing distributed schemes.

The paper tackles the problem of post-election ballot privacy in distributed electronic voting by presenting a distributed quantum election scheme that prevents voting administrators and counters from collaborating to trace ballots, and it can operate in lossy and noisy quantum channels.

In an electronic voting protocol, a distributed scheme can be used for forbidding the malicious acts of the voting administrator and the counter during the election, but it cannot prevent them from collaborating to trace the ballots and destroy their privacy after the election. We present a distributed anonymous quantum key distribution scheme and further construct a distributed quantum election scheme with a voting administrator made up of more than one part. This quantum election scheme can resist the malicious acts of the voting administrator and the counter after the election and can work in a system with lossy and noisy quantum channels.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes