Skip to main content

A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10398))

Abstract

The Big Data plays a valuable role in large scale information management that overshoots the potential of traditional data processing technologies. The importance of volume, velocity, variety, veracity and value of big data made researchers to put efforts to handle them efficiently. On considering the 5V’s of big data, if the veracity characteristic is not well focused, then the idea of big data will not be widely recognized. Advances in technology allow users to extract and utilize the big data which make data privacy violations in maximum cases. Also the data used for big data analytics may include restricted information. So it is necessary to protect and notice whether this kind of data is used with certain principles. In this paper we formalize a Bi-level security mechanism called Cosine Similarity with P-Stability for data privacy and graph protection in one of the big data environment called Online Social Network.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Xue-Wen, C., Xiaotong, L.: Big data deep learning: challenges and perspectives. IEEE Access 2, 514–525 (2014)

    Article  Google Scholar 

  2. Abid, M., Iynkaran, N., Yong, X., Guang, H., Song, G.: Protection of big data privacy. IEEE Access 4, 1821–1834 (2016)

    Article  Google Scholar 

  3. Avita, K., Mohammad, W., Goudar, R.H.: Big data: issues, challenges, tools and good practices. In: The Proceedings of the Sixth International Conference on Contemporary Computing (IC3), Noida, pp. 404–409 (2013)

    Google Scholar 

  4. Han, H., Yonggang, W., Tat Seng, C., Xuelong, L.: Toward scalable systems for big data analytics: a technology tutorial. IEEE Access 2, 652–687 (2014)

    Article  Google Scholar 

  5. Lei, X., Chunxiao, J., Jian, W., Jian, Y., Yong, R.: Information security in big data: privacy and data mining. IEEE Access 2, 1149–1176 (2014)

    Article  Google Scholar 

  6. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). doi:10.1007/3-540-48910-X_16

    Google Scholar 

  7. Ming, L., Shucheng, Y., Kui, R., Wenjing, L., Thomas, H.Y.: Toward privacy-assured and searchable cloud data storage services. IEEE Netw. 27, 56–62 (2013)

    Article  Google Scholar 

  8. Ann, C., Jeff, J.: Privacy by Design in the Age of Big Data. Information and Privacy Commissioner, Canada (2012)

    Google Scholar 

  9. Vicenc, T., Termeh, S., Julian, S.: Data protection for online social networks and P-Stability for graphs. IEEE Trans. Emerg. Top. Comput. 4, 374–381 (2016)

    Article  Google Scholar 

  10. Rongxing, L., Hui, Z., Ximeng, L., Joseph, K.L., Jun, S.: Toward efficient and privacy-preserving computing in big data era. IEEE Netw. 28, 46–50 (2014)

    Google Scholar 

  11. Mark, J., Alistair, S.: Fast uniform generation of regular graphs. Theoret. Comput. Sci. 73, 91–100 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  12. Jerrum, M., Sinclair, A., McKay, B.: When is a graphical sequence stable? In: Frieze, A., Luczak, T. (eds.) Random Graphs, vol. 2, pp. 101–115. Wiley (1992)

    Google Scholar 

  13. Prabu Kanna, G., Vasudevan, V.: Enhancing the security of user data using the keyword encryption and hybrid cryptographic algorithm in cloud. In: Proceedings of the International Conference on Electrical, Electronics and Optimization Techniques (ICEEOT), pp. 3688–3693 (2016)

    Google Scholar 

Download references

Acknowledgments

The first author would like to thank the management of Kalasalingam University for providing financial assistance under the University Research Fellowship.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. Franklin Vinod .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Franklin Vinod, D., Vasudevan, V. (2017). A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network. In: Arumugam, S., Bagga, J., Beineke, L., Panda, B. (eds) Theoretical Computer Science and Discrete Mathematics. ICTCSDM 2016. Lecture Notes in Computer Science(), vol 10398. Springer, Cham. https://doi.org/10.1007/978-3-319-64419-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64419-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64418-9

  • Online ISBN: 978-3-319-64419-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics