Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption
Source abstract
Abstract
Aiming at the problems of large ciphertext size and low efficiency in the current secure multi-party computation (SMC) protocol based on fully homomorphic encryption (FHE), the paper proves that the fully homomorphic encryption scheme that supports multi-bit encryption proposed by Chen Li et al. satisfies the key homomorphism. Based on this scheme and threshold decryption, a three-round, interactive, leveled, secure multi-party computation protocol under the Common Random String (CRS) model is designed. The protocol is proved to be safe under the semi-honest model and the semi-malicious model. From the non-interactive zero-knowledge proof, it can be concluded that the protocol is also safe under the malicious model. Its security can be attributed to the Decisional Learning With Errors (DLWE) and a variant of this problem (some-are-errorless LWE). Compared with the existing secure multi-party computation protocol based on fully homomorphic encryption under the CRS model, the ciphertext size of this protocol is smaller, the efficiency is higher, the storage overhead is smaller, and the overall performance is better than the existing protocol.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Cryptography and Data Security · Complexity and Algorithms in Graphs · Privacy-Preserving Technologies in Data
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Computer and Electronic Information, Guangxi University, Nanning 530004, China
Funding
National Natural Science Foundation of China · Guangxi Innovation-Driven Development Project
References (21)
Show source-provided references
1. On data banks and privacy homomorphisms
2. Gentry, C. (June, January 31). Fully homomorphic encryption using ideal lattices. Proceedings of the forty-first annual ACM symposium on Theory of computing, Bethesda, MD, USA.
3. Brakerski, Z., and Vaikuntanathan, V. (2011, January 22–25). Efficient Fully Homomorphic Encryption from (Standard) LWE. Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, CA, USA.10.1109/FOCS.2011.12 ↗
4. Brakerski, Z., Gentry, C., and Vaikuntanathan, V. (2012, January 8–10). (Leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, Cambridge, MA, USA.10.1145/2090236.2090262 ↗
5. Brakerski, Z. (2012, January 19–23). Fully homomorphic encryption without modulus switching from classical GapSVP. Proceedings of the Annual Cryptology Conference, Santa Barbara, CA, USA.10.1007/978-3-642-32009-5_50 ↗
6. Gentry, C., Sahai, A., and Waters, B. (2013, January 18–22). Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. Proceedings of the Annual Cryptology Conference, Santa Barbara, CA, USA.10.1007/978-3-642-40041-4_5 ↗
7. Cheon, J.H., Kim, A., Kim, M., and Song, Y. (2017, January 3–7). Homomorphic encryption for arithmetic of approximate numbers. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Hong Kong, China.10.1007/978-3-319-70694-8_15 ↗
8. Yao, A.C. (1982, January 3–5). Protocols for secure computations. Proceedings of the IEEE 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), Chicago, IL, USA.10.1109/SFCS.1982.38 ↗
9. López-Alt, A., Tromer, E., and Vaikuntanathan, V. (2012, January 19–22). On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. Proceedings of the forty-fourth Annual ACM Symposium on Theory of Computing, New York, NY, USA.10.1145/2213977.2214086 ↗
10. Hoffstein, J., Pipher, J., and Silverman, J.H. (1998, January 21–25). NTRU: A ring-based public key cryptosystem. Proceedings of the International Algorithmic Number Theory Symposium, Portland, OR, USA.10.1007/BFb0054868 ↗
11. Mukherjee, P., and Wichs, D. (2016, January 8–12). Two round multiparty computation via multi-key FHE. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria.10.1007/978-3-662-49896-5_26 ↗
12. A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE10.1007/s00500-017-2896-9 ↗
13. Kim, E., Lee, H.S., and Park, J. (2018, January 11–13). Towards round-optimal secure multiparty computations: Multikey FHE without a CRS. Proceedings of the Australasian Conference on Information Security and Privacy, Wollongong, Australia.10.1007/978-3-319-93638-3_7 ↗
14. Three Round Secure Multiparty Computation Based on Multi-key Full-Homomorphic Encryption without CRS
15. Li, Z. (2018). Lattice-Based Fully Homomorphic Encryption and Its Applications, Harbin Engineering University.
16. Secure multi-party computing based on multi-bit fully homomorphic encryption
17. Li, Z., Ma, C., Morais, E., and Du, G. (2016, January 4–6). Multi-bit Leveled Homomorphic Encryption via Dual. LWE-Based. Proceedings of the Information Security and Cryptology: 12th International Conference, Inscrypt 2016, Beijing, China.
18. Design of fully homomorphic encryption scheme supporting multi-bit encryption
19. On lattices, learning with errors, random linear codes, and cryptography10.1145/1568318.1568324 ↗
20. Boneh, D., Lewi, K., Montgomery, H., and Raghunathan, A. (2013, January 18–22). Key homomorphic PRFs and their applications. Proceedings of the Annual Cryptology Conference, Santa Barbara, CA, USA.10.1007/978-3-642-40041-4_23 ↗
21. Asharov, G., Jain, A., López-Alt, A., Tromer, E., Vaikuntanathan, V., and Wichs, D. (2012, January 15–19). Multiparty computation with low communication, computation and interaction via threshold FHE. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK.10.1007/978-3-642-29011-4_29 ↗