Cryptographic Randomized Response Techniques
Computational Complexity
2007-05-23 v2 Cryptography and Security
Computers and Society
Quantum Physics
Abstract
We develop cryptographically secure techniques to guarantee unconditional privacy for respondents to polls. Our constructions are efficient and practical, and are shown not to allow cheating respondents to affect the ``tally'' by more than their own vote -- which will be given the exact same weight as that of other respondents. We demonstrate solutions to this problem based on both traditional cryptographic techniques and quantum cryptography.
Cite
@article{arxiv.cs/0302025,
title = {Cryptographic Randomized Response Techniques},
author = {Andris Ambainis and Markus Jakobsson and Helger Lipmaa},
journal= {arXiv preprint arXiv:cs/0302025},
year = {2007}
}
Comments
21 pages