Efficient protocols for private database queries

Tushar Kanti Saha, Mayank, Takeshi Koshiba

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

    2 Citations (Scopus)

    Abstract

    We consider the problem of processing private database queries over encrypted data in the cloud. To do this, we propose a protocol for conjunctive query and another for disjunctive query processing using somewhat homomorphic encryption in the semi-honest model. In 2016, Kim et al. [IEEE Trans. on Dependable and Secure Comput.] showed an FHE-based query processing with equality conditions over encrypted data. We improve the performance of processing private conjunctive and disjunctive queries with the low-depth equality circuits than Kim et al.’s circuits. To get the low-depth circuits, we modify the packing methods of Saha and Koshiba [APWConCSE 2016] to support an efficient batch computation for our protocols with a few multiplications. Our implementation shows that our protocols work faster than Kim et al.’s protocols for both conjunctive and disjunctive query processing along with a better security level. We are also able to provide security to both attributes and values appeared in the predicate of the conjunctive and disjunctive queries whereas Kim et al. provided the security to the values only.

    Original languageEnglish
    Title of host publicationData and Applications Security and Privacy XXXI - 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Proceedings
    PublisherSpringer Verlag
    Pages337-348
    Number of pages12
    Volume10359 LNCS
    ISBN (Print)9783319611754
    DOIs
    Publication statusPublished - 2017
    Event31st Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, DBSec 2017 - Philadelphia, United States
    Duration: 2017 Jul 192017 Jul 21

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume10359 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other31st Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, DBSec 2017
    CountryUnited States
    CityPhiladelphia
    Period17/7/1917/7/21

    Fingerprint

    Query processing
    Query Processing
    Query
    Networks (circuits)
    Equality
    Processing
    Homomorphic Encryption
    Cryptography
    Predicate
    Packing
    Batch
    Multiplication
    Attribute
    Model

    Keywords

    • Batch technique
    • Conjunctive
    • Disjunctive
    • Homomorphic Encryption
    • Packing method
    • Private Database Queries

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Saha, T. K., Mayank, & Koshiba, T. (2017). Efficient protocols for private database queries. In Data and Applications Security and Privacy XXXI - 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Proceedings (Vol. 10359 LNCS, pp. 337-348). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10359 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-61176-1_19

    Efficient protocols for private database queries. / Saha, Tushar Kanti; Mayank, ; Koshiba, Takeshi.

    Data and Applications Security and Privacy XXXI - 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Proceedings. Vol. 10359 LNCS Springer Verlag, 2017. p. 337-348 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10359 LNCS).

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

    Saha, TK, Mayank, & Koshiba, T 2017, Efficient protocols for private database queries. in Data and Applications Security and Privacy XXXI - 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Proceedings. vol. 10359 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10359 LNCS, Springer Verlag, pp. 337-348, 31st Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, DBSec 2017, Philadelphia, United States, 17/7/19. https://doi.org/10.1007/978-3-319-61176-1_19
    Saha TK, Mayank , Koshiba T. Efficient protocols for private database queries. In Data and Applications Security and Privacy XXXI - 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Proceedings. Vol. 10359 LNCS. Springer Verlag. 2017. p. 337-348. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-61176-1_19
    Saha, Tushar Kanti ; Mayank, ; Koshiba, Takeshi. / Efficient protocols for private database queries. Data and Applications Security and Privacy XXXI - 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Proceedings. Vol. 10359 LNCS Springer Verlag, 2017. pp. 337-348 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{77b800bf606b4e9ba3c0c9b48b3b2013,
    title = "Efficient protocols for private database queries",
    abstract = "We consider the problem of processing private database queries over encrypted data in the cloud. To do this, we propose a protocol for conjunctive query and another for disjunctive query processing using somewhat homomorphic encryption in the semi-honest model. In 2016, Kim et al. [IEEE Trans. on Dependable and Secure Comput.] showed an FHE-based query processing with equality conditions over encrypted data. We improve the performance of processing private conjunctive and disjunctive queries with the low-depth equality circuits than Kim et al.’s circuits. To get the low-depth circuits, we modify the packing methods of Saha and Koshiba [APWConCSE 2016] to support an efficient batch computation for our protocols with a few multiplications. Our implementation shows that our protocols work faster than Kim et al.’s protocols for both conjunctive and disjunctive query processing along with a better security level. We are also able to provide security to both attributes and values appeared in the predicate of the conjunctive and disjunctive queries whereas Kim et al. provided the security to the values only.",
    keywords = "Batch technique, Conjunctive, Disjunctive, Homomorphic Encryption, Packing method, Private Database Queries",
    author = "Saha, {Tushar Kanti} and Mayank and Takeshi Koshiba",
    year = "2017",
    doi = "10.1007/978-3-319-61176-1_19",
    language = "English",
    isbn = "9783319611754",
    volume = "10359 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "337--348",
    booktitle = "Data and Applications Security and Privacy XXXI - 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Proceedings",
    address = "Germany",

    }

    TY - GEN

    T1 - Efficient protocols for private database queries

    AU - Saha, Tushar Kanti

    AU - Mayank,

    AU - Koshiba, Takeshi

    PY - 2017

    Y1 - 2017

    N2 - We consider the problem of processing private database queries over encrypted data in the cloud. To do this, we propose a protocol for conjunctive query and another for disjunctive query processing using somewhat homomorphic encryption in the semi-honest model. In 2016, Kim et al. [IEEE Trans. on Dependable and Secure Comput.] showed an FHE-based query processing with equality conditions over encrypted data. We improve the performance of processing private conjunctive and disjunctive queries with the low-depth equality circuits than Kim et al.’s circuits. To get the low-depth circuits, we modify the packing methods of Saha and Koshiba [APWConCSE 2016] to support an efficient batch computation for our protocols with a few multiplications. Our implementation shows that our protocols work faster than Kim et al.’s protocols for both conjunctive and disjunctive query processing along with a better security level. We are also able to provide security to both attributes and values appeared in the predicate of the conjunctive and disjunctive queries whereas Kim et al. provided the security to the values only.

    AB - We consider the problem of processing private database queries over encrypted data in the cloud. To do this, we propose a protocol for conjunctive query and another for disjunctive query processing using somewhat homomorphic encryption in the semi-honest model. In 2016, Kim et al. [IEEE Trans. on Dependable and Secure Comput.] showed an FHE-based query processing with equality conditions over encrypted data. We improve the performance of processing private conjunctive and disjunctive queries with the low-depth equality circuits than Kim et al.’s circuits. To get the low-depth circuits, we modify the packing methods of Saha and Koshiba [APWConCSE 2016] to support an efficient batch computation for our protocols with a few multiplications. Our implementation shows that our protocols work faster than Kim et al.’s protocols for both conjunctive and disjunctive query processing along with a better security level. We are also able to provide security to both attributes and values appeared in the predicate of the conjunctive and disjunctive queries whereas Kim et al. provided the security to the values only.

    KW - Batch technique

    KW - Conjunctive

    KW - Disjunctive

    KW - Homomorphic Encryption

    KW - Packing method

    KW - Private Database Queries

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

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

    U2 - 10.1007/978-3-319-61176-1_19

    DO - 10.1007/978-3-319-61176-1_19

    M3 - Conference contribution

    SN - 9783319611754

    VL - 10359 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 337

    EP - 348

    BT - Data and Applications Security and Privacy XXXI - 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Proceedings

    PB - Springer Verlag

    ER -