Conference Papers
-
A Physical Zero-knowledge Proof for Sumplete, a Puzzle Generated by ChatGPT
- Author(s)
- K. Hatsugai, K. Asano, and Y. Abe
- Conference
- COCOON 2023
- Vol.
- LNCS 14422
- Pages
- 398–410
- Publisher
- Springer
- Publication Year
- 2023
- Date Presented
- 2023/12/16
Abstract
In March 2023, ChatGPT generated a new puzzle, Sumplete. Sumplete consists of an n x n grid, each whose cell has an integer. In addition, each row and column of the grid has an integer, which we call a target value. The goal of Sumplete is to make the sum of integers in each row and column equal to the target value by deleting some integers of the cells. In this paper, we prove that Sumplete is NP-complete and propose a physical zero-knowledge proof for Sumplete. To show the NP-completeness, we give a polynomial reduction from the subset sum problem to Sumplete. In our physical zero-knowledge proof protocol, we use a card protocol that realizes the addition of negative and positive integers using cyclic permutation on a sequence of cards. To keep the solution secret, we use a technique named decoy technique.