A Privacy Preservation and Application-Level Performance for Profile Matching in Mobile Social Networks  
  Authors : B. Tejaswini; A. Srinivasan


Social network makes digital communication technologies sharpening tools for extending the social circle connected with people. Privacy preservation is usually a significant research issue in social networking. Here user account matching with privacy-preservation in mobile social networks (MSNs) is studied as well as a category of profile matching protocols is introduced. An explicit Comparison-based Profile matching protocol (eCPM) which runs between two parties, an initiator along with a responder is proposed which enables the initiator to search for the comparison-based matching result with regards to a specified attribute within their profiles, while preventing their attribute values from disclosure. An implicit Comparison-based Profile matching protocol (iCPM) will be proposed that permits the initiator to directly obtain some messages rather than the comparison result from the responder. The messages unrelated to user account might be separated into multiple categories through the responder. The initiator implicitly chooses the interested category which can be unknown for the responder. Two messages in each category are prepared through the responder, in support of one message can be acquired through the initiator based on the comparison result about the same attribute. iCPM is further generalized into an implicit Predicate-based Profile matching protocol (iPPM) that allows complex comparison criteria spanning multiple attributes. We analyze the communication overhead as well as the anonymity strength from the protocols. You have to present an enhanced version with the called by combining the having a novel prediction-based adaptive pseudonym change strategy. The performance comparatively studied through extensive tracebased simulations. Simulation results demonstrate which they achieve significantly higher anonymity strength with slightly larger variety of pseudonym.


Published In : IJCAT Journal Volume 1, Issue 7

Date of Publication : 31 August 2014

Pages : 354 - 357

Figures :01

Tables : --

Publication Link : A Privacy Preservation and Application-Level Performance for Profile Matching in Mobile Social Networks




B. Tejaswini : Post-Graduate Student, Department of Computer Science and Engineering, SITAMS, CHITTOOR, India

A. Srinivasan : Associate Professor, Department of computer Science and Engineering, SITAMS, CHITTOOR, India









Social Networking

Mobile Social Networks

Privacy Preserving

A distinctive comparison-based profile matching condition in Mobile Social Networks (MSNs) continues to be investigated, and novel protocols are proposed in order to resolve it. The explicit Comparison based Profile Matching (eCPM) protocol provides conditional anonymity. It reveals the comparison give you the initiator. For the k-anonymity being a user requirement; the anonymity risk level with regards to the pseudonym change for consecutive eCPM runs is analyzed. Further an enhanced version from the eCPM, i.e., eCPM+ is introduced, by exploiting the prediction-based strategy and adopting the pre-adaptive pseudonym change. The potency of the eCPM+ is validated through extensive simulations using real-trace data. Two protocols with full anonymity, i.e., implicit Comparison-based Profile Matching (iCPM) and implicit Predicate-based Profile Matching (iPPM) continues to be devised. The iCPM handles profile matching with different single comparison of the attribute even though the iPPM is implemented having a logical expression made from multiple comparisons spanning multiple attributes.










[1] B. Wang, B. Li, and H. Li, Gmatch: Secure and Privatepreserving Group Matching in SocialNetworks, in Proceedings of IEEE Globecom 2012, pp. 744-749, 2012.

[2] M. Li, N. Cao, S. Yu, and W. Lou, FindU: Private- Preserving Personal Profile Matching in Mobile Social Networks, in Proceedings of IEEE INFOCOM 2011, pp. 2435-2443, 2011.

[3] E. Cristofaro and G. Tsudik, Practical Private Set Intersection Protocols with Linear Complexity, in Proceedings of Financial Cryptography 2010, pp. 143- 159, 2010.

[4] D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, in Proceedings of EUROCRYPT 2003, pp. 416-432, 2006.

[5] M. Freedman, K. Nisssim, and B. Pinkas, Efficient Private Matching and Set Intersection, in Proceedings of EUROCRYPT 2004, pp. 1-19, 2004.

[6] P. Paillier, Public Key Cryptosystems Based on Composite Degree Residuosity Classes, in Proceedings of EUROCRYPT 1999, pp. 223-238, 1999.

[7] Z. Yang, B. Zhang, J. Dai, A. Champion, D. Xuan and D. Li, ESmallTalker: A Distributed Mobile System for Social Networking in Physical Proximity, in Proceedings of IEEE ICDCS 2010,pp. 468-477, 2010.

[8] D. Dachman-Soled, T. Malkin, M. Raykova, and M. Yung,“Efficient robust private set intersection,” in ACNS ’09, 2009,pp. 125–142.

[9] G. S. Narayanan, T. Aishwarya, A. Agrawal, A. Patra, A. Choudhary, and C. P. Rangan, “Multi party distributed private matching, set disjointness and cardinality of set intersection withinformation theoretic security,” in CANS ’09. Springer - Verlag, Dec. 2009, pp. 21–40.

[10] C. Hazay and Y. Lindell, “Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries,” in TCC’08, 2008, pp. 155–175.

[11] S. Jarecki and X. Liu, “Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection,” in TCC ’09. Berlin, Heidelberg: Springer-Verlag, 2009, pp. 577– 594.

[12] W. Dong, V. Dave, L. Qiu, and Y. Zhang, “Secure friend discovery in mobile social networks,” in IEEE INFOCOM ’11, Apr 2011, pp. 1–9.

[13] E. De Cristofaro, M. Manulis, and B. Poettering, “Private discovery of common social contacts,” in Applied Cryptography and Network Security. Springer, 2011, pp. 147–165.

[14] E. De Cristofaro, A. Durussel, and I. Aad, “Reclaiming privacy for smartphone applications,” in Pervasive Computing and Communications (PerCom), 2011 IEEE International Conference on,march 2011, pp. 84 –92.

[15] M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic faulttolerant distributed computation.”

[16] R. Gennaro, M. O. Rabin, and T. Rabin, “Simplified vss and fast-track multiparty computations with applications to threshold cryptography,” in ACM PODC ’98, 1998, pp. 101–111.

[17] T. Nishide and K. Ohta, “Multiparty computation for interval, equality, and comparison without bitdecomposition protocol,” in PKC’07, 2007, pp. 343– 360.