Eunyeong Ahn
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Eunyeong Ahn has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Brent Byunghoon Kang
School of Computing Korea Advanced Institute of Science and Technology (KAIST) Daejeon Republic of Korea
1 shared publication - Byeongsu Woo
Korea Advanced Institute of Science and Technology & CySecuLab, Daejeon, Republic of Korea
1 shared publication - Chihyun Song
KAIST, Daejeon, Republic of Korea
1 shared publication - Daehee Jang
Sungshin Women’s University Department of Convergence Security Engineering
1 shared publication - Hojoon Lee
Sungkyunkwan University, Suwon, Republic of Korea
1 shared publication - Jinsoo Jang
Chungnam National University, Daejeon, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 8 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 1366-1375
GENESIS: A Generalizable, Efficient, and Secure Intra-kernel Privilege Separation
Maintaining the trustworthiness of OS kernels is imperative in upholding any form of security objective within a system. However, most commodity kernel designs are monolithic and subject to frequent changes that may contain or introduce new software bugs. The uniform privilege and single address space of monolithic kernels assist the adversary in turning any vulnerability into a single point of failure. Hence, various isolation designs have been proposed to enable privilege separation within the kernel. However, many of these solutions are architecture-dependent because of their reliance on specific features of their target architecture. We present Genesis, a novel architecture-agnostic intra-kernel privilege separation design. The main idea behind Genesis is to construct a self-protected execution environment while leveraging only de facto hardware security primitives in contemporary architectures. This design principle paves the way for a generalizable intra-kernel solution that is applicable to other architectures without significant redesign effort; specifically, our prototype leverages a general hardware feature, such as supervisor-mode access prevention (SMAP) on x86-64, over which we realize two essential techniques for intra-kernel isolation: kernel deprivileging and secure domain switching. While sustaining its generalizability, Genesis introduces moderate performance overhead in standard benchmarks and real-world applications, such as Nginx and Memcached.
- 8 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 1366-1375
Open AccessGENESIS: A Generalizable, Efficient, and Secure Intra-kernel Privilege Separation
Maintaining the trustworthiness of OS kernels is imperative in upholding any form of security objective within a system. However, most commodity kernel designs are monolithic and subject to frequent changes that may contain or introduce new software bugs. The uniform privilege and single address space of monolithic kernels assist the adversary in turning any vulnerability into a single point of failure. Hence, various isolation designs have been proposed to enable privilege separation within the kernel. However, many of these solutions are architecture-dependent because of their reliance on specific features of their target architecture. We present Genesis, a novel architecture-agnostic intra-kernel privilege separation design. The main idea behind Genesis is to construct a self-protected execution environment while leveraging only de facto hardware security primitives in contemporary architectures. This design principle paves the way for a generalizable intra-kernel solution that is applicable to other architectures without significant redesign effort; specifically, our prototype leverages a general hardware feature, such as supervisor-mode access prevention (SMAP) on x86-64, over which we realize two essential techniques for intra-kernel isolation: kernel deprivileging and secure domain switching. While sustaining its generalizability, Genesis introduces moderate performance overhead in standard benchmarks and real-world applications, such as Nginx and Memcached.
- Open Access
- 8 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 61707-61720
Efficient Generation of Program Execution Hash
Distributed computing systems often require verifiable computing techniques in case their node is untrusted. To verify a node’s computation result, proof-of-work (PoW) is often utilized as a basis of verifiable computing method; however, this mechanism is only valid for computations producing results based on specific algorithm (e.g., AES decryption). To date, there is no efficient PoW mechanism applicable to arbitrary algorithm or a computation that does not produce any tangible output (e.g., void function). This paper proposes execution hash to serve as a proof for a program’s idempotent computation result without relying on its algorithm. Two versions of execution hash generation methods were designed and implemented and the efficacy was evaluated in terms of performance and reliability. Implementation was based on LLVM/Clang 6.0 and evaluation was based on open-source software, including GNU binutils/coreutils and Google’s OSSFuzz projects.
- 8 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 61707-61720
Open AccessEfficient Generation of Program Execution Hash
Distributed computing systems often require verifiable computing techniques in case their node is untrusted. To verify a node’s computation result, proof-of-work (PoW) is often utilized as a basis of verifiable computing method; however, this mechanism is only valid for computations producing results based on specific algorithm (e.g., AES decryption). To date, there is no efficient PoW mechanism applicable to arbitrary algorithm or a computation that does not produce any tangible output (e.g., void function). This paper proposes execution hash to serve as a proof for a program’s idempotent computation result without relying on its algorithm. Two versions of execution hash generation methods were designed and implemented and the efficacy was evaluated in terms of performance and reliability. Implementation was based on LLVM/Clang 6.0 and evaluation was based on open-source software, including GNU binutils/coreutils and Google’s OSSFuzz projects.