Abstract

In portable public networks creation of the new connection is important service. Where an existing client can discover related users bounded by objects nearness of him/her. In Portable public networks we can provide connection to the best profile matching users only. In general all the peoples frequently fill the information for profile before login in any portable public network. In this paper the existing user can see all the profiles by using search option. Here the problem is the existing user can see the profiles of the unknown users and hack the information. In this paper we proposed the security to the user's profiles by using with malicious model. Here matching profiles will be display but non matching profiles will not display. The problem is even we search the known person profile that profile will not match to yours profile then we cannot see the profile. So to overcome the problem by sending a request to the known user, the user will accept the request then the profile will display.

References

• Giles Hogben, ENISA (2007),ENISA Position Paper No. 1 "Security Issues and Recommendations for Online Social Networks"
• Elie Raad, Richard Chbeir, and Albert Dipanda," User Profile Matching in Social Networks" in Byourgogne University Dijon, France.
• Ralph Gross and Alessandro Acquisti,"Information Revelation and Privacy in Online Social Networks"
• Rui Zhang _ , Yanchao Zhang _ , Jinyuan (Stella) Suny, and Guanhua Yanzn, "Fine-grainedPrivate Matching for Proximity-basedMobile Social Networking".
• Muyuan Li, Zhaoyu Gao, Suguo Du, Haojin Zhu, Mianxiong Dong, KaoruOta,"PriMatch: Fairness-aware Secure Friend Discovery Protocol in Mobile Social Network".
• Q. Ye, H. Wang, and J. Pieprzyk, "Distributed private matching and set perations," in ISPEC'08, 2008.
• E. D. Cristofaro and G. Tsudik, "Practical private set intersection protocols with linear complexity," in Financial Cryptography and Data Security '10, 2010.
• L. Kissner and D. Song, "Privacy-preserving set operations," in CRYPTO '05, LNCS. Springer, 2005.
• A. C. Yao, "Protocols for secure computations," in SFCS82,1982.
• D. Dachman-Soled, T. Malkin, M. Raykova, and M. Yung, "Efficient robust private set intersection," in ACNS '09, 2009.
• 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 with information theoretic security," in CANS '09. Springer - Verlag, Dec. 2009.
• C. Hazay and Y. Lindell, "Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries," in TCC'08, 2008.
• 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.
• W. Dong, V. Dave, L. Qiu, and Y. Zhang, "Secure friend discovery in mobile social networks," in IEEE INFOCOM '11,Apr 2011.
• E. De Cristofaro, M. Manulis, and B. Poettering, "Private discovery of common social contacts," in Applied Cryptography and Network Security, Springer, 2011.