2026-07-23T20:16:20Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8822 2024-03-06T10:42:44Z ddc:004 open_access

Card-based Protocols Using Triangle Cards Shinagawa, Kazumasa Mizuki, Takaaki Cryptography without computer Secure computation Card-based protocols Triangle cards Three-valued computation Secure matching problem 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}. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Kazumasa Shinagawa and Takaaki Mizuki 2018 Is Part Of LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FUN.2018.31 urn:nbn:de:0030-drops-88228 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.31 eng https://creativecommons.org/licenses/by/3.0/legalcode