2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)最新文献

Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures 拜占庭故障下多跳动态网络的可靠通信

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.10

Alexandre Maurer, S. Tixeuil, X. Défago

引用次数: 16

Distributed Attribute Based Access Control of Aggregated Data in Sensor Clouds 传感器云中基于分布式属性的聚合数据访问控制

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.33

Vimal Kumar, S. Madria

{"title":"Distributed Attribute Based Access Control of Aggregated Data in Sensor Clouds","authors":"Vimal Kumar, S. Madria","doi":"10.1109/SRDS.2015.33","DOIUrl":"https://doi.org/10.1109/SRDS.2015.33","url":null,"abstract":"Sensor clouds are large scale wireless sensor networks (WSNs), built by connecting a number of smaller WSNs together. Each of these smaller individual WSNs may be owned by different owners. Sensor clouds are dynamic in nature, where wireless sensors can be provisioned and de-provisioned for the users on demand. In such a multi-user, multi-owner system, user access control is a significant problem. Previous user access control schemes have been centralized and designed for standalone sensors or smaller networks and do not take large networks into consideration. In large networks, data is generally aggregated in-network during data collection. In this paper, we present a user access control scheme, which unlike other schemes, is distributed and works on aggregated data within a sensor network. Our scheme which is based on attribute based encryption is also able to differentiate between users who require data with the same set of attributes, which would be a necessity in a commercial sensor cloud system. Our scheme gives the flexibility to sensor network owners to control user access of data from their sensors. Finally, we compare our scheme with other closely related schemes in terms of attack resilience and computation and communication overhead to show its effectiveness.","PeriodicalId":244925,"journal":{"name":"2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128220435","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}

引用次数: 8

Probabilistic Byzantine Tolerance for Cloud Computing 云计算的概率拜占庭容限

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.22

L. Arantes, R. Friedman, O. Marin, Pierre Sens

引用次数: 6

SafeSky: A Secure Cloud Storage Middleware for End-User Applications SafeSky:为终端用户应用程序提供安全的云存储中间件

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.23

Rui Zhao, Chuan Yue, Byungchul Tak, Chunqiang Tang

{"title":"SafeSky: A Secure Cloud Storage Middleware for End-User Applications","authors":"Rui Zhao, Chuan Yue, Byungchul Tak, Chunqiang Tang","doi":"10.1109/SRDS.2015.23","DOIUrl":"https://doi.org/10.1109/SRDS.2015.23","url":null,"abstract":"As the popularity of cloud storage services grows rapidly, it is desirable and even essential for both legacy and new end-user applications to have the cloud storage capability to improve their functionality, usability, and accessibility. However, incorporating the cloud storage capability into applications must be done in a secure manner to ensure the confidentiality, integrity, and availability of users' data in the cloud. Unfortunately, it is non-trivial for ordinary application developers to either enhance legacy applications or build new applications to properly have the secure cloud storage capability, due to the development efforts involved as well as the security knowledge and skills required. In this paper, we propose SafeSky, a middleware that can immediately enable an application to use the cloud storage services securely and efficiently, without any code modification or recompilation. A SafeSky-enabled application does not need to save a user's data to the local disk, but instead securely saves them to different cloud storage services to significantly enhance the data security. We have implemented SafeSky as a shared library on Linux. SafeSky supports applications written in different languages, supports various popular cloud storage services, and supports common user authentication methods used by those services. Our evaluation and analysis of SafeSky with real-world applications demonstrate that SafeSky is a feasible and practical approach for equipping end-user applications with the secure cloud storage capability.","PeriodicalId":244925,"journal":{"name":"2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133738816","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}

引用次数: 12

Ridge: High-Throughput, Low-Latency Atomic Multicast Ridge:高吞吐量，低延迟的原子组播

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.13

Carlos Eduardo Benevides Bezerra, Daniela Cason, F. Pedone

{"title":"Ridge: High-Throughput, Low-Latency Atomic Multicast","authors":"Carlos Eduardo Benevides Bezerra, Daniela Cason, F. Pedone","doi":"10.1109/SRDS.2015.13","DOIUrl":"https://doi.org/10.1109/SRDS.2015.13","url":null,"abstract":"It has been shown that the highest throughput for broadcasting messages in a point-to-point network is achieved with a ring topology. Although several ring-based group communication protocols have benefited from this observation, broadcasting messages along a ring overlay may lead to high latencies: In a system with n processes, at least n-1 communication steps are necessary for all processes to deliver a message. In this work, we argue that it is possible to reach optimal throughput without resorting to a ring topology (or to ip-multicast, typically unavailable in wide-area networks). This can be done by routing messages through different paths, while carefully using the available bandwidth at each process, resulting in a significantly lower latency for every message (potentially a single communication step). Based on this idea, we propose Ridge, a Paxos-based atomic multicast protocol where each message is initially forwarded to a single destination, the distributor, whose responsibility is to propagate the message to all other destinations. To utilize all bandwidth available in the system, processes alternate in the role of distributor. By doing this, the maximum system throughput matches that of ring-based protocols, with a latency that is not significantly dependent on the size of the system. Finally, we show that Ridge can also deliver messages optimistically, with even lower latency.","PeriodicalId":244925,"journal":{"name":"2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115229432","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}

引用次数: 9

Recurrence in Self-Stabilization 自稳定的递归

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.11

Oday Jubran, Oliver E. Theel

引用次数: 3

A Secure Collusion-Aware and Probability-Aware Range Query Processing in Tiered Sensor Networks 分层传感器网络中安全的共谋感知和概率感知距离查询处理

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.21

Lei Dong, Xuan Chen, Jianxiang Zhu, Hong Chen, Ke Wang, Cuiping Li

引用次数: 15

FTDE: Distributed Fault Tolerance for WSN Data Collection and Compression Schemes 无线传感器网络数据采集和压缩方案的分布式容错

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.12

Azad Ali, Abdelmajid Khelil, N. Suri

引用次数: 1

Temporality a NVRAM-based Virtualization Platform 临时性:基于nvram的虚拟化平台

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.42

V. Sartakov, Arthur Martens, R. Kapitza

引用次数: 2

Approximate Hash-Based Set Reconciliation for Distributed Replica Repair 分布式副本修复的近似哈希集协调

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2015-09-28 DOI: 10.1109/SRDS.2015.30

Nico Kruber, Maik Lange, F. Schintke

{"title":"Approximate Hash-Based Set Reconciliation for Distributed Replica Repair","authors":"Nico Kruber, Maik Lange, F. Schintke","doi":"10.1109/SRDS.2015.30","DOIUrl":"https://doi.org/10.1109/SRDS.2015.30","url":null,"abstract":"The objective comparison of hash-based set reconciliation algorithms for distributed replica repair is challenging. Each algorithm's behaviour can be tuned for a given use case, e.g. low bandwidth or computational overhead, using different sets of parameters. Changes on these parameters, however, often also influence the algorithm's accuracy in recognising differences between replicas and thus hinder objective comparisons. We develop models to deduce parameters for equally accurate set reconciliation algorithms for replica repair in a distributed system and compare equally accurate instances of two trivial hash-based algorithms, an algorithm using Bloom filters and a Merkle tree based algorithm. Instead of using a large fixed hash size for Merkle trees we propose to use dynamic hash sizes to align the transfer overhead with the desired accuracy. We evaluate (a) the transferred volume of data with respect to different entropy levels, data and failure distributions on the set of items, and (b) the scalability in the number of items. Our results allow to easily choose an efficient algorithm for practical set reconciliation tasks based on the required level of accuracy. Our way to find equally accurate configuration parameters for different algorithms can also be adopted to other set reconciliation algorithms and allows to rate their respective performance in an objective manner.","PeriodicalId":244925,"journal":{"name":"2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126804738","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}

引用次数: 2