Privacy-preserving string search for genome sequences with FHE bootstrapping optimization

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Citations (Scopus)

    Abstract

    Privacy-preserving string search is a crucial task for analyzing genomics-driven big data. In this work, we propose a cryptographic protocol that uses Fully Homomorphic Encryption (FHE) to enable a client to search on a genome sequence database without leaking his/her query to the server. Though FHE supports both addition and multiplication over encrypted data, random noise inside ciphertexts grows with every arithmetic operation especially multiplication, which results in incorrect decryption when the noise amount exceeds its threshold called level. There are two approaches to avoid the incorrect decryption: one is setting the sufficient level that assures correct decryption within the limited number of operations, and the other is resetting the noise by the method called bootstrapping. It is important to find an optimal balance between overhead caused by the level and overhead caused by the bootstrapping, since using higher level deteriorates the performance of all the arithmetic operations, while the more number of bootstrappings causes more expensive overhead. In this study, we propose an efficient approach to minimize the number of bootstrappings while reducing the level as much as possible. Our experimental result shows that it runs at most 10 times faster than a naïve approach.

    Original languageEnglish
    Title of host publicationProceedings - 2016 IEEE International Conference on Big Data, Big Data 2016
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages3989-3991
    Number of pages3
    ISBN (Electronic)9781467390040
    DOIs
    Publication statusPublished - 2017 Feb 2
    Event4th IEEE International Conference on Big Data, Big Data 2016 - Washington, United States
    Duration: 2016 Dec 52016 Dec 8

    Other

    Other4th IEEE International Conference on Big Data, Big Data 2016
    CountryUnited States
    CityWashington
    Period16/12/516/12/8

    Fingerprint

    Cryptography
    Genes
    Servers
    Network protocols
    Genomics
    Big data

    Keywords

    • Bootstrapping
    • Fully Homomorphic Encryption (FHE)
    • Genome Sequence
    • PBWT
    • String Search

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Information Systems
    • Hardware and Architecture

    Cite this

    Ishimaki, Y., Imabayashi, H., Shimizu, K., & Yamana, H. (2017). Privacy-preserving string search for genome sequences with FHE bootstrapping optimization. In Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016 (pp. 3989-3991). [7841085] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/BigData.2016.7841085

    Privacy-preserving string search for genome sequences with FHE bootstrapping optimization. / Ishimaki, Yu; Imabayashi, Hiroki; Shimizu, Kana; Yamana, Hayato.

    Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 3989-3991 7841085.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Ishimaki, Y, Imabayashi, H, Shimizu, K & Yamana, H 2017, Privacy-preserving string search for genome sequences with FHE bootstrapping optimization. in Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016., 7841085, Institute of Electrical and Electronics Engineers Inc., pp. 3989-3991, 4th IEEE International Conference on Big Data, Big Data 2016, Washington, United States, 16/12/5. https://doi.org/10.1109/BigData.2016.7841085
    Ishimaki Y, Imabayashi H, Shimizu K, Yamana H. Privacy-preserving string search for genome sequences with FHE bootstrapping optimization. In Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 3989-3991. 7841085 https://doi.org/10.1109/BigData.2016.7841085
    Ishimaki, Yu ; Imabayashi, Hiroki ; Shimizu, Kana ; Yamana, Hayato. / Privacy-preserving string search for genome sequences with FHE bootstrapping optimization. Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 3989-3991
    @inproceedings{4c3c25e64b6449aeaa5236d6b50c9012,
    title = "Privacy-preserving string search for genome sequences with FHE bootstrapping optimization",
    abstract = "Privacy-preserving string search is a crucial task for analyzing genomics-driven big data. In this work, we propose a cryptographic protocol that uses Fully Homomorphic Encryption (FHE) to enable a client to search on a genome sequence database without leaking his/her query to the server. Though FHE supports both addition and multiplication over encrypted data, random noise inside ciphertexts grows with every arithmetic operation especially multiplication, which results in incorrect decryption when the noise amount exceeds its threshold called level. There are two approaches to avoid the incorrect decryption: one is setting the sufficient level that assures correct decryption within the limited number of operations, and the other is resetting the noise by the method called bootstrapping. It is important to find an optimal balance between overhead caused by the level and overhead caused by the bootstrapping, since using higher level deteriorates the performance of all the arithmetic operations, while the more number of bootstrappings causes more expensive overhead. In this study, we propose an efficient approach to minimize the number of bootstrappings while reducing the level as much as possible. Our experimental result shows that it runs at most 10 times faster than a na{\"i}ve approach.",
    keywords = "Bootstrapping, Fully Homomorphic Encryption (FHE), Genome Sequence, PBWT, String Search",
    author = "Yu Ishimaki and Hiroki Imabayashi and Kana Shimizu and Hayato Yamana",
    year = "2017",
    month = "2",
    day = "2",
    doi = "10.1109/BigData.2016.7841085",
    language = "English",
    pages = "3989--3991",
    booktitle = "Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    address = "United States",

    }

    TY - GEN

    T1 - Privacy-preserving string search for genome sequences with FHE bootstrapping optimization

    AU - Ishimaki, Yu

    AU - Imabayashi, Hiroki

    AU - Shimizu, Kana

    AU - Yamana, Hayato

    PY - 2017/2/2

    Y1 - 2017/2/2

    N2 - Privacy-preserving string search is a crucial task for analyzing genomics-driven big data. In this work, we propose a cryptographic protocol that uses Fully Homomorphic Encryption (FHE) to enable a client to search on a genome sequence database without leaking his/her query to the server. Though FHE supports both addition and multiplication over encrypted data, random noise inside ciphertexts grows with every arithmetic operation especially multiplication, which results in incorrect decryption when the noise amount exceeds its threshold called level. There are two approaches to avoid the incorrect decryption: one is setting the sufficient level that assures correct decryption within the limited number of operations, and the other is resetting the noise by the method called bootstrapping. It is important to find an optimal balance between overhead caused by the level and overhead caused by the bootstrapping, since using higher level deteriorates the performance of all the arithmetic operations, while the more number of bootstrappings causes more expensive overhead. In this study, we propose an efficient approach to minimize the number of bootstrappings while reducing the level as much as possible. Our experimental result shows that it runs at most 10 times faster than a naïve approach.

    AB - Privacy-preserving string search is a crucial task for analyzing genomics-driven big data. In this work, we propose a cryptographic protocol that uses Fully Homomorphic Encryption (FHE) to enable a client to search on a genome sequence database without leaking his/her query to the server. Though FHE supports both addition and multiplication over encrypted data, random noise inside ciphertexts grows with every arithmetic operation especially multiplication, which results in incorrect decryption when the noise amount exceeds its threshold called level. There are two approaches to avoid the incorrect decryption: one is setting the sufficient level that assures correct decryption within the limited number of operations, and the other is resetting the noise by the method called bootstrapping. It is important to find an optimal balance between overhead caused by the level and overhead caused by the bootstrapping, since using higher level deteriorates the performance of all the arithmetic operations, while the more number of bootstrappings causes more expensive overhead. In this study, we propose an efficient approach to minimize the number of bootstrappings while reducing the level as much as possible. Our experimental result shows that it runs at most 10 times faster than a naïve approach.

    KW - Bootstrapping

    KW - Fully Homomorphic Encryption (FHE)

    KW - Genome Sequence

    KW - PBWT

    KW - String Search

    UR - http://www.scopus.com/inward/record.url?scp=85015159898&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85015159898&partnerID=8YFLogxK

    U2 - 10.1109/BigData.2016.7841085

    DO - 10.1109/BigData.2016.7841085

    M3 - Conference contribution

    SP - 3989

    EP - 3991

    BT - Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -