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

Bootstrapping for 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:23Z -
dc.date.created 2020-09-08 ko
dc.date.issued 2018-04-29 ko
dc.identifier.citation Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2018, pp.360 - 384 ko
dc.identifier.issn 0302-9743 ko
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/48443 -
dc.description.abstract This paper extends the leveled homomorphic encryption scheme for an approximate arithmetic of Cheon et al. (ASIACRYPT 2017) to a fully homomorphic encryption, i.e.,we propose a new technique to refresh low-level ciphertexts based on Gentry��s bootstrapping procedure. The modular reduction operation is the main bottleneck in the homomorphic evaluation of the decryption circuit. We exploit a scaled sine function as an approximation of the modular reduction operation and present an efficient evaluation strategy. Our method requires only one homomorphic multiplication for each of iterations and so the total computation cost grows linearly with the depth of the decryption circuit. We also show how to recrypt packed ciphertexts on the RLWE construction with an open-source implementation. For example, it takes 139.8s to refresh a ciphertext that encrypts 128numbers with 12bits of precision, yielding an amortized rate of 1.1seconds per slot. ? International Association for Cryptologic Research 2018. ko
dc.language 영어 ko
dc.publisher Springer Verlag ko
dc.title Bootstrapping for approximate homomorphic encryption ko
dc.type CONFERENCE ko
dc.identifier.scopusid 2-s2.0-85045958202 ko
dc.type.rims CONF ko
dc.identifier.doi 10.1007/978-3-319-78381-9_14 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