Article ID: 2026CIP0010
An independent set of a graph is a subset of vertices that contains no adjacent vertices. Given two independent sets Is and It of a graph G, suppose that a token is placed on each vertex in Is. The Independent Set Reconfiguration Problem (ISRP) asks whether Is can be transformed into It through a sequence of independent sets while satisfying a specified transition rule. In this paper, we study ISRP under the Token Sliding (TS) model, where a token located at a vertex v can be moved to an adjacent empty vertex w along an edge (v, w). The Independent Set Reconfiguration Problem under the TS model is known to be PSPACE-complete in general and remains NP-complete even when restricted to directed acyclic graphs. We apply the concept of zero-knowledge proofs to the ISRP under the TS model and propose a card-based zero-knowledge proof protocol that can be executed using playing cards. Using the proposed protocol, a prover who knows a valid reconfiguration sequence from Is to It can convince a verifier of this fact without revealing any information about the sequence itself. We prove that the proposed protocol is complete, sound, and zero-knowledge.