IEICE TRANSACTIONS on Information
Interactive Bi-proof Systems and Undeniable Signature Schemes
Summary :
This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum's scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. We show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes provide signature confirmation and disavowal with the same protocol (or at the same time).
- Publication
- IEICE TRANSACTIONS on Information Vol.E75-D No.1 pp.102-109
- Publication Date
- 1992/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Theoretical Foundations of Computing)
- Category
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
Atsushi FUJIOKA, Tatsuaki OKAMOTO, Kazuo OHTA, "Interactive Bi-proof Systems and Undeniable Signature Schemes" in IEICE TRANSACTIONS on Information,
vol. E75-D, no. 1, pp. 102-109, January 1992, doi: .
Abstract: This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum's scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. We show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes provide signature confirmation and disavowal with the same protocol (or at the same time).
URL: https://global.ieice.org/en_transactions/information/10.1587/e75-d_1_102/_p
Copy
@ARTICLE{e75-d_1_102,
author={Atsushi FUJIOKA, Tatsuaki OKAMOTO, Kazuo OHTA, },
journal={IEICE TRANSACTIONS on Information},
title={Interactive Bi-proof Systems and Undeniable Signature Schemes},
year={1992},
volume={E75-D},
number={1},
pages={102-109},
abstract={This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum's scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. We show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes provide signature confirmation and disavowal with the same protocol (or at the same time).},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Interactive Bi-proof Systems and Undeniable Signature Schemes
T2 - IEICE TRANSACTIONS on Information
SP - 102
EP - 109
AU - Atsushi FUJIOKA
AU - Tatsuaki OKAMOTO
AU - Kazuo OHTA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 1992
AB - This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum's scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. We show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes provide signature confirmation and disavowal with the same protocol (or at the same time).
ER -
English
