IACR News item: 08 September 2013
Martin Hirt, Daniel Tschudi
ePrint ReportProtocols for general adversaries are ``efficient\'\' in the sense that they require |Z|^O(1) bits of communication. However, as |Z| is usually very large (even exponential in n), the exact exponent is very relevant. In the setting with perfect security, the most efficient protocol known to date communicates |Z|^3 bits; we present a protocol for this setting which communicates |Z|^2 bits. In the setting with statistical security, |Z|^3 bits of communication is needed in general (whereas for a very restricted subclass of adversary structures, a protocol with communication
|Z|^2 bits is known); we present a protocol for this setting (without limitations) which communicates |Z|^1 bits.
Additional news items may be found on the IACR news page.