Abstract

Big data refers to a collection of information that is too vast and complex to be effectively collected, processed and analyzes using traditional algorithms, tools and approaches. In order to utilize big data, researchers, business and governments are focusing efforts on datasets characterized by three challenges, volume, velocity and variety. These challenges requires research and innovation at all levels of computing, from the physical networks needed for capturing and transporting such data to advanced algorithms for effectively ,securing, organizing, processing and ultimately, making effective use of such data .Now a days Big Data gradually become a hot topic of research and business and has been everywhere used in many industries. Big Data security and privacy has been increasingly concerned. In this paper, first we reviewed some possible methods and techniques to ensure big data security and privacy and then present an MD5 cryptographic algorithm in networking for big data security and privacy.

References

• Big Data Security and Privacy: Review MATTURDI Bardi1, ZHOU Xianwei, LI Shuai, and LIN Fuhong.2014:135-145.
• Gantz J, Reinsel D. Extracting value from Chaos [J]. IDC iview, 2011: 1-12.
• Lohr S. The age of big data [J]. New York Times, 2012, 11.
• McCune J C. Data, data everywhere [J]. Management Review, 1998, 87(10): 10-12.
• Gantz J, Reinsel D. The digital universe in 2020: Big data, bigger digital shadows, and Biggest growth in the Far East [J]. IDC iView: IDC Analyze the Future, 2012.
• Weiss R, Zgorski L. Obama administration Unveils “Big Data” Initiative: Announces $200 Million in New R&D Investments [J]. Office of Science and Technology Policy, Washington, DC, 2012. Data P. The emergence of a New Asset Class[C]//World Economic Forum Report. 2011.
• Anderson C. The end of theory: the data Deluge makes the scientific method obsolete. Wired Magazine 16.07[J]. 2008.
• Manyika J, Chui M, Brown B, et al. Big data: The next frontier for innovation, competition, and productivity [J]. 2011
• Mayer-Schönberger V, Cukier K. Big data: Arevolution that will transform how we live, Work, and think [M]. Houghton Mifflin Harcourt, 2013.
• Perlroth N, Larson J, Shane S. NSA able tofoil basic safeguards of privacy on web[J]. The New York Times, 2013,
• Ohm P. Broken promises of privacy: Responding to the surprising failure of anonymization [J]. UCLA L. Rev., 2009, 57: 1701.
• Rajasekar A, Moore R, Hou C, et al. iRODS Primer: integrated rule-oriented data System [J]. Synthesis Lectures on Information Concepts, Retrieval, and Services, 2010, 2(1): 1-143.
• Rajasekar A, Moore R, Wan M, et al. Applying rules as policies for large-scale data Sharing[C]//Intelligent Systems, Modelling And Simulation (ISMS), 2010 International Conference on. IEEE, 2010: 322-327.
• Barg I, Scott D, Timmermann E. NOAO E2E integrated data cache initiative using iRODS[C]//Astronomical Data Analysis Software and Systems XX. ASP Conference Proceedings. 2011, 442: 497-500.
• Schnase J L, Webster W P, Parnell L A, et al. The NASA Center for Climate Simulation Data Management system[C]//Mass Storage Systems and Technologies (MSST), 2011 IEEE 27th Symposium on. IEEE, 2011: 1-6
• Sweeney L. k-anonymity: A model for pro-tecting privacy [J]. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002, 10(05): 557-570.
• Sweeney L. Achieving k-anonymity privacy protection using generalization and Suppression [J]. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002, 10(05): 571-588.
• Bayardo R J, Agrawal R. Data privacy throughoptimal k-anonymization[C]//Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on. IEEE, 2005: 217-228.
• Lefebvre K, DeWitt D J, Ramakrishna R.Incognito: Efficient full-domain k-anonymity[C]//Proceedings of the 2005 ACM SIGMOD international conference on Management of data. ACM, 2005: 49-60.
• Lefebvre K, DeWitt D J, Ramakrishna R.Mondrian multidimensional k-anonymity[C]//Data Engineering, 2006. ICDE'06.Proceedings of the 22nd International Conference on. IEEE, 2006: 25-25.