Two Round Multiparty Computation via Multi-key FHE

By Pratyay Mukherjee, Daniel Wichs. International Conference on the Theory and Application of Cryptographic Techniques, 2016

327 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Homomorphic Encryption (2017, methodology): “A construction based on LWE was first described by Clear and McGoldrick [25], and later significantly simplified by Mukherjee and Wichs [73] and improved further by Peikert and Shiehian [80].”
Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network Inference (2019, methodology): “After that, Clear and McGoldrick [19] suggested a multi-key variant of GSW together with ciphertext extension technique to design an MKHE scheme and it was simplified by Mukherjee and Wichs [45].”
Privacy‐preserving federated learning based on multi‐key homomorphic encryption (2021, background): “Further simpliﬁcations in the ciphertext extension process, and multiple rounds of multi-party computation (MPC) have been introduced in [19], however, the size of the ciphertext in these schemes increases exponentially with the number of participants, which causes communication and storage costs…”
A Pragmatic Introduction to Secure Multi-Party Computation (2019, unknown): “We do not specifically consider outsourcing computation or FHE further in this book, but note that some of the techniques developed to improve multi-party computation also apply to FHE and outsourcing.”