Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez. Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. In Daniele Micciancio, Thomas Ristenpart, editors, Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II. Volume 12171 of Lecture Notes in Computer Science, pages 562-592, Springer, 2020. [doi]

Abstract

Abstract is missing.