Taechan Kim

Taechan Kim

Auto-generated profile, based on publicly available information

Taechan Kim

NTT Secure Platform Laboratories

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 July 2016
Verified
Book Chapter
Closed access
PDF file
TKTaechan Kim
Taechan Kim
RBRazvan Barbulescu
Razvan Barbulescu


15 November 2023
Verified
Conference Paper
Open access
TKTaechan Kim
Taechan Kim
HKHyesun Kwak
Hyesun Kwak
DLDongwon Lee
Dongwon Lee
JSJinyeong Seo
Jinyeong Seo
YSYongsoo Song
Yongsoo Song
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.

24 October 2016 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
MTMehdi Tibouchi
Mehdi Tibouchi
TKTaechan Kim
Taechan Kim

25 November 2017
Verified
Book Chapter
Closed access
PDF file
TKTaechan Kim
Taechan Kim
CLChangmin Lee
Changmin Lee

1 January 2016 in LMS Journal of Computation and Mathematics
Verified
Journal Article
Closed access
PDF file
JCJung Hee Cheon
Jung Hee Cheon
TKTaechan Kim
Taechan Kim