Authenticating strangers in fast mixing online social networks

Xinxin Zhao, Lingjun Li, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
DOIs
StatePublished - 2011
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: Dec 5 2011Dec 9 2011

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
CountryUnited States
CityHouston, TX
Period12/5/1112/9/11

Keywords

  • Authentication
  • Fast Mixing
  • Online Social Networks
  • Zero-Knowledge Proof

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this