On relationships between statistical zero-knowledge proofs
type: Item
instance of: scholarly article
title: On relationships between statistical zero-knowledge proofs
zbMATH Open document ID: 0956.68020
author: Tatsuaki Okamoto
published in: Journal of Computer and System Sciences
publication date: 2000-07-27T00:00:00Z
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 1441898
zbMATH Keywords: statistical zero-knowledge interactive proofs
MaRDI profile type: Publication
full work available at URL: jcss.1999.1664
OpenAlex ID: W1976527161
cites work: Statistical zero-knowledge languages can be recognized in two rounds
cites work: Minimum disclosure proofs of knowledge
cites work: Does co-NP have short interactive proofs ?
cites work: Q5750398
cites work: Q4341736
cites work: Q4343445
cites work: Computational complexity and knowledge complexity (extended abstract)
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Quantifying knowledge complexity
cites work: Q4542558
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Algebraic methods for interactive proof systems
cites work: Q5751927
cites work: Q4228522
cites work: Q4934711
cites work: IP = PSPACE
DOI: 10.1006/JCSS.1999.1664
Recommended article: Q4228522
Recommended article: On the relationship between statistical zero-knowledge and statistical randomized encodings
Recommended article: On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
Recommended article: On the Power of Statistical Zero Knowledge
Recommended article: Advances in Cryptology - CRYPTO 2003
Recommended article: Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
Recommended article: A complete problem for statistical zero knowledge
Recommended article: Q6107253
Recommended article: Q4364540
Recommended article: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
description: scientific article; zbMATH DE number 1441898