IACR News item: 16 July 2015
Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
ePrint Report
We present a technique to achieve O(n) communication complexity per multiplication for a wide class of robust practical MPC protocols. Previously such a communication complexity was only known in the case of non-robust protocols in the full threshold, dishonest majority setting. In particular our technique applies to robust threshold computationally secure protocols in the case of t
Additional news items may be found on the IACR news page.