On the communication complexity of zero-knowledge proofs
type: Item
instance of: scholarly article
title: On the communication complexity of zero-knowledge proofs
zbMATH Open document ID: 0782.68064
DOI: 10.1007/BF02620135
author: René Peralta
author: Joan Boyar
author: C. Lund
published in: Journal of Cryptology
publication date: 1993-08-29T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 399376
zbMATH Keywords: cryptographic protocols
zbMATH Keywords: zero-knowledge proofs of knowledge
MaRDI profile type: Publication
Wikidata QID: Q62472241
cites work: Q3778673
cites work: Subquadratic zero-knowledge
cites work: A discrete logarithm implementation of perfect zero-knowledge blobs
cites work: Minimum disclosure proofs of knowledge
cites work: Zero-Knowledge Simulation of Boolean Circuits
cites work: Q3777938
cites work: Q3826475
cites work: The complexity of theorem-proving procedures
cites work: Short propositional formulas represent nondeterministic computations
cites work: Zero-knowledge proofs of identity
cites work: Some simplified NP-complete graph problems
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Probabilistic encryption
cites work: The Knowledge Complexity of Interactive Proof Systems
full work available at URL: https://doi.org/10.1007/bf02620135
OpenAlex ID: W2022025391
DBLP publication ID: journals/joc/BoyarLP93
description: scientific article; zbMATH DE number 399376