BROWSE

Related Researcher

Author's Photo

Kim, Miran
Research Interests
  • My research mainly focuses on secure computation, which aims to develop advanced cryptographic primitives to protect the sensitive data of individuals. I have been actively working on the development of privacy-preserving protocols in a wide range of applications such as cyber-physical systems, data query processing, genomic computation, and machine learning.

ITEM VIEW & DOWNLOAD

A Full RNS Variant of Approximate Homomorphic Encryption

DC Field Value Language
dc.contributor.author Cheon, Jung Hee ko
dc.contributor.author Han,Kyoohyung ko
dc.contributor.author Kim, Andrey ko
dc.contributor.author Kim, Miran ko
dc.contributor.author Song, Yongsoo ko
dc.date.available 2020-10-22T08:12:15Z -
dc.date.created 2020-09-08 ko
dc.date.issued 2019- 8 ko
dc.identifier.citation 25th International Conference on Selected Areas in Cryptography, SAC 2018, pp.347 - 368 ko
dc.identifier.issn 0302-9743 ko
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/48434 -
dc.description.abstract The technology of Homomorphic Encryption (HE) has improved rapidly in a few years. The newest HE libraries are efficient enough to use in practical applications. For example, Cheon et al. (ASIACRYPT��17) proposed an HE scheme with support for arithmetic of approximate numbers. An implementation of this scheme shows the best performance in computation over the real numbers. However, its implementation could not employ a core optimization technique based on the Residue Number System (RNS) decomposition and the Number Theoretic Transformation (NTT). In this paper, we present a variant of approximate homomorphic encryption which is optimal for implementation on standard computer system. We first introduce a new structure of ciphertext modulus which allows us to use both the RNS decomposition of cyclotomic polynomials and the NTT conversion on each of the RNS components. We also suggest new approximate modulus switching procedures without any RNS composition. Compared to previous exact algorithms requiring multi-precision arithmetic, our algorithms can be performed by using only word size (64-bit) operations. Our scheme achieves a significant performance gain from its full RNS implementation. For example, compared to the earlier implementation, our implementation showed speed-ups 17.3, 6.4, and 8.3 times for decryption, constant multiplication, and homomorphic multiplication, respectively, when the dimension of a cyclotomic ring is 32768. We also give experimental result for evaluations of some advanced circuits used in machine learning or statistical analysis. Finally, we demonstrate the practicability of our library by applying to machine learning algorithm. For example, our single core implementation takes 1.8??min to build a logistic regression model from encrypted data when the dataset consists of 575 samples, compared to the previous best result 3.5??min using four cores. ? 2019, Springer Nature Switzerland AG. ko
dc.language 영어 ko
dc.publisher Springer Verlag ko
dc.title A Full RNS Variant of Approximate Homomorphic Encryption ko
dc.type CONFERENCE ko
dc.identifier.scopusid 2-s2.0-85060674384 ko
dc.type.rims CONF ko
dc.identifier.doi 10.1007/978-3-030-10970-7_16 ko
dc.identifier.url https://link.springer.com/chapter/10.1007%2F978-3-030-10970-7_16 ko
Appears in Collections:
CSE_Conference Papers

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show simple item record

qrcode

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU