Experimental Quantum Solution to the Dining Cryptographers Problem
Alley Hameedi, Breno Marques, Muhammad, Sadiq, Marcin Wieśniak, Mohamed Bourennane · arXiv (Cornell University) · 2017
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.