Privacy-preserving equality test towards big data

Tushar Kanti Saha, Takeshi Koshiba

    研究成果: Conference contribution

    1 引用 (Scopus)

    抄録

    In this paper, we review the problem of private batch equality test (PriBET) that was proposed by Saha and Koshiba (3rd APWConCSE 2016). They described this problem to find the equality of an integer within a set of integers between two parties who do not want to reveal their information if they do not equal. For this purpose, they proposed the PriBET protocol along with a packing method using the binary encoding of data. Their protocol was secured by using ring-LWE based somewhat homomorphic encryption (SwHE) in the semi-honest model. But this protocol is not fast enough to address the big data problem in some practical applications. To solve this problem, we propose a base-N fixed length encoding based PriBET protocol using SwHE in the same semi-honest model. Here we did our experiments for finding the equalities of 8–64-bit integers. Furthermore, our experiments show that our protocol is able to evaluate more than one million (resp. 862 thousand) of equality comparisons per minute for 8-bit (resp. 16-bit) integers with an encoding size of base 256 (resp. 65536). Besides, our protocol works more than 8–20 in magnitude than that of Saha and Koshiba.

    元の言語English
    ホスト出版物のタイトルFoundations and Practice of Security - 10th International Symposium, FPS 2017, Revised Selected Papers
    出版者Springer-Verlag
    ページ95-110
    ページ数16
    ISBN(印刷物)9783319756493
    DOI
    出版物ステータスPublished - 2018 1 1
    イベント10th International Symposium on Foundations and Practice of Security, FPS 2017 - Nancy, France
    継続期間: 2017 10 232017 10 25

    出版物シリーズ

    名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    10723 LNCS
    ISSN(印刷物)0302-9743
    ISSN(電子版)1611-3349

    Other

    Other10th International Symposium on Foundations and Practice of Security, FPS 2017
    France
    Nancy
    期間17/10/2317/10/25

    Fingerprint

    Privacy Preserving
    Equality
    Cryptography
    Batch
    Homomorphic Encryption
    Encoding
    Integer
    Experiments
    Packing
    Experiment
    Big data
    Binary
    Ring
    Evaluate
    Model

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    これを引用

    Saha, T. K., & Koshiba, T. (2018). Privacy-preserving equality test towards big data. : Foundations and Practice of Security - 10th International Symposium, FPS 2017, Revised Selected Papers (pp. 95-110). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10723 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-319-75650-9_7

    Privacy-preserving equality test towards big data. / Saha, Tushar Kanti; Koshiba, Takeshi.

    Foundations and Practice of Security - 10th International Symposium, FPS 2017, Revised Selected Papers. Springer-Verlag, 2018. p. 95-110 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 10723 LNCS).

    研究成果: Conference contribution

    Saha, TK & Koshiba, T 2018, Privacy-preserving equality test towards big data. : Foundations and Practice of Security - 10th International Symposium, FPS 2017, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 10723 LNCS, Springer-Verlag, pp. 95-110, 10th International Symposium on Foundations and Practice of Security, FPS 2017, Nancy, France, 17/10/23. https://doi.org/10.1007/978-3-319-75650-9_7
    Saha TK, Koshiba T. Privacy-preserving equality test towards big data. : Foundations and Practice of Security - 10th International Symposium, FPS 2017, Revised Selected Papers. Springer-Verlag. 2018. p. 95-110. (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-75650-9_7
    Saha, Tushar Kanti ; Koshiba, Takeshi. / Privacy-preserving equality test towards big data. Foundations and Practice of Security - 10th International Symposium, FPS 2017, Revised Selected Papers. Springer-Verlag, 2018. pp. 95-110 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{2176ab06e33d4995a176318d924c4994,
    title = "Privacy-preserving equality test towards big data",
    abstract = "In this paper, we review the problem of private batch equality test (PriBET) that was proposed by Saha and Koshiba (3rd APWConCSE 2016). They described this problem to find the equality of an integer within a set of integers between two parties who do not want to reveal their information if they do not equal. For this purpose, they proposed the PriBET protocol along with a packing method using the binary encoding of data. Their protocol was secured by using ring-LWE based somewhat homomorphic encryption (SwHE) in the semi-honest model. But this protocol is not fast enough to address the big data problem in some practical applications. To solve this problem, we propose a base-N fixed length encoding based PriBET protocol using SwHE in the same semi-honest model. Here we did our experiments for finding the equalities of 8–64-bit integers. Furthermore, our experiments show that our protocol is able to evaluate more than one million (resp. 862 thousand) of equality comparisons per minute for 8-bit (resp. 16-bit) integers with an encoding size of base 256 (resp. 65536). Besides, our protocol works more than 8–20 in magnitude than that of Saha and Koshiba.",
    keywords = "Base-N encoding, Homomorphic encryption, Packing method, Private batch equality test",
    author = "Saha, {Tushar Kanti} and Takeshi Koshiba",
    year = "2018",
    month = "1",
    day = "1",
    doi = "10.1007/978-3-319-75650-9_7",
    language = "English",
    isbn = "9783319756493",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer-Verlag",
    pages = "95--110",
    booktitle = "Foundations and Practice of Security - 10th International Symposium, FPS 2017, Revised Selected Papers",

    }

    TY - GEN

    T1 - Privacy-preserving equality test towards big data

    AU - Saha, Tushar Kanti

    AU - Koshiba, Takeshi

    PY - 2018/1/1

    Y1 - 2018/1/1

    N2 - In this paper, we review the problem of private batch equality test (PriBET) that was proposed by Saha and Koshiba (3rd APWConCSE 2016). They described this problem to find the equality of an integer within a set of integers between two parties who do not want to reveal their information if they do not equal. For this purpose, they proposed the PriBET protocol along with a packing method using the binary encoding of data. Their protocol was secured by using ring-LWE based somewhat homomorphic encryption (SwHE) in the semi-honest model. But this protocol is not fast enough to address the big data problem in some practical applications. To solve this problem, we propose a base-N fixed length encoding based PriBET protocol using SwHE in the same semi-honest model. Here we did our experiments for finding the equalities of 8–64-bit integers. Furthermore, our experiments show that our protocol is able to evaluate more than one million (resp. 862 thousand) of equality comparisons per minute for 8-bit (resp. 16-bit) integers with an encoding size of base 256 (resp. 65536). Besides, our protocol works more than 8–20 in magnitude than that of Saha and Koshiba.

    AB - In this paper, we review the problem of private batch equality test (PriBET) that was proposed by Saha and Koshiba (3rd APWConCSE 2016). They described this problem to find the equality of an integer within a set of integers between two parties who do not want to reveal their information if they do not equal. For this purpose, they proposed the PriBET protocol along with a packing method using the binary encoding of data. Their protocol was secured by using ring-LWE based somewhat homomorphic encryption (SwHE) in the semi-honest model. But this protocol is not fast enough to address the big data problem in some practical applications. To solve this problem, we propose a base-N fixed length encoding based PriBET protocol using SwHE in the same semi-honest model. Here we did our experiments for finding the equalities of 8–64-bit integers. Furthermore, our experiments show that our protocol is able to evaluate more than one million (resp. 862 thousand) of equality comparisons per minute for 8-bit (resp. 16-bit) integers with an encoding size of base 256 (resp. 65536). Besides, our protocol works more than 8–20 in magnitude than that of Saha and Koshiba.

    KW - Base-N encoding

    KW - Homomorphic encryption

    KW - Packing method

    KW - Private batch equality test

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

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

    U2 - 10.1007/978-3-319-75650-9_7

    DO - 10.1007/978-3-319-75650-9_7

    M3 - Conference contribution

    AN - SCOPUS:85042551362

    SN - 9783319756493

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

    SP - 95

    EP - 110

    BT - Foundations and Practice of Security - 10th International Symposium, FPS 2017, Revised Selected Papers

    PB - Springer-Verlag

    ER -