The Design and Implementation of a Two-Party Protocol Suite for SHAREMIND 3
Pille Pullonen, Dan Bogdanov, Thomas H. Schneider · TUbilio (Technical University of Darmstadt) · 2012
This report introduces the basics of two-party secret sharing protocols based on additive secret sharing implemented in Sharemind. The main contribution is the multiplication protocol which uses Paillier’s additively homomorphic cryptosystem. One approach is to directly use this protocol for multiplication and the other is to generate Beaver’s triples and use them for the multiplication. The benchmarking results show that the protocol that directly uses Paillier’s cryptosystem is slow compared to the native Sharemind protocol, but would be feasible as a precomputation phase. The online protocol using Beaver’s triples outperforms the three-party Sharemind multiplication.