Sciweavers

Share
IACR
2016

Fast Multiparty Multiplications from shared bits

5 years 6 months ago
Fast Multiparty Multiplications from shared bits
We study the question of securely multiplying N-bit integers that are stored in binary representation, in the context of protocols for dishonest majority with preprocessing. We achieve communication complexity O(N) using only secure operations over small fields F2 and Fp with log(p) ≈ log(N). For semi-honest security we achieve communication O(N)2O(log∗ (N)) using only secure operations over F2. This improves over the straightforward solution of simulating a Boolean multiplication circuit, both asymptotically and in practice.
Ivan Damgård, Tomas Toft, Rasmus Winther Zak
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where IACR
Authors Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias
Comments (0)
books