Secure Two-Party Differentially Private Data Release for Vertically Partitioned Data
- 17 May 2013
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 11 (1) , 59-71
Abstract
Privacy-preserving data publishing addresses the problem of disclosing sensitive data when mining for useful information. Among the existing privacy models, ϵ-differential privacy provides one of the strongest privacy guarantees. In this paper, we address the problem of private data publishing, where different attributes for the same set of individuals are held by two parties. In particular, we present an algorithm for differentially private data release for vertically partitioned data between two parties in the semihonest adversary model. To achieve this, we first present a two-party protocol for the exponential mechanism. This protocol can be used as a subprotocol by any other algorithm that requires the exponential mechanism in a distributed setting. Furthermore, we propose a two-party algorithm that releases differentially private data in a secure way according to the definition of secure multiparty computation. Experimental results on real-life data suggest that the proposed algorithm can effectively preserve information for a data mining task.Keywords
This publication has 50 references indexed in Scilit:
- No free lunch in data privacy2011
- The Limits of Two-Party Differential Privacy2010
- Composition attacks and auxiliary information in data privacy2008
- Workload-aware anonymization techniques for large-scale datasetsACM Transactions on Database Systems, 2008
- t-Closeness: Privacy Beyond k-Anonymity and l-Diversity2007
- Worst-Case Background Knowledge for Privacy-Preserving Data Publishing2007
- L -diversityACM Transactions on Knowledge Discovery From Data, 2007
- A secure distributed framework for achieving k-anonymityThe VLDB Journal, 2006
- Mondrian Multidimensional K-Anonymity2006
- Privacy Preserving Data MiningJournal of Cryptology, 2002