On Relationships between Statistical Zero-Knowledge Proofs

✍ Scribed by Tatsuaki Okamoto

• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 537 KB
• Volume: 60
• Category: Article
• ISSN: 0022-0000
• DOI: 10.1006/jcss.1999.1664

✦ Synopsis

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 ``publiccoin'' interactive proof against an honest verifier. (Theorem 1) 2000