Designing fully secure protocols for secure two-party computation of constant-domain functions

DOI10.1007/978-3-319-70500-2_20zbMath1410.94061OpenAlexW2724588692MaRDI QIDQ1690209

Nikolaos Makriyannis, Vanesa Daza

Publication date: 19 January 2018

Full work available at URL: http://hdl.handle.net/10230/45567

zbMATH Keywords

fairnesscryptographic protocolssecure two-party computationmalicious adversaries

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

On fully secure MPC with solitary output ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ MPC with friends and foes

This page was built for publication: Designing fully secure protocols for secure two-party computation of constant-domain functions