PRIVACY-PRESERVING-

OUTSOURCED
ASSOCIATION RULE
MINING ON VERTICALLY
PARTITIONED DATABASES
Ersha Aisyah Elfaiz
1214100076
Eko Andi Prastiyo
1214100080
PROBLEM

Dua orang pebsnis yang berbeda akan berkolaborasi, untuk

mengetahui pattern pembelian suatu komunitas melalui joint
database
Namun, setiap pebisnis harus menjaga beberapa data penting
perusahaan, seperti rahasia perusahaan (harus dilindungi dari
pebisnis lain yang melakukan joint database) serta harus menjaga
privacy dari customer ( tergantung regulasi yang berlaku)
DATA

Sistem model ini menggunakan dua atau lebih data owner dan
sebuah awan (a cloud). Masing-masing data owner memiliki private
database, owner data mengenkripsikan private database terlebih
dahulu kepada outsourcing, dan outsourcing mengekripsikannya ke
awan.
TASK YANG DIGUNAKAN

frequent itemset mining

association rule mining
SOLUSI

Frequent Itemset Mining Solution

Association Rule Mining Solution
Association Rule Mining Solution
All data owners and the cloud run the above frequent itemset mining
solution to mine frequent itemsets.
Initialization for secure threshold comparison
A data owner, say D1, computes cz = E(SK, 0), and sends cz along with n1 and
n2 to the cloud where n1 and n2 are two integers and n2/n1 = Tc. To prevent D1
deviating from the cooperative mining protocol, the cloud sends these received
ciphertexts and plaintexts to other data owners for correctness verification.
The cloud generates association rule candidates.
An association rule candidate X Y that satisfies X Y = and X Y, where X,
Y and X Y are seemingly frequent itemsets.
 For each association rule candidate, the cloud verifies its confidence in a
privacy-preserving manner, and computes its ECVR (Encrypted Confidence
Verifying Result).
E(Supp(X Y ) n1 Supp(X) n2) = (E(Supp(X Y )) n1 + (cz
E(Supp(X))) n2) mod p
misalkan Supp(X Y )n1Supp(X)n2
Supp(X Y ) n1 Supp(X) n2 0
Supp(X Y )/Supp(X) n2/n1
Conf (X Y ) Tc
The cloud returns association rule candidates, ESVRs and ECVRs to involved
data owners.
The data owners decrypt association rule candidates, ESVRs and ECVRs to
find out real association rules.
For a candidate X Y , the data owners will need to first decrypt the ESVR
of X Y to determine whether Supp(X Y ) Ts or not. If yes, the data
owners will decrypt the ECVR of X Y to determine whether Conf (X Y )
Tc or not. If yes, the data owners will then decrypt X and Y to recover the
real association rule in plaintext (as items in the joint database are
encrypted with a substitution cipher).