when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-88228
URL:

;

### Card-based Protocols Using Triangle Cards

 pdf-format:

### 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}.

### BibTeX - Entry

```@InProceedings{shinagawa_et_al:LIPIcs:2018:8822,
author =	{Kazumasa Shinagawa and Takaaki Mizuki},
title =	{{Card-based Protocols Using Triangle Cards}},
booktitle =	{9th International Conference on Fun with Algorithms (FUN 2018)},
pages =	{31:1--31:13},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-067-5},
ISSN =	{1868-8969},
year =	{2018},
volume =	{100},
editor =	{Hiro Ito and Stefano Leonardi and Linda Pagli and Giuseppe Prencipe},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address =	{Dagstuhl, Germany},
URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8822},
URN =		{urn:nbn:de:0030-drops-88228},
doi =		{10.4230/LIPIcs.FUN.2018.31},
annote =	{Keywords: Cryptography without computer, Secure computation, Card-based protocols, Triangle cards, Three-valued computation, Secure matching problem}
}
```

 Keywords: Cryptography without computer, Secure computation, Card-based protocols, Triangle cards, Three-valued computation, Secure matching problem Seminar: 9th International Conference on Fun with Algorithms (FUN 2018) Issue date: 2018 Date of publication: 04.06.2018

DROPS-Home | Fulltext Search | Imprint | Privacy