Voting with a logarithmic number of cards

Takaaki Mizuki; Isaac Kobina Asiedu; Hideaki Sone

doi:10.1007/978-3-642-39074-6_16

Voting with a logarithmic number of cards

Takaaki Mizuki, Isaac Kobina Asiedu, Hideaki Sone

Research and Development Divisions

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

30 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings
Publisher	Springer Verlag
Pages	162-173
Number of pages	12
ISBN (Print)	9783642390739
DOIs	https://doi.org/10.1007/978-3-642-39074-6_16
Publication status	Published - 2013
Event	12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013 - Milan, Italy Duration: 2013 Jul 1 → 2013 Jul 5

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7956 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013
Country	Italy
City	Milan
Period	13/7/1 → 13/7/5

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-39074-6_16

Fingerprint Dive into the research topics of 'Voting with a logarithmic number of cards'. Together they form a unique fingerprint.

Cite this

Mizuki, T., Asiedu, I. K., & Sone, H. (2013). Voting with a logarithmic number of cards. In Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings (pp. 162-173). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7956 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-39074-6_16

Voting with a logarithmic number of cards. / Mizuki, Takaaki; Asiedu, Isaac Kobina; Sone, Hideaki.

Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings. Springer Verlag, 2013. p. 162-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7956 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Mizuki, T, Asiedu, IK & Sone, H 2013, Voting with a logarithmic number of cards. in Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7956 LNCS, Springer Verlag, pp. 162-173, 12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013, Milan, Italy, 13/7/1. https://doi.org/10.1007/978-3-642-39074-6_16

Mizuki T, Asiedu IK, Sone H. Voting with a logarithmic number of cards. In Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings. Springer Verlag. 2013. p. 162-173. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-39074-6_16

Mizuki, Takaaki ; Asiedu, Isaac Kobina ; Sone, Hideaki. / Voting with a logarithmic number of cards. Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings. Springer Verlag, 2013. pp. 162-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{82991771185f441bb7bea9a7ec6dbeee,

title = "Voting with a logarithmic number of cards",

abstract = "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.",

author = "Takaaki Mizuki and Asiedu, {Isaac Kobina} and Hideaki Sone",

note = "Copyright: Copyright 2021 Elsevier B.V., All rights reserved.; 12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013 ; Conference date: 01-07-2013 Through 05-07-2013",

year = "2013",

doi = "10.1007/978-3-642-39074-6_16",

language = "English",

isbn = "9783642390739",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "162--173",

booktitle = "Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings",

}

TY - GEN

T1 - Voting with a logarithmic number of cards

AU - Mizuki, Takaaki

AU - Asiedu, Isaac Kobina

AU - Sone, Hideaki

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84886001440&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84886001440&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-39074-6_16

DO - 10.1007/978-3-642-39074-6_16

M3 - Conference contribution

AN - SCOPUS:84886001440

SN - 9783642390739

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 162

EP - 173

BT - Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings

PB - Springer Verlag

T2 - 12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013

Y2 - 1 July 2013 through 5 July 2013

ER -