We propose a concrete procedure of a Σ-protocol proving knowledge that a set of witnesses satisfies a monotone predicate in the witness-indistinguishable manner. Inspired by the high-level work proposed by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, we provide a concrete procedure by extending the so-called OR-proof.
