Non-interactive zero-knowledge: A low randomness characterization of NP

DOI10.1007/3-540-48523-6_24MaRDI QIDQ4938630zbMATH OpenFDO

Authors Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano

Publication date 23 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48523-6_24

zbMATH Keywords

non-interactive zero-knowledge proof system

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 2019634
• Short non-interactive zero-knowledge proofs
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Noninteractive Zero-Knowledge

Cited in

(10)

• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
• A zero-one law for RP and derandomization of AM if NP is not small
• scientific article; zbMATH DE number 1670843 (Why is no real title available?)
• Perfect Non-interactive Zero Knowledge for NP
• Randomness-efficient non-interactive zero knowledge
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
• Kolmogorov complexity characterizes statistical zero knowledge
• Cryptography in the multi-string model

This page was built for publication: Non-interactive zero-knowledge: A low randomness characterization of NP

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