5-Move Statistical Zero Knowledge
Summary :
We show that, if NP language L has an invulnerable generator and if L has an honest verifier standard statistical ZKIP, then L has a 5 move statistical ZKIP. Our class of languages involves random self reducible languages because they have standard perfect ZKIPs. We show another class of languages (class K) which have standard perfect ZKIPs. Blum numbers and a set of graphs with odd automorphism belong to this class. Therefore, languages in class K have 5 move statistical ZKIPs if they have invulnerable generators.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.1 pp.40-45
- Publication Date
- 1993/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- 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
Kaoru KUROSAWA, Masahiro MAMBO, Shigeo TSUJII, "5-Move Statistical Zero Knowledge" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 1, pp. 40-45, January 1993, doi: .
Abstract: We show that, if NP language L has an invulnerable generator and if L has an honest verifier standard statistical ZKIP, then L has a 5 move statistical ZKIP. Our class of languages involves random self reducible languages because they have standard perfect ZKIPs. We show another class of languages (class K) which have standard perfect ZKIPs. Blum numbers and a set of graphs with odd automorphism belong to this class. Therefore, languages in class K have 5 move statistical ZKIPs if they have invulnerable generators.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_1_40/_p
Copy
@ARTICLE{e76-a_1_40,
author={Kaoru KUROSAWA, Masahiro MAMBO, Shigeo TSUJII, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={5-Move Statistical Zero Knowledge},
year={1993},
volume={E76-A},
number={1},
pages={40-45},
abstract={We show that, if NP language L has an invulnerable generator and if L has an honest verifier standard statistical ZKIP, then L has a 5 move statistical ZKIP. Our class of languages involves random self reducible languages because they have standard perfect ZKIPs. We show another class of languages (class K) which have standard perfect ZKIPs. Blum numbers and a set of graphs with odd automorphism belong to this class. Therefore, languages in class K have 5 move statistical ZKIPs if they have invulnerable generators.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - 5-Move Statistical Zero Knowledge
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 40
EP - 45
AU - Kaoru KUROSAWA
AU - Masahiro MAMBO
AU - Shigeo TSUJII
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1993
AB - We show that, if NP language L has an invulnerable generator and if L has an honest verifier standard statistical ZKIP, then L has a 5 move statistical ZKIP. Our class of languages involves random self reducible languages because they have standard perfect ZKIPs. We show another class of languages (class K) which have standard perfect ZKIPs. Blum numbers and a set of graphs with odd automorphism belong to this class. Therefore, languages in class K have 5 move statistical ZKIPs if they have invulnerable generators.
ER -
English
