Skip to main content

Privacy Vulnerability of NeNDS Collaborative Filtering

  • Conference paper
  • First Online:
Cyber Security Cryptography and Machine Learning (CSCML 2021)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 12716))

  • 1112 Accesses

Abstract

Many of the data we collect today can easily be linked to an individual, household or entity. Unfortunately, using data without protecting the identity of the data owner can lead to data leaks and potential lawsuits. To maintain user privacy when a publication of data occurs many databases employ anonymization techniques, either on the query results or the data itself. In this paper we examine variant of such technique, “data perturbation” and discuss its vulnerability. The data perturbation method deals with changing the values of records in the dataset while maintaining a level of accuracy over the resulting queries. We focus on a relatively new data perturbation method called NeNDS [1] and show a possible partial knowledge privacy attack on this method.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Parameswaran, R., Blough, D.M.: Privacy preserving data obfuscation for inherently clustered data. Int. J. Inf. Comput. Secur. 2(1), 4–26 (2008)

    Google Scholar 

  2. Su, X., Khoshgoftaar, T.M.: A survey of collaborative filtering techniques. Adv. in Artif. Intell. 2009, 421425:1–421425:19 (2009)

    Google Scholar 

  3. Parameswaran, R., Blough, D.M.: Privacy preserving collaborative filtering using data obfuscation. In: Proceedings of the 2007 IEEE International Conference on Granular Computing, GRC 2007, Washington, DC, USA, pp. 380–386. IEEE Computer Society (2007)

    Google Scholar 

  4. Polat, H., Du, W.: Privacy-preserving collaborative filtering using randomized perturbation techniques. In: Proceedings of the Third IEEE International Conference on Data Mining, ICDM 2003, Washington, DC, USA, pp. 625–628. IEEE Computer Society (2003)

    Google Scholar 

  5. Parra-Arnau, J., Rebollo-Monedero, D., Forné, J.: A privacy-protecting architecture for collaborative filtering via forgery and suppression of ratings. In: Garcia-Alfaro, J., Navarro-Arribas, G., Cuppens-Boulahia, N., de Capitani di Vimercati, S. (eds.) DPM/SETOP - 2011. LNCS, vol. 7122, pp. 42–57. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28879-1_4

    Chapter  Google Scholar 

  6. Canny, J.: Collaborative filtering with privacy via factor analysis. In: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2002, New York, NY, USA, pp. 238–245. ACM (2002)

    Google Scholar 

  7. Huang, Z., Du, W., Chen, B.: Deriving private information from randomized data. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD 2005, New York, NY, USA, pp. 37–48. ACM (2005)

    Google Scholar 

  8. Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the Third IEEE International Conference on Data Mining, ICDM 2003, Washington, DC, USA, pp. 99–106. IEEE Computer Society (2003)

    Google Scholar 

  9. Naargaard, P.: Generating obfuscated data. US Patent, October 2018

    Google Scholar 

  10. Guirguis, S., Pareek, A.: Real-time transactional data obfuscation for Goldengate. In: Proceedings of the 13th International Conference on Extending Database Technology, EDBT 2010, New York, NY, USA, pp. 645–650. ACM (2010)

    Google Scholar 

  11. Kao, M.-Y., Sanghi, M.: An approximation algorithm for a bottleneck traveling salesman problem. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 223–235. Springer, Heidelberg (2006). https://doi.org/10.1007/11758471_23

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nussbaum, E., Segal, M. (2021). Privacy Vulnerability of NeNDS Collaborative Filtering. In: Dolev, S., Margalit, O., Pinkas, B., Schwarzmann, A. (eds) Cyber Security Cryptography and Machine Learning. CSCML 2021. Lecture Notes in Computer Science(), vol 12716. Springer, Cham. https://doi.org/10.1007/978-3-030-78086-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-78086-9_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-78085-2

  • Online ISBN: 978-3-030-78086-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics