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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationParadigms in Cryptology – Mycrypt 2016
Subtitle of host publicationMalicious and Exploratory Cryptology - 2nd International Conference, Mycrypt 2016, Revised Selected Papers
EditorsRaphael C.-W. Phan, Moti Yung
PublisherSpringer Verlag
Pages193-211
Number of pages19
ISBN (Print)9783319612720
DOIs
Publication statusPublished - 2017 Jan 1
Event2nd International Conference on Cryptology and Malicious Security, Mycrypt 2016 - Kuala Lumpur, Malaysia
Duration: 2016 Dec 12016 Dec 2

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10311 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)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)

Fingerprint Dive into the research topics of 'Necessary and sufficient numbers of cards for securely computing two-bit output functions'. Together they form a unique fingerprint.

Cite this