Public-coin parallel zero-knowledge for NP

DOI10.1007/s00145-011-9110-5zbMath1291.94140OpenAlexW2041528483MaRDI QIDQ1946592

Wei-Lung Dustin Tseng, Alon Rosen, Rafael Pass

Publication date: 15 April 2013

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-011-9110-5

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation ⋮ Non-black-box simulation in the fully concurrent setting, revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Probabilistic encryption
• Definitions and properties of zero-knowledge proof systems
• How to construct constant-round zero-knowledge proof systems for NP
• Concurrent zero-knowledge with timing, revisited
• New and Improved Constructions of Nonmalleable Cryptographic Protocols
• The Knowledge Complexity of Interactive Proof Systems
• A Pseudorandom Generator from any One-way Function
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Computationally Sound Proofs
• On the Composition of Zero-Knowledge Proof Systems
• Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
• Concurrent zero-knowledge
• On the Composition of Public-Coin Zero-Knowledge Protocols

This page was built for publication: Public-coin parallel zero-knowledge for NP