IEICE TRANSACTIONS on Fundamentals
A Constant-Round Resettably-Sound Resettable Zero-Knowledge Argument in the BPK Model
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.8 pp.1390-1401
- Publication Date
- 2012/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E95.A.1390
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Seiko ARITA, "A Constant-Round Resettably-Sound Resettable Zero-Knowledge Argument in the BPK Model" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 8, pp. 1390-1401, August 2012, doi: 10.1587/transfun.E95.A.1390.
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 conditional commitment scheme.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.1390/_p
Copy
@ARTICLE{e95-a_8_1390,
author={Seiko ARITA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Constant-Round Resettably-Sound Resettable Zero-Knowledge Argument in the BPK Model},
year={2012},
volume={E95-A},
number={8},
pages={1390-1401},
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 conditional commitment scheme.},
keywords={},
doi={10.1587/transfun.E95.A.1390},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - A Constant-Round Resettably-Sound Resettable Zero-Knowledge Argument in the BPK Model
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1390
EP - 1401
AU - Seiko ARITA
PY - 2012
DO - 10.1587/transfun.E95.A.1390
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2012
AB - 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.
ER -
English
