Paper 2015/671

Privacy-preserving Frequent Itemset Mining for Sparse and Dense Data

Peeter Laud and Alisa Pankova

Abstract

Frequent itemset mining is a task that can in turn be used for other purposes such as associative rule mining. One problem is that the data may be sensitive, and its owner may refuse to give it for analysis in plaintext. There exist many privacy-preserving solutions for frequent itemset mining, but in any case enhancing the privacy inevitably spoils the efficiency. Leaking some less sensitive information such as data density might improve the efficiency. In this paper, we devise an approach that works better for sparse matrices and compare it to the related work that uses similar security requirements on similar secure multiparty computation platform.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Preprint. MINOR revision.
Keywords
frequent itemset miningsecure multiparty computation
Contact author(s)
peeter @ cyber ee
History
2015-07-05: received
Short URL
https://ia.cr/2015/671
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/671,
      author = {Peeter Laud and Alisa Pankova},
      title = {Privacy-preserving Frequent Itemset Mining for Sparse and Dense Data},
      howpublished = {Cryptology ePrint Archive, Paper 2015/671},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/671}},
      url = {https://eprint.iacr.org/2015/671}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.