Making new connections according to personal preferences is a crucial service in mobile social networking, where the initiating user can find matching users within physical proximity of him/her. In existing systems for such services, usually all the users directly publish their complete profiles for others to search. However, in many applications, the users’ personal profiles may contain sensitive information that they do not want to make public. In this paper, we propose Find U, the first privacy-preserving personal profile matching schemes for mobile social networks. In Find U, an initiating user can find from a group of users the one whose profile best matches with his/her; to limit the risk of privacy exposure, only necessary and minimal information about the private attributes of the participating users is exchanged. Matching user profiles using their physical proximity via mobile social networking is a critical thing. We propose Find U, the concept used to limit the privacy levels and also to find the best matching profiles. To realize the user privacy levels here we are using secure multiparty computation (SMC) techniques. We also propose protocols such as PSI, PCSI to prove their security proofs. We evaluate the efficiency of the protocols by adopting the total run time and energy consumption.

B.ASWINI,B.RANJITH."Robust Model-Based Data Management". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.453-460, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I616.pdf,

[1] The Description Logic Handbook: Theory,
Implementation, and Applications, F. Baader, D.
Calvanese, D. McGuinness, D. Nardi, P.F. PatelSchneider, eds. Cambridge Univ. Press, 2003.
[2] Modular Ontologies: Concepts, Theories and
Techniques for Knowledge Modularization, H.
Stuckenschmidt, C. Parent, S. Spaccapietra, eds.
Springer, 2009.
[3] S. Ghilardi, C. Lutz, and F. Wolter, “Did I Damage
My Ontology? A Case for Conservative Extensions in
Description Logics,” Proc.10th Int’l Conf. Principles of
Knowledge Representation and Reasoning
(KR), 2006.
[4] R. Kontchakov, L. Pulina, U. Sattler, T. Schneider, P.
Selmer, F.Wolter, and M. Zakharyaschev, “Minimal
Module Extraction from DL-Lite Ontologies Using QBF
Solvers,” Proc. 21st Int’l Joint Conf.Artificial
Intelligence (IJCAI), 2009.
[5] Z. Wang, K. Wang, R.W. Topor, and J.Z. Pan,
“Forgetting concepts in DL-Lite,” Proc. Fifth European
Semantic Web Conf. Semantic Web:Research and
Applications (ESWC), 2008.
[6] B. Konev, D. Walther, and F. Wolter, “Forgetting
and Uniform Interpolation in Extensions of the
Description Logic EL,” Proc.22nd Int’l Workshop
Description Logics, 2009.
[7] B. Konev, C. Lutz, D. Walther, and F. Wolter,
“Semantic Modularity and Module Extraction in
Description Logics,” Proc.18th European Conf.
Artificial Intelligence (ECAI), 2008.
[8] B. Konev, D. Walther, and F. Wolter, “Forgetting
and Uniform Interpolation in Large-Scale Description
Logic Terminologies,” Proc. 21st Int’l Joint Conf.
Artifical intelligence (IJCAI), 2009.
[9] B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U.
Sattler, “Just the Right Amount: Extracting Modules
from Ontologies,” Proc. 16th Int’l Conf. World Wide
Web (WWW), 2007.
[10] K. Wang, Z. Wang, R.W. Topor, J.Z. Pan, and G.
Antoniou, “Concept and Role Forgetting in ALC
Ontologies,” Proc.Eighth
Int’l Semantic Web Conf. (ISWC), 2009.
[11] D. Calvanese, G.D. Giacomo, D. Lembo, M.
Lenzerini, and R.Rosati, “Tractable Reasoning andEfficient Query Answering in Description Logics: The
DL-Lite Family,” J. Automated Reasoning,vol. 39, no. 3,
pp. 385-429, 2007.
[12] O. Palombi, G. Bousquet, D. Jospin, S. Hassan, L.
Reve´ret, and F.Faure, “My Corporis Fabrica: A Unified
Ontological, Geometrical and Mechanical View of
Human Anatomy,” Proc. Second Workshop
3D Physiological Human (3DPH), 2009.
[13] S. Abiteboul, R. Hull, and V. Vianu, Foundations of
Databases. Addison-Wesley, 1995.
[14] M.Y. Vardi, “The Complexity of Relational Query
Languages,” Proc. 14th Ann. ACM Symp. Theory of
Computing (STOC), 1982.
[15] A. Cali, G. Gottlob, and T. Lukasiewicz, “Datalog+-
: A UnifiedApproach to Ontologies and Integrity
Constraints,” Proc. Int’l Conf. Database Theory (ICDT),
2009.
[16] R. Cattell, “Scalable Sql and Nosql Data Stores,”
SIGMOD Record,vol. 39, no. 4, pp. 12-27, 2010.
[17] B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U.
Sattler,“Extracting Modules from Ontologies: A LogicBased Approach,” Proc. Third Int’l Workshop OWL
Experiences and Directions(OWLED), 2007
[18] B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U.
Sattler, “Modular
Reuse of Ontologies: Theory and Practice,” J. Artificial
Intelligence Research, vol. 31, pp. 273-318, 2008.