![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
Privacy and Security in Storage of Matching Protocol for MSN
Discovery based on common attributes or similarity of users profile is a key component of mobile social networking. Preserving the privacy of profiles of matching users whiles matching is the major challenge of this system. These profiles contain very sensitive information managed by, setup procedures and revocation procedures. And to design distributed privacy preservation match protocol aimed at privacy preservation and security of users with a reduced communication cost.
Comparing their individual profile and is frequently the first step towards effectual As a security of User, directly publish their full profiles for remaining of them to search, the users' personal profile contain sensitive information which can't be open thing which is tried to solve MSN which are based on proximity. Attractive proximity-based communication platform for mobile users with similar interests, attributes, or background to communicate with each other. In this kind of proximity-based MSN, matching protocol is solving.
Data vector pre calculated by a central server which is trusted to stand for the location of a client in an online social network on social attribute data due to its key-sharing problem and information leakage problem.
Keywords
- M. Li, N. Cao, S. Yu, and W. Lou, “Findu: Privacy-preserving personal profile matching in mobile social networks,” in IEEE INFOCOM ’11, Apr 2011, pp. 1–9.
- 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 IEEE ICDCS ’10, June. 2010. 11
- R. Lu, X. Lin, X. Liang, and X. Shen, “A secure handshake scheme with symptomsmatching for mhealthcare social network,” Mobile networks and Applications, pp. 1–12, 2010.
- C. Zhang, X. Zhu, Y. Song, and Y. Fang, “C4: A new paradigm for providing incentives in multi-hop wireless networks,” in INFOCOM, 2011 Proceedings IEEE, april 2011, pp. 918 –926.
- M. Freedman, K. Nissim, and B. Pinkas, “Efficient private matching and set intersection,” in EUROCRYPT’04. Springer- Verlag, 2004, pp. 1–19.
- Q. Ye, H. Wang, and J. Pieprzyk, “Distributed private matching and set operations,” in ISPEC’08, 2008, pp. 347–360.
- E. D. Cristofaro and G. Tsudik, “Practical private set intersection protocols with linear complexity,” in Financial Cryptography and Data Security ’10, 2010.s
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 291
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 159