Voting with a Logarithmic Number of Cards
Consider an election where there are two candidates and several voters. Such an election usually requires the same number of ballot papers as the number of voters. In this paper, we show that such an election can be conducted using only a logarithmic number of cards with two suits—black and red—with identical backs. That is, we can securely compute the summation of a number of inputs (0s and 1s) using a logarithmic number of cards with respect to the number of inputs.
Unable to display preview. Download preview PDF.
- 13.Yao, A.: Protocols for secure computations. In: Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, FOCS 1982, pp. 160–164 (1982)Google Scholar