Title :
Authenticating Strangers in Fast Mixing Online Social Networks
Author :
Zhao, Xinxin ; Li, Lingjun ; Xue, Guoliang
Abstract :
Making new connections is a crucial service in current online social networks. However, such a service can also raise a big security concern. For example, two strangers become friends in the online social network and they want to communicate securely. The messages transmitted between them could be encrypted using their public keys and decrypted using their private keys. However, one can not determine whether this public key indeed belongs to the claimed user. In this paper, we design a system to authenticate two strangers in fast mixing online social networks. We make a thorough analysis on our system and show that there is a high probability of finding witness users in fast mixing social networks.
Keywords :
message authentication; private key cryptography; probability; public key cryptography; social networking (online); decryption; fast mixing online social network; messages encryption; private keys; probability; public keys; security concern; stranger authentication; Authentication; Communication channels; Peer to peer computing; Protocols; Public key; Social network services;
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
Conference_Location :
Houston, TX, USA
Print_ISBN :
978-1-4244-9266-4
Electronic_ISBN :
1930-529X
DOI :
10.1109/GLOCOM.2011.6134343