Abstract
While the strategy in previous chapter is theoretically superior to existing ones due to its independence of utility measures and privacy models, and its privacy guarantee under publicly-known algorithms, it incurs a high computational complexity. In this chapter, we study an efficient strategy for diversity preserving data publishing with publicly known algorithms (algorithms as side-channel). Our main observation is that a high computational complexity is usually incurred when an algorithm conflates the processes of privacy preservation and utility optimization. We then propose a novel privacy streamliner approach to decouple those two processes for improving algorithm efficiency. More specifically, we first identify a set of potential privacy-preserving solutions satisfying that an adversary’s knowledge about this set itself will not help him/her to violate the privacy property; we can then optimize utility within this set without worrying about privacy breaches since such an optimization is now simulatable by adversaries. To make our approach more concrete, we study it in the context of micro-data release with publicly known generalization algorithms. The analysis and experiments both confirm our algorithms to be more efficient than existing solutions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Roberto J. Bayardo and Rakesh Agrawal. Data privacy through optimal k-anonymization. In ICDE ’05: Proceedings of the 21st International Conference on Data Engineering, pages 217–228, 2005.
C. Dwork. Differential privacy. In ICALP (2), pages 1–12, 2006.
Philip W. L. Fong, Mohd Anwar, and Zhen Zhao. A privacy preservation model for facebook-style social network systems. In ESORICS ’09, pages 303–320, 2009.
B. C. M. Fung, K. Wang, R. Chen, and P. S. Yu. Privacy-preserving data publishing: A survey of recent developments. ACM Computing Surveys, 42(4):14:1–14:53, June 2010.
Benjamin C. M. Fung, Ke Wang, and Philip S. Yu. Top-down specialization for information and privacy preservation. In ICDE ’05, pages 205–216, 2005.
K. Kenthapadi, N. Mishra, and K. Nissim. Simulatable auditing. In PODS, pages 118–127, 2005.
Kristen LeFevre, David J. DeWitt, and Raghu Ramakrishnan. Mondrian multidimensional k-anonymity. In ICDE ’06: Proceedings of the 22nd International Conference on Data Engineering, page 25, 2006.
Ninghui Li, Wahbeh H. Qardaji, and Dong Su. Provably private data anonymization: Or, k-anonymity meets differential privacy. CoRR, abs/1101.2604, 2011.
W. M. Liu, L. Wang, and L. Zhang. k-jump strategy for preserving privacy in micro-data disclosure. In ICDT ’10, pages 104–115, 2010.
Wen Ming Liu and Lingyu Wang. Privacy streamliner: a two-stage approach to improving algorithm efficiency. In Proceedings of the second ACM conference on Data and Application Security and Privacy, CODASPY ’12, pages 193–204, New York, NY, USA, 2012. ACM.
A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam. L-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data, 1(1):3, 2007.
Arvind Narayanan and Vitaly Shmatikov. De-anonymizing social networks. In IEEE Symposium on Security and Privacy ’09, pages 173–187, 2009.
Steven Ruggles, Matthew Sobek, J. Trent Alexander, Catherine Fitch, Ronald Goeken, Patricia Kelly Hall, Miriam King, and Chad Ronnander. Integrated public use microdata series: Version 3.0. http://ipums.org, 2004.
P. Samarati. Protecting respondents’ identities in microdata release. IEEE Trans. on Knowl. and Data Eng., 13(6):1010–1027, 2001.
Ke Wang, Philip S. Yu, and Sourav Chakraborty. Bottom-up generalization: A data mining solution to privacy protection. In ICDM ’04, pages 249–256, 2004.
R. C. Wong and A. W. Fu. Privacy-Preserving Data Publishing: An Overview. Morgan and Claypool Publishers, 2010.
R.C. Wong, A.W. Fu, K. Wang, and J. Pei. Minimality attack in privacy preserving data publishing. In VLDB, pages 543–554, 2007.
X. Xiao, Y. Tao, and N. Koudas. Transparent anonymization: Thwarting adversaries who know the algorithm. ACM Trans. Database Syst., 35(2):1–48, 2010.
L. Zhang, S. Jajodia, and A. Brodsky. Information disclosure under realistic assumptions: privacy versus optimality. In CCS, pages 573–583, 2007.
L. Zhang, L. Wang, S. Jajodia, and A. Brodsky. L-cover: Preserving diversity by anonymity. In SDM ’09, pages 158–171, 2009.
Acknowledgements
The authors thank Lei Zhang for his contribution to the early stage of this work.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Liu, W.M., Wang, L. (2016). Data Publishing: A Two-Stage Approach to Improving Algorithm Efficiency. In: Preserving Privacy Against Side-Channel Leaks. Advances in Information Security, vol 68. Springer, Cham. https://doi.org/10.1007/978-3-319-42644-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-42644-0_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42642-6
Online ISBN: 978-3-319-42644-0
eBook Packages: Computer ScienceComputer Science (R0)