{"title":"Real-Time Client-Side Phishing Prevention Add-On","authors":"Giovanni Armano, Samuel Marchal, N. Asokan","doi":"10.1109/ICDCS.2016.44","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.44","url":null,"abstract":"Since existing solutions for steering users away from phishing websites are typically server-based, they have several drawbacks: they compromise user privacy, are not robust against adaptive attackers who serve different content at different times, and do not provide any guidance to users after flagging a website as a phish. To address these limitations, we present a new phishing prevention system implementing a fast and effective phishing detection technique we developed recently [1]. It is implemented as a client-side application and a browser add-on. It uses information extracted from website visited by the user to detect if it is a phish and warn the user. It also determines the target of the phish and offers to redirect the user there.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"55 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131830863","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":"Characterizing the Computational Power of Anonymous Mobile Robots","authors":"Mattia D’emidio, D. Frigioni, A. Navarra","doi":"10.1109/ICDCS.2016.58","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.58","url":null,"abstract":"The distributed setting of computational mobile entities, called robots, thathave to perform tasks without global coordination has been extensively studied in the literature. A well-known scenario is that in which robots operate in Look-Compute-Move (LCM) cycles. During each cycle, a robot acquires asnapshot of the surrounding environment (Look phase), then executes an appropriate algorithm by using the obtained snapshot as input (Computephase), and finally moves toward a desired destination, if any (Movephase). Look-Compute-Move cycles might be subject to different temporal constraints dictated by the considered schedule. The classic models for theactivation and synchronization of mobile robots are the well-known fully-synchronous, semi-synchronous, and asynchronous models. A first comprehensive evaluation of the computational power of robots operating in the LCM model and moving within the Euclidean plane, under different levels of synchronization, has been proposed in [Das et al., Int.'l Conf. on Distributed Computing Systems, 2012]. In detail, the authors provide a series of results that prove relations between classic models and variations of them, which consider the possibility that robots are endowed with a visible light, i.e. they are luminous, or with the capability to store some past snapshots, or combinations of them. In this paper, we are interested in similar settings but for robots moving on graphs. In particular, we propose a characterization of the computational power of mobile robots on graphs as follows. First, we show the relations among the three classic activation and synchronization models. Second, we compare the models where robots are endowed with lights against the models without lights. Third, we highlight the relations among the different models concerning luminous robots. Finally, we provide a detailed comparison of the proposed results with the case of robots moving in the Euclidean plane.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125195884","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":"DL-Store: A Distributed Hybrid OLTP and OLAP Data Processing Engine","authors":"Kaiwen Zhang, Mohammad Sadoghi, H. Jacobsen","doi":"10.1109/ICDCS.2016.71","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.71","url":null,"abstract":"There has been a recent push in the database community towards supporting real-time analytical queries (OLAP) while sustaining a large volume of fine-grained updates (OLTP). Supporting these types of workloads require both an efficient data storage layer as well as a distributed architecture. In this demo, we address the latter point with our Distributed Lineage-based Data Store (DL-Store), which is a distributed data processing engine. DL-Store is built on top of L-Store, which is a lineage-based storage architecture designed to handle mixed OLTP and OLAP workloads, and provides scalability and elasticity by supporting multiple L-Store nodes. To maintain the desired consistency semantics, DL-Store employs a distributed transaction handler component which can horizontally scaled by provisioning additional transaction manager nodes. We leverage partitioning in the record space of the transactions to minimize communication across transaction managers while ensuring consistent execution. The demo shows our implementation of DL-Store over Apache Spark using a variety of use cases.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114929844","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":"ChitChat: An Effective Message Delivery Method in Sparse Pocket-Switched Networks","authors":"Douglas McGeehan, D. Lin, S. Madria","doi":"10.1109/ICDCS.2016.69","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.69","url":null,"abstract":"The ubiquitous adoption of portable smart devices has enabled a new way of communication via Pocket Switched Networks (PSN), whereby messages are routed by personal devices inside the pockets of ever-moving people. PSNs provide opportunities for various interesting applications such as location based social networking, geolocal advertising, and military missions in active battlefields where the central communication tower is unavailable. One key challenge of the successful roll-out of PSN applications is the difficulty of achieving high message delivery ratio due to the dynamic nature of moving people and spatial-temporal sparsity in such networks. In this paper, we propose a novel message routing approach, called ChitChat, which exploits users' direct and transient social interests via discriminatory gossiping to penetrate messages deeper into the network. Our approach enables message carriers to make opportunistic and distributed routing decisions based on the likelihood a potential message receiver will meet individuals that have a high chance to forward the message to the destination. Our experimental results have demonstrated that our approach achieves higher delivery ratios against the two more recent state-of-the-art algorithms, while maintaining a lower communication overhead against flooding and reducing the amount of time messages remain idlein buffers.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123634779","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}
Antonino Rullo, Daniele Midi, Edoardo Serra, E. Bertino
{"title":"Strategic Security Resource Allocation for Internet of Things","authors":"Antonino Rullo, Daniele Midi, Edoardo Serra, E. Bertino","doi":"10.1109/ICDCS.2016.48","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.48","url":null,"abstract":"In many Internet of Thing (IoT) application domains security is a critical requirement, because malicious parties can undermine the effectiveness of IoT-based systems by compromising single components and/or communication channels. Thus, a security infrastructure is needed to ensure the proper functioning of such systems even under attack. In this paper, we focus on the problem of efficiently and effectively securing IoT networks by carefully allocating security tools.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124054268","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}
R. Birke, Mathias Björkqvist, Evangelia Kalyvianaki, L. Chen
{"title":"Dslash: Managing Data in Overloaded Batch Streaming Systems","authors":"R. Birke, Mathias Björkqvist, Evangelia Kalyvianaki, L. Chen","doi":"10.1109/ICDCS.2016.96","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.96","url":null,"abstract":"Peak loads are a challenge for streaming systems. Here we present Dslash, a latency-driven controller that keeps and processes as much data as the system resources allow in order to meet a target latency.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"875 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128211105","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":"DMZtore: A dispersed Data Storage System with Decentralized Multi-factor Access Control (Demo)","authors":"Ertem Esiner, Shun Hanli Hanley, Anwitaman Datta","doi":"10.1109/ICDCS.2016.42","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.42","url":null,"abstract":"While many commercial systems as well as academic techniques for data outsourcing to and content confidentiality from untrusted data stores have been developed over the last decade, when it comes to multi-factor authentication based layered security, existing approaches typically rely on a logically centralized service. In this demo, we present DMZtore edge storage system that incorporates a decentralized multi-factor access control scheme [1] achieving layered security.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129575159","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":"Accurate Spatial Calibration of RFID Antennas via Spinning Tags","authors":"Chunhui Duan, Lei Yang, Yunhao Liu","doi":"10.1109/ICDCS.2016.32","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.32","url":null,"abstract":"Recent years have witnessed the advance of RFID-based localization techniques that demonstrate high precision. Many efforts have been made locating RFID tags with a mandatory assumption that the RFID reader's position is known in advance. Unfortunately, calibrating reader's location manually is always time-consuming and laborious in practice. In this paper, we present Tagspin, an approach using COTS tags to pinpoint the reader (antenna) quickly and easily with high accuracy. Tagspin enables each tag to emulate a circular antenna array by uniformly spinning on the edge of a rotating disk. We design an SAR-based method for estimating the angle spectrum of the target reader. Compared to previous AoA-based techniques, we employ an enhanced power profile modeling the signal power received from the reader along different spatial directions, which is more accurate and immune to ambient noise as well as measurement errors caused by hardware characteristics. Besides, we find that tag's phase measurements in practice are related to its orientation. To the best of our knowledge, we are the first to point out this fact and quantify the relationship between them. By calibrating the phase shifts caused by orientation, the positioning accuracy can be improved by 3.7×. We have implemented Tagspin withCOTS RFID devices and evaluated it extensively. Experimentalresults show that Tagspin achieves mean accuracy of 7.3cm with standard deviation of 1.8cm in 3D space.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127053157","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}
Ting Wang, Xin Hu, Jiyong Jang, S. Ji, M. Stoecklin, Teryl Taylor
{"title":"BotMeter: Charting DGA-Botnet Landscapes in Large Networks","authors":"Ting Wang, Xin Hu, Jiyong Jang, S. Ji, M. Stoecklin, Teryl Taylor","doi":"10.1109/ICDCS.2016.77","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.77","url":null,"abstract":"Recent years have witnessed a rampant use of domain generation algorithms (DGAs) in major botnet crimewares, which tremendously strengthens a botnet's capability to evade detection or takedown. Despite a plethora of existing studies on detecting DGA-generated domains in DNS traffic, remediating such threats still relies on vetting the DNS behavior of each individual device. Yet, in large networks featuring complicated DNS infrastructures, we often lack the capability or the resource to exhaustively investigate every part of the networks to identify infected devices in a timely manner. It is therefore of great interest to first assess the population distribution of DGA-bots inside the networks and to prioritize the remediation efforts. In this paper, we present BotMeter, a novel tool that accurately charts the DGA-bot population landscapes in large networks. Specifically, we embrace the prevalent yet challenging setting of hierarchical DNS infrastructures with caching and forwarding mechanisms enabled, whereas DNS traffic is observable only at certain upper-level vantage points. We establish a new taxonomy of DGAs that captures their characteristic DNS dynamics. This allows us to develop a rich library of rigorous analytical models to describe the complex relationships between bot populations and DNS lookups observed at vantage points. We provide results from extensive empirical studies using both synthetic data and real DNS traces to validate the efficacy of BotMeter.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"56 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130586148","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}
Ge Peng, Gang Zhou, David T. Nguyen, Xin Qi, Shan Lin
{"title":"HIDE: AP-Assisted Broadcast Traffic Management to Save Smartphone Energy","authors":"Ge Peng, Gang Zhou, David T. Nguyen, Xin Qi, Shan Lin","doi":"10.1109/ICDCS.2016.14","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.14","url":null,"abstract":"WiFi is a major source of energy consumption on smartphones. Unfortunately, a non-negligible portion of the WiFi energy consumption is spent for frames that are useless to the smartphone. For example, energy is wasted to receive WiFi broadcast frames that are not needed by any smartphone application. What's worse, in order to process the broadcast frames received, a smartphone in suspend mode switches from suspend mode to high power active mode and stays there for a while. As such, additional energy is wasted to do the processing. In this paper, we design a system, namely HIDE, to reduce smartphone energy wasted on useless WiFi broadcast traffic. With our system, smartphones in suspend mode do not receive useless broadcast frames or wake up to process useless broadcast frames. Our trace-driven simulation shows that the HIDE system saves 34%-75% energy for Nexus One when 10% of the broadcast frames are useful to the smartphone. Our overhead analysis demonstrates that our system has negligible impact on network capacity and packet round-trip time.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129185574","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}