A constant-round resettably-sound resettable zero-knowledge argument in the BPK model

Seiko Arita

Paper 2011/404

A constant-round resettably-sound resettable zero-knowledge argument in the BPK model

Seiko Arita

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: Published elsewhere. Unknown where it was published
Keywords: Resettable zero-knowlege Resettable sound
Contact author(s): arita @ iisec ac jp
History: 2011-07-30: received
Short URL: https://ia.cr/2011/404
License: CC BY

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}
}