Proceedings of the 16th International Conference on Distributed Computing and Networking最新文献

Optimally Resilient Asynchronous MPC with Linear Communication Complexity 具有线性通信复杂度的最佳弹性异步MPC

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684470

Ashish Choudhury, A. Patra

{"title":"Optimally Resilient Asynchronous MPC with Linear Communication Complexity","authors":"Ashish Choudhury, A. Patra","doi":"10.1145/2684464.2684470","DOIUrl":"https://doi.org/10.1145/2684464.2684470","url":null,"abstract":"We present a secure asynchronous multiparty computation (AMPC) protocol with optimal resilience, involving n = 3t + 1 parties and tolerating a computationally bounded static adversary, capable of corrupting upto t parties. For a security parameter k and for circuits of sufficiently large size, our protocol has an amortized communication complexity of O(cMnk) bits, where cM denotes the number of multiplication gates in the arithmetic circuit, representing the function to be computed. Prior to our work, the most efficient optimally resilient, computationally secure AMPC protocol was due to Hirt et al. (ICALP 2008). The protocol offers an amortized communication complexity of O(cMn2k) bits. Our protocol follows the standard offline-online paradigm. In the offline phase, the parties produce encryptions of random multiplication triples. These are used to securely evaluate the multiplication gates in the online phase, using Beaver's circuit-randomization technique (CRYPTO 1991). The offline protocol of earlier works deploy linearly homomorphic encryption schemes. Our offline phase is much simpler and more efficient than the existing protocols and uses linearly homomorphic encryption scheme with support for one homomorphic multiplication.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599337","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}

引用次数: 20

Distributed and Predictive-Preventive Defense Against DDoS Attacks 分布式预防DDoS攻击防御

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684503

Manjiri Jog, M. Natu, S. Shelke

引用次数: 4

Polyhedral Approach for Lifetime Maximization of Target Coverage Problem 目标覆盖问题寿命最大化的多面体方法

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684495

A. K. Pujari, S. Mini, Trideba Padhi, Prabhanjan Sahoo

{"title":"Polyhedral Approach for Lifetime Maximization of Target Coverage Problem","authors":"A. K. Pujari, S. Mini, Trideba Padhi, Prabhanjan Sahoo","doi":"10.1145/2684464.2684495","DOIUrl":"https://doi.org/10.1145/2684464.2684495","url":null,"abstract":"MLTCP (Maximum Lifetime Target Coverage Problem) aims at providing required coverage to a set of targets maximizing the lifetime of wireless sensor network. The problem is known to be computationally hard and it is shown recently that MLTCP exhibits phase-transition phenomenon. The region of occurrences of hard instances is identified in terms of an interval of values of sensing-range. Most of the earlier heuristics report their empirical analyses on instances that are outside this region. There has not been any algorithm proposed so far to handle particularly hard instances. In the present work, we provide a new insight to MLTCP by studying the structure of polyhedral feasible set and propose a heuristic that distinguishes hard instances from solvable cases. The proposed method yields best-ever near-optimal solution and indicates situations when the given problem instance is hard. Considering the linear programming formulation of MLTCP, the algorithm can be viewed as traversal from one BFS (Basic Feasible Solution) to another nonadjacent BFS with non-decreasing value of the objective function. It is shown that high degree of degeneracy of BFS and cycling make the problem hard. When the algorithm encounters a non-trivial cycle, our method uses a novel way of generating an improved feasible solution (not a BFS) by moving away from BFS search. Experimental results confirm that the proposed method achieves the optimal solution for easy instances and gives best-ever near-optimal solution for hard instances.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122913737","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}

引用次数: 7

OPCAM: Optimal Algorithms Implementing Causal Memories in Shared Memory Systems OPCAM:在共享内存系统中实现因果记忆的最优算法

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684483

Min Shen, A. Kshemkalyani, T. Hsu

引用次数: 10

An integrated routing and offset-time adaptation scheme for OBS network 一种OBS网络的综合路由和偏移时间自适应方案

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684488

S. Choudhury, Vivek Nair, Jaydeep Howlader, B. Choudhury, A. K. Mal

引用次数: 3

Reducing Aborts in Distributed Transactional Systems through Dependency Detection 通过依赖检测减少分布式事务系统中的中断

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684475

Bo Zhang, B. Ravindran, R. Palmieri

引用次数: 3

NetSecuritas: An Integrated Attack Graph-based Security Assessment Tool for Enterprise Networks NetSecuritas:面向企业网络的集成攻击图安全评估工具

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684494

Nirnay Ghosh, Ishan Chokshi, Mithun Sarkar, S. Ghosh, A. K. Kaushik, Sajal K. Das

{"title":"NetSecuritas: An Integrated Attack Graph-based Security Assessment Tool for Enterprise Networks","authors":"Nirnay Ghosh, Ishan Chokshi, Mithun Sarkar, S. Ghosh, A. K. Kaushik, Sajal K. Das","doi":"10.1145/2684464.2684494","DOIUrl":"https://doi.org/10.1145/2684464.2684494","url":null,"abstract":"Sophisticated cyber-attacks have become prominent with the growth of the Internet and web technology. Such attacks are multi-stage ones, and correlate vulnerabilities on intermediate hosts to compromise an otherwise well-protected critical resource. Conventional security assessment approaches can leave out some complex scenarios generated by these attacks. In the literature, these correlated attacks have been modeled using attack graphs. Although a few attack graph-based network security assessment tools are available, they are either commercial products or developed using proprietary databases. In this paper, we develop a customized tool, NetSecuritas, which implements a novel heuristic-based attack graph generation algorithm and integrates different phases of network security assessment. NetSecuritas leverages open-source libraries, tools and publicly available databases. A cost-driven mitigation strategy has also been proposed to generate network security recommendations. Experimental results establish the efficacy of both attack graph generation and mitigation approach.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125623180","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}

引用次数: 24

Supporting Multiple Data Replication Models in Distributed Transactional Memory 支持分布式事务性内存中的多个数据复制模型

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684481

J. Silva, Tiago M. Vale, Ricardo J. Dias, Hervé Paulino, João M. Lourenço

引用次数: 5

Delay-aware TDMA Scheduling for Multi-Hop Wireless Networks 多跳无线网络延迟感知TDMA调度

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684493

Shanti Chilukuri, A. Sahoo

引用次数: 6

Yesquel: Scalable SQL storage for Web applications Yesquel:用于Web应用程序的可伸缩SQL存储

Proceedings of the 16th International Conference on Distributed Computing and Networking Pub Date : 2015-01-04 DOI: 10.1145/2684464.2684504

M. Aguilera, Joshua B. Leners, R. Kotla, Michael Walfish

引用次数: 11