Public-coin parallel zero-knowledge for NP
type: Item
instance of: scholarly article
title: Public-coin parallel zero-knowledge for NP
zbMATH Open document ID: 1291.94140
author: Rafael Pass
author: Alon Rosen
author: Wei-Lung Dustin Tseng
published in: Journal of Cryptology
publication date: 2013-04-15T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6153964
MaRDI profile type: Publication
full work available at URL: s00145-011-9110-5
OpenAlex ID: W2041528483
cites work: Q3826476
cites work: Concurrent zero-knowledge
cites work: How to construct constant-round zero-knowledge proof systems for NP
cites work: On the Composition of Zero-Knowledge Proof Systems
cites work: Probabilistic encryption
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Foundations of Cryptography
cites work: Concurrent zero-knowledge with timing, revisited
cites work: Definitions and properties of zero-knowledge proof systems
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: A Pseudorandom Generator from any One-way Function
cites work: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
cites work: Computationally Sound Proofs
cites work: Bit commitment using pseudorandomness
cites work: New and Improved Constructions of Nonmalleable Cryptographic Protocols
cites work: On the Composition of Public-Coin Zero-Knowledge Protocols
cites work: Q4250778
DOI: 10.1007/S00145-011-9110-5
description: scientific article; zbMATH DE number 6153964