Resettable Zero Knowledge Based

Let (P,V) be an rZK proof system (of membership)

for hard language L in NP.

Alice(prover) Bob(verifier)

x

rZK proof

that x e L

If Verifier accepts x,

then id succeeds

(x,s)

Aliceís ability to prove membership, convinces Bob of her identity

Resettable Zero-Knowledge property resettable imposter will fail

[Similar to non-transferable proof of ability]

Diapositive prÈcÈdente Diapositive suivante Revenir ý la premiËre diapositive Afficher la version graphique