How to implement a random bisection cut

Itaru Ueda, Akihiro Nishimura, Yu Ichi Hayashi, Takaaki Mizuki, Hideaki Sone

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

34 Citations (Scopus)


By using a deck of cards, it is possible to realize a secure computation. In particular, since a new shuffling operation, called a random bisection cut, was devised in 2009, many efficient protocols have been designed. The shuffle functions in the following manner. A sequence of cards is bisected, and the two halves are swapped randomly. This results in two possible cases, depending on whether the two halves of the card sequence are swapped or not. Because there are only two possibilities when a random bisection cut is performed, it has been suggested that information regarding the result of the shuffle could sometimes be leaked visually. Thus, in this paper we propose some methods for implementing a random bisection cut without leaking such information.

Original languageEnglish
Title of host publicationTheory and Practice of Natural Computing - 5th International Conference, TPNC 2016, Proceedings
EditorsMiguel A. Vega-Rodríguez, Carlos Martín-Vide, Takaaki Mizuki
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319490007
Publication statusPublished - 2016
Event5th International Conference on Theory and Practice of Natural Computing, TPNC 2016 - Sendai, Japan
Duration: 2016 Dec 122016 Dec 13

Publication series

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


Conference5th International Conference on Theory and Practice of Natural Computing, TPNC 2016


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


Dive into the research topics of 'How to implement a random bisection cut'. Together they form a unique fingerprint.

Cite this