Efficient and Persistent Profile Matching in the Propinquity Mobile Social Networks
Keywords:
Privacy, Mobile Social Networking, Profile Matching, Vulnerable, Ad-Hoc NetworksAbstract
Mobile social networks (MSNs) refer to the social networking for making new connections. In the MSNs personal preferences is an imperative service, where user can find matching users within the range. In the existing systems all services, generally all users can create specific profile and publish it into social networks to interconnect with the new people. It may contain some sensitive information also these types of sensitive users may not publish their profile into social networks as a public. A propinquity mobile social network refers to virtual interaction with the data (BLUETOOTH/WI-FI) interfaces on their smart phones. These social networks are more popular due to the recently growth of smart phone users. To reveal sensitive user�s profile is most vulnerable in these devices. In these services conflicts with the user�s privacy concerns about reveal their personal profiles to complete strangers before deciding to interact with them. In this paper takes this open challenge to overcome with the novel strategy. In this paper prior security work is focused on privacy to users� profiles with using high efficient symmetric cryptographic primitives.
References
Z. Yang, B. Zhang, J.Dai, A.Champion, D.Xuan, and D. Li, “E-smart Talker: A distributed mobile system for social networking in physical proximity,” in ICDCS’10, Genoa, Italy, June 2010, pp. 468-477.
T. Nishide and K. Ohta, “Multyparty Computation for interval, equality, and comparisons without bit-decomposition protocol,” in PKC’07,2007, pp. 343-360.
Y. Qi and M. J. Atallah, “Efficient privacy-preserving K-nearest neighbor search,” in IEEE ICDCS’08,2008, pp. 311-319.
M. Li, S. Yu, J.D. Guttman, W. Lou, and K. Ren, “Secure Adhoc trust initialization and key management in wireless body area networks,” ACM Transactions on sensor Networks(TOSN), 2012.
Z. Yang, B. Zhang, J. Dai, A. Champion, D. Xuan, D. Li, “E-smarttaliker: A distributed mobile system for social networking in physical proximity,” in IEEE ICDCS’10, June, 2010.
G. Asharov and Y. Lindell, “ A full proof of the bgw protocol for perfectly-secure multiparty computation,” Advances in CryptologyCRYPTO 2011,2011.
M. Ben-Or, S.Goldwasser, and A.Wigderson,”Completeness theorems for non-cryptographic fault-tolerant distributed computation.”
R. Gennaro, M.O.Rabin, and T. Rabin, “simplified vss and fast-track multiparty computations with applications to threshold cryptography,” in ACM PODC ’98, 1998, pp. 101-111.
Josef Pieprzyk , Hossein Ghodosi and Ron Steinfeld, “multi-Party Computation with Conversion of secret Sharing,” NTU, Singapore, September 2011.
R. W. Baldwin and W. C. Gramlich, “Cryptographic protocol for trustable match making,” in IEEE S&P’85, Oakland, CA,April 1985.
G. Ateniese, M. Blanton, and J. Kirsch, “Secret handshakes with dynamic and fuzzy matching,” in NDSS’07, San Diego, CA, FEB. 2007.
Srihari babu. Kolla and B B K Prasad, “A Survey of Source Routing Protocols, Vulnerabilities and Security in wireless Adhoc networks” IJCSE vol 2 no.4 pp. 20-25. April 2014.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
