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. © International Association for Cryptologic Research 2004.
Author supplied keywords
Cite
CITATION STYLE
Ambainis, A., Jakobsson, M., & Lipmaa, H. (2004). Cryptographic randomized response techniques. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2947, 425–438. https://doi.org/10.1007/978-3-540-24632-9_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.