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

DOI10.1007/978-3-540-72540-4_18zbMath1141.94361OpenAlexW2129746927MaRDI QIDQ5429398

Chiu-Yuen Koo, Jonathan N. 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)

Related Items (8)

Secure Computation with Minimal Interaction, Revisited ⋮ Improving the round complexity of VSS in point-to-point networks ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols

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