Secure computation of any boolean function based on any deck of cards

Kazumasa Shinagawa, Takaaki Mizuki

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

It is established that secure computation can be achieved by using a deck of physical cards. Almost all existing card-based protocols are based on a specific deck of cards. In this study, we design card-based protocols that are executable using any deck of cards (e.g., playing cards, UNO, and trading cards). Specifically, we construct a card-based protocol for any Boolean function based on any deck of cards. As corollaries of our result, a standard deck of playing cards (having 52 cards) enables secure computation of any 22-variable Boolean function, and UNO (having 112 cards) enables secure computation of any 53-variable Boolean function.

本文言語English
ホスト出版物のタイトルFrontiers in Algorithmics - 13th International Workshop, FAW 2019, Proceedings
編集者Mei Lu, Xiaotie Deng, Yijia Chen
出版社Springer Verlag
ページ63-75
ページ数13
ISBN(印刷版)9783030181253
DOI
出版ステータスPublished - 2019
イベント13th International Workshop on Frontiers in Algorithmics, FAW 2019 - Sanya, China
継続期間: 2019 4 292019 5 3

出版物シリーズ

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

Conference

Conference13th International Workshop on Frontiers in Algorithmics, FAW 2019
CountryChina
CitySanya
Period19/4/2919/5/3

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Secure computation of any boolean function based on any deck of cards」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル