Cryptographic Randomized Response Techniques
Andris Ambainis, Markus Jakobsson, 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.
Create a lesson
Related papers
How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?
Tomislav Petrović
The Complexity of Finding Additional Solutions
Saman Farhat
On the Hardness of 4-to-1 Games with Perfect Completeness
Yumou Fei, Dor Minzer, Shuo Wang
Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation
Sebastian Ben Daniel
∃ R ⊂eq CH
Alex Meiburg
Primal/Dual Method for the Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta