LIPIcs.FUN.2018.31.pdf
- Filesize: 1.13 MB
- 13 pages
Document
Card-based Protocols Using Triangle Cards
Authors
-
Part of:
Volume:
9th International Conference on Fun with Algorithms (FUN 2018)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Fun with Algorithms (FUN) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2018-06-04
Cite AsGet BibTex
Kazumasa Shinagawa and Takaaki Mizuki. Card-based Protocols Using Triangle Cards. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 31:1-31:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.FUN.2018.31
https://doi.org/10.4230/LIPIcs.FUN.2018.31
Abstract
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}.
Subject Classification
ACM Subject Classification
- Theory of computation → Cryptographic protocols
Keywords
- Cryptography without computer
- Secure computation
- Card-based protocols
- Triangle cards
- Three-valued computation
- Secure matching problem
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads