TY - GEN
T1 - Card-based protocols using triangle cards
AU - Shinagawa, Kazumasa
AU - Mizuki, Takaaki
N1 - Funding Information:
Supported by JSPS KAKENHI Grant Numbers 17J01169 and 17K00001.
Publisher Copyright:
© Kazumasa Shinagawa and Takaaki Mizuki; licensed under Creative Commons License CC-BY 9th International Conference on Fun with Algorithms (FUN 2018).
PY - 2018/6/1
Y1 - 2018/6/1
N2 - Suppose that three boys and three girls attend a party. Each boy and girl have a crush on exactly one of the three girls and three boys, respectively. The following dilemma arises: On one hand, each person thinks that if there is a mutual affection between a girl and boy, the couple should go on a date the next day. On the other hand, everyone wants to avoid the possible embarrassing situation in which their heart is broken "publicly." In this paper, we solve the dilemma using novel cards called triangle cards. The number of cards required is only six, which is minimal in the case where each player commits their input at the beginning of the protocol. We also construct multiplication and addition protocols based on triangle cards. Combining these protocols, we can securely compute any function f: {0, 1, 2}n → {0, 1, 2}.
AB - Suppose that three boys and three girls attend a party. Each boy and girl have a crush on exactly one of the three girls and three boys, respectively. The following dilemma arises: On one hand, each person thinks that if there is a mutual affection between a girl and boy, the couple should go on a date the next day. On the other hand, everyone wants to avoid the possible embarrassing situation in which their heart is broken "publicly." In this paper, we solve the dilemma using novel cards called triangle cards. The number of cards required is only six, which is minimal in the case where each player commits their input at the beginning of the protocol. We also construct multiplication and addition protocols based on triangle cards. Combining these protocols, we can securely compute any function f: {0, 1, 2}n → {0, 1, 2}.
KW - Card-based protocols
KW - Cryptography without computer
KW - Secure computation
KW - Secure matching problem
KW - Three-valued computation
KW - Triangle cards
UR - http://www.scopus.com/inward/record.url?scp=85048978807&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85048978807&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.FUN.2018.31
DO - 10.4230/LIPIcs.FUN.2018.31
M3 - Conference contribution
AN - SCOPUS:85048978807
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 311
EP - 3113
BT - 9th International Conference on Fun with Algorithms, FUN 2018
A2 - Prencipe, Giuseppe
A2 - Ito, Hiro
A2 - Leonardi, Stefano
A2 - Pagli, Linda
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 9th International Conference on Fun with Algorithms, FUN 2018
Y2 - 13 June 2018 through 15 June 2018
ER -