eprint.iacr.org will be offline for approximately an hour for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between April 12 and April 14, and some authors have been notified that they need to resubmit their papers.

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-knowlegeResettable sound
Contact author(s)
arita @ iisec ac jp
History
2011-07-30: received
Short URL
https://ia.cr/2011/404
License
Creative Commons Attribution
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},
      note = {\url{https://eprint.iacr.org/2011/404}},
      url = {https://eprint.iacr.org/2011/404}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.