Information-theoretic broadcast-optimal MPC

DOI10.1007/978-3-032-12287-2_6MaRDI QIDQ7233173zbMATH OpenFDO

Authors Michele Ciampi, Ivan B. Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12287-2_6

zbMATH Keywords

communication complexitycryptographic protocolsinformation-theoretic cryptographyround complexityverifiable secret sharing

Mathematics Subject Classification ID

Information theory (general) (94A15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• Broadcast-optimal four-round MPC in the plain model
• Broadcast-optimal two round MPC with an honest majority
• Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
• Broadcast-optimal two-round MPC
• Foundations of Cryptography
• Secure computation on the web: computing without simultaneous interaction
• Security and composition of multiparty cryptographic protocols
• The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
• The round complexity of perfect MPC with active security and optimal resiliency
• The round complexity of statistical MPC with optimal resiliency
• The round complexity of verifiable secret sharing and secure multicast
• The Round Complexity of Verifiable Secret Sharing Revisited
• The round complexity of verifiable secret sharing: the statistical case
• Two-round secure MPC from indistinguishability obfuscation

This page was built for publication: Information-theoretic broadcast-optimal MPC

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