TY - GEN
T1 - Secure frequent pattern mining by fully homomorphic encryption with ciphertext packing
AU - Imabayashi, Hiroki
AU - Ishimaki, Yu
AU - Umayabara, Akira
AU - Sato, Hiroki
AU - Yamana, Hayato
PY - 2016
Y1 - 2016
N2 - We propose an efficient and secure frequent pattern mining protocol with fully homomorphic encryption (FHE). Nowadays, secure outsourcing of mining tasks to the cloud with FHE is gaining attentions. However, FHE execution leads to significant time and space complexities. P3CC, the first proposed secure protocol with FHE for frequent pattern mining, has these particular problems. It generates ciphertexts for each component in item-transaction data matrix, and executes numerous operations over the encrypted components. To address this issue, we propose efficient frequent pattern mining with ciphertext packing. By adopting the packing method, our scheme will require fewer ciphertexts and associated operations than P3CC, thus reducing both encryption and calculation times. We have also optimized its implementation by reusing previously produced results so as not to repeat calculations. Our experimental evaluation shows that the proposed scheme runs 430 times faster than P3CC, and uses 94.7% less memory with 10, 000 transactions data.
AB - We propose an efficient and secure frequent pattern mining protocol with fully homomorphic encryption (FHE). Nowadays, secure outsourcing of mining tasks to the cloud with FHE is gaining attentions. However, FHE execution leads to significant time and space complexities. P3CC, the first proposed secure protocol with FHE for frequent pattern mining, has these particular problems. It generates ciphertexts for each component in item-transaction data matrix, and executes numerous operations over the encrypted components. To address this issue, we propose efficient frequent pattern mining with ciphertext packing. By adopting the packing method, our scheme will require fewer ciphertexts and associated operations than P3CC, thus reducing both encryption and calculation times. We have also optimized its implementation by reusing previously produced results so as not to repeat calculations. Our experimental evaluation shows that the proposed scheme runs 430 times faster than P3CC, and uses 94.7% less memory with 10, 000 transactions data.
KW - Ciphertext packing
KW - Cloud computing
KW - Frequent pattern mining
KW - Fully homomorphic encryption
KW - Privacy preservation
UR - http://www.scopus.com/inward/record.url?scp=84990040829&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84990040829&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-47072-6_12
DO - 10.1007/978-3-319-47072-6_12
M3 - Conference contribution
AN - SCOPUS:84990040829
SN - 9783319470719
VL - 9963 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 181
EP - 195
BT - Data Privacy Management and Security Assurance - 11th International Workshop, DPM 2016 and 5th International Workshop, QASA 2016, Proceedings
PB - Springer Verlag
T2 - 11th International Workshop on Data Privacy Management and Security Assurance, DPM 2016 and 5th International Workshop on Quantitative Aspects in Security Assurance, QASA 2016
Y2 - 26 September 2016 through 27 September 2016
ER -