Proceedings of the 22nd International Conference on Distributed Computing and Networking最新文献_第2页

LogFlow: Simplified Log Analysis for Large Scale Systems LogFlow:大型系统的简化日志分析

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427808

Marc Platini, Thomas Ropars, Ben Pelletier, N. D. Palma

引用次数: 3

Simultaneous Crowd Counting and Localization by WiFi CSI 同时人群计数和定位的WiFi CSI

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3430000

Hyuckjin Choi, Tomokazu Matsui, Manato Fujimoto, K. Yasumoto

引用次数: 1

Haiku: Efficient Authenticated Key Agreement with Strong Security Guarantees for IoT 俳句:高效的认证密钥协议，为物联网提供强大的安全保证

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427817

Abdulrahman Bin Rabiah, K. Ramakrishnan, Silas Richelson, A. Rabiah, Elizabeth Liri, K. Kar

{"title":"Haiku: Efficient Authenticated Key Agreement with Strong Security Guarantees for IoT","authors":"Abdulrahman Bin Rabiah, K. Ramakrishnan, Silas Richelson, A. Rabiah, Elizabeth Liri, K. Kar","doi":"10.1145/3427796.3427817","DOIUrl":"https://doi.org/10.1145/3427796.3427817","url":null,"abstract":"IoT devices often gather critical information that needs to be communicated in a secure manner. Authentication and secure communication in an IoT environment can be difficult because of constraints, in computing power, memory, energy and network connectivity. For secure communication with the rest of the network, an IoT device needs to trust the gateway through which it communicates, often over a wireless link. An IoT device needs a way of authenticating the gateway and vice-versa, to set up that secure channel. The protocol for authentication and key exchange needs to also work in situations where one or both parties lose connectivity with the outside of their network (e.g., infrastructure failure, intermittent connectivity to the rest of the network, to save cost or power). We propose a lightweight authentication and key exchange protocol for IoT environments that is tailored to handle IoT-imposed constraints. In our protocol, the gateway and IoT device communicate over an encrypted channel that uses a shared symmetric session key which changes periodically (every session) in order to ensure perfect forward secrecy (PFS). We combine both symmetric-key and public-key cryptography based authentication and key exchange, thus reducing the overhead of manual configuration. We leverage on the digital certificate signed by the manufacturer that is typically provided to each device. We study our proposed protocol, called Haiku, where keys are never exchanged over the network. We show that Haiku is lightweight and provides authentication, key exchange, confidentiality, and message integrity. Haiku does not need to contact a trusted third party (TTP), works in disconnected IoT environments, provides PFS, and is efficient in compute, memory and energy usage.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132051801","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}

引用次数: 1

Secure Conflict-free Replicated Data Types 安全无冲突复制数据类型

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427831

M. Barbosa, Bernardo Ferreira, João Marques, Bernardo Portela, Nuno M. Preguiça

{"title":"Secure Conflict-free Replicated Data Types","authors":"M. Barbosa, Bernardo Ferreira, João Marques, Bernardo Portela, Nuno M. Preguiça","doi":"10.1145/3427796.3427831","DOIUrl":"https://doi.org/10.1145/3427796.3427831","url":null,"abstract":"Conflict-free Replicated Data Types (CRDTs) are abstract data types that support developers when designing and reasoning about distributed systems with eventual consistency guarantees. In their core they solve the problem of how to deal with concurrent operations, in a way that is transparent for developers. However in the real world, distributed systems also suffer from other relevant problems, including security and privacy issues and especially when participants can be untrusted. In this paper we present new privacy-preserving CRDT protocols that can be used to help secure distributed cloud-backed applications, including NoSQL geo-replicated databases. Our proposals are based on standard CRDTs, such as sets and counters, augmented with cryptographic mechanisms that allow their operations to be performed on encrypted data. We accompany our proposals with formal security proofs and implement and integrate them in AntidoteDB, a geo-replicated NoSQL database that leverages CRDTs for its operations. Experimental evaluations based on the Danish Shared Medication Record dataset (FMK) exhibit the tradeoffs that our different proposals make and show that they are ready to be used in practical applications.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117102271","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

On Building Modular and Elastic Data Structures with Bulk Operations 用批量操作构建模块化和弹性数据结构

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3433932

Kevin Williams, J. Foster, Athicha Srivirote, Ahmed Hassan, Joseph Tassarotti, Lewis Tseng, R. Palmieri

引用次数: 1

Sampling and Output Estimation in Distributed Algorithms and LCAs 分布式算法和lca中的采样和输出估计

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427810

Leonid Barenboim, Tzalik Maimon

{"title":"Sampling and Output Estimation in Distributed Algorithms and LCAs","authors":"Leonid Barenboim, Tzalik Maimon","doi":"10.1145/3427796.3427810","DOIUrl":"https://doi.org/10.1145/3427796.3427810","url":null,"abstract":"We consider the distributed message-passing model and the Local Computational Algorithms (LCA) model. In both models a network is represented by an n-vertex graph G = (V, E). We focus on labeling problems, such as vertex-coloring, edge-coloring, maximal independent set (MIS) and maximal matching. In the distributed model the vertices of v perform computations in parallel, in order to compute their parts in the solution for G. In the LCA model, on the other hand, probes are performed on certain vertices in order to compute their labels in a solution to a given problem. We study the possibility of estimating a solution produced by an algorithm, much before the algorithm terminates. This estimation not only allows for size estimation of a solution, but also for an early detection of failure in randomized algorithms, so that a correcting procedure can be executed. To this end, we propose a sampling technique, in which the labels in the sampling are distributed proportionally to the distribution in the algorithm’s output. However, the sampling running time is significantly smaller than that of the algorithm in hand. We achieve the following results, in terms of the maximum degree Δ and the arboricity a of the input graph. The running time of our procedures is O(log a + log log n), for sampling vertex-coloring, edge-coloring, maximal matching and MIS. This significantly improves upon previous sampling techniques, which incur additional dependency on the maximum degree Δ that can be much higher than the arboricity, as well as more significant dependency on n. Our techniques for sampling in the distributed model provide a powerful and general tool for estimation in the LCA model. In this setting the goal is estimating the size of a solution to a given problem, by making as few vertex probes as possible. For the above-mentioned problems, we achieve estimations with probe complexity dO(log a + log log n), where d = min(Δ, a · poly(log(n)).","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126852304","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}

引用次数: 1

Resource Allocation Techniques for extending the performance of Long-Range Network 扩展远程网络性能的资源分配技术

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3430002

Preti Kumari, Hari Prabhat Gupta

引用次数: 0

COTS Drone Detection using Video Streaming Characteristics 基于视频流特性的COTS无人机检测

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3428480

Anas Alsoliman, Giulio Rigoni, M. Levorato, C. Pinotti, Nils Ole Tippenhauer, M. Conti

{"title":"COTS Drone Detection using Video Streaming Characteristics","authors":"Anas Alsoliman, Giulio Rigoni, M. Levorato, C. Pinotti, Nils Ole Tippenhauer, M. Conti","doi":"10.1145/3427796.3428480","DOIUrl":"https://doi.org/10.1145/3427796.3428480","url":null,"abstract":"Cheap commercial off-the-shelf (COTS) drones have become widely available for consumers in recent years. Unfortunately, they also provide low-cost capabilities for attackers. Therefore, effective methods to detect the presence of non-cooperating rogue drones within a restricted area are highly required. Approaches based on detection of control traffic have been proposed but were not yet shown to work against other benign traffic, such as that generated by wireless security cameras. In this work, we propose a novel drone detection framework based on a Random Forest classification model. In essence, the framework leverages specific patterns in video traffic transmitted by drones. The patterns consist of repetitive synchronization packets (denoted as pivots) which we use as features in the proposed machine learning classifier. We show that our framework can achieve up to 99% detection accuracy over an encrypted WiFi channel using only 20 packets originated from the drone. Our system is able to identify drone transmissions even among very similar WiFi transmission (such as a security camera video stream) and in a noisy scenario with background traffic.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123428701","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

Characterising Proxy Usage in the Bitcoin Peer-to-Peer Network 比特币点对点网络中代理使用的特征

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427840

Alexander Mühle, Andreas Grüner, C. Meinel

{"title":"Characterising Proxy Usage in the Bitcoin Peer-to-Peer Network","authors":"Alexander Mühle, Andreas Grüner, C. Meinel","doi":"10.1145/3427796.3427840","DOIUrl":"https://doi.org/10.1145/3427796.3427840","url":null,"abstract":"In the public mind, Bitcoin has often been associated with censorship circumvention and evasion of surveillance measures, specifically in the context of monetary transactions. However, this perceived anonymity is a false sense of security as both on-chain transactions and the underlying message exchange in the peer-to-peer network are attack vectors for deanonymisation and monitoring, as shown in other research. Nonetheless, there has been an increase in Bitcoin usage not only for end-users but also in the context of cybercrime in the form of cryptojacking and ransomware. So there are a number of reasons why proxies might be used in the Bitcoin network, either as a privacy-preserving measure of end-users or as obfuscation in cybercrime. In this paper, we present a measurement study with the goal of characterising the proxy and VPN usage in the Bitcoin peer-to-peer network. We developed YABA (Yet Another Bitcoin Analyser) to gather network data in a geographically distributed fashion and analyse it. We describe our techniques to infer proxy/VPN usage and load on the peer through different latency measurements and the limitations of our approaches. We utilise port scanning of standard proxy/VPN service ports to compare results. We deployed our infrastructure on three continents (4 workers) and continuously crawled the network, with a total of 26.9 million connection attempts over five days. We conclude the usage of proxies to be minimal, with an estimated 0.4% of peers detected through latency measurements. Similar prevalence was measured through the use of port scans with SOCKS port hitrate at 0.3%, while common VPN ports had hitrates between 0.18% and 0.7%.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127584251","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

Effective Space Saving 有效节省空间

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427803

R. Friedman, Or Goaz, Ori Rottenstreich

{"title":"Effective Space Saving","authors":"R. Friedman, Or Goaz, Ori Rottenstreich","doi":"10.1145/3427796.3427803","DOIUrl":"https://doi.org/10.1145/3427796.3427803","url":null,"abstract":"In computer networks, it is important to analyze the traffic and provide insights about flows sending packets through the network, e.g., to prevent overloads and DDoS attacks. In this paper, we introduce Effective Space Saving (ESS), a novel algorithm for Top-K identification, a fundamental problem in network monitoring and management. ESS can identify Top-K flows in the network and answer queries regarding flows’ frequency estimation while guaranteeing a small error and a small memory footprint. ESS tracks the frequency of only a small portion of the flows in two tables. Each entry in these tables records a mapping from a given flow id to its current frequency counter. Of these two tables, the Main table stores flows that are suspected of being the heaviest in the stream in terms of their frequency. The Window table stores other recently observed flows that are contending to enter the Main table. We use a probabilistic eviction mechanism for the Window table that is based on the collected statistics. These mechanisms improve the overall memory to accuracy tradeoff of ESS compared to other known approaches. We demonstrate the effectiveness of ESS on real and synthetic packet traces with varying degrees of skew levels. For different skews, ESS identifies the Top-K flows with smaller frequency error by a factor of between 102 to 105 compared to Space Saving [19] and by a factor of up to 10 compared to RAP [5], the two state of the art competing algorithms.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125805873","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}

引用次数: 1