学術論文誌

Cardbased Cryptography with Dihedral Symmetry
 著者
 K. Shinagawa
 雑誌名
 New Generation Computing
 出版社
 Springer
 発行年
 To appear
to appearAbstract
It is known that secure computation can be done by using a deck of physical cards. This area is called cardbased cryptography. Shinagawa et al. (ProvSec 2015) proposed regular nsided polygon cards that enable to compute functions over Z/nZ. In particular, they designed efficient protocols for linear functions (e.g. addition and constant multiplication) over Z/nZ. Here, efficiency is measured by the number of cards used in the protocol. In this paper, we propose a new type of cards, dihedral cards, as a natural generalization of regular polygon cards. Based on them, we construct efficient protocols for various interesting functions such as carry of addition, equality, and greaterthan, whose efficient construction has not been known before. Beside this, we introduce a new protocol framework that captures a wide class of card types including binary cards, regular polygon cards, dihedral cards, and so on.