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
Parents
14
Probabilistic checking of proofs
Sanjeev Arora · Journal of the ACM · 1998 · 1.2K citations · Full text
Probabilistic checking of proofs; a new characterization of NP
Sanjeev Arora · 1992 · 278 citations
Silvio Micali, M. O. Rabin, Joe Kilian · 2004 · 172 citations
Probabilistic checking of proofs and hardness of approximation problems
Sanjeev Arora · 1995 · 109 citations
1–5 of 14
37
3
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 37
31
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
387 citations
Universität Ulm
Ulm, Germany
2 h-index
2 publications
94 citations

Universidad Politécnica de Madrid
Madrid, Spain
2 h-index
2 publications
45 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
5 publications
384 citations
IMDEA Software Institute
Pozuelo de Alarcón, Spain
2 h-index
4 publications
90 citations

National Taipei University
Taipei, Taiwan
1 h-index
1 publications
17 citations

University of Rochester
Rochester, United States
1 h-index
1 publications
17 citations

École Normale Supérieure de Lyon
Lyon, France
1 h-index
1 publications
23 citations
1–8 of 31
1 publications · 35 citations
1
h-index
Conference · 1 publications · 26 citations
1
h-index
TSE · 1 publications · 53 citations
1
h-index
1 publications · 23 citations
1
h-index
1 publications · 77 citations
1
h-index
1–5