Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Mobile Social Networks for Flattering Unsigned Profile Matching

M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Assistant Professor, Priyadarshini Institute of Technology and Science for Women

Social networking makes digital communication technologies sharpening tools for extending the social circle of people. Privacy preservation is a significant research issue in social networking. Here user Profile matching with privacy preservation in mobile social networks (MSNs) is studied and a family of Profile matching protocols is introduced. An explicit Comparison-based Profile matching protocol (eCPM) which runs between two parties, an initiator and a responder is proposed which enables the initiator to obtain the comparison-based matching result about a specified attribute in their Profiles, while preventing their attribute values from disclosure. An implicit Comparison-based Profile matching protocol (iCPM) is then proposed which allows the initiator to directly obtain some messages instead of the comparison result from the responder. The messages unrelated to user Profile can be divided into multiple categories by the responder. The initiator implicitly chooses the interested category which is unknown to the responder. Two messages in each category are prepared by the responder, and only one message can be obtained by the initiator according to the comparison result on a single attribute. iCPM is further generalized into an implicit Predicate-based Profile matching protocol (iPPM) which allows complex comparison criteria spanning multiple attributes.

ANUSHA.V,K.SUMALATHA."Mobile Social Networks for Flattering Unsigned Profile Matching". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.384-390, DECEMBER - 2014, URL :,

Keywords : Mobile social network, Profile matching, privacy preservation, Homomorphic encryption, oblivious transfer

[2] A. G. Miklas, K. K. Gollu, K. K. W. Chan, S. Saroiu, P.
K. Gummadi, and E. de Lara, ‚Exploiting social
interactions in mobile systems,‛ in Ubicomp, 2007, pp.
[3] S. Ioannidis, A. Chaintreau, and L. Massouli´e,
‚Optimal and scalable distribution of content updates
over a mobile social network,‛ in Proc. IEEE INFOCOM,
2009, pp. 1422–1430.
[4] R. Lu, X. Lin, and X. Shen, ‚Spring: A social-based
privacy-preserving packet forwarding protocol for
vehicular delay tolerant networks,‛ in Proc. IEEE
INFOCOM, 2010, pp. 632–640.
[5] W. He, Y. Huang, K. Nahrstedt, and B. Wu,
‚Message propagation in ad- hoc-based proximity
mobile social networks,‛ in PERCOM workshops, 2010,
pp. 141–146.
[6] D. Niyato, P. Wang, W. Saad, and A. Hjørungnes,
‚Controlled coalitional games for cooperative mobile social networks,‛ IEEE Transactions on Vehicular
Technology, vol. 60, no. 4, pp. 1812–1824, 2011.
[7] M. Motani, V. Srinivasan, and P. Nuggehalli,
‚Peoplenet: engineering a wireless virtual social
network,‛ in MobiCom, 2005, pp. 243–257.
[8] M. Brereton, P. Roe, M. Foth, J. M. Bunker, and L.
Buys, ‚Designing participation in agile ridesharing with
mobile social software,‛ in OZCHI, 2009, pp. 257–260.
[9] E.Bulut and B.Szymanski, ‚Exploiting friendship
relations for efficient routing in delay tolerant mobile
social networks,‛ IEEE Transactions on Parallel and
Distributed Systems, vol. 23, no. 12, pp. 2254–2265, 2012.
[10] 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 ICDCS,
2010, pp. 468–477.
[11] Q. Li, S. Zhu, and G. Cao, ‚Routing in socially
selfish delay tolerant networks,‛ in Proc. IEEE
INFOCOM, 2010, pp. 857–865.
[12] X. Liang, X. Li, T. H. Luan, R. Lu, X. Lin, and X.
Shen, ‚Morality- driven data forwarding with privacy
preservation in mobile social networks,‛ IEEE
Transactions on Vehicular Technology, vol. 7, no. 61, pp.
3209–3222, 2012.
[13] R. Gross, A. Acquisti, and H. J. H. III, ‚Information
revelation and privacy in online social networks,‛ in
WPES, 2005, pp. 71–80.
[14] F. Stutzman, ‚An evaluation of identity-sharing
behavior in social network communities.‛ iDMAa
Journal, vol. 3, no. 1, pp. 10–18, 2006.
[15] K. P. N. Puttaswamy, A. Sala, and B. Y. Zhao,
‚Starclique: guaranteeing user privacy in social
networks against intersection attacks,‛ in CoNEXT,
2009, pp. 157–168.
[16] E. Zheleva and L. Getoor, ‚To join or not to join: the
illusion of privacy in social networks with mixed public
and private user profiles,‛ in WWW, 2009, pp. 531–540.
[17] G. Chen and F. Rahman, ‚Analyzing privacy
designs of mobile social networking applications,‛
IEEE/IFIP International Conference on Em- bedded and
Ubiquitous Computing, vol. 2, pp. 83–88, 2008. 
[18] D.
Balfanz, G. Durfee, N. Shankar, D. K. Smetters, J.
Staddon, and H.- C. Wong, ‚Secret handshakes from
pairing-based key agreements,‛ in IEEE Symposium on
Security and Privacy, 2003, pp. 180–196. 
[19] M. J.
Freedman, K. Nissim, and B. Pinkas, ‚Efficient private
matching and set intersection,‛ in EUROCRYPT, 2004,
pp. 1–19.
[20] R. Lu, X. Lin, X. Liang, and X. Shen, ‚A secure
handshake scheme with symptoms-matching for
healthcare social network,‛ ACM Mobile Networks and
Applications (MONET), vol. 16, no. 6, pp. 683–694, 2011.
[21] M. Li, N. Cao, S. Yu, and W. Lou, ‚Findu: Privacypreserving personal profile matching in mobile social
networks,‛ in Proc. IEEE INFOCOM, 2011, pp. 2435–
[22] R. Zhang, Y. Zhang, J. Sun, and G. Yan, ‚Finegrained private matching for proximity-based mobile
social networking,‛ in Proc. IEEE INFO- COM, 2012, pp.
[23] W. Dong, V. Dave, L. Qiu, and Y. Zhang, ‚Secure
friend discovery in mobile social networks,‛ in Proc.
IEEE INFOCOM, 2011, pp. 1647– 1655.
[24] J. Freudiger, M. H. Manshaei, J.-P. Hubaux, and D.
C. Parkes, ‚On non- cooperative location privacy: a
game-theoretic analysis,‛ in ACM CCS, 2009, pp. 324–
[25] R. Lu, X. Lin, H. Luan, X. Liang, and X. Shen,
‚Pseudonym changing at social spots: An effective
strategy for location privacy in vanets,‛ IEEE
Transactions on Vehicular Technology, vol. 61, no. 1, pp.
86 – 96, 2011.
[26] J. Katz, A. Sahai, and B. Waters, ‚Predicate
encryption supporting dis- junctions, polynomial
equations, and inner products,‛ in EUROCRYPT, 2008,
pp. 146–162.
[27] N. Eagle and A. Pentland, ‚Social serendipity:
mobilizing social soft- ware,‛ IEEE Pervasive
Computing, vol. 4, no. 2, pp. 28–34, 2005.
[28] J. Teng, B. Zhang, X. Li, X. Bai, and D. Xuan, ‚Eshadow: Lubricating social interaction using mobile
phones,‛ in ICDCS, 2011, pp. 909–918. 
[29] B. Han and A. Srinivasan, ‚Your friends have more
friends than you do: identifying influential mobile users
through random walks,‛ in MobiHoc, 2012, pp. 5–14.
[30] 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 ICDCS,
2010, pp. 468–477.
[31] L. Kissner and D. X. Song, ‚Privacy-preserving set
operations,‛ in CRYPTO, 2005, pp. 241–257. 
[32] Q. Ye,
H. Wang, and J. Pieprzyk, ‚Distributed private
matching and set operations,‛ in ISPEC, 2008, pp. 347–
[33] D. Dachman-Soled, T. Malkin, M. Raykova, and M.
Yung, ‚Efficient robust private set intersection,‛ in
ACNS, 2009, pp. 125–142.
[34] S. Jarecki and X. Liu, ‚Efficient oblivious
pseudorandom function with applications to adaptive ot
and secure computation of set intersection,‛ in TCC,
2009, pp. 577–594.
[35] C. Hazay and Y. Lindell, ‚Efficient protocols for set
intersection and pattern matching with security against
malicious and covert adversaries,‛ Journal of
Cryptology, vol. 23, no. 3, pp. 422–456, 2010.
[36] B. Goethals, S. Laur, H. Lipmaa, and T.
Mielik¨ainen, ‚On private scalar product computation
for privacy-preserving data mining,‛ in ICISC, 2004, pp.


Download :

Refbacks : Currently there are no Refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal