2003/02/18 by Andris Ambainis, Ambainis, Andris, Markus Jakobsson +3 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Computational Complexity (cs.CC) #Computers and Society (cs.CY) #Cryptography and Security (cs.CR) #D.4.6 #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph) #Survey Sampling and Estimation Techniques #cs.CC #cs.CR #cs.CY #quant-ph
paper · pdf · doi:10.48550/arxiv.cs/0302025
21 pages
openalex publication_date 2003/02/18 · arxiv created 2003/05/23 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.