Secure encounter-based social networks: requirements, challenges, and designs

Authors:
Abedelaziz Mohaisen;Eugene Y. Vasserman;Max Schuchard;Denis Foo Kune;Yongdae Kim
Affiliations:
University of Minnesota, Minneapolis, MN, USA;Kansas State University, Manhattan, KS, USA;University of Minnesota, Minneapolis, MN, USA;University of Minnesota, Minneapolis, MN, USA;University of Minnesota, Minneapolis, MN, USA
Venue:
Proceedings of the 17th ACM conference on Computer and communications security
Year:
2010

Citing 4
Cited 0

Tor: the second-generation onion router

SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
We saw each other on the subway: secure, anonymous proximity-based missed connections

Proceedings of the 10th workshop on Mobile Computing Systems and Applications
Performance Measurements of Tor Hidden Services in Low-Bandwidth Access Networks

ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
SMILE: encounter-based trust for mobile social services

Proceedings of the 16th ACM conference on Computer and communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we outline requirements, challenges, and designs for encounter-based mobile social networks, where relationships are based on a temporarily shared location. To illustrate the challenges we examine a recently proposed design, SMILE, against a set of functional and security requirements. We show that SMILE is vulnerable to several attacks such as impersonation, collusion, and privacy breaching, even though it was built with the explicit goal of resisting some of those attacks. With this in mind, we construct a flexible framework for secure mobile social networks, and describe how to use it in order to construct several networks which offer somewhat different security properties. Each of the designs is then examined against the ideal requirements where some are shown to outperform previous work.