Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 197

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Privacy-Preserving-Outsourced Association Rule Mining on Vertically Partitioned Databases

Li, Lichun, Lu, Rongxing, Choo, Kim-Kwang Raymond, Datta, Anwitaman, Shao, Jun · 2016 · IEEE Transactions on Information Forensics and Security

Abstract

Association rule mining and frequent itemset mining are two popular and widely studied data analysis techniques for a range of applications. In this paper, we focus on privacy-preserving mining on vertically partitioned databases. In such a scenario, data owners wish to learn the association rules or frequent itemsets from a collective data set and disclose as little information about their (sensitive) raw data as possible to other data owners and third parties. To ensure data privacy, we design an efficient homomorphic encryption scheme and a secure comparison scheme. We then propose a cloud-aided frequent itemset mining solution, which is used to build an association rule mining solution. Our solutions are designed for outsourced databases that allow multiple data owners to efficiently share their data securely without compromising on data privacy. Our solutions leak less information about the raw data than most existing solutions. In comparison to the only known solution achieving a similar privacy level as our proposed solutions, the performance of our proposed solutions is three to five orders of magnitude higher. Based on our experiment findings using different parameters and data sets, we demonstrate that the run time in each of our solutions is only one order higher than that in the best non-privacy-preserving data mining algorithms. Since both data and computing work are outsourced to the cloud servers, the resource consumption at the data owner end is very low.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tifs.2016.2561241

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Cited by

See all 197

Metadata

Authors
Li, L., Lu, R., Choo, K.-K. R., Datta, A., & Shao, J.
Venue
IEEE Transactions on Information Forensics and Security
Published
2016-08
Volume
11
Issue
8
Pages
1847-1861
ISSN
  • 1556-6013 (ISSN-L)
  • 1556-6021
OpenAlex
W2345464210
Cited by
197
References
4
FWCI
26.28
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Privacy-Preserving-Outsourced Association Rule Mining on Vertically Partitioned Databases. https://app.cochat.ai/papers/10.1109/tifs.2016.2561241
The paper
Li, L., Lu, R., Choo, K.-K. R., Datta, A., & Shao, J. (2016). Privacy-Preserving-Outsourced Association Rule Mining on Vertically Partitioned Databases. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2016.2561241

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.