Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption

Arisa Tajima, Hiroki Sato, Hayato Yamana

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

    Abstract

    Cloud database services have attracted considerable interest with the increase in the amount of data to be analyzed. Delegating data management to cloud services, however, causes security and privacy issues because cloud services are not always trustable. In this study, we address the problem of answering join queries across outsourced private datasets while maintaining data confidentiality. We particularly consider a scenario in which two data owners each own a set of elements and a querier asks the cloud to perform join operations to obtain the size of the common elements in the two datasets. To process the join operations without revealing the contents of data to the cloud, we propose two protocols, a basic protocol and a querier-friendly protocol, which adopt a functionality of outsourced private set intersection cardinality (OPSI-CA) with fully homomorphic encryption (FHE) and bloom filters. The querier-friendly protocol achieves a reduction in communication and computation costs for the querier. Our experimental results show that it takes 436 s for the basic protocol and 298 s for the querier-friendly protocol to execute the join query on the two datasets with 100 elements each. The novelty of this study is that our protocols are the first approaches for outsourced join operations adopting FHE.

    Original languageEnglish
    Title of host publicationProceedings of 2018 6th International Conference on Multimedia Computing and Systems, ICMCS 2018
    EditorsAbdelaaziz El Hibaoui, Youssef Zaz, Mohamed Essaaidi
    PublisherIEEE Computer Society
    ISBN (Electronic)9781538662205
    DOIs
    Publication statusPublished - 2018 Nov 6
    Event6th International Conference on Multimedia Computing and Systems, ICMCS 2018 - Rabat, Morocco
    Duration: 2018 May 102018 May 12

    Publication series

    NameInternational Conference on Multimedia Computing and Systems -Proceedings
    Volume2018-May

    Conference

    Conference6th International Conference on Multimedia Computing and Systems, ICMCS 2018
    CountryMorocco
    CityRabat
    Period18/5/1018/5/12

    Fingerprint

    Homomorphic Encryption
    Cryptography
    Cardinality
    Intersection
    Join
    Information management
    Communication
    Costs
    Query
    Bloom Filter
    Confidentiality
    Data Management
    Privacy
    Scenarios
    Experimental Results

    Keywords

    • bloom filter
    • cloud computing
    • component
    • FHE
    • outsourced join queries
    • private set intersection

    ASJC Scopus subject areas

    • Media Technology
    • Computer Science Applications
    • Computer Networks and Communications
    • Theoretical Computer Science

    Cite this

    Tajima, A., Sato, H., & Yamana, H. (2018). Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption. In A. El Hibaoui, Y. Zaz, & M. Essaaidi (Eds.), Proceedings of 2018 6th International Conference on Multimedia Computing and Systems, ICMCS 2018 [8525881] (International Conference on Multimedia Computing and Systems -Proceedings; Vol. 2018-May). IEEE Computer Society. https://doi.org/10.1109/ICMCS.2018.8525881

    Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption. / Tajima, Arisa; Sato, Hiroki; Yamana, Hayato.

    Proceedings of 2018 6th International Conference on Multimedia Computing and Systems, ICMCS 2018. ed. / Abdelaaziz El Hibaoui; Youssef Zaz; Mohamed Essaaidi. IEEE Computer Society, 2018. 8525881 (International Conference on Multimedia Computing and Systems -Proceedings; Vol. 2018-May).

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

    Tajima, A, Sato, H & Yamana, H 2018, Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption. in A El Hibaoui, Y Zaz & M Essaaidi (eds), Proceedings of 2018 6th International Conference on Multimedia Computing and Systems, ICMCS 2018., 8525881, International Conference on Multimedia Computing and Systems -Proceedings, vol. 2018-May, IEEE Computer Society, 6th International Conference on Multimedia Computing and Systems, ICMCS 2018, Rabat, Morocco, 18/5/10. https://doi.org/10.1109/ICMCS.2018.8525881
    Tajima A, Sato H, Yamana H. Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption. In El Hibaoui A, Zaz Y, Essaaidi M, editors, Proceedings of 2018 6th International Conference on Multimedia Computing and Systems, ICMCS 2018. IEEE Computer Society. 2018. 8525881. (International Conference on Multimedia Computing and Systems -Proceedings). https://doi.org/10.1109/ICMCS.2018.8525881
    Tajima, Arisa ; Sato, Hiroki ; Yamana, Hayato. / Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption. Proceedings of 2018 6th International Conference on Multimedia Computing and Systems, ICMCS 2018. editor / Abdelaaziz El Hibaoui ; Youssef Zaz ; Mohamed Essaaidi. IEEE Computer Society, 2018. (International Conference on Multimedia Computing and Systems -Proceedings).
    @inproceedings{5c5e3d7fd2344d87b72420217b00f77c,
    title = "Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption",
    abstract = "Cloud database services have attracted considerable interest with the increase in the amount of data to be analyzed. Delegating data management to cloud services, however, causes security and privacy issues because cloud services are not always trustable. In this study, we address the problem of answering join queries across outsourced private datasets while maintaining data confidentiality. We particularly consider a scenario in which two data owners each own a set of elements and a querier asks the cloud to perform join operations to obtain the size of the common elements in the two datasets. To process the join operations without revealing the contents of data to the cloud, we propose two protocols, a basic protocol and a querier-friendly protocol, which adopt a functionality of outsourced private set intersection cardinality (OPSI-CA) with fully homomorphic encryption (FHE) and bloom filters. The querier-friendly protocol achieves a reduction in communication and computation costs for the querier. Our experimental results show that it takes 436 s for the basic protocol and 298 s for the querier-friendly protocol to execute the join query on the two datasets with 100 elements each. The novelty of this study is that our protocols are the first approaches for outsourced join operations adopting FHE.",
    keywords = "bloom filter, cloud computing, component, FHE, outsourced join queries, private set intersection",
    author = "Arisa Tajima and Hiroki Sato and Hayato Yamana",
    year = "2018",
    month = "11",
    day = "6",
    doi = "10.1109/ICMCS.2018.8525881",
    language = "English",
    series = "International Conference on Multimedia Computing and Systems -Proceedings",
    publisher = "IEEE Computer Society",
    editor = "{El Hibaoui}, Abdelaaziz and Youssef Zaz and Mohamed Essaaidi",
    booktitle = "Proceedings of 2018 6th International Conference on Multimedia Computing and Systems, ICMCS 2018",

    }

    TY - GEN

    T1 - Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption

    AU - Tajima, Arisa

    AU - Sato, Hiroki

    AU - Yamana, Hayato

    PY - 2018/11/6

    Y1 - 2018/11/6

    N2 - Cloud database services have attracted considerable interest with the increase in the amount of data to be analyzed. Delegating data management to cloud services, however, causes security and privacy issues because cloud services are not always trustable. In this study, we address the problem of answering join queries across outsourced private datasets while maintaining data confidentiality. We particularly consider a scenario in which two data owners each own a set of elements and a querier asks the cloud to perform join operations to obtain the size of the common elements in the two datasets. To process the join operations without revealing the contents of data to the cloud, we propose two protocols, a basic protocol and a querier-friendly protocol, which adopt a functionality of outsourced private set intersection cardinality (OPSI-CA) with fully homomorphic encryption (FHE) and bloom filters. The querier-friendly protocol achieves a reduction in communication and computation costs for the querier. Our experimental results show that it takes 436 s for the basic protocol and 298 s for the querier-friendly protocol to execute the join query on the two datasets with 100 elements each. The novelty of this study is that our protocols are the first approaches for outsourced join operations adopting FHE.

    AB - Cloud database services have attracted considerable interest with the increase in the amount of data to be analyzed. Delegating data management to cloud services, however, causes security and privacy issues because cloud services are not always trustable. In this study, we address the problem of answering join queries across outsourced private datasets while maintaining data confidentiality. We particularly consider a scenario in which two data owners each own a set of elements and a querier asks the cloud to perform join operations to obtain the size of the common elements in the two datasets. To process the join operations without revealing the contents of data to the cloud, we propose two protocols, a basic protocol and a querier-friendly protocol, which adopt a functionality of outsourced private set intersection cardinality (OPSI-CA) with fully homomorphic encryption (FHE) and bloom filters. The querier-friendly protocol achieves a reduction in communication and computation costs for the querier. Our experimental results show that it takes 436 s for the basic protocol and 298 s for the querier-friendly protocol to execute the join query on the two datasets with 100 elements each. The novelty of this study is that our protocols are the first approaches for outsourced join operations adopting FHE.

    KW - bloom filter

    KW - cloud computing

    KW - component

    KW - FHE

    KW - outsourced join queries

    KW - private set intersection

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

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

    U2 - 10.1109/ICMCS.2018.8525881

    DO - 10.1109/ICMCS.2018.8525881

    M3 - Conference contribution

    AN - SCOPUS:85063232008

    T3 - International Conference on Multimedia Computing and Systems -Proceedings

    BT - Proceedings of 2018 6th International Conference on Multimedia Computing and Systems, ICMCS 2018

    A2 - El Hibaoui, Abdelaaziz

    A2 - Zaz, Youssef

    A2 - Essaaidi, Mohamed

    PB - IEEE Computer Society

    ER -