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.
Chapter PDF
Similar content being viewed by others
Keywords
References
Bellare, M., Rivest, R.: Translucent Cryptography — An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer. Journal of Cryptology 12(2), 117–139 (1999)
Crépeau, C., Kilian, J.: Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract). In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, October 24-26, pp. 42–52. IEEE Computer Society Press, Los Alamitos (1998)
Chaudhuri, A., Mukerjee, R.: Randomized Response: Theory and Techniques. Statistics: Textbooks and Monographs, vol. 95. Marcel Dekker, Inc, New York (1988); ISBN: 0824777859
Crépeau, C.: Efficient Cryptographic Protocols Based on Noisy Channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 306–317. Springer, Heidelberg (1997)
Greenberg, B.G., Abul-Ela, A.-L.A., Simmons, W.R., Horvitz, D.G.: The Unrelated Question Randomized Response Model: Theoretical Framework. Journal of the American Statistical Association 64(326), 520–539 (1969)
Kikuchi, H., Akiyama, J., Nakamura, G., Gobioff, H.: Stochastic Voting Protocol To Protect Voters Privacy. In: 1999 IEEE Workshop on Internet Applications, July 26-27, 1999, pp. 103–111 (1999)
Laih, C.-S. (ed.): ASIACRYPT 2003. LNCS, vol. 2894. Springer, Heidelberg (2003)
Lipmaa, H., Asokan, N., Niemi, V.: Secure Vickrey Auctions without Threshold Trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 87–101. Springer, Heidelberg (2003)
Lipmaa, H.: On Diophantine Complexity and Statistical Zero-Knowledge Arguments. In: Laih, C.S. (ed.) [Lai03], pp. 398–415 (2003)
Lipmaa, H.: Verifiable Homomorphic Oblivious Transfer and Private Equality Test. In: Laih, C.S. (ed.) [Lai03], pp. 416–433 (2003)
Naor, M., Pinkas, B.: Efficient Oblivious Transfer Protocols. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, USA, January 7-9, pp. 448–457. ACM Press, New York (2001)
Pedersen, T.P.: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)
Warner, S.L.: Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias. Journal of the American Statistical Association 60(309), 63–69 (1965)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambainis, A., Jakobsson, M., Lipmaa, H. (2004). Cryptographic Randomized Response Techniques. In: Bao, F., Deng, R., Zhou, J. (eds) Public Key Cryptography – PKC 2004. PKC 2004. Lecture Notes in Computer Science, vol 2947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-24632-9_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21018-4
Online ISBN: 978-3-540-24632-9
eBook Packages: Springer Book Archive