Browse

Secure searching of biomarkers through hybrid homomorphic encryption scheme

DC Field Value Language
dc.contributor.authorKim, Miran-
dc.contributor.authorSong, Yongsoo-
dc.contributor.authorCheon, Jung Hee-
dc.date.accessioned2017-11-02T05:50:07Z-
dc.date.available2017-11-02T14:51:21Z-
dc.date.issued2017-07-26-
dc.identifier.citationBMC Medical Genomics, 10(Suppl 2):42ko_KR
dc.identifier.issn1755-8794-
dc.identifier.urihttps://hdl.handle.net/10371/138301-
dc.descriptionThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/ publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.ko_KR
dc.description.abstractAbstract

Background
As genome sequencing technology develops rapidly, there has lately been an increasing need to keep genomic data secure even when stored in the cloud and still used for research. We are interested in designing a protocol for the secure outsourcing matching problem on encrypted data.

Method
We propose an efficient method to securely search a matching position with the query data and extract some information at the position. After decryption, only a small amount of comparisons with the query information should be performed in plaintext state. We apply this method to find a set of biomarkers in encrypted genomes. The important feature of our method is to encode a genomic database as a single element of polynomial ring.

Result
Since our method requires a single homomorphic multiplication of hybrid scheme for query computation, it has the advantage over the previous methods in parameter size, computation complexity, and communication cost. In particular, the extraction procedure not only prevents leakage of database information that has not been queried by user but also reduces the communication cost by half. We evaluate the performance of our method and verify that the computation on large-scale personal data can be securely and practically outsourced to a cloud environment during data analysis. It takes about 3.9 s to search-and-extract the reference and alternate sequences at the queried position in a database of size 4M.

Conclusion
Our solution for finding a set of biomarkers in DNA sequences shows the progress of cryptographic techniques in terms of their capability can support real-world genome data analysis in a cloud environment.
ko_KR
dc.description.sponsorshipPublication of this article has been funded by IT R&D program of MSIP/KEIT(No. B0717-16-0098).ko_KR
dc.language.isoenko_KR
dc.publisherBioMed Centralko_KR
dc.subjectHomomorphic encryptionko_KR
dc.subjectBiomarkersko_KR
dc.titleSecure searching of biomarkers through hybrid homomorphic encryption schemeko_KR
dc.typeArticleko_KR
dc.contributor.AlternativeAuthor김미란-
dc.contributor.AlternativeAuthor송용수-
dc.contributor.AlternativeAuthor천정희-
dc.identifier.doi10.1186/s12920-017-0280-3-
dc.language.rfc3066en-
dc.rights.holderThe Author(s)-
dc.date.updated2017-10-03T16:51:14Z-
Appears in Collections:
College of Natural Sciences (자연과학대학)Dept. of Mathematical Sciences (수리과학부)Journal Papers (저널논문_수리과학부)
Files in This Item:
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse