Takaaki Mizuki

Learn More
The “five-card trick” invented by Boer allows Alice and Bob to securely compute the AND function of their secret inputs using five cards—three black cards and two red cards—with identical backs. This paper shows that such a secure computation can be done with only four cards. Specifically, we give a protocol to achieve a secure computation of AND using only(More)
It is known that secure multi-party computations can be achieved using a number of black and red physical cards (with identical backs). In previous studies on such card-based cryptographic protocols, typically an ideal situation where all players are semi-honest and all cards of the same suit are indistinguishable from one another was assumed. In this(More)
3  There are 2 candidates and n voters. 2 candidates n voters election Abstract 4  There are 2 candidates and n voters.  Usually, n ballot papers are required. 2 candidates n voters election n ballot papers Abstract 5  There are 2 candidates and n voters.  Usually, n ballot papers are required.  We show O(log n) cards conduct an election.
Consider a face-down card lying on the table such that we do not know whether its suit color is black or red. Then, how do we make identical copies of the card while keeping its color secret? A partial solution has been devised: using a number of additional black and red cards, Niemi and Renvall proposed an excellent protocol which can copy a face-down card(More)