@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00106646,
 author = {西田, 拓也 and 林, 優一 and 水木, 敬明 and 曽根, 秀昭 and Takuya, Nishida and Yu-ichi, Hayashi and Takaaki, Mizuki and Hideaki, Sone},
 book = {コンピュータセキュリティシンポジウム2014論文集},
 issue = {2},
 month = {Oct},
 note = {入力を秘密にしたまま出力を得られる安全な計算（Secure Multi-Party Computation）は，情報セキュリティを支える暗号技術の一つである．特に物理的なカード組を用いるカードベース暗号プロトコルは，情報理論的に安全な計算を実現する．既存研究では，論理積や多数決関数など，特定の論理関数にターゲットをしぼりテーラーメイドのプロトコルを構築し，計算に必要なカードの枚数を求めてきた．しかし，任意の論理関数を計算する為に十分な枚数について，一般的な解は未だ検討されていない．本稿では，任意の論理関数を安全に計算できるカード枚数を与えると共に，対称関数の場合は枚数を減らせることも示す．, Secure Multi-Party Computation, which outputs the result of some computation while concealing the inputs, is a cryptographic technique supporting information security. In particular, card-based cryptographic protocols that use physical cards achieve information theoretic security. The existing studies designed tailor-made protocols for certain Boolean functions such as the logical AND function and the majority function, showing the numbers of cards required for the computations. However, a sufficient number of cards to compute any function has not been revealed. In this paper, we give a sufficient condition on the number of cards for any function to be securely computed, and show that the number can be decreased for symmetric functions.},
 pages = {944--951},
 publisher = {情報処理学会},
 title = {カード組を用いた任意の論理関数の安全な計算について},
 volume = {2014},
 year = {2014}
}