Attribute-Based Secure Friend Discovery in Online Social Networks

Abstract

Many proximity-based mobile social networks are developed to facilitate connections between any 2 folks,
or to assist a user to seek out folks with a matched profile at intervals an exact distance. A difficult task in these
applications is to guard the privacy of the participants’ profiles and communications. during this paper, we have a
tendency to style novel mechanisms, once given a preference-profile submitted by a user that search persons with
matching-profile in redistributed mobile social networks. Meanwhile, our mechanisms establish a secure line between
the leader and matching users at the time once an identical user is found. These techniques may be applied to conduct
privacy conserving keywords based mostly search with none secure line. Our analysis shows that our mechanism is
privacy-preserving (no participants’ profile and therefore the submitted preference-profile are exposed), verifiable (both
the leader and any unmatched user cannot cheat one another to faux to be matched), and economical in each
communication and computation. In-depth evaluations exploitation real social network information and actual system
implementation on sensible phones show that our mechanisms are considerably additional economical than existing
solutions. As a contribution we have a tendency to present an anonymous privilege management theme Annoy Control to
deal with not only the info privacy drawback in Server storage, however additionally the user identity privacy problems
in existing access management schemes. By exploitation multiple authorities in Server ADP system, our projected theme
achieves anonymous Server information access and fine grained privilege management. Our security proof and
performance analysis shows that Annoy Control is each secure and economical for Server computing atmosphere.