Email this article 
Hide
Show allPRIVACY PRESERVED AND SECURE PROFILE MATCHING BASED ON PROFESSION ATTRIBUTES
Abstract
Today online social networks and micro blogging services have gained more popularity due to increasing needs of professional services extended to people having the same professional attributes or the members of a group. When professional services are to be shared with group members by another member in the same group or the person from the outside of the group need to find the matching profiles of groups or individuals based on the profession or the location or any other attribute. The problem of sharing profiles are having increasing risk of exploitation or misusing profile information needs a secured sharing of the profile information due to sensitive and personal information, which are not to be disclosed to everyone. In this paper, we present a novel mechanism to extract the correct group matching attributes while sensitive information of the initiator and group members are not disclosed. Our proposed scheme explores the private set intersection and ring signature to use group verification to provide efficient and high performance profile matching.
Keywords
References
M. Li, N. Cao, S. Yu, and W. Lou, “FindU: Private-Preservi ng Personal Profile Matching in Mobile Social Networks,” in Proc. IEEE INFOCOM, 2011, pp. 2435 – 2443.
M. J. Freedman, K. Nissim, and B. Pinkas, “Efficient Private Matching and Set Intersection,” in Proc. EUROCRYPT. Spring-Verlag, 2004, pp. 1–19.
R. L. Rivest, A. Shamir, and Y. Tauman, “How to Leak a Secret, ” in Proc. ASIACRYPT. Springer-Verlag, 2001, pp. 552–565.
D. Boneh, C. Gentry, B. Lynn, and H. Shacham, “Aggregate an d Verifi-ably Encrypted Signatures from Bilinear Maps,” in Proc. EUROCRYPT. Springer-Verlag, 2003, pp. 416–432.
Sorniotti and R. Molva, “Secret Interest Groups (SIGs ) in Social Networks with an Implementation on Facebook,” in Proc. ACM SAC, 2010, pp. 621–628.
R. Agrawal, A. Evfimievski, and R. Srikant, “Information Sh aring Across Private Databases,” in Proc. ACM SIGMOD, 2003, pp. 86–97.
C. Hazay and Y. Lindell, “Efficient Protocols for Set Inte rsection and Pattern Matching with Security Against Malicious and Covert Adversaries,” in Proc. TCC. Springer-Verlag, 2008, pp. 155–175.
P. Paillier, “Public-Key Cryptosystems Based on Composit e Degree Residuosity Classes,” in Proc. EUROCRYPT. Springer-Verlag, 1999, pp. 223–238.
Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing,” in Proc. IEEE INFOCOM, 2010, pp. 525–533.
R. Li and C. Wu, “An Unconditionally Secure Protocol for Multi-Party Set Intersection,” in Proc. ACNS. Springer-Verlag, 2007, pp. 226–236.
Dachman-Soled, T. Malkin, M. Raykova, and M. Yung, “Ef ficient Robust Private Set Intersection,” in Proc. International Conference on Applied Cryptography and Network Security. Springer-Verlag, 2009, pp. 125–142.
D. Cristofaro and G. Tsudik, “Practical Private Set I ntersection Protocols with Linear Complexity,” in Proc. FC, 2010, pp. 143–159.
L. Kissner and D. Song, “Privacy-Preserving Set Operat ions,” in Proc. CRYPT. Springer-Verlag, 2005, pp. 241–257.
Q. Ye, H. Wang, and J. Pieprzyk, “Distributed Private Ma tching and Set Operations,” in Proc. ISPEC. Springer-Verlag, 2008, pp. 347–360.
Y. Sang, H. Shen, Y. Tan, and N. Xiong, “Efficient Protoco ls for Privacy Preserving Matching Against Distributed Datasets,” in Proc. ICICS. Springer-Verlag, 2006, pp. 210–227.
Z. Yang, B. Zhang, J. Dai, A. C.Champion, D. Xuan, and D. Li, “E-SmallTalker: A Distributed Mobile System for Social Networking in Physical Proximity,” in Proc. IEEE ICDCS, 2010, pp. 468 – 477.
Refbacks
- There are currently no refbacks.
Copyright © 2012 - 2023, All rights reserved.| ijitr.com
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.