{"title":"Towards User Re-Authentication on Mobile Devices via On-Screen Keyboard","authors":"Zijiang Hao, Qun A. Li","doi":"10.1109/HotWeb.2016.22","DOIUrl":"https://doi.org/10.1109/HotWeb.2016.22","url":null,"abstract":"Mobile devices have become our true companions in recent years. While bringing plenty of convenience, they also come with many security and privacy concerns. Being small, a mobile device is prone to loss or theft. Privacy data such as emails in a saved Gmail or Yahoo account on a lost device can be easily accessed by an unwanted visitor. Therefore, it is essential to research methods protecting mobile devices from any such unauthorized access. In this paper, we explore the potential of re-authenticating mobile device users by exploiting the biometrics derived from their tapping behaviors on the on-screen keyboard. We conduct an offline analysis on a dataset collected from 33 subjects using a Google Nexus S phone. The results show that more than 90% accuracy can be achieved for text input with 20 continuous key-taps.","PeriodicalId":408635,"journal":{"name":"2016 Fourth IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131048942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Client-Centric Content Delivery Network","authors":"Sipat Triukose, M. Rabinovich","doi":"10.1109/HotWeb.2016.9","DOIUrl":"https://doi.org/10.1109/HotWeb.2016.9","url":null,"abstract":"Content delivery networks (CDNs) carry a large portion of today's web traffic. Any improvement in their performance would have a direct impact on Internet users' experience. We propose a client-centric approach to improve the content delivery performance of CDNs with minimal alteration of the current CDN platform. A preliminary evaluation of our approach based on traffic traces from a large organization network shows significant promise, with around 22%-36% performance improvement for HTTP object downloads.","PeriodicalId":408635,"journal":{"name":"2016 Fourth IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134350503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Greedy Maximization Framework for Graph-Based Influence Functions","authors":"E. Cohen","doi":"10.1109/HotWeb.2016.14","DOIUrl":"https://doi.org/10.1109/HotWeb.2016.14","url":null,"abstract":"The study of graph-based submodular maximization problems was initiated in a seminal work of Kempe, Kleinberg, and Tardos (2003): An influence function of subsets of nodes is defined by the graph structure and the aim is to find subsets of seed nodes with (approximately) optimal tradeoff of size and influence. Applications include viral marketing, monitoring, and active learning of node labels. This powerful formulation was studied for (generalized) coverage functions, where the influence of a seed set on a node is the maximum utility of a seed item to the node, and for pairwise utility based on reachability, distances, or reverse ranks. We define a rich class of influence functions which unifies and extends previous work beyond coverage functions and specific utility functions. We present a meta-algorithm for approximate greedy maximization with strong approximation quality guarantees and worst-case near-linear computation for all functions in our class. Our meta-algorithm generalizes a recent design by Cohen et al (2014) that was specific for distance-based coverage functions.","PeriodicalId":408635,"journal":{"name":"2016 Fourth IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)","volume":"17 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121009579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"PROVIDE: Hiding from Automated Network Scans with Proofs of Identity","authors":"W. Koch, Azer Bestavros","doi":"10.1109/HOTWEB.2016.20","DOIUrl":"https://doi.org/10.1109/HOTWEB.2016.20","url":null,"abstract":"Network scanners are a valuable tool for researchers and administrators, however they are also used by malicious actors to identify vulnerable hosts on a network. Upon the disclosure of a security vulnerability, scans are launched within hours. These opportunistic attackers enumerate blocks of IP addresses in hope of discovering an exploitable host. Fortunately, defensive measures such as port knocking protocols (PKPs) allow a service to remain stealth to unauthorized IP addresses. The service is revealed only when a client includes a special authentication token (AT) in the IP/TCP header. However this AT is generated from a secret shared between the clients/servers and distributed manually to each endpoint. As a result, these defense measures have failed to be widely adopted by other protocols such as HTTP/S due to challenges in distributing the shared secrets. In this paper we propose a scalable solution to this problem for services accessed by domain name. We make the following observation: automated network scanners access servers by IP address, while legitimate clients access the server by name. Therefore a service should only reveal itself to clients who know its name. Based on this principal, we have created a proof of the verifier's identity (a.k.a. PROVIDE) protocol that allows a prover (legitimate user) to convince a verifier (service) that it is knowledgeable of the verifier's identity. We present a PROVIDE implementation using a PKP and DNS (PKP+DNS) that uses DNS TXT records to distribute identification tokens (IDTs) while DNS PTR records for the service's domain name are prohibited to prevent reverse DNS lookups. Clients are modified to make an additional DNS TXT query to obtain the IDT which is used by the PKP to generate an AT. The inclusion of an AT in the packet header, generated from the DNS TXT query, is proof the client knows the service's identity. We analyze the effectiveness of this mechanism with respect to brute force attempts for various strength ATs and discuss practical considerations.","PeriodicalId":408635,"journal":{"name":"2016 Fourth IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126814291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}