On Relationships between Statistical Zer
โ
Tatsuaki Okamoto
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 537 KB
This paper solves several fundamental open problems about statistical zero-knowledge interactive proofs (SZKIPs). The following two theorems are proven: v If language L has a statistical zero-knowledge interactive proof against an honest verifier, then L has a statistical zero-knowledge ``publiccoi