Dongwon Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dongwon Lee has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Yongsoo Song
Seoul National University
4 shared publications - Jinyeong Seo
Seoul National University, Seoul, Republic of Korea
3 shared publications - Hyesun Kwak
Seoul National University
2 shared publications Dan Dongseong Kim
1 shared publication- Duhyeong Kim
Intel Labs
1 shared publication - Hyoungshick Kim
Sungkyunkwan University
1 shared publication
Latest Publications
- 29 February 2024
- Published by Springer Nature
- p. 403-430
A General Framework of Homomorphic Encryption for Multiple Parties with Non-interactive Key-Aggregation
- 29 February 2024
- Published by Springer Nature
- p. 403-430
A General Framework of Homomorphic Encryption for Multiple Parties with Non-interactive Key-Aggregation
- Open Access
- 15 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 726-740
Asymptotically Faster Multi-Key Homomorphic Encryption from Homomorphic Gadget Decomposition
Homomorphic Encryption (HE) is a cryptosytem that allows us to perform an arbitrary computation on encrypted data. The standard HE, however, has a disadvantage in that the authority is concentrated in the secret key owner since computations can only be performed on ciphertexts encrypted under the same secret key. To resolve this issue, research is underway on Multi-Key Homomorphic Encryption (MKHE), which is a variant of HE supporting computations on ciphertexts possibly encrypted under different keys. Despite its ability to provide privacy for multiple parties, existing MKHE schemes suffer from poor performance due to the cost of multiplication which grows at least quadratically with the number of keys involved. In this paper, we revisit the work of Chen et al. (ACM CCS 2019) on MKHE schemes from CKKS and BFV and significantly improve their performance. Specifically, we redesign the multi-key multiplication algorithm and achieve an asymptotically optimal complexity that grows linearly with the number of keys. Our construction relies on a new notion of gadget decomposition, which we call homomorphic gadget decomposition, where arithmetic operations can be performed over the decomposed vectors with guarantee of its functionality. Finally, we implement our MKHE schemes and demonstrate their benchmarks. For example, our multi-key CKKS multiplication takes only 0.5, 1.0, and 1.9 seconds compared to 1.6, 5.9, and 23.0 seconds of the previous work when 8, 16, and 32 keys are involved, respectively.
- 15 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 726-740
Open AccessAsymptotically Faster Multi-Key Homomorphic Encryption from Homomorphic Gadget Decomposition
Homomorphic Encryption (HE) is a cryptosytem that allows us to perform an arbitrary computation on encrypted data. The standard HE, however, has a disadvantage in that the authority is concentrated in the secret key owner since computations can only be performed on ciphertexts encrypted under the same secret key. To resolve this issue, research is underway on Multi-Key Homomorphic Encryption (MKHE), which is a variant of HE supporting computations on ciphertexts possibly encrypted under different keys. Despite its ability to provide privacy for multiple parties, existing MKHE schemes suffer from poor performance due to the cost of multiplication which grows at least quadratically with the number of keys involved. In this paper, we revisit the work of Chen et al. (ACM CCS 2019) on MKHE schemes from CKKS and BFV and significantly improve their performance. Specifically, we redesign the multi-key multiplication algorithm and achieve an asymptotically optimal complexity that grows linearly with the number of keys. Our construction relies on a new notion of gadget decomposition, which we call homomorphic gadget decomposition, where arithmetic operations can be performed over the decomposed vectors with guarantee of its functionality. Finally, we implement our MKHE schemes and demonstrate their benchmarks. For example, our multi-key CKKS multiplication takes only 0.5, 1.0, and 1.9 seconds compared to 1.6, 5.9, and 23.0 seconds of the previous work when 8, 16, and 32 keys are involved, respectively.
- 9 August 2023
- Published by Springer Nature
- p. 549-580
Toward Practical Lattice-Based Proof of Knowledge from Hint-MLWE
- 9 August 2023
- Published by Springer Nature
- p. 549-580
Toward Practical Lattice-Based Proof of Knowledge from Hint-MLWE
- 9 August 2023
- Published by Springer Nature
- p. 70-92
Accelerating HE Operations from Key Decomposition Technique
- 9 August 2023
- Published by Springer Nature
- p. 70-92
Accelerating HE Operations from Key Decomposition Technique
- 16 January 2023
- Published by Elsevier in Future Generation Computer Systems
- Vol. 142, 351-363
PP–GSM: Privacy-preserving graphical security model for security assessment as a service
- 16 January 2023
- Published by Elsevier in Future Generation Computer Systems
- Vol. 142, 351-363
PP–GSM: Privacy-preserving graphical security model for security assessment as a service