This article points out a gap between two natural formulations of the concept of a proof of knowledge, and shows that in all natural cases (e.g., NP-statements) this gap can be bridged. The aforementioned formulations differ by whether they refer to (all possible) probabilistic or deterministic prover strategies. Unlike in the rest of cryptography, in the current context, the obvious transformation of probabilistic strategies to deterministic strategies does not seem to suffice per se. The source of trouble is "bad interaction" between the expectation operator and other operators, which appear in the definition of a proof of knowledge (reviewed here). © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bellare, M., & Goldreich, O. (2011). On probabilistic versus deterministic provers in the definition of proofs of knowledge. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6650 LNCS, 114–123. https://doi.org/10.1007/978-3-642-22670-0_14
Mendeley helps you to discover research relevant for your work.