A one-round, two-prover, zero-knowledge protocol for NP
type: Item
instance of: scholarly article
title: A one-round, two-prover, zero-knowledge protocol for NP
zbMATH Open document ID: 0834.94015
DOI: 10.1007/BF01200756
author: Dror Lapidot
author: Adi Shamir
published in: Combinatorica
publication date: 1996-04-10T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 778334
zbMATH Keywords: extremal combinatorics
zbMATH Keywords: zero-knowledge
zbMATH Keywords: NP problems
zbMATH Keywords: extremal combinatorial problem
MaRDI profile type: Publication
cites work: Q4318711
cites work: Does co-NP have short interactive proofs ?
cites work: Q3975930
cites work: The Knowledge Complexity of Interactive Proof Systems
full work available at URL: https://doi.org/10.1007/bf01200756
OpenAlex ID: W2030257803
description: scientific article; zbMATH DE number 778334