Ball sort puzzle is a popular logic puzzle consisting of several bins containing balls of multiple colors. Each bin works like a stack; a ball has to follow the last-in first-out order. The player has to sort the balls by color such that each bin contains only balls of a single color. In this paper, we propose a physical zero-knowledge proof protocol for the ball sort puzzle using a deck of playing cards, which enables a prover to physically show that he/she knows a solution with $t$ moves of the ball sort puzzle without revealing it. Our protocol is the first zero-knowledge proof protocol for an interactive puzzle involving moving objects.
翻译:球类解谜是一个流行的逻辑解谜, 由多个包含多色球的垃圾桶组成。 每个垃圾桶就像堆叠一样工作; 球必须遵循最晚的首选顺序。 玩家必须用颜色对球进行排序, 使每个垃圾桶只包含单一颜色的球。 在此文件中, 我们建议使用牌牌牌牌牌来为球类解谜提供一个物理上的零知识验证协议, 使证明人能够用$t 来实际显示他/ 她对球类解谜的解谜不透露它。 我们的协议是涉及移动对象的互动解谜的第一个零知识验证协议 。