Broadcast-optimal secure computation from black-box oblivious transfer

DOI10.1007/978-981-95-5116-3_5MaRDI QIDQ7232555zbMATH OpenFDO

Authors Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Yu Xia

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5116-3_5

zbMATH Keywords

round-complexity of multi-party computation protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• A lower bound for the time to assure interactive consistency
• Advances in Cryptology – CRYPTO 2004
• Authenticated Algorithms for Byzantine Agreement
• Black-box constant-round secure 2PC with succinct communication
• Broadcast-optimal four-round MPC in the plain model
• Broadcast-optimal two round MPC with an honest majority
• Broadcast-optimal two-round MPC
• Efficient secure two-party protocols. Techniques and constructions
• scientific article; zbMATH DE number 4101088 (Why is no real title available?)
• List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
• Minimizing setup in broadcast-optimal two round MPC
• On fully secure MPC with solitary output
• On the round complexity of black-box secure MPC
• Promise zero knowledge and its applications to round optimal MPC
• Round optimal secure multiparty computation from minimal assumptions
• Round-optimal black-box MPC in the plain model
• Round-optimal black-box multiparty computation from polynomial-time assumptions
• Round-optimal black-box protocol compilers
• Round-optimal black-box secure computation from two-round malicious OT
• Round-optimal secure multi-party computation
• Round-optimal secure multiparty computation with honest majority
• Secure multi-party computation without agreement
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Separating two-round secure computation from oblivious transfer
• Theory of Cryptography
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Two round multiparty computation via multi-key FHE
• Two-round MPC: information-theoretic and black-box
• Two-round multiparty secure computation from minimal assumptions

This page was built for publication: Broadcast-optimal secure computation from black-box oblivious transfer

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