Voting with a logarithmic number of cards

Takaaki Mizuki, Isaac Kobina Asiedu, Hideaki Sone

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationUnconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings
PublisherSpringer Verlag
Pages162-173
Number of pages12
ISBN (Print)9783642390739
DOIs
Publication statusPublished - 2013
Event12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013 - Milan, Italy
Duration: 2013 Jul 12013 Jul 5

Publication series

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

Other

Other12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013
CountryItaly
CityMilan
Period13/7/113/7/5

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

Cite this