Unconditional Characterizations of Non-interactive Zero-Knowledge

DOI10.1007/11535218_8MaRDI QIDQ5451022zbMATH OpenOpenAlexFDO

Authors Rafael Pass, Abhi Shelat

Publication date 17 March 2008

Published in Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11535218_8

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Lower Bounds for Non-interactive Zero-Knowledge
• Noninteractive Zero-Knowledge
• Publication:4941874
• An Unconditional Study of Computational Zero Knowledge
• Unconditionally secure NIZK in the fine-grained setting

Cited in

(20)

• Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
• The Complexity of Zero Knowledge
• QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
• Amplification of non-interactive zero knowledge, revisited
• Unconditionally secure quantum commitments with preprocessing
• Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
• Constructions and bounds for unconditionally secure non-interactive commitment schemes
• Perfect Non-interactive Zero Knowledge for NP
• Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
• NIZK from SNARGs
• Non-interactive zero-knowledge proofs with fine-grained security
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Lower Bounds for Non-interactive Zero-Knowledge
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Classically verifiable NIZK for QMA with preprocessing
• On the relationship between statistical zero-knowledge and statistical randomized encodings
• scientific article; zbMATH DE number 1842511 (Why is no real title available?)
• Dual-mode NIZKs: possibility and impossibility results for property transfer
• On the relationship between statistical zero-knowledge and statistical randomized encodings
• Multi-theorem preprocessing NIZKs from lattices

This page was built for publication: Unconditional Characterizations of Non-interactive Zero-Knowledge

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