Cryptology ePrint Archive: Report 2004/318

Available versions in chronological order


Upper Bounds on the Communication Complexity of Cryptographic Multiparty Computation
Martin Hirt and Jesper Buus Nielsen

Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Martin Hirt and Jesper Buus Nielsen
Publication Info: Asiacrypt 2005


[ Cryptology ePrint archive ]