Zero Knowledge Arguments

• Completeness:

• soundness: with respect to polynomial time

• Zero- Knowledge : when x e L

What V can compute after interaction =

What V can compute before interaction

Prover P

Polynomial time + secret

Verifier V

Input: x

q1

a1

q2

Accepts /Rejects

[CB87]

Diapositive prÈcÈdente

Diapositive suivante

Revenir ý la premiËre diapositive

Afficher la version graphique