Hideaki Sone

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)
Using a lot of VLANs on campus networks has become popular for deploying many logical networks over minimal fibers/cables. A campus-wide Wi-Fi system, for example, requires a lot of VLANs for separating the access networks from other campus networks and for realizing a sophisticated access control such as guest-/home-users separation and security filtering.(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.
Card-based protocols that are based on a deck of physical cards achieve secure multi-party computation with information-theoretic secrecy. Using existing AND, XOR, NOT, and copy protocols, one can naively construct a secure computation protocol for any given (multivariable) Boolean function as long as there are plenty of additional cards. However, an(More)
From the perspective of fault management, tra c characteristics contain symptoms of faults in the network. Symptoms of faults aggregate and are manifested in the aggregate tra c characteristics generally observed by a tra c monitor. It is very di cult for a manager or an NMS to isolate the symptoms manifested in the aggregate tra c characteristics. Symptoms(More)