Round-optimal perfect zero-knowledge proofs
type: Item
instance of: scholarly article
title: Round-optimal perfect zero-knowledge proofs
zbMATH Open document ID: 0803.68031
DOI: 10.1016/0020-0190(94)90015-9
author: Giovanni Di Crescenzo
author: Giuseppe Persiano
published in: Information Processing Letters
publication date: 1994-05-05T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 562525
zbMATH Keywords: communication complexity
zbMATH Keywords: computer security
zbMATH Keywords: zero-knowledge proofs
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90015-9
OpenAlex ID: W2167553233
cites work: Noninteractive Zero-Knowledge
cites work: Practic zero-knowledge proofs: Giving hints and using deficiencies
cites work: Constant-round perfect zero-knowledge computationally convincing protocols
cites work: An almost-constant round interactive zero-knowledge proof
cites work: The knowledge complexity of interactive proof-systems
cites work: The Lattice Point Covering Theorem for Rectangles
cites work: Q4314039
description: scientific article; zbMATH DE number 562525