Round-optimal black-box multiparty computation from polynomial-time assumptions

DOI10.1007/978-3-031-91092-0_12MaRDI QIDQ6891250zbMATH OpenFDO

Authors Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91092-0_12

zbMATH Keywords

secure multiparty computation with dishonest majority

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A new approach to round-optimal secure multiparty computation
• Advances in Cryptology – CRYPTO 2004
• ATLAS: efficient and scalable MPC in the honest majority setting
• Black-box, round-efficient secure computation via non-malleability amplification
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Constant round non-malleable protocols using one way functions
• Constant-round non-malleable commitments from sub-exponential one-way functions
• Efficient oblivious transfer protocols
• Founding Cryptography on Oblivious Transfer – Efficiently
• Four round secure computation without setup
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 2009981 (Why is no real title available?)
• List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
• 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 and communication-efficient multiparty computation
• Round-optimal black-box MPC in the plain model
• Round-optimal multi-party computation with identifiable abort
• Round-optimal secure multi-party computation
• Secure multiparty computation with minimal interaction
• Smooth projective hashing and two-message oblivious transfer
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• The Exact Round Complexity of Secure Computation
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Trapdoor hash functions and their applications
• Two-message statistically sender-private OT from LWE
• Two-round MPC: information-theoretic and black-box
• Two-round multiparty secure computation from minimal assumptions
• Zero-knowledge proofs from secure multiparty computation

Cited in

(1)

• Broadcast-optimal secure computation from black-box oblivious transfer

This page was built for publication: Round-optimal black-box multiparty computation from polynomial-time assumptions

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