Email this article Social Closeness Based Private Coordinating Conventions for Online Informal Organizations
Abstract
The hazardous development of Online Interpersonal organizations in the course of recent years has re-imagined the way individuals collaborate with existing companions and particularly make new companions. A few works propose to give individuals a chance to wind up companions on the off chance that they have comparative profile attributes. In any case, profile coordinating includes a natural protection danger of uncovering private profile data to outsiders in the internet. The current answers for the issue endeavor to ensure clients' protection by secretly figuring the convergence or crossing point cardinality of the profile quality arrangements of two clients. These plans have a few impediments can in any case uncover clients' protection. In this project, we influence group structures to reclassify the Online Social Networks(OSN) display and propose a practical awry social closeness measure between two clients. At that point, in light of the proposed hilter kilter social nearness, along with AES algorithm we outline three private coordinating conventions, which give diverse security levels and can ensure clients' protection superior to the past works. At long last, we approve our proposed unbalanced closeness measure utilizing genuine interpersonal organization information and lead broad reenactments to assess the execution of the proposed conventions regarding calculation cost, correspondence cost, add up to running time, and vitality utilization.
References
(2013, October). [Online]. Available: http://www.alexa.com/topsites
CNN, “Report: Eastern european gang hacked apple, facebook, twitter,” http://www.cnn.com/2013/02/20/tech/web/hacked-apple-facebook-twitter/index.html, February, 2013.
IGN, “Microsoft hacked by same method as apple and facebook,” http://www.ign.com/articles/2013/02/23/microsofthacked-by-same-method-as-apple-and-facebook, February, 2013.
H. Lin, S. S. M. Chow, D. Xing, Y. Fang, and Z. Cao, “Privacy-Preserving Friend Search over Online Social Networks,” Cryptology ePrint Archive, Report 2011/445, 2011. [Online].
Available: http://eprint.iacr.org/
R. Zhang, Y. Zhang, J. S. Sun, and G. Yan, “Fine-grained Private Matching for Proximity-based Mobile Social Networking,” in IEEE International Conference on Computer Communications (INFO- COM’2), Orlando, Florida, USA, March 2012.
M. Li, N. Cao, S. Yu, and W. Lou, “FindU: Privacy-preserving Personal Profile Matching in Mobile Social Networks,” in IEEE In- ternational Conference on Computer Communications (INFOCOM’11), Shanghai, China, April 2011.
R. Lu, X. Lin, X. Liang, and X. Shen, “A Secure Handshake Scheme with Symptoms-Matching for mHealthcare Social Network,” Mo- bile Networks and Applications, vol. 16, pp. 683–694, 2011.
X. Liang, M. Barua, R. Lu, X. Lin, and X. Shen, “Health Share: Achieving Secure and Privacy-preserving Health Information Sharing through Health Social Networks,” Computer Communications, vol. 35, no. 15, pp. 1910–1920, 2012.
W. Dong, V. Dave, L. Qiu, and Y. Zhang, “Secure Friend Discovery in Mobile Social Networks,” in IEEE International Conference on Computer Communications (INFOCOM’11), Shanghai, China, April 2011.
H. Zhu, S. Du, M. Li, and Z. Gao, “Fairness-aware and privacypreserving friend matching protocol in mobile social networks,” IEEE Transactions on Emerging Topics in Computing, vol. 1, no. 1, pp. 192–200, June 2005.
E. D. Cristofaro, M. Manulis, and B. Poettering, “Private Discovery of Common Social Contacts,” in Proceedings of the 9th international conference on Applied cryptography and network security: ACNS’11, Nerja, Spain, June 2011.
M. Nagy, E. D. Cristofaro, A. Dmitrienko, N. Asokan, and A.- R. Sadeghi, “Do i know you?: efficient and privacy-preserving common friend-finder protocols and applications,” in Proceedings of the 29th Annual Computer Security Applications Conference, New Orleans, LA, USA, December 2013.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.