Randomness-efficient non-interactive zero knowledge

DOI10.1007/3-540-63165-8_225MaRDI QIDQ4572000zbMATH OpenOpenAlexFDO

Authors Alfredo De Santis, Giovanni Di Crescenzo, P. Persiano

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)

Recommendations

• scientific article; zbMATH DE number 1405650
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• scientific article; zbMATH DE number 2019634
• scientific article; zbMATH DE number 1676657
• Noninteractive Zero-Knowledge

Cites work

• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
• Definitions and properties of zero-knowledge proof systems
• scientific article; zbMATH DE number 1676657 (Why is no real title available?)
• scientific article; zbMATH DE number 3159594 (Why is no real title available?)
• scientific article; zbMATH DE number 503349 (Why is no real title available?)
• scientific article; zbMATH DE number 708823 (Why is no real title available?)
• scientific article; zbMATH DE number 1024046 (Why is no real title available?)
• More deterministic simulation in logspace
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Noninteractive Zero-Knowledge
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Pseudorandom bits for constant depth circuits
• Pseudorandom generators for space-bounded computation
• Pseudorandomness for network algorithms
• Randomness complexity of private computation
• Randomness in interactive proofs
• The Knowledge Complexity of Interactive Proof Systems
• The knowledge complexity of quadratic residuosity languages

Cited in

(11)

• Scalable zero knowledge with no trusted setup
• How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
• scientific article; zbMATH DE number 1583796 (Why is no real title available?)
• scientific article; zbMATH DE number 1676657 (Why is no real title available?)
• scientific article; zbMATH DE number 6720551 (Why is no real title available?)
• Lower Bounds for Non-interactive Zero-Knowledge
• Noninteractive Zero-Knowledge
• Nonce-Based Key Agreement Protocol Against Bad Randomness
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
• Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572000)