Voting with a logarithmic number of cards

Takaaki Mizuki, Isaac Kobina Asiedu, Hideaki Sone

研究成果: Conference contribution

31 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルUnconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Proceedings
出版社Springer Verlag
ページ162-173
ページ数12
ISBN(印刷版)9783642390739
DOI
出版ステータスPublished - 2013
イベント12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013 - Milan, Italy
継続期間: 2013 7 12013 7 5

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7956 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)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)

フィンガープリント 「Voting with a logarithmic number of cards」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル