Cryptology ePrint Archive: Report 2004/318
Available versions in chronological order
20041123:180233 (posted 23-Nov-2004 18:02:33 UTC)
Upper Bounds on the Communication Complexity of Cryptographic Multiparty Computation
Martin Hirt and Jesper Buus Nielsen
20060510:121012 (posted 10-May-2006 12:10:12 UTC)
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
]