An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation

Ivan Damgaard, Rasmus Lauritsen, and Tomas Toft

Abstract

Recent developments in Multi-party Computation (MPC) has resulted in very efficient protocols for dishonest majority in the pre- processing model. In particular, two very promising protocols for Boolean circuits have been proposed by Nielsen et al. (nicknamed TinyOT) and by Damg &#778;ard and Zakarias (nicknamed MiniMac). While TinyOT has already been implemented, we present in this paper the first implemen- tation of MiniMac, using the same platform as the existing TinyOT im- plementation. We also suggest several improvements of MiniMac, both on the protocol design and implementation level. In particular, we sug- gest a modification of MiniMac that achieves increased parallelism at no extra communication cost. This gives an asymptotic improvement of the original protocol as well as an 8-fold speed-up of our implementation. We compare the resulting protocol to TinyOT for the case of secure com- putation in parallel of a large number of AES encryptions and find that it performs better than results reported so far on TinyOT, on the same hardware.

Note: Added thanks for European Research Council Grant

Available format(s)
Category
Implementation
Publication info
Preprint. MINOR revision.
Keywords
Contact author(s)
rwl @ cs au dk
History
2014-07-04: revised
See all versions
Short URL
https://ia.cr/2014/289

CC BY

BibTeX

@misc{cryptoeprint:2014/289,
author = {Ivan Damgaard and Rasmus Lauritsen and Tomas Toft},
title = {An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation},
howpublished = {Cryptology ePrint Archive, Paper 2014/289},
year = {2014},
note = {\url{https://eprint.iacr.org/2014/289}},
url = {https://eprint.iacr.org/2014/289}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.