Cryptology ePrint Archive: Report 2019/1255

Available versions in chronological order


Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular
Daniel Benarroch and Matteo Campanelli and Dario Fiore and Dimitris Kolonelos

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular
Daniel Benarroch and Matteo Campanelli and Dario Fiore and Dimitris Kolonelos

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular
Daniel Benarroch and Matteo Campanelli and Dario Fiore and Kobi Gurkan and Dimitris Kolonelos

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular
Daniel Benarroch and Matteo Campanelli and Dario Fiore and Kobi Gurkan and Dimitris Kolonelos

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular
Daniel Benarroch and Matteo Campanelli and Dario Fiore and Kobi Gurkan and Dimitris Kolonelos
Original publication (with minor differences): Financial Cryptography and Data Security 2021


[ Cryptology ePrint archive ]