Name
Abstract | ||
|---|---|---|
We propose a multi-party computation (MPC) protocol over Z(2k) secure against actively corrupted majority from somewhat homomorphic encryption. The main technical contributions are: (i) a new efficient packing method for Z(2k)-messages in lattice-based somewhat homomorphic encryption schemes, (ii) a simpler reshare protocol for leveldependent packings, (iii) a more efficient zero-knowledge proof of plaintext knowledge on cyclotomic rings Z[X]/Phi(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 Z(2k) considerably, but also provide a toolkit that can be leveraged when designing other cryptographic primitives over Z(2k). |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-84245-1_15 | ADVANCES IN CRYPTOLOGY - CRYPTO 2021, PT II |
Keywords | DocType | Volume |
Multi-party computation, Dishonest majority, Homomorphic encryption, Packing method, Zero-knowledge proof, Z(2k) | Conference | 12826 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jung Hee Cheon | 1 | 1787 | 129.74 |
| Dongwoo Kim | 2 | 0 | 0.34 |
| Keewoo Lee | 3 | 16 | 3.02 |