Statistical zero-knowledge languages can be recognized in two rounds
type: Item
instance of: scholarly article
title: Statistical zero-knowledge languages can be recognized in two rounds
zbMATH Open document ID: 0732.68038
DOI: 10.1016/0022-0000(91)90006-Q
author: William Aiello
author: Johan Hastad
published in: Journal of Computer and System Sciences
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 4211490
zbMATH Keywords: hierarchy of probabilistic complexity classes
zbMATH Keywords: class IP
zbMATH Keywords: interactive prover-verifier pair
zbMATH Keywords: interactive proof
zbMATH Keywords: zero-knowledge proof
Wikidata QID: Q56959192
MaRDI profile type: Publication
cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
cites work: Does co-NP have short interactive proofs ?
cites work: Q5750398
cites work: Universal classes of hash functions
cites work: The knowledge complexity of interactive proof-systems
cites work: The Knowledge Complexity of Interactive Proof Systems
DBLP publication ID: journals/jcss/AielloH91
Recommended article: On the Power of Statistical Zero Knowledge
Recommended article: On round optimal statistical zero knowledge arguments
Recommended article: Q3210166
Recommended article: A complete problem for statistical zero knowledge
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: Resettable Statistical Zero Knowledge
Recommended article: On relationships between statistical zero-knowledge proofs
Recommended article: Q4228522
Recommended article: Statistical Concurrent Non-malleable Zero Knowledge
description: scientific article; zbMATH DE number 4211490