Litcius/Paper detail

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular

Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos

2021Lecture notes in computer science46 citationsDOI

Topics & Concepts

Computer scienceZero-knowledge proofMathematical proofModular designSet (abstract data type)Zero (linguistics)Theoretical computer scienceProgramming languageAlgorithmMathematicsCryptographyGeometryLinguisticsPhilosophyCryptography and Data SecurityBlockchain Technology Applications and SecurityComplexity and Algorithms in Graphs
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular | Litcius