Common friends discovery with privacy and authenticity

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 IEEE.

Cite

CITATION STYLE

APA

Chiou, S. Y., Chang, S. Y., & Sun, H. M. (2009). Common friends discovery with privacy and authenticity. In 5th International Conference on Information Assurance and Security, IAS 2009 (Vol. 1, pp. 337–340). https://doi.org/10.1109/IAS.2009.208

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free