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

Kazumasa Shinagawa, Takaaki Mizuki

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

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationFrontiers in Algorithmics - 13th International Workshop, FAW 2019, Proceedings
EditorsMei Lu, Xiaotie Deng, Yijia Chen
PublisherSpringer Verlag
Pages63-75
Number of pages13
ISBN (Print)9783030181253
DOIs
Publication statusPublished - 2019
Event13th International Workshop on Frontiers in Algorithmics, FAW 2019 - Sanya, China
Duration: 2019 Apr 292019 May 3

Publication series

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

Conference

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

Keywords

  • Card-based protocols
  • Playing cards
  • Secure computation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Secure computation of any boolean function based on any deck of cards'. Together they form a unique fingerprint.

Cite this