Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems

DOI10.1007/3-540-38424-3_27zbMath0800.68420OpenAlexW1523338383MaRDI QIDQ4279588

Alfredo De Santis, Mordechai M. Yung

Publication date: 7 March 1994

Published in: Advances in Cryptology-CRYPT0’ 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-38424-3_27

zbMATH Keywords

non-interactive proof systemzero-knowledge computation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (5)

Randomness-efficient non-interactive zero knowledge ⋮ Communication efficient Zero-knowledge Proofs of knowledge ⋮ Practical proofs of knowledge without relying on theoretical proofs of membership on languages ⋮ Achieving Optimal Anonymity in Transferable E-Cash with a Judge ⋮ One-message statistical Zero-Knowledge Proofs and space-bounded verifier

This page was built for publication: Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems