Broadcast interactive proofs

DOI10.1007/3-540-46416-6_7MaRDI QIDQ4037453zbMATH OpenOpenAlexFDO

Authors M. V. D. Burmester, Yvo Desmedt

Publication date 18 May 1993

Published in Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46416-6_7

zbMATH Keywords

broadcast proofsinteractive zero-knowledge proofs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Non-interactive zero-knowledge proofs to multiple verifiers
• Noninteractive Zero-Knowledge
• A general zero-knowledge scheme
• Theory of Cryptography
• scientific article; zbMATH DE number 4053065

Cited in

(10)

• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
• Non-interactive zero-knowledge proofs to multiple verifiers
• Steganography-free zero-knowledge
• The round complexity of statistical MPC with optimal resiliency
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Ramp hyper-invertible matrices and their applications to MPC protocols
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• How to share an NP statement or combiners for zero-knowledge proofs
• Single-input functionality against a dishonest majority: practical and round-optimal

This page was built for publication: Broadcast interactive proofs

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