Akihiro Nishimura
ABSTRACT
Card-based cryptographic protocols provide secure multi-party computation using a deck of physical cards. The most important primitive of those protocols is the shuffling operation, and most known protocols rely on uniform shuffles (such as the random cut and random bisection cut) in which each possible outcome is equally likely. However, several protocols with non-uniform shuffles have recently been proposed by Koch et al. Compared to other protocols, their protocols require fewer cards to securely produce a hidden AND value, although implementation of the non-uniform shuffle appearing in their protocols remains an open problem. This paper presents a secure implementation of their non-uniform shuffle. To implement the shuffle, we utilize physical cases that can store piles of cards, such as boxes and envelopes. Therefore, humans are able to perform the non-uniform shuffle using these everyday objects.
- C. Crépeau and J. Kilian. Discreet solitary games. In D. R. Stinson, editor, advances in Cryptology -- CRYPTO '93, volume 773 of Lecture Notes in Computer Science, pages 319--330. Springer Berlin Heidelberg, 1994. Google Scholar
Digital Library
- B. den Boer. More efficient match-making and satisfiability: the five card trick. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology -- EUROCRYPT '89, volume 434 of Lecture Notes in Computer Science, pages 208--217. Springer Berlin Heidelberg, 1990. Google ScholarDigital Library
- A. Koch, S. Walzer, and K. Härtel. Card-based cryptographic protocols using a minimal number of cards. In T. Iwata and J. Cheon, editors, Advances in Cryptology -- ASIACRYPT 2015, volume 9452 of Lecture Notes in Computer Science, pages 783--807. Springer Berlin Heidelberg, 2015.Google Scholar
- T. Mizuki, M. Kumamoto, and H. Sone. The five-card trick can be done with four cards. In X. Wang and K. Sako, editors, Advances in Cryptology -- ASIACRYPT 2012, volume 7658 of Lecture Notes in Computer Science, pages 598--606. Springer Berlin Heidelberg, 2012. Google ScholarDigital Library
- T. Mizuki and H. Shizuya. A formalization of card-based cryptographic protocols via abstract machine. International Journal of Information Security, 13(1):15--23, 2014. Google ScholarDigital Library
- T. Mizuki and H. Sone. Six-card secure AND and four-card secure XOR. In X. Deng, J. E. Hopcroft, and J. Xue, editors, Frontiers in Algorithmics, volume 5598 of Lecture Notes in Computer Science, pages 358--369. Springer Berlin Heidelberg, 2009. Google ScholarDigital Library
- T. Mizuki, F. Uchiike, and H. Sone. Securely computing XOR with 10 cards. The Australasian Journal of Combinatorics, 36:279--293, 2006.Google Scholar
- V. Niemi and A. Renvall. Secure multiparty computations without computers. Theoretical Computer Science, 191(1-2):173--183, 1998. Google ScholarDigital Library
- T. Nishida, Y. Hayashi, T. Mizuki, and H. Sone. Card-based protocols for any boolean function. In R. Jain, S. Jain, and F. Stephan, editors, Theory and Applications of Models of Computation, volume 9076 of Lecture Notes in Computer Science, pages 110--121. Springer International Publishing, 2015.Google Scholar
- A. Nishimura, T. Nishida, Y. Hayashi, T. Mizuki, and H. Sone. Five-card secure computations using unequal division shuffle. In A.-H. Dediu, L. Magdalena, and C. Martín-Vide, editors, Theory and Practice of Natural Computing, volume 9477 of Lecture Notes in Computer Science, pages 109--120. Springer International Publishing, 2015.Google Scholar
- K. Shinagawa, T. Mizuki, J. Schuldt, K. Nuida, N. Kanayama, T. Nishide, G. Hanaoka, and E. Okamoto. Multi-party computation with small shuffle complexity using regular polygon cards. In M.-H. Au and A. Miyaji, editors, Provable Security, volume 9451 of Lecture Notes in Computer Science, pages 127--146. Springer International Publishing, 2015. Google ScholarDigital Library
- A. Stiglic. Computations with a deck of cards. Theoretical Computer Science, 259(1-2):671--678, 2001. Google ScholarDigital Library
Index Terms
- An Implementation of Non-Uniform Shuffle for Secure Multi-Party Computation
Recommendations
Efficient Fair Secure Two-Party Computation
APSCC '12: Proceedings of the 2012 IEEE Asia-Pacific Services Computing Conference)Yao first introduced a constant-round protocol for secure two-party computation (2PC) withstanding semi-honest adversaries by using a tool called """"garbled circuit"""". Later, many protocols based on garbled circuit approach have been presented, most ...
Secure Multi-Party Computation without Agreement
It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of ...
Comments