2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)最新文献_第3页

Pseudo-Honeypot: Toward Efficient and Scalable Spam Sniffer 伪蜜罐:迈向高效和可扩展的垃圾邮件嗅探器

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/DSN.2019.00052

Yihe Zhang, Hao Zhang, Xu Yuan, N. Tzeng

{"title":"Pseudo-Honeypot: Toward Efficient and Scalable Spam Sniffer","authors":"Yihe Zhang, Hao Zhang, Xu Yuan, N. Tzeng","doi":"10.1109/DSN.2019.00052","DOIUrl":"https://doi.org/10.1109/DSN.2019.00052","url":null,"abstract":"Honeypot-based spammer gathering solutions usually lack attribute variability, deployment flexibility, and network scalability, deemed as their common drawbacks. This paper explores pseudo-honeypot, a novel honeypot-like system to overcome such drawbacks, for efficient and scalable spammer sniffing. The pseudo-honeypot takes advantage of user diversity and selects normal accounts, with attributes that have the higher potential of attracting spammers, as the parasitic bodies. By harnessing such category of users, pseudo-honeypot can monitor their streaming posts and behavioral patterns transparently. When compared with its traditional honeypot counterpart, the proposed solution offers the substantial advantages of attribute variability, deployment flexibility, network scalability, and system portability. Meanwhile, it offers a novel method to collect the social network dataset that has a higher probability of including spams and spammers, without being noticed by advanced spammers. We take the Twitter social network as an example to exhibit its system design, including pseudo-honeypot nodes selection, monitoring, feature extraction, ground truth labeling, and learning-based classification. Through experiments, we demonstrate the efficiency of pseudo-honeypot in terms of spams and spammers gathering. In particular, we confirm our solution can garner spammers at least 19 times faster than the state-of-the-art honeypot-based counterpart.","PeriodicalId":271955,"journal":{"name":"2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129365538","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}

引用次数: 6

Best Paper Award [3 candidate papers] 最佳论文奖[3篇候选论文]

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/dsn.2019.00010

引用次数: 0

Fault Tolerance Through Redundant Execution on COTS Multicores: Exploring Trade-Offs 通过COTS多核冗余执行的容错:探索权衡

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/DSN.2019.00031

Yanyan Shen, G. Heiser, Kevin Elphinstone

引用次数: 4

ParaMedic: Heterogeneous Parallel Error Correction 辅助:异构并行错误纠正

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/DSN.2019.00032

S. Ainsworth, Timothy M. Jones

引用次数: 3

gem5-Approxilyzer: An Open-Source Tool for Application-Level Soft Error Analysis gem5-Approxilyzer:一个用于应用级软错误分析的开源工具

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/DSN.2019.00033

Radha Venkatagiri, Khalique Ahmed, Abdulrahman Mahmoud, Sasa Misailovic, D. Marinov, Christopher W. Fletcher, S. Adve

{"title":"gem5-Approxilyzer: An Open-Source Tool for Application-Level Soft Error Analysis","authors":"Radha Venkatagiri, Khalique Ahmed, Abdulrahman Mahmoud, Sasa Misailovic, D. Marinov, Christopher W. Fletcher, S. Adve","doi":"10.1109/DSN.2019.00033","DOIUrl":"https://doi.org/10.1109/DSN.2019.00033","url":null,"abstract":"Modern systems are increasingly susceptible to soft errors in the field and traditional redundancy-based mitigation techniques are too expensive to protect against all errors. Recent techniques, such as approximate computing and various low-cost resilience mechanisms, intelligently trade off inaccuracy in program output for better energy, performance, and resiliency overhead. A fundamental requirement for realizing the full potential of these techniques is a thorough understanding of how applications react to errors. Approxilyzer is a state-of-the-art tool that enables an accurate, efficient, and comprehensive analysis of how errors in almost all dynamic instructions in a program's execution affect the quality of the final program output. While useful, its adoption is limited by its implementation using the proprietary Simics infrastructure and the SPARC ISA. We present gem5-Approxilyzer, a re-implementation of Approxilyzer using the open-source gem5 simulator. gem5-Approxilyzer can be extended to different ISAs, starting with x86 in this work. We show that gem5-Approxilyzer is both efficient (up to two orders of magnitude reduction in error injections over a naive campaign) and accurate (average 92% for our experiments) in predicting the program's output quality in the presence of errors. We also compare the error profiles of five workloads under x86 and SPARC to further motivate the need for a tool like gem5-Approxilyzer.","PeriodicalId":271955,"journal":{"name":"2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125605706","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}

引用次数: 18

Extensions of Network Reliability Analysis 网络可靠性分析的扩展

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/DSN.2019.00023

H. Nguyen, Kartik Palani, D. Nicol

{"title":"Extensions of Network Reliability Analysis","authors":"H. Nguyen, Kartik Palani, D. Nicol","doi":"10.1109/DSN.2019.00023","DOIUrl":"https://doi.org/10.1109/DSN.2019.00023","url":null,"abstract":"Network reliability studies properties of networks subjected to random failures of their components. It has been widely adopted to modeling and analyzing real-world problems across different domains, such as circuit design, genomics, databases, information propagation, network security, and many others. Two practical situations that usually arise from such problems are (i) the correlation between component failures and (ii) the uncertainty in failure probabilities. Previous work captured correlations by modeling component reliability using general Boolean expression of Bernoulli random variables. This paper extends such a model to address the second problem, where we investigate the use of Beta distributions to capture the variance of uncertainty. We call this new formalism the Beta uncertain graph. We study the reliability polynomials of Beta uncertain graphs as multivariate polynomials of Beta random variables and demonstrate the use of the model on two realistic examples. We also observe that the reliability distribution of a monotone Beta uncertain graph can be approximated by a Beta distribution, usually with high accuracy. Numerical results from Monte Carlo simulation of an approximation scheme and from two case studies strongly support this observation.","PeriodicalId":271955,"journal":{"name":"2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125915055","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}

引用次数: 4

Rigorous, Effortless and Timely Assessment of Cellular Network Changes 严格、轻松、及时地评估蜂窝网络的变化

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/DSN.2019.00037

A. Mahimkar, Zihui Ge, Sanjeev Ahuja, Shomik Pathak, Nauman Shafi

引用次数: 2

Your IoTs Are (Not) Mine: On the Remote Binding Between IoT Devices and Users 你的物联网是(不是)我的:关于物联网设备和用户之间的远程绑定

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/DSN.2019.00034

Jiongyi Chen, Chaoshun Zuo, Wenrui Diao, Shuaike Dong, Qingchuan Zhao, Menghan Sun, Zhiqiang Lin, Yinqian Zhang, Kehuan Zhang

{"title":"Your IoTs Are (Not) Mine: On the Remote Binding Between IoT Devices and Users","authors":"Jiongyi Chen, Chaoshun Zuo, Wenrui Diao, Shuaike Dong, Qingchuan Zhao, Menghan Sun, Zhiqiang Lin, Yinqian Zhang, Kehuan Zhang","doi":"10.1109/DSN.2019.00034","DOIUrl":"https://doi.org/10.1109/DSN.2019.00034","url":null,"abstract":"Nowadays, IoT clouds are increasingly deployed to facilitate users to manage and control their IoT devices. Unlike the traditional cloud services with communication between a client and a server, IoT cloud architectures involve three parties: the IoT device, the user, and the cloud. Before a user can remotely access her IoT device, remote communication between them is bootstrapped through the cloud. However, the security implications of such a unique process in IoT are less understood today. In this paper, we report the first step towards systematic analyses of IoT remote binding. To better understand the problem, we describe the life cycle of remote binding with a state-machine model which helps us demystify the complexity in various designs and systematically explore the attack surfaces. With the evaluation of 10 real-world remote binding solutions, our study brings to light questionable practices in the designs of authentication and authorization, including inappropriate use of device IDs, weak device authentication, and weak cloud-side access control, as well as the impact of the discovered problems, which could cause sensitive user data leak, persistent denial-ofservice, connection disruption, and even stealthy device control.","PeriodicalId":271955,"journal":{"name":"2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123408808","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}

引用次数: 21

Bonsai: Efficient Fast Failover Routing Using Small Arborescences 盆景:使用小树苗的高效快速故障转移路由

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/DSN.2019.00039

Klaus-Tycho Foerster, Andrzej Kamisiński, Y. Pignolet, S. Schmid, Gilles Trédan

{"title":"Bonsai: Efficient Fast Failover Routing Using Small Arborescences","authors":"Klaus-Tycho Foerster, Andrzej Kamisiński, Y. Pignolet, S. Schmid, Gilles Trédan","doi":"10.1109/DSN.2019.00039","DOIUrl":"https://doi.org/10.1109/DSN.2019.00039","url":null,"abstract":"To provide high availability despite link failures, many modern communication networks feature fast failover mechanisms in the data plane, which operates orders of magnitude faster than the control plane. While the configuration of highly resilient data planes is known to be a difficult combinatorial problem, over the last years, much progress has been made in the design of algorithms which provably guarantee connectivity even under many concurrent link failures. However, while these algorithms provide connectivity, the resulting routes after failures can be very long, which in turn can harm performance. In this paper, we propose, analyze, and evaluate methods for fast failover algorithms which account for the quality of the routes after failures, in addition to connectivity. In particular, we revisit the existing approach to cover the to-be-protected network with arc-disjoint spanning arborescences to define alternative routes to the destination, aiming to keep the stretch imposed by these trees low (hence the name of our method: Bonsai). We show that the underlying problem is NP-hard on general topologies and present lower bound results that are tight for various topologies, for any class of fast failover algorithms. We also present heuristics for general networks and demonstrate their performance benefits in extensive simulations. Finally, we show that failover algorithms using low-stretch arborescences, as a side effect, can provide connectivity under more general failure models than usually considered in the literature.","PeriodicalId":271955,"journal":{"name":"2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125306299","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}

引用次数: 18

Multilayer ROP Protection Via Microarchitectural Units Available in Commodity Hardware 通过商用硬件中可用的微架构单元实现多层ROP保护

2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) Pub Date : 2019-06-01 DOI: 10.1109/DSN.2019.00042

Mateus Tymburibá, Hugo Sousa, Fernando Magno Quintão Pereira

{"title":"Multilayer ROP Protection Via Microarchitectural Units Available in Commodity Hardware","authors":"Mateus Tymburibá, Hugo Sousa, Fernando Magno Quintão Pereira","doi":"10.1109/DSN.2019.00042","DOIUrl":"https://doi.org/10.1109/DSN.2019.00042","url":null,"abstract":"This paper presents a multilayer protection approach to guard programs against Return-Oriented Programming (ROP) attacks. Upper layers validate most of a program's control flow at a low computational cost; thus, not compromising runtime. Lower layers provide strong enforcement guarantees to handle more suspicious flows; thus, enhancing security. Our multilayer system combines techniques already described in the literature with verifications that we introduce in this paper. We argue that modern versions of x86 processors already provide the microarchitectural units necessary to implement our technique. We demonstrate the effectiveness of our multilayer protection on a extensive suite of benchmarks, which includes: SPEC CPU2006; the three most popular web browsers; 209 benchmarks distributed with LLVM and four well-known systems shown to be vulnerable to ROP exploits. Our experiments indicate that we can protect programs with almost no overhead in practice, allying the good performance of lightweight security techniques with the high dependability of heavyweight approaches.","PeriodicalId":271955,"journal":{"name":"2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124351198","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}

引用次数: 0