Necessary and sufficient numbers of cards for securely computing two-bit output functions

Danny Francis, Syarifah Ruqayyah Aljunid, Takuya Nishida, Yu Ichi Hayashi, Takaaki Mizuki, Hideaki Sone

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

In 2015, Koch et al. proposed a five-card finite-runtime committed protocol to compute securely the AND function, showing that their protocol was optimal: there is no protocol computing the AND function with four cards in finite-runtime fashion and committed format. Thus, necessary and sufficient numbers of cards for computing single-bit output functions are known. However, as for two-bit output functions, such an exact characterization is unknown. This paper gives a six-card (or less) protocol for each of all two-bit output functions and proves that our finite-runtime committed protocols are optimal by providing a lower bound. In other words, we give the necessary and sufficient number of cards for any two-bit output function to be computed by a finite-runtime committed protocol. Our lower bound can also be applied to any function which outputs more than two bits.

本文言語English
ホスト出版物のタイトルParadigms in Cryptology – Mycrypt 2016
ホスト出版物のサブタイトルMalicious and Exploratory Cryptology - 2nd International Conference, Mycrypt 2016, Revised Selected Papers
編集者Raphael C.-W. Phan, Moti Yung
出版社Springer Verlag
ページ193-211
ページ数19
ISBN(印刷版)9783319612720
DOI
出版ステータスPublished - 2017
イベント2nd International Conference on Cryptology and Malicious Security, Mycrypt 2016 - Kuala Lumpur, Malaysia
継続期間: 2016 12 12016 12 2

出版物シリーズ

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

Other

Other2nd International Conference on Cryptology and Malicious Security, Mycrypt 2016
CountryMalaysia
CityKuala Lumpur
Period16/12/116/12/2

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Necessary and sufficient numbers of cards for securely computing two-bit output functions」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル