Common friends discovery with privacy and authenticity

Shin Yan Chiou*, Shih Ying Chang, Hung Min Sun

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

In this paper, we propose a common friend discovery algorithm considering the privacy of users and the authenticity of friend relationships. The privacy means users' other friends' information does not be leaked except their common friends. The authenticity signifies anyone can not successfully claim he is a friend of someone unless he really is. It has many applications such as playing games by friends, finding talking-topics by strangers, finding introducer of job interview, finding matchmaker of someone you desire to know, etc. We consider its security and matching probability. We also implement the algorithm in two mobile phones to prove that it is workable.

Original languageEnglish
Title of host publication5th International Conference on Information Assurance and Security, IAS 2009
Pages337-340
Number of pages4
DOIs
StatePublished - 2009
Externally publishedYes
Event5th International Conference on Information Assurance and Security, IAS 2009 - Xian, China
Duration: 18 08 200920 09 2009

Publication series

Name5th International Conference on Information Assurance and Security, IAS 2009
Volume1

Conference

Conference5th International Conference on Information Assurance and Security, IAS 2009
Country/TerritoryChina
CityXian
Period18/08/0920/09/09

Fingerprint

Dive into the research topics of 'Common friends discovery with privacy and authenticity'. Together they form a unique fingerprint.

Cite this