Card-Based Overwriting Protocol for Equality Function and Applications

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Ruangwises, Suthee, Ono, Tomoki, Abe, Yoshiki, Hatsugai, Kyosuke, Iwamoto, Mitsugu
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909289315041280
author Ruangwises, Suthee
Ono, Tomoki
Abe, Yoshiki
Hatsugai, Kyosuke
Iwamoto, Mitsugu
author_facet Ruangwises, Suthee
Ono, Tomoki
Abe, Yoshiki
Hatsugai, Kyosuke
Iwamoto, Mitsugu
contents Research in the area of secure multi-party computation with an unconventional method of using a physical deck of playing cards began in 1989 when den Boer proposed a protocol to compute the logical AND function using five cards. Since then, the area has gained interest from many researchers and several card-based protocols to compute various functions have been developed. In this paper, we propose a card-based protocol called the overwriting protocol that can securely compute the $k$-candidate $n$-variable equality function $f: \{0,1,\ldots ,k-1\}^n \rightarrow \{0,1\}$. We also apply the technique used in this protocol to compute other similar functions.
format Preprint
id arxiv_https___arxiv_org_abs_2402_16290
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Card-Based Overwriting Protocol for Equality Function and Applications
Ruangwises, Suthee
Ono, Tomoki
Abe, Yoshiki
Hatsugai, Kyosuke
Iwamoto, Mitsugu
Cryptography and Security
Research in the area of secure multi-party computation with an unconventional method of using a physical deck of playing cards began in 1989 when den Boer proposed a protocol to compute the logical AND function using five cards. Since then, the area has gained interest from many researchers and several card-based protocols to compute various functions have been developed. In this paper, we propose a card-based protocol called the overwriting protocol that can securely compute the $k$-candidate $n$-variable equality function $f: \{0,1,\ldots ,k-1\}^n \rightarrow \{0,1\}$. We also apply the technique used in this protocol to compute other similar functions.
title Card-Based Overwriting Protocol for Equality Function and Applications
topic Cryptography and Security
url https://arxiv.org/abs/2402.16290