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

T2 - 10th International Symposium on Foundations and Practice of Security, FPS 2017

Y2 - 23 October 2017 through 25 October 2017

ER -