Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

Martin Hirt, Jesper Buus Nielsen. Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. IACR Cryptology ePrint Archive, 2004:318, 2004. [doi]

Abstract

Abstract is missing.