A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Predictable Arguments of Knowledge
[chapter]
2017
Lecture Notes in Computer Science
We initiate a formal investigation on the power of predictability for argument of knowledge systems for NP . Specifically, we consider private-coin argument systems where the answer of the prover can be predicted, given the private randomness of the verifier; we call such protocols Predictable Arguments of Knowledge (PAoK). Our study encompasses a full characterization of PAoK, showing that such arguments can be made extremely laconic, with the prover sending a single bit, and assumed to have
doi:10.1007/978-3-662-54365-8_6
fatcat:77hiymfnm5cexnugchlw5efxka