How to implement a random bisection cut

Itaru Ueda, Akihiro Nishimura, Yu Ichi Hayashi, Takaaki Mizuki, Hideaki Sone

研究成果: Conference contribution

31 被引用数 (Scopus)

抄録

By using a deck of cards, it is possible to realize a secure computation. In particular, since a new shuffling operation, called a random bisection cut, was devised in 2009, many efficient protocols have been designed. The shuffle functions in the following manner. A sequence of cards is bisected, and the two halves are swapped randomly. This results in two possible cases, depending on whether the two halves of the card sequence are swapped or not. Because there are only two possibilities when a random bisection cut is performed, it has been suggested that information regarding the result of the shuffle could sometimes be leaked visually. Thus, in this paper we propose some methods for implementing a random bisection cut without leaking such information.

本文言語English
ホスト出版物のタイトルTheory and Practice of Natural Computing - 5th International Conference, TPNC 2016, Proceedings
編集者Miguel A. Vega-Rodríguez, Carlos Martín-Vide, Takaaki Mizuki
出版社Springer Verlag
ページ58-69
ページ数12
ISBN(印刷版)9783319490007
DOI
出版ステータスPublished - 2016
イベント5th International Conference on Theory and Practice of Natural Computing, TPNC 2016 - Sendai, Japan
継続期間: 2016 12 122016 12 13

出版物シリーズ

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

Other

Other5th International Conference on Theory and Practice of Natural Computing, TPNC 2016
国/地域Japan
CitySendai
Period16/12/1216/12/13

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「How to implement a random bisection cut」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル