Fast and space-efficient secure frequent pattern mining by FHE

Hiroki Imabayashi, Yu Ishimaki, Akira Umayabara, Hayato Yamana

    研究成果: Conference contribution

    4 被引用数 (Scopus)

    抄録

    In the big data era, security and privacy concerns are growing. One of the big challenges is secure Frequent Pattern Mining (FPM) over Fully Homomorphic Encryption (FHE). There exist some research efforts aimed at speeding-up, however, we have a big room so as to decrease time and space complexity. Apriori over FHE, in particular, generates a large number of ciphertexts during the support calculation, which results in both large time and space complexity. To solve it, we proposed a speedup technique, around 430 times faster and 18.9 times smaller memory usage than the state-of-the-art method, by adopting both packing and caching mechanism. In this paper, we further propose to decrease the memory space used for caching. Our goal is to discard redundant cached ciphertexts without increasing the execution time. Our experimental results show that our method decreases the memory usage by 6.09% at most in comparison with our previous method without increasing the execution time.

    本文言語English
    ホスト出版物のタイトルProceedings - 2016 IEEE International Conference on Big Data, Big Data 2016
    出版社Institute of Electrical and Electronics Engineers Inc.
    ページ3983-3985
    ページ数3
    ISBN(電子版)9781467390040
    DOI
    出版ステータスPublished - 2017 2 2
    イベント4th IEEE International Conference on Big Data, Big Data 2016 - Washington, United States
    継続期間: 2016 12 52016 12 8

    Other

    Other4th IEEE International Conference on Big Data, Big Data 2016
    国/地域United States
    CityWashington
    Period16/12/516/12/8

    ASJC Scopus subject areas

    • コンピュータ ネットワークおよび通信
    • 情報システム
    • ハードウェアとアーキテクチャ

    フィンガープリント

    「Fast and space-efficient secure frequent pattern mining by FHE」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル