") does not match the recommended repository name for your site ("").
", so that your site can be accessed directly at "http://".
However, if the current repository name is intended, you can ignore this message by removing "{% include widgets/debug_repo_name.html %}" in index.html.
",
which does not match the baseurl ("") configured in _config.yml.
baseurl in _config.yml to "".
Kevin Nam, Youyeon Joo, Seungjin Ha, Hyungon Moon$\dagger$, Yunheung Paek$\dagger$ ($\dagger$ corresponding author)
ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2026
Recent HE-based Private Inference (PI) systems improve the accuracy--performance trade-off via a layer-wise scheme and parameter switching, yet remain bottlenecked by fire-and-forget execution in which the server alone performs costly ciphertext management. This paper presents HEPIC, an HE-based PI system that explores a different design point by leveraging client interventions for ciphertext managements.
Kevin Nam, Youyeon Joo, Seungjin Ha, Hyungon Moon$\dagger$, Yunheung Paek$\dagger$ ($\dagger$ corresponding author)
2026
Recent HE-based Private Inference (PI) systems improve the accuracy--performance trade-off via a layer-wise scheme and parameter switching, yet remain bottlenecked by fire-and-forget execution in which the server alone performs costly ciphertext management. This paper presents HEPIC, an HE-based PI system that explores a different design point by leveraging client interventions for ciphertext managements.
Kevin Nam*, Youyeon Joo*, Seungjin Ha, Yunheung Paek$\dagger$ (* equal contribution, $\dagger$ corresponding author)
USENIX Security Symposium (USENIX Sec), 2025
Existing works adopt an eager approximation (EA) strategy to approximate non-arithmetic functions (NAFs), which statically replaces each NAF with a fixed polynomial, locking in computational errors and limiting optimization opportunities. We propose SLOTHE, a lazy approximation (LA) solution that recursively decomposes NAF codes into arithmetic and nonarithmetic sub-functions, selectively approximating only the non-arithmetic components when required.
Kevin Nam*, Youyeon Joo*, Seungjin Ha, Yunheung Paek$\dagger$ (* equal contribution, $\dagger$ corresponding author)
2025
Existing works adopt an eager approximation (EA) strategy to approximate non-arithmetic functions (NAFs), which statically replaces each NAF with a fixed polynomial, locking in computational errors and limiting optimization opportunities. We propose SLOTHE, a lazy approximation (LA) solution that recursively decomposes NAF codes into arithmetic and nonarithmetic sub-functions, selectively approximating only the non-arithmetic components when required.