Homomorphic Encryption and its Application to Blockchain
DOI:
https://doi.org/10.54097/fcis.v3i1.6343Keywords:
Cryptography, Public key cryptography, Privacy computing, Fully homo- morphic encryption, Blockchain applicationAbstract
The concept, method, algorithm and application of the advanced field of cryptography, homomorphic encryption, as well as its application to the field of blockchain are discussed in this paper. There are various forms of homomorphic encryption and they can be classified into three categories: partially homomorphic encryption, hierarchical homomorphic encryption and fully homomorphic encryption. We explain the concept, method and algorithm for each category with down to earth examples. The milestone example of RSA algorithm is explained which is still widely used in the internet and in blockchain as well. Applications of homomorphic encryption depends on efficiency of implementation which has been in good progress in recent years.
Downloads
References
Adleman L. Rivest R L, Shamir A. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21, 1978.
Gentry C. Fully homomorphic encryption using ideal lattices. Proceedings of the forty-first annual ACM symposium on Theory of computing, pages 169– 178, 2009.
Vercauteren F. Fan J. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptology ePrint Archive, 2012.
Kim M et al. Cheon H J, Kim A. Homomorphic Encryption for Arithmetic of Approx-imate Numbers. ADVANCES IN CRYPTOLOGY - ASIACRYPT, 2017 PT I, pages 409–437, 2017.
Vaikuntanathan V. Brakerski Z, Gentry C. Fully Homomorphic Encryption without Bootstrap- ping. IACR Cryptology ePrint Archive, 2011.
