## CryptoDB

### Paper: Privacy-Preserving Polling using Playing Cards

Authors: Sid Stamm Markus Jakobsson URL: http://eprint.iacr.org/2005/444 Search ePrint Search Google Visualizing protocols is not only useful as a step towards understanding and ensuring security properties, but is also a beneficial tool to communicate notions of security to decision makers and technical people outside the field of cryptography. We present a simple card game that is a visualization for a secure protocol for private polling where it is simple to see that individual responses cannot be traced back to a respondent, and cheating is irrational. We use visualization tricks to illustrate a somewhat complex protocol, namely the Cryptographic Randomized Response Technique protocol of Lipmaa et al. While our tools --- commitments and cut-and-choose --- are well known, our construction for oblivious transfer using playing cards is new. As part of visualizing the protocol, we have been able to show that, while cut-and-choose protocols normally get more secure with an increasing number of choices, the protocol we consider --- surprisingly --- does not. This is true for our visualization of the protocol and for the real protocol.
##### BibTeX
@misc{eprint-2005-12777,
title={Privacy-Preserving Polling using Playing Cards},
booktitle={IACR Eprint archive},
keywords={card game, polls, privacy, randomized response technique, rational equilibrium, voting},
url={http://eprint.iacr.org/2005/444},
note={ sstamm@indiana.edu 13122 received 5 Dec 2005},
author={Sid Stamm and Markus Jakobsson},
year=2005
}