One-message statistical Zero-Knowledge Proofs and space-bounded verifier

DOI10.1007/3-540-55719-9_61MaRDI QIDQ5204303zbMATH OpenOpenAlexFDO

Authors Alfredo De Santis, Giuseppe Persiano, Moti Yung

Publication date 4 December 2019

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

Full work available at URL https://doi.org/10.1007/3-540-55719-9_61

zbMATH Keywords

zero-knowledge proofs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1024047
• Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Advances in Cryptology - CRYPTO 2003
• One-message zero knowledge and non-malleable commitments
• Theory of Cryptography
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• On round optimal statistical zero knowledge arguments
• Statistical zero knowledge and quantum one-way functions

Cites work

• Average and randomized communication complexity
• Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
• Does co-NP have short interactive proofs ?
• scientific article; zbMATH DE number 4053065 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Noninteractive Zero-Knowledge
• Probabilistic encryption
• Reducibility among combinatorial problems
• Some simplified NP-complete graph problems
• The Knowledge Complexity of Interactive Proof Systems
• The power of preprocessing in zero-knowledge proofs of knowledge
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Zero-knowledge proofs of identity

Cited in

(4)

• scientific article; zbMATH DE number 1024047 (Why is no real title available?)
• Theory of Cryptography
• Speak much, remember little: cryptography in the bounded storage model, revisited
• Post-quantum zero-knowledge with space-bounded simulation

This page was built for publication: One-message statistical Zero-Knowledge Proofs and space-bounded verifier

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