Revisiting fairness in MPC: polynomial number of parties and general adversarial structures

DOI10.1007/978-3-030-64378-2_21zbMATH Open1485.94075OpenAlexW3116502952MaRDI QIDQ2119062

Dana Dachman-Soled

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-64378-2_21

zbMATH Keywords

symmetric Boolean functionssecure multiparty computation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Boolean functions (94D10)

Related Items (5)

Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ On secure computation of solitary output functionalities with and without broadcast ⋮ Three party secure computation with friends and foes ⋮ Can Alice and Bob guarantee output to Carol? ⋮ Secure multiparty computation with identifiable abort via vindicating release

This page was built for publication: Revisiting fairness in MPC: polynomial number of parties and general adversarial structures

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