2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)最新文献

PULP: Achieving Privacy and Utility Trade-Off in User Mobility Data 在用户移动数据中实现隐私和效用的权衡

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-27 DOI: 10.1109/SRDS.2017.25

Sophie Cerf, Vincent Primault, A. Boutet, Sonia Ben Mokhtar, R. Birke, S. Bouchenak, L. Chen, N. Marchand, B. Robu

{"title":"PULP: Achieving Privacy and Utility Trade-Off in User Mobility Data","authors":"Sophie Cerf, Vincent Primault, A. Boutet, Sonia Ben Mokhtar, R. Birke, S. Bouchenak, L. Chen, N. Marchand, B. Robu","doi":"10.1109/SRDS.2017.25","DOIUrl":"https://doi.org/10.1109/SRDS.2017.25","url":null,"abstract":"Leveraging location information in location-based services leads to improving service utility through geocontextualization. However, this raises privacy concerns as new knowledge can be inferred from location records, such as user's home and work places, or personal habits. Although Location Privacy Protection Mechanisms (LPPMs) provide a means to tackle this problem, they often require manual configuration posing significant challenges to service providers and users. Moreover, their impact on data privacy and utility is seldom assessed. In this paper, we present PULP, a model-driven system which automatically provides user-specific privacy protection and contributes to service utility via choosing adequate LPPM and configuring it. At the heart of PULP is nonlinear models that can capture the complex dependency of data privacy and utility for each individual user under given LPPM considered, i.e., Geo-Indistinguishability and Promesse. According to users' preferences on privacy and utility, PULP efficiently recommends suitable LPPM and corresponding configuration. We evaluate the accuracy of PULP's models and its effectiveness to achieve the privacy-utility trade-off per user, using four real-world mobility traces of 770 users in total. Our extensive experimentation shows that PULP ensures the contribution to location service while adhering to privacy constraints for a great percentage of users, and is orders of magnitude faster than non-model based alternatives.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82720834","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

On Availability for Blockchain-Based Systems 关于基于区块链系统的可用性

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-26 DOI: 10.1109/SRDS.2017.15

I. Weber, V. Gramoli, A. Ponomarev, M. Staples, Ralph Holz, An Binh Tran, Paul Rimba

{"title":"On Availability for Blockchain-Based Systems","authors":"I. Weber, V. Gramoli, A. Ponomarev, M. Staples, Ralph Holz, An Binh Tran, Paul Rimba","doi":"10.1109/SRDS.2017.15","DOIUrl":"https://doi.org/10.1109/SRDS.2017.15","url":null,"abstract":"Blockchain has recently gained momentum. Startups, enterprises, banks, and government agencies around the world are exploring the use of blockchain for broad applications including public registries, supply chains, health records, and voting. Dependability properties, like availability, are critical for many of these applications, but the guarantees offered by the blockchain technology remain unclear, especially from an application perspective. In this paper, we identify the availability limitations of two mainstream blockchains, Ethereum and Bitcoin. We demonstrate that while read availability of blockchains is typically high, write availability - for transaction management - is actually low. For Ethereum, we collected 6 million transactions over a period of 97 days. First, we measured the time for transactions to commit as required by the applications. Second, we observed that some transactions never commit, due to the inherent blockchain design. Third and perhaps even more dramatically, we identify the consequences of the lack of built-in options for explicit abort or retry that can maintain the application in an uncertain state, where transactions remain pending (neither aborted nor committed) for an unknown duration. Finally we propose techniques to mitigate the availability limitations of existing blockchains, and experimentally test the efficacy of these techniques.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87899882","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}

引用次数: 137

Fault-Tolerant Pattern Formation by Multiple Robots: A Learning Approach 多机器人的容错模式形成:一种学习方法

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.42

Jia Wang, Jiannong Cao, Shan Jiang

引用次数: 3

Performance Modeling of PBFT Consensus Process for Permissioned Blockchain Network (Hyperledger Fabric) 许可区块链网络(Hyperledger Fabric) PBFT共识过程的性能建模

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.36

H. Sukhwani, J. M. Martínez, Xiaolin Chang, Kishor S. Trivedi, A. Rindos

引用次数: 279

AutoFlowLeaker: Circumventing Web Censorship through Automation Services AutoFlowLeaker:通过自动化服务规避网络审查

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.30

Shengtuo Hu, Xiaobo Ma, Muhui Jiang, Xiapu Luo, M. Au

引用次数: 2

PITR: An Efficient Single-Failure Recovery Scheme for PIT-Coded Cloud Storage Systems PITR:用于PITR编码云存储系统的高效单故障恢复方案

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.38

Peng Li, Jiaxiang Dong, Xueda Liu, G. Wang, Zhongwei Li, X. Liu

引用次数: 2

An Unsupervised Multi-Detector Approach for Identifying Malicious Lateral Movement 一种无监督多检测器的恶意横向移动识别方法

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.31

Atul Bohara, Mohammad A. Noureddine, Ahmed M. Fawaz, W. Sanders

{"title":"An Unsupervised Multi-Detector Approach for Identifying Malicious Lateral Movement","authors":"Atul Bohara, Mohammad A. Noureddine, Ahmed M. Fawaz, W. Sanders","doi":"10.1109/SRDS.2017.31","DOIUrl":"https://doi.org/10.1109/SRDS.2017.31","url":null,"abstract":"Lateral movement-based attacks are increasingly leading to compromises in large private and government networks, often resulting in information exfiltration or service disruption. Such attacks are often slow and stealthy and usually evade existing security products. To enable effective detection of such attacks, we present a new approach based on graph-based modeling of the security state of the target system and correlation of diverse indicators of anomalous host behavior. We believe that irrespective of the specific attack vectors used, attackers typically establish a command and control channel to operate, and move in the target system to escalate their privileges and reach sensitive areas. Accordingly, we identify important features of command and control and lateral movement activities and extract them from internal and external communication traffic. Driven by the analysis of the features, we propose the use of multiple anomaly detection techniques to identify compromised hosts. These methods include Principal Component Analysis, k-means clustering, and Median Absolute Deviation-based outlier detection. We evaluate the accuracy of identifying compromised hosts by using injected attack traffic in a real enterprise network dataset, for various attack communication models. Our results show that the proposed approach can detect infected hosts with high accuracy and a low false positive rate.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86193107","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}

引用次数: 43

A Simulation Analysis of Reliability in Erasure-Coded Data Centers 擦除编码数据中心可靠性仿真分析

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.19

Mi Zhang, Shujie Han, P. Lee

引用次数: 14

A Statistical Framework on Software Aging Modeling with Continuous-Time Hidden Markov Model 基于连续时间隐马尔可夫模型的软件老化建模统计框架

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.24

H. Okamura, Junjun Zheng, T. Dohi

引用次数: 13

A Resilient Auction Framework for Deadline-Aware Jobs in Cloud Spot Market 云现货市场中截止日期敏感工作的弹性拍卖框架

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.34

A. S. Sabyasachi, H. M. D. Kabir, A. Abdelmoniem, S. Mondal

{"title":"A Resilient Auction Framework for Deadline-Aware Jobs in Cloud Spot Market","authors":"A. S. Sabyasachi, H. M. D. Kabir, A. Abdelmoniem, S. Mondal","doi":"10.1109/SRDS.2017.34","DOIUrl":"https://doi.org/10.1109/SRDS.2017.34","url":null,"abstract":"Public cloud providers, such as Amazon EC2, offer idle computing resources known as spot instances at a much cheaper rate compared to On-Demand instances. Spot instance prices are set dynamically according to market demand. Cloud users request spot instances by submitting their bid, and if user's bid price exceeds current spot price then a spot instance is assigned to that user. The problem however is that while spot instances are executing their jobs, they can be revoked whenever the spot price rises above the current bid of the user. In such scenarios and to complete jobs reliably, we propose a set of improvements for the cloud spot market which benefits both the provider and users. Typically, the new framework allows users to bid different prices depending on their perceived urgency and nature of the running job. Hence, it practically allow them to negotiate the current bid price in a way that guarantees the timely completion of their jobs. To complement our intuition, we have conducted an empirical study using real cloud spot price traces to evaluate our framework strategies which aim to achieve a resilient deadline-aware auction framework.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90503337","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}

引用次数: 14