Concrete Scheme based on Resettable Zero Knowledge

Theorem [CGGM, MR]: Assume DLP is (sub-exponentially)

Hard. If the verifier has a public-key, then there exist constant round

rZK protocols for NP for hard language L in NP.

Alice(prover) Bob(verifier)

Public keys secret keys

Alice x s

Bob c t

rZK proof

that x e L

If Verifier accepts x,

then id succeeds

Bob publishes a trapdoor-commitment scheme for Alice to use.

Diapositive prÈcÈdente

Diapositive suivante

Revenir ý la premiËre diapositive

Afficher la version graphique