Tiny Groups Tackle Byzantine Adversaries

A popular technique for tolerating malicious faults in open distributed systems is to establish small groups of participants, each of which has a non-faulty majority. These groups are used as building blocks to design attack-resistant algorithms. Despite over a decade of active research, current constructions require group sizes of $O(\log n)$, where $n$ is the number of participants in the system. This group size is important since communication and state costs scale polynomially with this parameter. Given the stubbornness of this logarithmic barrier, a natural question is whether better bounds are possible. Here, we consider an attacker that controls a constant fraction of the total computational resources in the system. By leveraging proof-of-work (PoW), we demonstrate how to reduce the group size exponentially to $O(\log\log n)$ while maintaining strong security guarantees. This reduction in group size yields a significant improvement in communication and state costs.Comment: This work is supported by the National Science Foundation grant CCF 1613772 and a C Spire Research Gif

Peer to Peer Information Retrieval: An Overview

Peer-to-peer technology is widely used for file sharing. In the past decade a number of prototype peer-to-peer information retrieval systems have been developed. Unfortunately, none of these have seen widespread real- world adoption and thus, in contrast with file sharing, information retrieval is still dominated by centralised solutions. In this paper we provide an overview of the key challenges for peer-to-peer information retrieval and the work done so far. We want to stimulate and inspire further research to overcome these challenges. This will open the door to the development and large-scale deployment of real-world peer-to-peer information retrieval systems that rival existing centralised client-server solutions in terms of scalability, performance, user satisfaction and freedom

A new coupling solution for G3-PLC employment in MV smart grids

This paper proposes a new coupling solution for transmitting narrowband multicarrier power line communication (PLC) signals over medium voltage (MV) power lines. The proposed system is based on an innovative PLC coupling principle, patented by the authors, which exploits the capacitive divider embedded in voltage detecting systems (VDS) already installed inside the MV switchboard. Thus, no dedicated couplers have to be installed and no switchboard modifications or energy interruptions are needed. This allows a significant cost reduction of MV PLC implementation. A first prototype of the proposed coupling system was presented in previous papers: it had a 15 kHz bandwidth useful to couple single carrier PSK modulated PLC signals with a center frequency from 50–200 kHz. In this paper, a new prototype is developed with a larger bandwidth, up to 164 kHz, thus allowing to couple multicarrier G3-PLC signals using orthogonal frequency division multiplexing (OFDM) digital modulation. This modulation ensures a more robust communication even in harsh power line channels. In the paper, the new coupling system design is described in detail. A new procedure is presented for tuning the coupling system parameters at first installation in a generic MV switchboard. Finally, laboratory and in-field experimental test results are reported and discussed. The coupling performances are evaluated measuring the throughput and success rate in the case of both 18 and 36 subcarriers, in one of the different tone masks standardized for the FCC-above CENELEC band (that is, from 154.6875–487.5 kHz). The experimental results show an efficient behavior of the proposed coupler allowing a two-way communication of G3-PLC OFDM signals on MV networks