Score:0

Ephemeral anonymous identities that can be slashed once forever with a single nullifier

au flag

Consider a ZKP anonymous credential scheme where each tuple of (x, identity_secret, merkle_root) corresponds to a unique nullifier computed as Hash(x|identity_secret). The prover can use this tuple repeatedly along with proving other statements.

x is designated on a per-session/app basis. And for a specific triple, a user can be blacklisted with the nullifier, and can not generate any new proofs without revealing the blacklisted nullifier.

Is it possible that when we blacklist one nullifier for a triple, the user as identified by (identity_secret, merkle_root) is permanently blacklisted ? Can the user efficiently prove to be not blacklisted ?

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.