Visible to the public Wifi authentication through social networks #x2014; A decentralized and context-aware approach

TitleWifi authentication through social networks #x2014; A decentralized and context-aware approach
Publication TypeConference Paper
Year of Publication2014
AuthorsDurmus, Y., Langendoen, K.
Conference NamePervasive Computing and Communications Workshops (PERCOM Workshops), 2014 IEEE International Conference on
Date PublishedMarch
Keywordsauthentication, authentication mechanism, authorisation, Authorization, context-aware approach, decentralized approach, EAP-SocTLS, EAP-TLS, embedded trust relations, heuristic, IEEE 802.11 Standards, message authentication, password, physical proximity, Probes, Protocols, quadratic search complexity, search problems, search time reduction, security principles, Servers, smartphone, Social Devices, Social network services, social networking (online), social networks, telecommunication security, Trusted Computing, ubiquitous computing, WebID, WiFi authentication, WiFi Authentication and Authorization, WiFi router, WiFi-enabled devices, wireless LAN
Abstract

With the proliferation of WiFi-enabled devices, people expect to be able to use them everywhere, be it at work, while commuting, or when visiting friends. In the latter case, home owners are confronted with the burden of controlling the access to their WiFi router, and usually resort to simply sharing the password. Although convenient, this solution breaches basic security principles, and puts the burden on the friends who have to enter the password in each and every of their devices. The use of social networks, specifying the trust relations between people and devices, provides for a more secure and more friendly authentication mechanism. In this paper, we progress the state-of-the-art by abandoning the centralized solution to embed social networks in WiFi authentication; we introduce EAP-SocTLS, a decentralized approach for authentication and authorization of WiFi access points and other devices, exploiting the embedded trust relations. In particular, we address the (quadratic) search complexity when indirect trust relations, like the smartphone of a friend's kid, are involved. We show that the simple heuristic of limiting the search to friends and devices in physical proximity makes for a scalable solution. Our prototype implementation, which is based on WebID and EAP-TLS, uses WiFi probe requests to determine the pool of neighboring devices and was shown to reduce the search time from 1 minute for the naive policy down to 11 seconds in the case of granting access over an indirect friend.

DOI10.1109/PerComW.2014.6815263
Citation Key6815263