ZeroKnowledgeProofs.pptVIP

Zero Knowledge Proofs;Zero Knowledge Proofs ;Zero Knowledge Proofs (ZKP);ZKP;Properties of ZKP ;Advantages of ZKP ;Classic Example ;Fiat-Shamir Identification Protocol;Fiat-Shamir Identification Protocol;After many iterations, with a very high probability Bob can verify Alice’s identity Alice’s response does not reveal the secret s (with y = r or y = r* s mod n) An intruder can prove Alice’s identity without knowing the secret, if he knows Bob’s challenge in advance: Generate random r If expected challenge is 1, send x = r2/v mod n as commitment, and y = r as response If expected challenge is 0, send x = r mod n as commitment Probability that any Intruder impersonating the prover can send the right response is only ? Probability reduced as iterations are increased Important - Alice should not repeat r ;Applications ;Products;References