Submission + - How to use ZKP to prove set membership without exposing the set or the member (cyborch.com)
cyborch writes: I present a simple example with a prover and a verifier who do not know each other in advance and only share data in the form of a commitment to a set.
Given this technology, we now have the ability to anonymously prove memberships of sets in almost any imaginable context. There are obvious use-cases in decentralised authentication, but there may be many more interesting uses for it.
Given this technology, we now have the ability to anonymously prove memberships of sets in almost any imaginable context. There are obvious use-cases in decentralised authentication, but there may be many more interesting uses for it.
