2000 character limit reached
Card-Based Overwriting Protocol for Equality Function and Applications (2402.16290v2)
Published 26 Feb 2024 in cs.CR
Abstract: 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.
- C. Crépeau and J. Kilian. Discreet Solitary Games. In Proceedings of the 13th Annual International Cryptology Conference (CRYPTO ’93), pp. 319–330 (1994).
- B. den Boer. More Efficient Match-Making and Satisfiability: the Five Card Trick. In Proceedings of the Workshop on the Theory and Application of of Cryptographic Techniques (EUROCRYPT ’89), pp. 208–217 (1990).
- A. Koch. The Landscape of Optimal Card-Based Protocols. Mathematical Cryptology, 1(2): 115–131 (2021).
- Y. Komano and T. Mizuki. Coin-based Secure Computations. International Journal of Information Security, 21(4): 833–846 (2022).
- T. Mizuki and H. Sone. Six-Card Secure AND and Four-Card Secure XOR. In Proceedings of the 3rd International Frontiers of Algorithmics Workshop (FAW), pp. 358–369 (2009).
- V. Niemi and A. Renvall. Secure multiparty computations without computers. Theoretical Computer Science, 191: 173–183 (1998).
- S. Ruangwises. The Landscape of Computing Symmetric n𝑛nitalic_n-Variable Functions with 2n2𝑛2n2 italic_n Cards. In Proceedings of the 20th International Colloquium on Theoretical Aspects of Computing (ICTAC), pp. 74–82 (2023).
- S. Ruangwises. Using Five Cards to Encode Each Integer in ℤ/6ℤℤ6ℤ\mathbb{Z}/6\mathbb{Z}blackboard_Z / 6 blackboard_Z. In Proceedings of the 14th International Conference on Security for Information Technology and Communications (SecITC), pp. 165–177 (2022).
- S. Ruangwises and T. Itoh. AND Protocols Using only Uniform Shuffles. In Proceedings of the 14th International Computer Science Symposium in Russia (CSR), pp. 349–358 (2019).
- S. Ruangwises and T. Itoh. Securely Computing the n𝑛nitalic_n-Variable Equality Function with 2n2𝑛2n2 italic_n Cards. Theoretical Computer Science, 887: 99–110 (2021).
- K. Shinagawa and T. Mizuki. Card-based Protocols Using Triangle Cards. In Proceedings of the 9th International Conference on Fun with Algorithms (FUN), pp. 31:1–31:13 (2018).
- K. Shinagawa and T. Mizuki. The Six-Card Trick: Secure Computation of Three-Input Equality. In Proceedings of the 21st Annual International Conference on Information Security and Cryptology (ICISC), pp. 123–131 (2018).
- A. Stiglic. Computations with a deck of cards. Theoretical Computer Science, 259: 671–678 (2001).