Predictable Arguments of Knowledge [chapter]

Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi
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
more » ... ly one round (i.e., two messages) of communication without loss of generality. We additionally explore PAoK satisfying additional properties (including zero-knowledge and the possibility of re-using the same challenge across multiple executions with the prover), present several constructs of PAoK relying on different cryptographic tools, and discuss applications to cryptography.
doi:10.1007/978-3-662-54365-8_6 fatcat:77hiymfnm5cexnugchlw5efxka