IJSTR

International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
0.2
2019CiteScore
 
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020

CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT

IJSTR >> Volume 10 - Issue 2, February 2021 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



An Efficient And Secure Profile Matching Scheme For Encounter Based Mobile Social Network

[Full Text]

 

AUTHOR(S)

Fizza Abbas, Ubaidullah Rajput, Umair Ali Khan, Farwa Abbas

 

KEYWORDS

 

ABSTRACT

Mobile Social Network (MSN) is an emerging area in recent years where many users are enjoying the facilities of social network on their mobile devices. Encounter-based MSN is a type of MSN where users share a short encounter, exchange some encounter information, and communicate later with the help of the shared encounter information. Encounter-based MSN inherent most of the security and privacy issues associated with MSN. Profile matching is an important and vastly used application of MSN as well as encounter-based MSN. In profile matching, users need to share and match their private information (such as interests). A high similarity may lead to a friendship. The revelation of this private information to an attacker can pose significant threats to the user’s privacy. In encounter-based MSN, a significant issue is the secure and accurate exchange of encounter information that can be later used for verification of the encounter. This paper proposes a secure and privacy preserving profile matching mechanism for encounter-based MSN. We have proposed a secure encounter phase and a profile matching phase. During encounter phase, users share their identity along with their signed public key and encrypted interests. The public key is signed by a registration server. During the profile matching phase, users’ encrypted interests are matched, and the encrypted results are sent to respective users. The exchange of this information is in encrypted form and only legitimate user can decrypt it. To show the feasibility of the proposed scheme, the computational cost is calculated. In the end, it is observed that the proposed scheme is taking reasonable time to calculate the interests securely. Moreover, the comparison shows that proposed scheme also provides prevention from Sybil attacks, impersonation while keeping the privacy of the users intact. Index Terms— Encounter based mobile social network, Interests, Mobile social network (MSN), Privacy, Paillier cryptosystem, Profile matching, Security.

 

REFERENCES

[1] Najaflou, Y., Jedari, B., Xia, F., Yang, L. T., & Obaidat, M. S. “Safety Challenges and Solutions in Mobile Social Networks,” IEEE Systems Journal, 2013.
[2] R. Zhang, Y. Zhang, J. Sun,and G. Yan,“ Fine-grained Private Matching for Proximity-Based Mobile Social Networking," IEEE INFOCOM, pp. 1969- 1977, 2012.
[3] J. Manweiler, R. Scudellari, and L. P. Cox, “SMILE: encounter-based trust for mobile social services," 16th ACM conference on Computer and communications security, pp. 246-255, 2009
[4] R. Agrawal, A. Evmievski, and R. Srikant, ``Information sharing across private databases,'' in Proc. ACM Int. Conf. Manage. Data (SIGMOD), 2003, pp. 86-97.
[5] Q. Xie and U. Hengartner, “Privacy-preserving matchmaking for mobile social networking secure against malicious users,” IEEE 9th International Conference on Trust, Security and Privacy in Computing and Communications, pp. 252-259, 2011.
[6] Y. Wang, J. Hou, Y. Xia, and H. Z. Li, ``Efficient privacy preserving matchmaking for mobile social networking,'' against malicious users,'' Concurrency Comput., Practice Exper., vol. 27, no. 12, pp. 2924-2937, 2015.
[7] A. Mohaien, D. F. Kune, E. Y. Vasserman, M. Kim, and Y. Kim, “ Secure encounter-based mobile social networks: Requirements, designs, and tradeoffs," IEEE Transaction on Dependable and Secure Computing, vol. 10, no. 6, pp. 380-393, 2013.
[8] N. Eagle and A. Pentland, ``Social serendipity: Mobilizing social software,'' IEEE Pervasive Comput., vol. 4, no. 2, pp. 28-34, Jan./Mar. 2005.
[9] L. P. Cox, A. Dalton, and V. Marupadi, ``SmokeScreen: Flexible privacy controls for presence-sharing,'' in Proc. ACM 6th Int. Conf. Mobile Syst., Appl. Services (MobiSys), 2007, pp. 233-245.
[10] H. Li, Y. Chen, X. Cheng, K. Li, and D. Chen, “Secure friend discovery based on encounter history in mobile social networks,” Springer Journal of Personal and Ubiquitous Computing, vol. 19, no. 7, pp. 999-1009, 2015.
[11] Bhattacharjee, S., & Bit, S. D. (2019). EnTER: an encounter based throwbox deployment strategy for enhancing network reliability in post-disaster scenarios over DTN. In Proceedings of the 20th International Conference on Distributed Computing and Networking (pp. 413-416). ACM.
[12] A. Nagender, and S. Gambhir. "Recent Advances in Ad-Hoc Social Networking: Key Techniques and Future Research Directions." Wireless Personal Communications (2020): 1-19.
[13] P. Paillier and D. Pointcheval, “Efficient public-key cryptosystems provably secure against active adversaries,” in International Conference on the Theory and Application of Cryptology and Information Security. Springer, 1999, pp. 165–179.
[14] P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 1999, pp. 223–238.
[15] C. heng-Hao, W. Chuen Wu, C. Wang, Tzung-Shi Chen, and J. Chen. "Friend recommendation for location-based mobile social networks." IEEE seventh international conference on innovative mobile and internet services in ubiquitous computing, pp. 365-370, 2013.