TY - GEN
T1 - Common friends discovery with privacy and authenticity
AU - Chiou, Shin Yan
AU - Chang, Shih Ying
AU - Sun, Hung Min
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/74049164714
U2 - 10.1109/IAS.2009.208
DO - 10.1109/IAS.2009.208
M3 - 会议稿件
AN - SCOPUS:74049164714
SN - 9780769537443
T3 - 5th International Conference on Information Assurance and Security, IAS 2009
SP - 337
EP - 340
BT - 5th International Conference on Information Assurance and Security, IAS 2009
T2 - 5th International Conference on Information Assurance and Security, IAS 2009
Y2 - 18 August 2009 through 20 September 2009
ER -