(Difficult) The identification scheme in 14.2 was difficult to follow. I understand that the numbers s1,s2, etc. are Peggy's secret numbers, and that Peggy only sends x,y, and the vi's to Victor, but I don't understand how steps 3 and 4 work in this algorithm.
(Reflective) In section 14.1 when we talk about Victor choosing a random x1 or x2, this made me think back to the section on pseudo-random bit generation. This made me consider which random bit generators would work for a zero-knowledge "proof". If the random bit generator could be predicted, then Eve could use this to fake her way through the test. So now we are not only considering the security of the algorithm used for verification, but also the method used to generate "random" bits.
No comments:
Post a Comment