Computer Science – Computational Complexity
Scientific paper
2003-02-18
Computer Science
Computational Complexity
21 pages
Scientific paper
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.
Ambainis Andris
Jakobsson Markus
Lipmaa Helger
No associations
LandOfFree
Cryptographic Randomized Response Techniques does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cryptographic Randomized Response Techniques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptographic Randomized Response Techniques will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-501514