DocumentCode
1612228
Title
DAG: A Model for Privacy Preserving Computation
Author
Teo, Sin G. ; Jianneng Cao ; Lee, Vincent C. S.
Author_Institution
Monash Univ., Melbourne, VIC, Australia
fYear
2015
Firstpage
289
Lastpage
296
Abstract
Secure multi-party computation (SMC) allows parties to jointly compute a function over their inputs, while keeping every input confidential. It has been extensively applied in privacy-preserving computation, such as privacy-preserving data mining (PPDM), to protect data privacy. However, most SMC-based solutions are ad-hoc. They are proposed for specific applications, and thus cannot be applied to other applications directly. To address this issue, we propose a privacy model DAG (Directed A cyclic Graph) that consists of a set of secure operators (e.g., Multiplication and division). Our DAG model is general -- its operators, if pipelined together, can implement various functions. It is also extendable -- secure operators can be defined to add new features to the model. As an application study, we have applied our DAG to kernel regression. Experiments on datasets of more than 680,000 tuples show that our DAG model is effective and its running time is nearly thrice that of non-privacy setting, where parties directly disclose data.
Keywords
data mining; data privacy; directed graphs; DAG; PPDM; SMC; data privacy; directed acyclic graph; kernel regression; privacy preserving computation; privacy-preserving data mining; secure multiparty computation; Approximation methods; Computational modeling; Encryption; Logic gates; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Web Services (ICWS), 2015 IEEE International Conference on
Conference_Location
New York, NY
Print_ISBN
978-1-4673-7271-8
Type
conf
DOI
10.1109/ICWS.2015.47
Filename
7195581
Link To Document