当前位置: X-MOL 学术Int. J. Inf. Secur. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Secure implementations of a random bisection cut
International Journal of Information Security ( IF 2.4 ) Pub Date : 2019-08-23 , DOI: 10.1007/s10207-019-00463-w
Itaru Ueda , Daiki Miyahara , Akihiro Nishimura , Yu-ichi Hayashi , Takaaki Mizuki , Hideaki Sone

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

中文翻译:

随机二等分割的安全实现

通过使用一副纸牌,可以实现安全的多方计算。特别地,由于在2009年设计了一种新的随机混洗操作,称为随机二等分切,所以已经设计了许多基于卡的有效协议。随机二等分割的功能如下。一连串的牌被一分为二,并且两半被洗牌。这取决于卡序列的两半是否交换而导致两种可能的情况。由于执行随机等分切割时只有两种可能性,因此建议有关随机播放结果的信息有时可能会在视觉上泄漏。因此,在本文中,我们提出了一些在不泄漏此类信息的情况下安全地实现随机二等分切割的方法。
更新日期:2019-08-23
down
wechat
bug