Set Membership Proofs

Set Membership Proofs is a cryptographic proof system that enables a prover to demonstrate, without revealing any additional information, that a committed value belongs to a predefined set, thereby providing a zero-knowledge guarantee of membership within that set.

14

Publications

2K

Citations

37

Authors

31

Institutions

Publications per year

2017–2026

3

Authors

37

  1. SA
    Sanjeev Arora

    Princeton University, United States

    3 publications · 1.6K citations

    3

    h-index

  2. DF
    Dario Fiore

    IMDEA Software Institute, Spain

    2 publications · 45 citations

    2

    h-index

  3. DK
    Dimitris Kolonelos

    Universidad Politécnica de Madrid, Spain

    2 publications · 45 citations

    2

    h-index

  4. MC
    Matteo Campanelli

    IMDEA Software Institute, Spain

    2 publications · 45 citations

    2

    h-index

  5. KN
    Khoa Nguyen

    Nanyang Technological University, Singapore

    1 publications · 23 citations

    1

    h-index

1–5 of 37

Venues

  1. Archive for Mathematical Logic

    1 publications · 35 citations

    1

    h-index

  2. 1

    h-index

  3. IEEE Transactions on Software Engineering

    TSE · 1 publications · 53 citations

    1

    h-index

  4. Journal of Cryptology

    1 publications · 23 citations

    1

    h-index

  5. Information and Computation

    1 publications · 77 citations

    1

    h-index

1–5