Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2018, Article ID 7846547, 16 pages
Research Article

Using MOPSO for Optimizing Randomized Response Schemes in Privacy Computing

Department of Information Engineering, Engineering University of Chinese People’s Armed Police Force, Xi'an, China

Correspondence should be addressed to Zhiqiang Gao; moc.qq@4648930901

Received 17 November 2017; Revised 6 February 2018; Accepted 22 February 2018; Published 3 April 2018

Academic Editor: Khaled Loukhaoukha

Copyright © 2018 Zhiqiang Gao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. G. E. Hinton, S. Osindero, and Y. W. Teh, “A fast learning algorithm for deep belief nets,” Neural Computation, vol. 18, no. 7, pp. 1527–1554, 2014. View at Google Scholar
  2. Y. Guo, A. Oerlemans, S. Lao, S. Wu, and M. S. Lew, “Deep learning for visual understanding,” Neurocomputing, vol. 187, no. C, pp. 27–48, 2016. View at Google Scholar
  3. Y. Li, W. Dai, Z. Ming, and M. Qiu, “Privacy protection for preventing data over-collection in smart city,” IEEE Transactions on Computers, vol. 65, no. 5, pp. 1339–1350, 2016. View at Google Scholar
  4. Y. Liu, B. Guo, H. Du, Z. W. Yu, D. Zhang, and C. Chen, “FooDNet: Optimized On Demand Take-out Food Delivery using Spatial Crowdsourcing,” in Proceedings of the MobiCom’17, Association for Computing Machinery, Snowbird, UT, USA, 2017.
  5. M. S. Farash and M. A. Attari, A Provably Secure And Efficient Authentication Scheme for Access Control in Mobile Pay-TV Systems, Kluwer Academic Publishers, Norwell, MA, USA, 2016.
  7. S. Hansell, “AOL removes search data on vast group of web users,” New York Times, 2006. View at Google Scholar
  9. A. Narayanan and V. Shmatikov, “How to break anonymity of the netflix prize dataset,” Computer Science, 2006. View at Google Scholar
  11. M. Douriez, H. Doraiswamy, J. Freire, and C. T. Silva, “Anonymizing NYC Taxi Data: Does It Matter?” in IEEE International Conference on Data Science and Advanced Analytics, pp. 140–148, Montréal, Canada, 2016.
  13. L. Sweeney, K -Anonymity: A Model for Protecting Privacy, vol. 10, World Scientific Publishing, Singapore, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  14. A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, “L-diversity: Privacy beyond k-anonymity,” ACM Transactions on Knowledge Discovery from Data (TKDD), vol. 1, no. 1, 2007. View at Google Scholar
  15. N. Li, T. Li, and S. Venkatasubramanian, “t-closeness: Privacy beyond k-anonymity and l-diversity,” in 2007 IEEE 23rd International Conference on Data Engineering, pp. 106–115, IEEE, Istanbul, Turkey, 2007.
  16. R. C. W. Wong, J. Li, A. W. C. Fu, and K. Wang, “(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing,” in In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 754–759, ACM, Philadelphia, PA, USA, 2006.
  17. X. Xiao and Y. Tao, “M-invariance: towards privacy preserving re-publication of dynamic datasets,” in In Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pp. 689–700, ACM, Beijing, China, 2007.
  18. C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in Proceedings of the 3rd Theory of Cryptography Conference, vol. 3876, pp. 265–284, Springer, New York, NY, USA, 2006.
  19. C. Dwork, “A firm foundation for private data analysis,” Communications of the ACM, vol. 54, no. 1, pp. 86–95, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. C. Dwork, M. Naor, T. Pitassi, and G. N. Rothblum, “Differential privacy under continual observation,” in In Proceedings of the 42nd ACM symposium on Theory of computing, pp. 715–724, ACM, Cambridge, MA, USA, 2010.
  21. X. Li, J. Yang, Z. Sun, and J. Zhang, “Differential privacy for edge weights in social networks,” Security & Communication Networks, vol. 2017, no. 4, 10 pages, 2017. View at Google Scholar
  22. T. Gao, F. Li, Y. Chen, and X. K. Zou, “Preserving local differential privacy in online social networks,” in Proceedings of the International Conference on Wireless Algorithms, Systems, and Applications, vol. 10251, Springer, Guilin, China, 2007.
  23. C. Lin, Z. Song, Q. Liu, W. Sun, and G. Wu, “Protecting Privacy for Big Data in Body Sensor Networks: A Differential Privacy Approach,” in in the proceedings of International Conference on Collaborative Computing: Networking, Applications and Worksharing, pp. 163–172, Springer, Beijing, China, 2015.
  24. T. T. Nguyên, X. Xiao, Y. Yang, S. C. Hui, H. Shin, and J. Shin, “Collecting and analyzing data from smart device users with local differential privacy,” 2016,
  25. B. Mishra, S. White, D. Hosseini et al., “Storage, Retrieval, Analysis, Pricing, and Marketing of Personal Health Care Data Using Social Networks, Expert Networks, and Markets,” WO, WO/2013/188838, 2013.
  26. F. Kargl, A. Friedman, and R. Boreli, “Differential privacy in intelligent transportation systems,” in ACM Conference on Security and Privacy in Wireless and Mobile Networks, pp. 107–112, ACM, Budapest, Hungary, 2013.
  27. I. Roy, S. T. Setty, A. Kilzer, V. Shmatikov, and E. Witchel, “Airavat: Security and privacy for MapReduce,” in Proceedings of the Symposium on Networked Systems Design and Implementation (NSDI), vol. 10, pp. 297–312, USENIX – Advanced Computing Systems Association, Lombard, IL, USA, 2010.
  28. Vijay Srinivas Agneeswaran, Big Data Analytics Beyond Hadoop: Real-Time Applications with Storm, Spark, and More Hadoop Alternatives, Pearson Education, London, UK, 2014.
  29. R. Khatri and A. Kumar, “Spark (lightning-fast cluster computing) application intelecommunication sector to prevent customer churn out,” International Journal of Computer & Mathematical Sciences, vol. 4, pp. 124–126, 2015. View at Google Scholar
  30. W. Du and Z. Zhan, “Using randomized response techniques for privacy-preserving data mining,” in ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol. 25, pp. 505–510, DBLP, Washington, Dc, USA, 2003.
  31. Ú. Erlingsson, V. Pihur, and A. Korolova, “Rappor, Randomized aggregatable privacy-preserving ordinal response,” in In Proceedings of 2014 ACM SIGSAC conference on computer and communications security, pp. 1054–1067, ACM, Scottsdale, AZ, USA, 2014.
  32. M. G. Gong, Q. Cai, X. W. Chen, and L. J. Ma, “Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 1, pp. 82–97, 2014. View at Publisher · View at Google Scholar · View at Scopus
  33. Y. Wang, X. T. Wu, and D. H. Hu, “Using Randomized Response for Differential Privacy Preserving Data Collection,” EDBT/ICDT Workshops, 2016. View at Google Scholar
  34. Z. Huang and W. Du, “OptRR: Optimizing randomized response schemes for privacy-preserving data mining,” in Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08, pp. 705–714, mex, April 2008. View at Publisher · View at Google Scholar · View at Scopus
  35. D. Agrawal and C. C. Aggarwal, “On the design and quantification of privacy preserving data mining algorithms,” in Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 247–255, Santa Barbara, California, USA, May 2001. View at Scopus
  36. R. Agrawal and R. Srikant, “Privacy-preserving data mining,” ACM SIGMOD Record, vol. 29, no. 2, pp. 439–450, 2000. View at Publisher · View at Google Scholar · View at Scopus
  37. R. Agrawal, R. Srikant, and D. Thomas, “Privacy preserving OLAP,” in ACM SIGMOD International Conference on Management of Data, vol. 23, pp. 251–262, DBLP, Baltimore, Maryland, USA, 2005.
  38. Z. Qin, Y. Yang, T. Yu, I. Khalil, X. Xiao, and K. Ren, “Heavy hitter estimation over set-valued data with local differential privacy,” in Proceedings of the 23rd ACM Conference on Computer and Communications Security, CCS 2016, pp. 192–203, aut, October 2016. View at Publisher · View at Google Scholar · View at Scopus
  39. S. Agrawal and J. R. Haritsa, “A Framework for High-Accuracy Privacy-Preserving Mining,” in International Conference on Data Engineering, 2005. ICDE, 2005, vol. 18, pp. 193–204, IEEE, Tokyo, Japan, 2005.
  40. L. Ninghui, W. Qardaji, and D. Su, “Provably Private Data Anonymization: Or, k-Anonymity Meets Differential Privacy,” pp. 32-33, 2010, Corr abs/1101.2604.
  41. F. H. Li, Y. Jia, and Li. H. Jia, “Privacy computing: concept, connotation and its research trend,” Journal on Communications, vol. 37, pp. 1–11, 2016. View at Google Scholar
  42. H. Akaike, “Information theory and an extension of the maximum likelihood principle,” in Proceedings of the International Symposium on Information Theory, vol. 1, pp. 267–281, Akadémiai Kiadó, Budapest, Hungary, 1973.
  43. A. Gilbert and A. McMillan, “Local Differential Privacy for Physical Sensor Data and Sparse Recovery,”
  44. T. Kulkarni, G. Cormode, and D. Srivastava, “Marginal Release Under Local Differential Privacy,”
  45. S. L. Warner, “Randomized response: a survey technique for eliminating evasive answer bias,” Journal of the American Statistical Association, vol. 60, no. 309, pp. 63–66, 1965. View at Publisher · View at Google Scholar · View at Scopus
  46. B. Kang, J. Wang, and D. Shao, “Attack on Privacy-Preserving Public Auditing Schemes for Cloud Storage,” Mathematical Problems in Engineering, vol. 2017, Article ID 8062182, 2017. View at Publisher · View at Google Scholar · View at Scopus
  47. Z. Lin, X. Xiao, Y. Sun, Y. Zhang, and Y. Ma, “A Privacy-Preserving Intelligent Medical Diagnosis System Based on Oblivious Keyword Search,” Mathematical Problems in Engineering, vol. 2017, Article ID 8632183, 7 pages, 2017. View at Google Scholar