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

DOI10.1007/3-540-55719-9_61zbMath1425.68109OpenAlexW1824482557MaRDI QIDQ5204303

Alfredo De Santis, Giuseppe Persiano, Mordechai M. 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)

Related Items (1)

Speak much, remember little: cryptography in the bounded storage model, revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Does co-NP have short interactive proofs ?
• Zero-knowledge proofs of identity
• Some simplified NP-complete graph problems
• The power of preprocessing in zero-knowledge proofs of knowledge
• Average and randomized communication complexity
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• The Knowledge Complexity of Interactive Proof Systems
• Noninteractive Zero-Knowledge
• Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
• Reducibility among Combinatorial Problems

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