Cryptographic Randomized Response Techniques
classification
💻 cs.CC
cs.CRcs.CYquant-ph
keywords
respondentstechniquescryptographicaffectallowcheatingconstructionscryptographically
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.