IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Regular Section
A Constant-Round Resettably-Sound Resettable Zero-Knowledge Argument in the BPK Model
Seiko ARITA
著者情報
ジャーナル 認証あり

2012 年 E95.A 巻 8 号 p. 1390-1401

詳細
抄録

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.

著者関連情報
© 2012 The Institute of Electronics, Information and Communication Engineers
前の記事 次の記事
feedback
Top