Randomness-efficient non-interactive zero knowledge

DOI10.1007/3-540-63165-8_225zbMath1401.94147OpenAlexW1535259605MaRDI QIDQ4572000

Alfredo De Santis, Pino Persiano, Giovanni Di Crescenzo

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_225

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages ⋮ How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge ⋮ How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudorandom bits for constant depth circuits
• Pseudorandom generators for space-bounded computation
• Randomness in interactive proofs
• Definitions and properties of zero-knowledge proof systems
• The knowledge complexity of quadratic residuosity languages
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• Randomness complexity of private computation
• Pseudorandomness for network algorithms
• The Knowledge Complexity of Interactive Proof Systems
• Noninteractive Zero-Knowledge
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• More deterministic simulation in logspace

This page was built for publication: Randomness-efficient non-interactive zero knowledge