Timeline for How does `d-KCA` help secure the zcash protocol?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2018 at 12:29 | comment | added | Yohan Obadia | I need to dive more into the QAP section. It is this sentence that sent me on the wrong track. Great clear explanations ! | |
| Mar 26, 2018 at 5:18 | vote | accept | Yohan Obadia | ||
| Mar 26, 2018 at 3:15 | comment | added | CRYPTONEWBIE | Bob does not know $P$ and in fact must not learn it -- this would defeat the purpose of the protocol. The passage you quote refers to something else and it isn't really relevant. The goal is for Alice to prove (1) that she knows coefficients $(c_0,\cdots, c_d)$ and (2) that these coefficients form a solution to a given problem (more on this in the QAP section). @YohanObadia | |
| Mar 25, 2018 at 10:10 | comment | added | Yohan Obadia |
Thanks for your feedback. I read the QAP section but not yet the Pinocchio one. I might "get it" there. However, it is clearly mention in the last paragraph of part 2 that Bob has a knowledge of $P$: The rough intuition is that the verifier has a “correct” polynomial in mind, and wishes to check the prover knows it
|
|
| Mar 24, 2018 at 22:19 | history | answered | CRYPTONEWBIE | CC BY-SA 3.0 |