%0 Conference Proceedings
%T Understanding Privacy Risk of Publishing Decision Trees
%+ Department of Electrical Engineering and Computer Science
%A Zhu, Zutao
%A Du, Wenliang
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 24th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy (DBSEC)
%C Rome, Italy
%Y Sara Foresti; Sushil Jajodia
%I Springer
%3 Data and Applications Security and Privacy XXIV
%V LNCS-6166
%P 33-48
%8 2010-06-21
%D 2010
%R 10.1007/978-3-642-13739-6_3
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X Publishing decision trees can provide enormous benefits to the society. Meanwhile, it is widely believed that publishing decision trees can pose a potential risk to privacy. However, there is not much investigation on the privacy consequence of publishing decision trees. To understand this problem, we need to quantitatively measure privacy risk. Based on the well-established maximum entropy theory, we have developed a systematic method to quantify privacy risks when decision trees are published. Our method converts the knowledge embedded in decision trees into equations and inequalities (called constraints), and then uses nonlinear programming tool to conduct maximum entropy estimate. The estimate results are then used to quantify privacy. We have conducted experiments to evaluate the effectiveness and performance of our method.
%G English
%2 https://inria.hal.science/hal-01056670/document
%2 https://inria.hal.science/hal-01056670/file/_11.pdf
%L hal-01056670
%U https://inria.hal.science/hal-01056670
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6166
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-WG11-3
%~ IFIP-DBSEC
%~ IFIP-2010