Abstract Set membership proofs are an invaluable part of privacy preserving systems. These allow a prover to demonstrate knowledge witness w corresponding secret element x public set, such that they jointly satisfy given NP relation, i.e. ?( w, ) = 1 and is member set { , . ???? }. This allows the identity remain hidden, eg. ring signatures confidential transactions in cryptocurrencies. In this...