Abstract
Finding common items privately usually assumes the existence of a trusted infrastructure. However, a social proximity has to hold personal data in its database. It causes some concerns about data leakage from server database, trustfulness of the social proximity, unwilling disclosure of personal friendship, etc. The authenticity between users and the ownership of items also remain a difficult problem. This work presents private common friend matching algorithms that allow users to privately and immediately match their common friends via mobile devices or via remote connection. It considers the privacy of users and the authenticity of friend relationships, where the privacy means no private items, except common ones, is leaked, and the authenticity signifies no forgery relationships can be successfully claimed. Besides that, the matching probability shows its practicality. The algorithms are demonstrated to be secure, effective, and efficient. The implementation on mobile devices allows users securely finding their common friends.
Original language | English |
---|---|
Pages (from-to) | 191-197 |
Number of pages | 7 |
Journal | ICIC Express Letters, Part B: Applications |
Volume | 4 |
Issue number | 1 |
State | Published - 2013 |
Keywords
- Authenticity
- Privacy
- Security
- Social network