Concrete Scheme: Resettable Zero Knowledge based

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 commit t

If Verifier accepts x,

then ID succeeds

Bob publishes perfectly private

Computationally binding

trapdoor-commitment

scheme for Alice to use.

commit (s)

chg

response

commit(chg)

POK of t

Replace coin by

PSRF(prefix)

Diapositive prÈcÈdente

Diapositive suivante

Revenir ý la premiËre diapositive

Afficher la version graphique