Cryptology ePrint Archive: Report 2003/027
Cryptographic Randomized Response Techniques
Andris Ambainis and Markus Jakobsson and Helger Lipmaa
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.
Category / Keywords: classical cryptography, oblivious transfer, polling, privacy, privacy-preserving data-mining, quantum cryptography, randomized response technique
Date: received 10 Feb 2003, last revised 22 May 2003
Contact author: helger at tcs hut fi
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation
Note: Improved readability, plus applications in privacy-preserving data-mining.
Version: 20030522:192941 (All versions of this report)
Short URL: ia.cr/2003/027
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]