* Zero Knowledge Proofs
- Assumed section
> Alice has a secret
> Bob dose not know, whether Alice has a secret or not.
- In this case, Does Bob proof that Alice has a secret? This topic is "Zero Knowledge Proofs"
- Alice has a key which is pass the walls, between R and S.
- But, Bob does not know, whether Alice has a Key.
- Zero Knowledge Proofs
Step 1) Alice goes to R or S (ratio, 50 : 50)
Step 2) Bob goes to Q
Step 3) Bob says "Alice, Come here from S" to Alice.
Alice's Path 1 : S-Q = 1/2
Alice's Path 2 : R-Q = 1/2
>> Repeat N, from step 1 to step 3.
- If Alice always come to Q from S, then Bob proofs that Alice has a Key!!
* Fiat-Shamir Protocol
- Zero Knowledge Proofs protocol
- Alice selects random value r, and calculates r^2 mod N
- If Bob selects e = 1, and if Alice know value of s, then Alice can calculate r * s mod N.
- If Bob selects e = 0, then Alice does not use value, S.(Whether Alice knows key S, or not)
- If, Constantly, Alice sends collect value to Bob, then Bob proofs that Alice has a secret value(S)/