Two-threshold broadcast and detectable multi-party computation

DOI10.1007/3-540-39200-9_4MaRDI QIDQ4434868zbMATH OpenFDO

Authors Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger

Publication date 26 November 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2656/26560051.htm

zbMATH Keywords

broadcastmulti-party computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Detectable Byzantine agreement secure against faulty majorities
• scientific article; zbMATH DE number 2086726
• Secure computation without agreement
• Trading correctness for privacy in unconditional multi-party computation. (Extended abstract)
• Advances in Cryptology - EUROCRYPT 2004

Cited in

(10)

• Characterization of secure multiparty computation without broadcast
• Synchronous consensus with optimal asynchronous fallback guarantees
• MPC with synchronous security and asynchronous responsiveness
• Characterization of secure multiparty computation without broadcast
• Broadcast from minicast secure against general adversaries
• Complete characterization of broadcast and pseudo-signatures from correlations
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus
• Multi-threshold asynchronous reliable broadcast and consensus
• Efficient quantum detectable weak Byzantine agreement with optimal fault-tolerant bound

This page was built for publication: Two-threshold broadcast and detectable multi-party computation

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