Round-Efficient Secure Computation in Point-to-Point Networks

DOI10.1007/978-3-540-72540-4_18MaRDI QIDQ5429398zbMATH OpenOpenAlexFDO

Authors Chiu-Yuen Koo, Jonathan Katz

Publication date 29 November 2007

Published in Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72540-4_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Improving the Round Complexity of VSS in Point-to-Point Networks
• Improving the round complexity of VSS in point-to-point networks
• scientific article; zbMATH DE number 1942420
• The broadcast message complexity of secure multiparty computation
• Broadcast-optimal two-round MPC

Cited in

(10)

• Probabilistic termination and composability of cryptographic protocols
• Constant-round linear-broadcast secure computation with penalties
• Secure computation with minimal interaction, revisited
• Broadcast (and round) efficient verifiable secret sharing
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Optimal extension protocols for Byzantine broadcast and agreement
• On expected constant-round protocols for Byzantine agreement
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
• Probabilistic Termination and Composability of Cryptographic Protocols
• Improving the round complexity of VSS in point-to-point networks

This page was built for publication: Round-Efficient Secure Computation in Point-to-Point Networks

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