Paper 2006/359 Original: eprint.iacr.org/2006/359 ↗
On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge
Abstract
This note 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 closed. 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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2006-10-23: last updated
- 2006-10-23: published
- Short URL
- https://ia.cr/2006/359
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/359,
author = {Mihir Bellare and Oded Goldreich},
title = {On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/359},
year = {2006},
url = {https://eprint.iacr.org/2006/359}
}