Card-based protocols for any boolean function

Takuya Nishida, Yu Ichi Hayashi, Takaaki Mizuki, Hideaki Son

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

35 Citations (Scopus)


Card-based protocols that are based on a deck of physical cards achieve secure multi-party computation with information-theoretic secrecy. Using existing AND, XOR, NOT, and copy protocols, one can naively construct a secure computation protocol for any given (multivariable) Boolean function as long as there are plenty of additional cards. However, an explicit sufficient number of cards for computing any function has not been revealed thus far. In this paper, we propose a general approach to constructing an efficient protocol so that six additional cards are sufficient for any function to be securely computed. Further, we prove that two additional cards are sufficient for any symmetric function.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings
EditorsRahul Jain, Sanjay Jain, Frank Stephan
PublisherSpringer Verlag
Number of pages12
ISBN (Electronic)9783319171418
Publication statusPublished - 2015
Event12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015 - Singapore, Singapore
Duration: 2015 May 182015 May 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Card-based protocols for any boolean function'. Together they form a unique fingerprint.

Cite this