Cryptographic Randomized Response Techniques
计算复杂性
2007-05-23 v2 密码学与安全
计算机与社会
量子物理
摘要
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.
引用
@article{arxiv.cs/0302025,
title = {Cryptographic Randomized Response Techniques},
author = {Andris Ambainis and Markus Jakobsson and Helger Lipmaa},
journal= {arXiv preprint arXiv:cs/0302025},
year = {2007}
}
备注
21 pages