@inproceedings{a88729600cfb44b091eebc307b22b61b,
title = "More efficient constant-round multi-party computation from BMR and SHE",
abstract = "We present a multi-party computation protocol in the case of dishonest majority which has very low round complexity. Our protocol sits philosophically between Gentry{\textquoteright}s Fully Homomorphic Encryption based protocol and the SPDZ-BMR protocol of Lindell et al. (CRYPTO 2015). Our protocol avoids various inefficiencies of the previous two protocols. Compared to Gentry{\textquoteright}s protocol we only require Somewhat Homomorphic Encryption (SHE). Whilst in comparison to the SPDZ-BMR protocol we require only a quadratic complexity in the number of players (as opposed to cubic), we have fewer rounds, and we require less proofs of correctness of ciphertexts. Additionally, we present a variant of our protocol which trades the depth of the garbling circuit (computed using SHE) for some more multiplications in the offline and online phases.",
author = "Yehuda Lindell and Smart, {Nigel P.} and Eduardo Soria-Vazquez",
note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2016.; 14th International Conference on Theory of Cryptography, TCC 2016-B ; Conference date: 31-10-2016 Through 03-11-2016",
year = "2016",
doi = "10.1007/978-3-662-53641-4_21",
language = "الإنجليزيّة",
isbn = "9783662536407",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "554--581",
editor = "Adam Smith and Martin Hirt",
booktitle = "Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings",
address = "ألمانيا",
}