Abstract
We propose a multi-party computation (MPC) protocol over Z2k secure against actively corrupted majority from somewhat homomorphic encryption. The main technical contributions are: (i) a new efficient packing method for Z2k -messages in lattice-based somewhat homomorphic encryption schemes, (ii) a simpler reshare protocol for level-dependent packings, (iii) a more efficient zero-knowledge proof of plaintext knowledge on cyclotomic rings Z[ X] / ΦM(X) with M being a prime. Integrating them, our protocol shows from 2.2x upto 4.8x improvements in amortized communication costs compared to the previous best results. Our techniques not only improve the efficiency of MPC over Z2k considerably, but also provide a toolkit that can be leveraged when designing other cryptographic primitives over Z2k.
Author supplied keywords
Cite
CITATION STYLE
Cheon, J. H., Kim, D., & Lee, K. (2021). MHz2k: MPC from HE over Z2k with New Packing, Simpler Reshare, and Better ZKP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12826 LNCS, pp. 426–456). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-84245-1_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
