Go to the top
## Electrical & Computer Engineering

Aaram Yun

Assistant Professor / UNIST
## INTRO

## profile

## research

## publications

## education

**Aaram Yun**

Aaram Yun

My research area is cryptography, that is, design and analysis of provably secure cryptographic services. Currently, I am especially interested in

**Homomorphic cryptography**: unlike conventional cryptography, homomorphic cryptography allows secure processing of cryptographically protected data, like encrypted ciphertexts or authenticated data, by third parties. I am especially interested in homomorphic authentication and verifiable computation.

**Post-quantum cryptography**: due to Shor’s algorithm, most of currently existing public-key cryptography will be broken, once a practical quantum computer is built. Post-quantum cryptography is to design cryptosystems secure even against quantum computers. I am interested in both the foundational computational problems and the proof methodology for post-quantum cryptography.

**Computational/mathematical foundations of cryptography**: hardness of fundamental computational problems based on lattices, elliptic curves, or factorization. Also I am interested in computational complexity theory and algorithms.

**Computer security/applied cryptography**: applying cryptographic techniques to build secure computer systems.

I am **Aaram Yun**, associate professor in School of ECE, UNIST. My research area is cryptography, and I lead the Cryptography and Secure Computation Lab.

**Associate professor
Cryptography and Secure Computation Lab
School of Electrical and Computer Engineering**

Tel.: +82-52-217-2118

Email: aaramyun@unist.ac.kr

Here is my current (as of writing this ) curriculum vitae: aaramyun_cv

My research area is cryptography, that is, design and analysis of provably secure cryptographic services. Currently, I am especially interested in

**Homomorphic cryptography**: unlike conventional cryptography, homomorphic cryptography allows secure processing of cryptographically protected data, like encrypted ciphertexts or authenticated data, by third parties. I am especially interested in homomorphic authentication and verifiable computation.

**Post-quantum cryptography**: due to Shor’s algorithm, most of currently existing public-key cryptography will be broken, once a practical quantum computer is built. Post-quantum cryptography is to design cryptosystems secure even against quantum computers. I am interested in both the foundational computational problems and the proof methodology for post-quantum cryptography.

**Computational/mathematical foundations of cryptography**: hardness of fundamental computational problems based on lattices, elliptic curves, or factorization. Also I am interested in computational complexity theory and algorithms.

**Computer security/applied cryptography**: applying cryptographic techniques to build secure computer systems.

**International Journals**

- Aaram Yun, “Discrete Subgroups of the Special Linear Groups with Thin Limit Sets”, Transactions of the American Mathematical Society, vol. 369(1), pp. 365–407, 2017.
- Jung Hee Cheon, Jinsu Kim, Moon Sung Lee, Aaram Yun, “CRT-based Fully Homomorphic Encryption over the Integers”, Information Sciences, vol. 310, pp. 149-162, 2015.
- Shoichi Hirose, Je Hong Park, Aaram Yun, “A Simple Variant of the Merkle-Damgård Scheme with a Permutation”, Journal of Cryptology, vol. 25(2), pp. 271-309, 2012.
- Aaram Yun, Je Hong Park, Jooyoung Lee, “On Lai-Massey and Quasi-Feistel Ciphers”, Designs, Codes, and Cryptography, vol. 58, no. 1, pp. 45-72, 2011.
- Aaram Yun, Jung Hee Cheon, Yongdae Kim, “On Homomorphic Signatures for Network Coding”, IEEE Transactions on Computers, vol. 59, no. 9, pp. 1295-1296, 2010.

**International Conferences**

- Fang Song, Aaram Yun, “Quantum Security of NMAC and Related Constructions”, Proceedings of CRYPTO 2017, Lecture Notes in Computer Science, vol. 10402, pp. 283–309, Springer, 2017.
- Aaram Yun, “Generic Hardness of the Multiple Discrete Logarithm Problem”, Proceedings of EUROCRYPT 2015, Lecture Notes in Computer Science, vol. 9057, pp. 817-836, Springer, 2015.
- Chihong Joo, Aaram Yun, “Homomorphic Authenticated Encryption Secure Against Chosen-Ciphertext Attack”, Proceedings of ASIACRYPT 2014, Lecture Notes in Computer Science, vol. 8874, pp. 173-192, Springer, 2014.
- Jung Hee Cheon, Jean-Sébastien Coron, Jinsu Kim, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi, Aaram Yun, “Batch Fully Homomorphic Encryption Over the Integers”, Proceedings of EUROCRYPT 2013, Lecture Notes in Computer Science, vol. 7881, pp. 315-335, Springer, 2013.
- Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim, “Measuring the Mixing Time of Social Graphs”, Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement (IMC’10), Melbourne, Australia, 2010.
- Aaram Yun, Chunhui Shi, Yongdae Kim, “On Protecting Integrity and Confidentiality of Cryptographic File System for Outsourced Storage”, Proceedings of CCSW 2009: The ACM Cloud Computing Security Workshop, pp. 67-76, 2009.
- Vishal Saraswat, Aaram Yun, “Anonymous Signatures Revisited”, Proceedings of ProvSec 2009, pp. 140-153, 2009.
- Shoichi Hirose, Je Hong Park, Aaram Yun, “A Simple Variant of the Merkle-Damgård Scheme with a Permutation”, Proceedings of Asiacrypt 2007, pp. 113–129, 2007.
- Hongbo Yu, Xiaoyun Wang, Aaram Yun, Sangwoo Park, “Cryptanalysis of the Full HAVAL with 4 and 5 Passes”, Proceedings of FSE 2006, Lecture Notes in Computer Science, vol. 4047, pp. 89–110, Springer, 2006.
- Hong-Su Cho, Sangwoo Park, Soo Hak Sung, Aaram Yun, “Collision Search Attack for 53-Step HAS-160″, Proceedings of ICISC 2006, Lecture Notes in Computer Science, vol. 4296, pp. 286–295, 2006.
- Aaram Yun, Soo Hak Sung, Sangwoo Park, Donghoon Chang, Seokhie Hong, Hong-Su Cho, “Finding Collision on 45-Step HAS-160″, Proceedings of ICISC 2005, Lecture Notes in Computer Science, vol. 3935, pp. 146–155, Springer, 2005.
- Aaram Yun, Jaeheon Kim, Dong Hoon Lee, “Cryptanalysis of a Divisor Class Group Based Public-Key Cryptosystem”, Proceedings of ANTS 2004, pp. 442–450, Springer, 2004.

Also: DBLP

052-217-2118