
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Secure Computation Protocols Using Polarizing Cards
Kazumasa SHINAGAWA Takaaki MIZUKI Jacob C. N. SCHULDT Koji NUIDA Naoki KANAYAMA Takashi NISHIDE Goichiro HANAOKA Eiji OKAMOTO
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E99A
No.6
pp.11221131 Publication Date: 2016/06/01 Online ISSN: 17451337
DOI: 10.1587/transfun.E99.A.1122 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cardbased protocols, polarizing cards, secure computation, boolean circuits, recreational cryptography,
Full Text: PDF(1.7MB)>>
Summary:
It is known that, using just a deck of cards, an arbitrary number of parties with private inputs can securely compute the output of any function of their inputs. In 2009, Mizuki and Sone constructed a sixcard COPY protocol, a fourcard XOR protocol, and a sixcard AND protocol, based on a commonly used encoding scheme in which each input bit is encoded using two cards. However, up until now, there are no known results to construct a set of COPY, XOR, and AND protocols based on a twocardperbit encoding scheme, which all can be implemented using only four cards. In this paper, we show that it is possible to construct fourcard COPY, XOR, and AND protocols using polarizing plates as cards and a corresponding twocardperbit encoding scheme. Our protocols use a minimum number of cards in the setting of twocardperbit encoding schemes since four cards are always required to encode the inputs. Moreover, we show that it is possible to construct twocard COPY, twocard XOR, and threecard AND protocols based on a onecardperbit encoding scheme using a common reference polarizer which is a polarizing material accessible to all parties.

