Efficient card-based protocols for generating a hidden random permutation without fixed points

Rie Ishikawa, Eikoh Chida, Takaaki Mizuki

研究成果: Conference contribution

31 被引用数 (Scopus)

抄録

Consider the holiday season, where there are n players who would like to exchange gifts. That is, we would like to generate a random permutation having no fixed point. It is known that such a random permutation can be obtained in a hidden form by using a number of physical cards of four colors with identical backs, guaranteeing that it has no fixed point (without revealing the permutation itself). This paper deals with such a problem and improves the known result: whereas the known protocol needs O(n2) cards of four colors, our efficient protocol uses only O(n log n) cards of two colors.

本文言語English
ホスト出版物のタイトルUnconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings
編集者Cristian S. Calude, Michael J. Dinneen
出版社Springer Verlag
ページ215-226
ページ数12
ISBN(印刷版)9783319218182
DOI
出版ステータスPublished - 2015
イベント14th International Conference on Unconventional Computation and Natural Computation, UCNC 2015 - Auckland, New Zealand
継続期間: 2015 8 302015 9 3

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9252
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other14th International Conference on Unconventional Computation and Natural Computation, UCNC 2015
CountryNew Zealand
CityAuckland
Period15/8/3015/9/3

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Efficient card-based protocols for generating a hidden random permutation without fixed points」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル