A Constant-Round Resettably-Sound Resettable Zero-Knowledge Argument in the BPK Model

Seiko ARITA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E95-A   No.8   pp.1390-1401
Publication Date: 2012/08/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E95.A.1390
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Cryptography and Information Security
resettable zero-knowledge,  resettable soundness,  conditional commitment,  resettably extractable,  

Full Text: PDF(245.3KB)>>
Buy this Article

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 conditional commitment scheme.