Five-card secure computations using unequal division shuffle

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

doi:10.1007/978-3-319-26841-5_9

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 proceeding › Conference 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 language	English
Title of host publication	Theory and Practice of Natural Computing - 4th International Conference, TPNC 2015, Proceedings
Editors	Adrian-Horia Dediu, Carlos Martín-Vide, Luis Magdalena
Publisher	Springer-Verlag
Pages	109-120
Number of pages	12
ISBN (Print)	9783319268408
DOIs	https://doi.org/10.1007/978-3-319-26841-5_9
Publication status	Published - 2015 Jan 1
Event	4th International Conference on Theory and Practice of Natural Computing, TPNC 2015 - Mieres, Spain Duration: 2015 Dec 15 → 2015 Dec 16

Publication series

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

Other

Other	4th International Conference on Theory and Practice of Natural Computing, TPNC 2015
Country	Spain
City	Mieres
Period	15/12/15 → 15/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)

Access to Document

10.1007/978-3-319-26841-5_9

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

Five-card secure computations using unequal division shuffle. / Nishimura, Akihiro; Nishida, Takuya; Hayashi, Yu-Ichi; Mizuki, Takaaki ; Sone, Hideaki.

Theory and Practice of Natural Computing - 4th International Conference, TPNC 2015, Proceedings. ed. / Adrian-Horia Dediu; Carlos Martín-Vide; Luis Magdalena. Springer-Verlag, 2015. p. 109-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9477).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9477, Springer-Verlag, pp. 109-120, 4th International Conference on Theory and Practice of Natural Computing, TPNC 2015, Mieres, Spain, 15/12/15. https://doi.org/10.1007/978-3-319-26841-5_9

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

Nishimura, Akihiro ; Nishida, Takuya ; Hayashi, Yu-Ichi ; Mizuki, Takaaki ; Sone, Hideaki. / Five-card secure computations using unequal division shuffle. Theory and Practice of Natural Computing - 4th International Conference, TPNC 2015, Proceedings. editor / Adrian-Horia Dediu ; Carlos Martín-Vide ; Luis Magdalena. Springer-Verlag, 2015. pp. 109-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{edc04b8800054ee3ac2629bb84976f43,

title = "Five-card secure computations using unequal division shuffle",

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.",

keywords = "Card games, Card-based protocols, Cryptography, Cryptography without computers, Real-life hands-on cryptography, Secure multi-party computations",

author = "Akihiro Nishimura and Takuya Nishida and Yu-Ichi Hayashi and Takaaki Mizuki and Hideaki Sone",

year = "2015",

month = jan,

day = "1",

doi = "10.1007/978-3-319-26841-5_9",

language = "English",

isbn = "9783319268408",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "109--120",

editor = "Adrian-Horia Dediu and Carlos Mart{\'i}n-Vide and Luis Magdalena",

booktitle = "Theory and Practice of Natural Computing - 4th International Conference, TPNC 2015, Proceedings",

note = "4th International Conference on Theory and Practice of Natural Computing, TPNC 2015 ; Conference date: 15-12-2015 Through 16-12-2015",

}

TY - GEN

T1 - Five-card secure computations using unequal division shuffle

AU - Nishimura, Akihiro

AU - Nishida, Takuya

AU - Hayashi, Yu-Ichi

AU - Mizuki, Takaaki

AU - Sone, Hideaki

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

KW - Card games

KW - Card-based protocols

KW - Cryptography

KW - Cryptography without computers

KW - Real-life hands-on cryptography

KW - Secure multi-party computations

UR - http://www.scopus.com/inward/record.url?scp=84951871481&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84951871481&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-26841-5_9

DO - 10.1007/978-3-319-26841-5_9

M3 - Conference contribution

AN - SCOPUS:84951871481

SN - 9783319268408

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 109

EP - 120

BT - Theory and Practice of Natural Computing - 4th International Conference, TPNC 2015, Proceedings

A2 - Dediu, Adrian-Horia

A2 - Martín-Vide, Carlos

A2 - Magdalena, Luis

PB - Springer-Verlag

T2 - 4th International Conference on Theory and Practice of Natural Computing, TPNC 2015

Y2 - 15 December 2015 through 16 December 2015

ER -