Secure two-party computation with fairness -- a necessary design principle

DOI10.1007/978-3-319-70500-2_19zbMath1410.94092OpenAlexW2766999502MaRDI QIDQ1690208

Tal Rabin, Yehuda Lindell

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70500-2_19

zbMATH Keywords

fairnesssecure two-party computationdefinitions of security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

On the structure of unconditional UC hybrid protocols ⋮ On fully secure MPC with solitary output ⋮ From fairness to full security in multiparty computation

This page was built for publication: Secure two-party computation with fairness -- a necessary design principle