Authenticating strangers in fast mixing online social networks

Xinxin Zhao, Lingjun Li, Guoliang Xue

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

4 Citations (Scopus)

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 publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
StatePublished - 2011
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: Dec 5 2011Dec 9 2011

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

Zhao, X., Li, L., & Xue, G. (2011). Authenticating strangers in fast mixing online social networks. In GLOBECOM - IEEE Global Telecommunications Conference [6134343] https://doi.org/10.1109/GLOCOM.2011.6134343

Authenticating strangers in fast mixing online social networks. / Zhao, Xinxin; Li, Lingjun; Xue, Guoliang.

GLOBECOM - IEEE Global Telecommunications Conference. 2011. 6134343.

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

Zhao, X, Li, L & Xue, G 2011, Authenticating strangers in fast mixing online social networks. in GLOBECOM - IEEE Global Telecommunications Conference., 6134343, 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011, Houston, TX, United States, 12/5/11. https://doi.org/10.1109/GLOCOM.2011.6134343
Zhao X, Li L, Xue G. Authenticating strangers in fast mixing online social networks. In GLOBECOM - IEEE Global Telecommunications Conference. 2011. 6134343 https://doi.org/10.1109/GLOCOM.2011.6134343
Zhao, Xinxin ; Li, Lingjun ; Xue, Guoliang. / Authenticating strangers in fast mixing online social networks. GLOBECOM - IEEE Global Telecommunications Conference. 2011.
@inproceedings{db44c7b223ef458b8c51d0414946d40d,
title = "Authenticating strangers in fast mixing online social networks",
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 = "Authentication, Fast Mixing, Online Social Networks, Zero-Knowledge Proof",
author = "Xinxin Zhao and Lingjun Li and Guoliang Xue",
year = "2011",
doi = "10.1109/GLOCOM.2011.6134343",
language = "English (US)",
isbn = "9781424492688",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Authenticating strangers in fast mixing online social networks

AU - Zhao, Xinxin

AU - Li, Lingjun

AU - Xue, Guoliang

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Authentication

KW - Fast Mixing

KW - Online Social Networks

KW - Zero-Knowledge Proof

UR - http://www.scopus.com/inward/record.url?scp=84863164988&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863164988&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2011.6134343

DO - 10.1109/GLOCOM.2011.6134343

M3 - Conference contribution

AN - SCOPUS:84863164988

SN - 9781424492688

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -