Skip to main content
Log in

A privacy policy conflict detection method for multi-owner privacy data protection

  • Published:
Electronic Commerce Research Aims and scope Submit manuscript

Abstract

The current privacy-preserving researches focus on single-owner privacy data. However, multi-owner privacy data, which is also a widespread privacy data, need to be properly protected. At first, the characteristics of multi-owner privacy data and its protection requirement is introduced in this paper. Secondly, a data schema based on deputy mechanism for multi-owner privacy data is proposed. Thirdly, based on the schema, this paper proposes a privacy policy conflict detection method based on sub-graph isomorphic. This method models the privacy policy and each possible policy conflict pattern as a stratified-directed graph (SDG), and provides an algorithm to detect whether the SDG of a privacy conflict mode is isomorphic to that of privacy policies.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Agrawal, R., Kiernan, J., Srikant, R., & Xu, Y. (2002). Hippocratic databases. In Proc. 28th int’l conf. on very large data bases, Hong Kong, China.

    Google Scholar 

  2. Bertino, E., & Sandhu, R. (2005). Database security—concepts, approached, and challenge. IEEE Transaction On Dependable and Secure Computing, 2(1), 2–19.

    Article  Google Scholar 

  3. Xiao, X., & Tao, Y. (2006). Personalized privacy preservation. In Proceedings of the 2006 ACM SIGMOD international conference on management of data, Chicago, IL, USA.

    Google Scholar 

  4. Byun, J.-W., Bertino, E., & Li, N. (2006). Micro-views, or on how to protect privacy while enhancing data usability—concepts and challenges. SIGMOD Record, 35(1), 9–13.

    Article  Google Scholar 

  5. Bayardo, R., & Agrawal, R. (2005). Data privacy through optimal k-anonymization. In ICDE (pp. 217–228).

    Google Scholar 

  6. Yao, C., Wang, L., Wang, X. S., & Jajodia, S. (2006). Indistinguishability: the other aspect of privacy. In Secure data management (pp. 1–17).

    Chapter  Google Scholar 

  7. Samarati, P., & Sweeney, L. (1998). Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression (Technical Report). SRI International, March 1998.

  8. Sweeney, L. (2002). k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5), 557–570.

    Article  Google Scholar 

  9. LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006). Mondrian multidimensional k-anonymity. In ICDE.

    Google Scholar 

  10. Machanavajjhala, A., Gehrke, J., & Kifer, D. (2006). l-diversity: privacy beyond k-anonymity. In ICDE.

    Google Scholar 

  11. Byun, J.-W., Bertino, E., & Li, N. (2005). Purpose based access control of complex data for privacy protection. In SACMAT’05, June 1–3, 2005.

    Google Scholar 

  12. Olmos, I., Gonzalez, J. A., & Osorio, M. (2007). Reductions between the subgraph isomorphism problem and Hamiltonian and SAT problems. In CONIELECOMP’07.

    Google Scholar 

  13. Byun, J.-W., Bertino, E., & Li, N. (2008). Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In VLDB’08, August 24–30, 2008.

    Google Scholar 

  14. Kambayashi, Y., & Peng, Z. (1996). An object deputy model for realization of flexible and powerful objectbases. Journal of Systems Integration, 6, 329–362.

    Article  Google Scholar 

  15. Peng, Z., & Kambayashi, Y. (1995). Deputy mechanisms for object-oriented databases. In Proc. of IEEE 11th int. conf. on data engineering (pp. 333–340).

    Chapter  Google Scholar 

  16. Ren, Y., Luo, M., Tang, Z., & Ye, L. (2007). A composite privacy protection model. In Second international workshop in information and computer security, Nara, Japan.

    Google Scholar 

  17. Buss, S. R. (1997). Alogtime algorithms for tree isomorphism, comparison, and canonization. In Proceeding of the 5th Kurt Godel colloquium on computational logic and proof theory (pp. 18–33).

    Google Scholar 

  18. Wen, X.-l., & Liang, H.-j. (2005). A BULT algorithms for tree isomorphism. Acta scientiarum naturalium universitatis sunyatseni, 44(6).

  19. Kuznetsov, S. O., & Obiedkov, S. A. (1999). Comparing performance of algorithmsfor generating concept lattices. Journal of Experimental and Theoretical Artificial Intelligence, 71(5/6), 199–204.

    Google Scholar 

  20. Bettini, C., Jajodia, S., Wang, X. S., & Wijesekera, D. (2002). Provisions and obligations in policy management and security applications. In VLDB’02, Hong Kong, China.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yi Ren.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ren, Y., Cheng, F., Peng, Z. et al. A privacy policy conflict detection method for multi-owner privacy data protection. Electron Commer Res 11, 103–121 (2011). https://doi.org/10.1007/s10660-010-9067-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10660-010-9067-8

Keywords

Navigation