One message proof systems with known space verifiers

DOI10.1007/3-540-48329-2_8MaRDI QIDQ4341735zbMATH OpenFDO

Authors Yonatan Aumann, Uriel Feige

Publication date 15 December 1997

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

Full work available at URL https://doi.org/10.1007/3-540-48329-2_8

zbMATH Keywords

known-space verifierproof systemzero knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• One-message statistical Zero-Knowledge Proofs and space-bounded verifier
• Theory of Cryptography
• scientific article; zbMATH DE number 4053065
• Zero-knowledge proofs of identity
• Noninteractive Zero-Knowledge

Cited in

(6)

• Fast verification of any remote procedure call: Short witness-indistinguishable one-round proofs for NP
• scientific article; zbMATH DE number 697825 (Why is no real title available?)
• One-message statistical Zero-Knowledge Proofs and space-bounded verifier
• 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 proof systems with known space verifiers

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