Secure frequent pattern mining by fully homomorphic encryption with ciphertext packing

Hiroki Imabayashi, Yu Ishimaki, Akira Umayabara, Hiroki Sato, Hayato Yamana

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

    6 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationData Privacy Management and Security Assurance - 11th International Workshop, DPM 2016 and 5th International Workshop, QASA 2016, Proceedings
    PublisherSpringer Verlag
    Pages181-195
    Number of pages15
    Volume9963 LNCS
    ISBN (Print)9783319470719
    DOIs
    Publication statusPublished - 2016
    Event11th International Workshop on Data Privacy Management and Security Assurance, DPM 2016 and 5th International Workshop on Quantitative Aspects in Security Assurance, QASA 2016 - Heraklion, Crete, Greece
    Duration: 2016 Sep 262016 Sep 27

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume9963 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other11th International Workshop on Data Privacy Management and Security Assurance, DPM 2016 and 5th International Workshop on Quantitative Aspects in Security Assurance, QASA 2016
    CountryGreece
    CityHeraklion, Crete
    Period16/9/2616/9/27

    Keywords

    • Ciphertext packing
    • Cloud computing
    • Frequent pattern mining
    • Fully homomorphic encryption
    • Privacy preservation

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Secure frequent pattern mining by fully homomorphic encryption with ciphertext packing'. Together they form a unique fingerprint.

  • Cite this

    Imabayashi, H., Ishimaki, Y., Umayabara, A., Sato, H., & Yamana, H. (2016). Secure frequent pattern mining by fully homomorphic encryption with ciphertext packing. In Data Privacy Management and Security Assurance - 11th International Workshop, DPM 2016 and 5th International Workshop, QASA 2016, Proceedings (Vol. 9963 LNCS, pp. 181-195). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9963 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-47072-6_12