Experimental Quantum Solution to the Dining Cryptographers Problem
Quantum Physics
2017-02-08 v1
Abstract
Quantum resources such as superposition and entanglement have been used to provide unconditional key distribution, secret sharing and communication complexity reduction. In this letter we present a novel quantum information protocol for dining cryptographers problem and anonymous vote casting by a group of voters. We successfully demonstrate the experimental realization of the protocol using single photon transmission. Our implementation employs a flying particle scheme where a photon passes by the voters who perform a sequence of actions (unitary transformations) on the photonic state at their local stations.
Cite
@article{arxiv.1702.01984,
title = {Experimental Quantum Solution to the Dining Cryptographers Problem},
author = {Alley Hameedi and Breno Marques and Sadiq Muhammad and Marcin Wiesniak and Mohamed Bourennane},
journal= {arXiv preprint arXiv:1702.01984},
year = {2017}
}
Comments
8 pages, 2 figures