Cryptographic Randomized Response Techniques

Simple item page
dc.creatorAmbainis, Andris
dc.creatorJakobsson, Markus
dc.creatorLipmaa, Helger
dc.date2003-02-18
dc.date2003-05-23
dc.date.accessioned2026-07-07T03:19:28Z
dc.date.available2026-07-07T03:19:28Z
dc.descriptionWe 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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/cs/0302025
dc.identifierhttp://arxiv.org/abs/cs/0302025
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31472
dc.subjectComputational Complexity
dc.subjectCryptography and Security
dc.subjectComputers and Society
dc.subjectQuantum Physics
dc.subjectD.4.6
dc.titleCryptographic Randomized Response Techniques
dc.typetext

Files

Collections

arXiv