| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 開始ページ |
|
| 終了ページ |
|
| 会議情報 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 利用開始日 |
|
| 関連DOI |
|
|
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
Comparison of integers, a traditional topic in secure multiparty computation since Yao’s pioneering work on “Millionaires’ Problem” (FOCS 1982), is also well studied in card-based cryptography. For th...e problem, Miyahara et al. (Theoretical Computer Science, 2020) proposed a protocol using binary cards (i.e., cards with two kinds of symbols) that is highly efficient in terms of numbers of cards and shuffles, and its extension to number cards (i.e., cards with distinct symbols). In this paper, with a different design strategy which we name “Tug-of-War Technique”, we propose new protocols based on binary cards and on number cards. For binary cards, our protocol improves the previous protocol asymptotically (in bit lengths of input integers) in terms of numbers of cards and shuffles when adopting ternary encoding of input integers. For number cards, at the cost of increasing the number of cards, our protocol improves the number of shuffles of the previous protocol even with binary encoding, and more with q-ary encoding where q > 2.続きを見る
|
Mendeley出力
