Description
Disjunctive zero knowledge proofs, where the prover demonstrates knowledge of solution to a subset of problems, were first studied by Cramer et al.[8] Since then, there have been numerous optimizations towards more efficient communication and computation. In order to reach amortized computation that does not grow with the total number of statements, [6] uses RSA set accumulators to combine with commitment schemes in a Σ−Protocol. There is a natural connection between ring signatures and Σ−protocols as any Σ−protocol of zero knowledge proofs can be converted to a ring signatures by embedding the message to be signed in the hash function. Therefore, the construction of [6] give a ring signature scheme, which can be potentially applied to the Monero protocol after modifications.