Paper 2011/404 Original: eprint.iacr.org/2011/404 ↗
A constant-round resettably-sound resettable zero-knowledge argument in the BPK model
Abstract
In resetting attacks against a proof system, a prover or a verifier is reset and enforced to use the same random tape on various inputs as many times as an adversary may want. Recent deployment of cloud computing gives these attacks a new importance. This paper shows that argument systems for any NP language that are both resettably-sound and resettable zero-knowledge are possible by a constant-round protocol in the BPK model. For that sake, we define and construct a resettably-extractable {\em conditional} commitment scheme.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2011-07-30: last updated
- 2011-07-30: published
- Short URL
- https://ia.cr/2011/404
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/404,
author = {Seiko Arita},
title = {A constant-round resettably-sound resettable zero-knowledge argument in the BPK model},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/404},
year = {2011},
url = {https://eprint.iacr.org/2011/404}
}