Constant round perfect ZKIP of computational ability

Toshiya Itoh, Kouichi Sakurai

Research output: Contribution to journalArticle

Abstract

In this paper, we show that without any unproven assumption, there exists a 'four' move blackbox simulation perfect zero-knowledge interactive proof system of computational ability for any random self-reducible relation R whose domain is in B P P, and that without any unproven assumption, there exists a 'four' move blackbox simulation perfect zero-knowledge interactive proof system of knowledge on the prime factorization. These results are optimal in the light of the round complexity, because it is shown that if a relation R has a three move blackbox simulation (perfect) zero-knowledge interactive proof system of computational ability (or of knowledge), then there exists a probabilistic polynomial time algorithm that on input x ε {0, 1}, outputs y such that (x,y) ε R with overwhelming probability if x ε dom R, and outputs '⊥' with probability 1 if x ε dom R.

Original languageEnglish
Pages (from-to)1225-1233
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE76-A
Issue number7
Publication statusPublished - Jul 1993
Externally publishedYes

Fingerprint

Interactive Proof Systems
Perfect Simulation
Zero-knowledge Proof
Black Box
Factorization
L'Hôpital's Rule
Probabilistic Algorithms
Output
Polynomials
Polynomial-time Algorithm
Knowledge

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Constant round perfect ZKIP of computational ability. / Itoh, Toshiya; Sakurai, Kouichi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E76-A, No. 7, 07.1993, p. 1225-1233.

Research output: Contribution to journalArticle

@article{a642f11e7fcb4bd2ba9cd5c8978b006a,
title = "Constant round perfect ZKIP of computational ability",
abstract = "In this paper, we show that without any unproven assumption, there exists a 'four' move blackbox simulation perfect zero-knowledge interactive proof system of computational ability for any random self-reducible relation R whose domain is in B P P, and that without any unproven assumption, there exists a 'four' move blackbox simulation perfect zero-knowledge interactive proof system of knowledge on the prime factorization. These results are optimal in the light of the round complexity, because it is shown that if a relation R has a three move blackbox simulation (perfect) zero-knowledge interactive proof system of computational ability (or of knowledge), then there exists a probabilistic polynomial time algorithm that on input x ε {0, 1}, outputs y such that (x,y) ε R with overwhelming probability if x ε dom R, and outputs '⊥' with probability 1 if x ε dom R.",
author = "Toshiya Itoh and Kouichi Sakurai",
year = "1993",
month = "7",
language = "English",
volume = "E76-A",
pages = "1225--1233",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

T1 - Constant round perfect ZKIP of computational ability

AU - Itoh, Toshiya

AU - Sakurai, Kouichi

PY - 1993/7

Y1 - 1993/7

N2 - In this paper, we show that without any unproven assumption, there exists a 'four' move blackbox simulation perfect zero-knowledge interactive proof system of computational ability for any random self-reducible relation R whose domain is in B P P, and that without any unproven assumption, there exists a 'four' move blackbox simulation perfect zero-knowledge interactive proof system of knowledge on the prime factorization. These results are optimal in the light of the round complexity, because it is shown that if a relation R has a three move blackbox simulation (perfect) zero-knowledge interactive proof system of computational ability (or of knowledge), then there exists a probabilistic polynomial time algorithm that on input x ε {0, 1}, outputs y such that (x,y) ε R with overwhelming probability if x ε dom R, and outputs '⊥' with probability 1 if x ε dom R.

AB - In this paper, we show that without any unproven assumption, there exists a 'four' move blackbox simulation perfect zero-knowledge interactive proof system of computational ability for any random self-reducible relation R whose domain is in B P P, and that without any unproven assumption, there exists a 'four' move blackbox simulation perfect zero-knowledge interactive proof system of knowledge on the prime factorization. These results are optimal in the light of the round complexity, because it is shown that if a relation R has a three move blackbox simulation (perfect) zero-knowledge interactive proof system of computational ability (or of knowledge), then there exists a probabilistic polynomial time algorithm that on input x ε {0, 1}, outputs y such that (x,y) ε R with overwhelming probability if x ε dom R, and outputs '⊥' with probability 1 if x ε dom R.

UR - http://www.scopus.com/inward/record.url?scp=0027631850&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027631850&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0027631850

VL - E76-A

SP - 1225

EP - 1233

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 7

ER -