2015 IEEE 35th International Conference on Distributed Computing Systems最新文献_第5页

Shuffle to Baffle: Towards Scalable Protocols for Secure Multi-party Shuffling Shuffle to Baffle:迈向安全多方Shuffle的可扩展协议

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-07-23 DOI: 10.1109/ICDCS.2015.116

Mahnush Movahedi, Jared Saia, M. Zamani

{"title":"Shuffle to Baffle: Towards Scalable Protocols for Secure Multi-party Shuffling","authors":"Mahnush Movahedi, Jared Saia, M. Zamani","doi":"10.1109/ICDCS.2015.116","DOIUrl":"https://doi.org/10.1109/ICDCS.2015.116","url":null,"abstract":"In secure multi-party shuffling, multiple parties, each holding an input, want to agree on a random permutation of their inputs while keeping the permutation secret. This problem is important as a primitive in many privacy-preserving applications such as anonymous communication, location-based services, and electronic voting. Known techniques for solving this problem suffer from poor scalability, load-balancing issues, trusted party assumptions, and/or weak security guarantees. In this paper, we propose an unconditionally-secure protocol for multi-party shuffling that scales well with the number of parties and is load-balanced. In particular, we require each party to send only a polylogarithmic number of bits and perform a polylogarithmic number of operations while incurring only a logarithmic round complexity. We show security under universal compos ability against up to about n/3 fully-malicious parties. We also provide simulation results in the full version of this paper showing that our protocol improves significantly over previous work. For example, for one million parties, when compared to the state of the art, our protocol reduces the communication and computation costs by at least three orders of magnitude and slightly decreases the number of communication rounds.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132019671","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}

引用次数: 3

Towards Scalable Publish/Subscribe Systems 迈向可扩展的发布/订阅系统

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-07-23 DOI: 10.1109/ICDCS.2015.108

Shuping Ji, Chunyang Ye, Jun Wei, H. Jacobsen

引用次数: 5

A Self-Stabilizing Algorithm for CDS Construction with Constant Approximation in Wireless Networks under SINR Model SINR模型下无线网络中常数逼近CDS构造的自稳定算法

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-07-23 DOI: 10.1109/ICDCS.2015.112

Jiguo Yu, Lili Jia, Wei Li, Xiuzhen Cheng, Shengling Wang, R. Bie, Dongxiao Yu

引用次数: 3

Improve Charging Capability for Wireless Rechargeable Sensor Networks Using Resonant Repeaters 利用共振中继器提高无线可充电传感器网络的充电能力

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-07-23 DOI: 10.1109/ICDCS.2015.22

Cong Wang, Ji Li, Fan Ye, Yuanyuan Yang

{"title":"Improve Charging Capability for Wireless Rechargeable Sensor Networks Using Resonant Repeaters","authors":"Cong Wang, Ji Li, Fan Ye, Yuanyuan Yang","doi":"10.1109/ICDCS.2015.22","DOIUrl":"https://doi.org/10.1109/ICDCS.2015.22","url":null,"abstract":"Wireless charging has provided a convenient alternative to renew sensors' energy in wireless sensor networks. Due to physical limitations, previous works have only considered recharging a single node at a time, which has limited efficiency and scalability. Recent advance on multi-hop wireless charging is gaining momentum to provide fundamental support to address this problem. However, existing single-node charging designs do not consider and cannot take advantage of such opportunities. In this paper, we propose a new framework to enable multi-hop wireless charging using resonant repeaters. First, we present a realistic model that accounts for detailed physical factors to calculate charging efficiencies. Second, to achieve balance between energy efficiency and data latency, we propose a hybrid data gathering strategy that combines static and mobile data gathering to overcome their respective drawbacks and provide theoretical analysis. Then we formulate multi-hop recharge schedule into a bi-objective NP-hard optimization problem. We propose a two-step approximation algorithm that first finds the minimum charging cost and then calculates the charging vehicles' moving costs with bounded approximation ratios. Finally, upon discovering more room to reduce the total system cost, we develop a post-optimization algorithm that iteratively adds more stopping locations for charging vehicles to further improve the results. Our extensive simulations show that the proposed algorithms can handle dynamic energy demands effectively, and can cover at least three times of nodes and reduce service interruption time by an order of magnitude compared to the single-node charging scheme.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128949722","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}

引用次数: 29

Synthesizing Self-Stabilizing Protocols under Average Recovery Time Constraints 平均恢复时间约束下的综合自稳定协议

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-07-23 DOI: 10.1109/ICDCS.2015.65

Saba Aflaki, Fathiyeh Faghih, Borzoo Bonakdarpour

引用次数: 4

Approximate Holistic Aggregation in Wireless Sensor Networks 无线传感器网络中的近似整体聚合

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-07-23 DOI: 10.1145/3027488

Ji Li, Siyao Cheng, Zhipeng Cai, Jiguo Yu, Chaokun Wang, Yingshu Li

引用次数: 103

Fault-Tolerant and Elastic Streaming MapReduce with Decentralized Coordination 分布式协调的容错弹性流MapReduce

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-07-23 DOI: 10.1109/ICDCS.2015.41

A. Kumbhare, M. Frîncu, Yogesh L. Simmhan, V. Prasanna

{"title":"Fault-Tolerant and Elastic Streaming MapReduce with Decentralized Coordination","authors":"A. Kumbhare, M. Frîncu, Yogesh L. Simmhan, V. Prasanna","doi":"10.1109/ICDCS.2015.41","DOIUrl":"https://doi.org/10.1109/ICDCS.2015.41","url":null,"abstract":"The MapReduce programming model, due to its simplicity and scalability, has become an essential tool for processing large data volumes in distributed environments. Recent Stream Processing Systems (SPS) this model to provide low-latency analysis of high-velocity continuous data streams. However, integrating MapReduce with streaming poses challenges: first, the runtime variations in data characteristics such as data-rates and key-distribution cause resource overload, that in-turn leads to fluctuations in the Quality of the Service (QoS), and second, the stateful reducers, whose state depends on the complete tuple history, necessitates efficient fault-recovery mechanisms to maintain the desired QoS in the presence of resource failures. We propose an integrated streaming MapReduce architecture leveraging the concept of consistent hashing to support runtime elasticity along with locality-aware data and state replication to provide efficient load-balancing with low-overhead fault-tolerance and parallel fault-recovery from multiple simultaneous failures. Our evaluation on a private cloud shows up to 2.8× improvement in peak throughput compared to Apache Storm SPS, and a low recovery latency of 700 - 1500 ms from multiple failures.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129284148","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}

引用次数: 19

Advertiser and Publisher-centric Privacy Aware Online Behavioral Advertising 以广告商和出版商为中心的隐私意识在线行为广告

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-07-23 DOI: 10.1109/ICDCS.2015.38

Jingyu Hua, An Tang, Sheng Zhong

{"title":"Advertiser and Publisher-centric Privacy Aware Online Behavioral Advertising","authors":"Jingyu Hua, An Tang, Sheng Zhong","doi":"10.1109/ICDCS.2015.38","DOIUrl":"https://doi.org/10.1109/ICDCS.2015.38","url":null,"abstract":"Online behavioral advertising (OBA) has become one of the most successful advertising models on the Internet. Nevertheless, all existing OBA systems are broker-centric in the billing phase, which means it is the broker who exclusively determines advertisers' expenses and publishers' revenues. Consequently, a malicious broker may cheat in their tallying of ad clicks to overcharge advertisers or underpay publishers. Furthermore, as the broker cannot justify the bills, malicious advertisers may deny actual clicks to ask for refunds, and malicious publishers may claim non-existing clicks to demand extra revenue shares. This paper solves these problems by reversing the priority between the broker and the advertisers and publishers. Specifically, when users click on ads, it makes corresponding advertisers and publishers forward click reports of clients to the broker after checking, anonymizing and signing them. The broker then settles accounts with advertisers and publishers fully based on these reports. To guarantee the interests of the broker after the priority reversal, we further propose effective mechanisms for detecting underreporting advertisers and over reporting publishers, respectively.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116888606","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

Privacy-Preserving Publication of Mobility Data with High Utility 高实用移动数据的隐私保护发布

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-30 DOI: 10.1109/ICDCS.2015.117

Vincent Primault, Sonia Ben Mokhtar, L. Brunie

引用次数: 10

Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees 约束生成树的空间最优时效沉默自稳定构造

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-29 DOI: 10.1109/ICDCS.2015.66

Lélia Blin, P. Fraigniaud

{"title":"Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees","authors":"Lélia Blin, P. Fraigniaud","doi":"10.1109/ICDCS.2015.66","DOIUrl":"https://doi.org/10.1109/ICDCS.2015.66","url":null,"abstract":"Self-stabilizing algorithms are distributed algorithms supporting transient failures. Starting from any configuration, they allow the system to detect whether the actual configuration is legal, and, if not, they allow the system to eventually reach a legal configuration. In the context of network computing, it is known that, for every task, there is a self-stabilizing algorithm solving that task, with optimal space-complexity, but converging in an exponential number of rounds. On the other hand, it is also known that, for every task, there is a self-stabilizing algorithm solving that task in a linear number of rounds, but with large space-complexity. It is however not known whether for every task there exists a self-stabilizing algorithm that is simultaneously space-efficient and time-efficient. In this paper, we make a first attempt for answering the question of whether such an efficient algorithm exists for every task, by focussing on constrained spanning tree construction tasks. We present a general roadmap for the design of silent space-optimal self-stabilizing algorithms solving such tasks, converging in polynomially many rounds under the unfair scheduler. By applying our roadmap to the task of constructing minimum-weight spanning tree (MST), and to the task of constructing minimum-degree spanning tree (MDST), we provide algorithms that outperform previously known algorithms designed and optimized specifically for solving each of these two tasks.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124778030","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}

引用次数: 17