Browse > Article
http://dx.doi.org/10.5392/JKCA.2013.13.08.036

Technical Trend of Fully Homomorphic Encryption  

Jeong, Myoung In (육군사관학교 수학과)
Publication Information
The Journal of the Korea Contents Association / v.13, no.8, 2013 , pp. 36-43 More about this Journal
Abstract
Fully homomorphic encryption is a cryptography system in which coded data can be searched and statistically processed without decryption. Fully homomorphic encryption has accelerated searching speed by minimizing time spent on encryption and decryption. In addition, it is also known to prevent leakage of any data decoded for statistical reasons. Also, it is expected to protect personal information stored in the cloud computing environment which is becoming commercialized. Since the 1970s when fully homomorphic encryption was first introduced, it has been researched to develop the algorithm that satisfy effectiveness and functionality. We will take the reader through a journey of these developments and provide a glimpse of the exciting research directions that lie ahead.
Keywords
Fully Homomorphic Encryption; Cloud Computing;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 M. V. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, "fully homomorphic encryption over the integers," Advances in Cryptology - EUROCRYPT, Lecture Notes in Computer Science, Vol.6110, pp.24-43, 2010.
2 김선주, 김진묵, 조인준, "모바일 클라우드 서비스상에서 준동형 암호 기반의 형상 관리 방안", 한국정보통신학회논문지, 제16권, 제10호, pp.2217-2223, 2012.
3 송유진, 박광용, "데이터베이스 아웃소싱을 위한 준동형성 암호기술", 정보보호학회지, 제19권, 제3호, pp.80-89, 2009.   과학기술학회마을
4 R. Rivest, L. Addleman, and M. Dertouzos, "On data banks and privacy homomorphism," In Foundations of Secure Computation, pp.169-177, 1978.
5 I. Damgard and M. Jurik, "A Generalization, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System," Public Key Cryptography - PKC, pp.119-136, 2001.
6 P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," EUROCRYPT, pp.223-238, 1999.
7 S. Galbraith, "Elliptic curve Paillier schemes," Journal of Cryptology - JOC, Vol.15, No.2, pp.129-138, 2002.   DOI
8 C. Gentry, "Fully homomorphic encryption using ideal lattices," ACM Symposium on Theory of Computing - STOC, pp.169-178, 2009.
9 D. Boneh, E. Goh, and K. Nissm, "Evaluating 2-DNF formulars on ciphertexts," Theory of Cryptography, pp.325-341, 2005.
10 J. H. Cheon, J. S. Coron, J. Kim, M. S. Lee, T. Lepoint, M. Tibouchi, and A. Yun, "Batch fully hoomorphic encryption over the integers," Advances in Cryptology - EUROCRYPT, Lecture Notes in Computer Science, Vol.7881, pp.315-335, 2013.
11 C. Gentry and S. Halevi, "Implementing gentry's fully homomorphic encryption scheme," Advances in Cryptology - EUROCRYPT, Lecture Notes in Computer Science, Vol.6632, pp.129-148, 2011.
12 http://terms.naver.com/entry.nhn?cid=200000000&docId=1350825&mobile&categoryId=200000756
13 http://outsourcedbits.org/2012/06/26/applying-fully-homomorphic-encryption-part-1/