Nonogram is a pencil puzzle consisting of a rectangular white grid where the player has to paint some cells black according to given constraints. In 2010, Chien and Hon constructed a physical card-based zero-knowledge proof protocol for Nonogram, which enables a prover to physically show that he/she knows a solution of the puzzle without revealing it. However, their protocol requires special tools such as scratch-off cards and a sealing machine, making it impractical to implement in real world. The protocol also has a nonzero soundness error. In this paper, we develop a more practical card-based protocol for Nonogram with perfect soundness that uses only regular paper cards. We also show how to modify our protocol to make it support Nonogram Color, a generalization of Nonogram where the player has to paint the cells with multiple colors.

翻译：非ograms是一种铅笔谜题，由矩形白色网格构成，玩家需根据给定约束将部分格子涂黑。2010年，Chien与Hon构建了一种基于物理卡片的零知识证明协议用于非ograms，使证明者能够在不泄露解谜方案的情况下物理展示其知晓解法。然而，该协议需使用刮刮卡和封口机等特殊工具，导致在实际中难以实现。同时，该协议存在非零的完备性误差。本文提出一种更实用的基于卡片的非ograms协议，仅使用普通纸卡即可实现完美完备性。我们还展示了如何改进该协议以支持非ograms的泛化形式——彩色非ograms，即玩家需用多种颜色填充格子。