A single shuffle is enough for secure card-based computation of any Boolean circuit

Kazumasa Shinagawa, Koji Nuida

研究成果: Contribution to journalArticle査読

3 被引用数 (Scopus)

抄録

Secure computation enables a number of players each holding a secret input value to compute a function of the inputs without revealing the inputs. It is known that secure computation is possible physically when the inputs are given as a sequence of physical cards. This research area is called card-based cryptography. One of the important problems in card-based cryptography is to minimize the number of cards and shuffles, where a shuffle is the most important (and somewhat heavy) operation in card-based protocols. In this paper, we determine the minimum number of shuffles for achieving general secure computation. Somewhat surprisingly, the answer is just one, i.e., we design a protocol which securely computes any Boolean circuit with only a single shuffle. The number of cards required for our protocol is proportional to the size of the circuit to be computed.

本文言語英語
ページ(範囲)248-261
ページ数14
ジャーナルDiscrete Applied Mathematics
289
DOI
出版ステータス出版済み - 1 31 2021
外部発表はい

All Science Journal Classification (ASJC) codes

  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

「A single shuffle is enough for secure card-based computation of any Boolean circuit」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル