Five-card secure computations using unequal division shuffle

Akihiro Nishimura, Takuya Nishida, Yu-Ichi Hayashi, Takaaki Mizuki, Hideaki Sone

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

12 Citations (Scopus)

Abstract

Card-based cryptographic protocols can perform secure computation of Boolean functions. Cheung et al. recently presented an elegant protocol that securely produces a hidden AND value using five cards; however, it fails with a probability of 1/2. The protocol uses an unconventional shuffle operation called unequal division shuffle; after a sequence of five cards is divided into a two-card portion and a threecard portion, these two portions are randomly switched. In this paper, we first show that the protocol proposed by Cheung et al. securely produces not only a hidden AND value but also a hidden OR value (with a probability of 1/2). We then modify their protocol such that, even when it fails, we can still evaluate the AND value. Furthermore, we present two five-card copy protocols using unequal division shuffle. Because the most efficient copy protocol currently known requires six cards, our new protocols improve upon the existing results.

Original languageEnglish
Title of host publicationTheory and Practice of Natural Computing - 4th International Conference, TPNC 2015, Proceedings
EditorsAdrian-Horia Dediu, Carlos Martín-Vide, Luis Magdalena
PublisherSpringer-Verlag
Pages109-120
Number of pages12
ISBN (Print)9783319268408
DOIs
Publication statusPublished - 2015 Jan 1
Event4th International Conference on Theory and Practice of Natural Computing, TPNC 2015 - Mieres, Spain
Duration: 2015 Dec 152015 Dec 16

Publication series

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

Other

Other4th International Conference on Theory and Practice of Natural Computing, TPNC 2015
CountrySpain
CityMieres
Period15/12/1515/12/16

Keywords

  • Card games
  • Card-based protocols
  • Cryptography
  • Cryptography without computers
  • Real-life hands-on cryptography
  • Secure multi-party computations

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Five-card secure computations using unequal division shuffle'. Together they form a unique fingerprint.

  • Cite this

    Nishimura, A., Nishida, T., Hayashi, Y-I., Mizuki, T., & Sone, H. (2015). Five-card secure computations using unequal division shuffle. In A-H. Dediu, C. Martín-Vide, & L. Magdalena (Eds.), Theory and Practice of Natural Computing - 4th International Conference, TPNC 2015, Proceedings (pp. 109-120). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9477). Springer-Verlag. https://doi.org/10.1007/978-3-319-26841-5_9