Cryptology ePrint Archive: Report 2017/425

Card-Based Protocols Using Unequal Division Shuffles

Akihiro Nishimura and Takuya Nishida and Yu-ichi Hayashi and Takaaki Mizuki and Hideaki Sone

Abstract: Card-based cryptographic protocols can perform secure computation of Boolean functions. In 2013, Cheung et al. presented a 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 an unequal division shuffle; after a sequence of five cards is divided into a two-card portion and a three-card portion, these two portions are randomly switched so that nobody knows which is which. 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 in the clear. Furthermore, we present two five-card copy protocols (which can duplicate a hidden value) using unequal division shuffle. Because the most efficient copy protocol currently known requires six cards, our new protocols improve upon the existing results. We also design a general copy protocol that produces multiple copies using an unequal division shuffle. Furthermore, we show feasible implementations of unequal division shuffles by the use of card cases.

Category / Keywords: cryptographic protocols / Card-based protocols

Original Publication (in the same form): Soft Computing
DOI:
10.1007/s00500-017-2858-2

Date: received 17 May 2017, last revised 26 Sep 2017

Contact author: tm-paper+card5cop at g-mail tohoku-university jp

Available format(s): PDF | BibTeX Citation

Version: 20170926:065956 (All versions of this report)

Short URL: ia.cr/2017/425

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]