TY - GEN
T1 - Secure multi-party computation using polarizing cards
AU - Shinagawa, Kazumasa
AU - Mizuki, Takaaki
AU - Schuldt, Jacob
AU - Nuida, Koji
AU - Kanayama, Naoki
AU - Nishide, Takashi
AU - Hanaoka, Goichiro
AU - Okamoto, Eiji
PY - 2015/1/1
Y1 - 2015/1/1
N2 - 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 six-card COPY protocol, a four-card XOR protocol, and a six-card AND protocol, based on a commonly used encoding scheme in which each input bit is encoded using two cards. However, up until now, it has remained an open problem to construct a set of COPY, XOR, and AND protocols based on a two-cards-per-bit encoding scheme, which all can be implemented using only four cards. In this paper, we show that it is possible to construct four-card COPY, XOR, and AND protocols using polarizing plates as cards and a corresponding two-cards-per-bit encoding scheme. Our protocols are optimal in the setting of two-cardsper- bit encoding schemes since four cards are always required to encode the inputs. As applications of our protocols, we show constructions of optimal input-preserving XOR and AND protocols, which we combine to obtain optimal half-adder, full-adder, voting protocols, and more.
AB - 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 six-card COPY protocol, a four-card XOR protocol, and a six-card AND protocol, based on a commonly used encoding scheme in which each input bit is encoded using two cards. However, up until now, it has remained an open problem to construct a set of COPY, XOR, and AND protocols based on a two-cards-per-bit encoding scheme, which all can be implemented using only four cards. In this paper, we show that it is possible to construct four-card COPY, XOR, and AND protocols using polarizing plates as cards and a corresponding two-cards-per-bit encoding scheme. Our protocols are optimal in the setting of two-cardsper- bit encoding schemes since four cards are always required to encode the inputs. As applications of our protocols, we show constructions of optimal input-preserving XOR and AND protocols, which we combine to obtain optimal half-adder, full-adder, voting protocols, and more.
UR - http://www.scopus.com/inward/record.url?scp=84944741495&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84944741495&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-22425-1_17
DO - 10.1007/978-3-319-22425-1_17
M3 - Conference contribution
AN - SCOPUS:84944741495
SN - 9783319224244
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 281
EP - 297
BT - Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings
A2 - Tanaka, Keisuke
A2 - Suga, Yuji
PB - Springer-Verlag
T2 - 10th International Workshop on Security, IWSEC 2015
Y2 - 26 August 2015 through 28 August 2015
ER -