Skip to main content

Algorithm of Multiple Sensitive Attributes Privacy Based on Personal Anonymous

  • Conference paper
Advances in Computer Science, Environment, Ecoinformatics, and Education (CSEE 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 215))

  • 1787 Accesses

Abstract

This paper analyzes the (k, l) - Anonymous model need to address two key questions: re-encoding methods and information loss metrics, and in-depth analysis of the (k, l) - Anonymous model and similar models that exist in many sensitive attributes privacy disclosure and attack the problem while giving a certain amount of improvement. In order to avoid multiple records corresponding to a single individual in the situation over in anonymous generalization, this paper presents a new connection based on lossy re-encoding attribute more sensitive method, experimental results show that the coding method can keep the same person more sensitive to possible link between property information. Meanwhile, in order to solve the existing multi-anonymous model sensitive information, especially due to its relevance leak, the paper related to the privacy of individuals Anonymous technological trends, a relational database to solve more sensitive attribute data released disclosure of private information model, the paper gives the formal description of this model and the corresponding algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Qin, X., Men, A., Zou, Y.: Based on K-anonymity privacy protection algorithms. Chifeng University, Natural Science (May 2010)

    Google Scholar 

  2. Liu, T., Ni, W., Chong, Z., Zhang, Y.: Multi-dimensional numerical sensitive attributes privacy preserving data dissemination methods. Southeast University, Natural Science (April 2010)

    Google Scholar 

  3. Hu, X., Zhang, Z., Zhang, B., Dong, J.: Tuple based on the privacy of sensitive data protection method. Southeast University, Natural Science (May 2010)

    Google Scholar 

  4. Song, J., Huang, L., Zhou, G., Li, Y.: View of the safety release (review). Hebei Normal University (February 2008)

    Google Scholar 

  5. Song, J., Liu, G., Huang, L., Zhu, C.: K-anonymous method and the quasi-identifier set of views related to the solution algorithm. Computer Research and Development (January 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guozhen, S. (2011). Algorithm of Multiple Sensitive Attributes Privacy Based on Personal Anonymous. In: Lin, S., Huang, X. (eds) Advances in Computer Science, Environment, Ecoinformatics, and Education. CSEE 2011. Communications in Computer and Information Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23324-1_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23324-1_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23323-4

  • Online ISBN: 978-3-642-23324-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics