Tight Bounds for MIS in Multichannel Radio Networks

Daum et al. [PODC'13] presented an algorithm that computes a maximal independent set (MIS) within $O(\log^2 n/F+\log n \mathrm{polyloglog} n)$ rounds in an $n$-node multichannel radio network with $F$ communication channels. The paper uses a multichannel variant of the standard graph-based radio network model without collision detection and it assumes that the network graph is a polynomially bounded independence graph (BIG), a natural combinatorial generalization of well-known geographic families. The upper bound of that paper is known to be optimal up to a polyloglog factor. In this paper, we adapt algorithm and analysis to improve the result in two ways. Mainly, we get rid of the polyloglog factor in the runtime and we thus obtain an asymptotically optimal multichannel radio network MIS algorithm. In addition, our new analysis allows to generalize the class of graphs from those with polynomially bounded local independence to graphs where the local independence is bounded by an arbitrary function of the neighborhood radius.Comment: 37 pages, to be published in DISC 201

A Formal Approach to Exploiting Multi-Stage Attacks based on File-System Vulnerabilities of Web Applications (Extended Version)

Web applications require access to the file-system for many different tasks. When analyzing the security of a web application, secu- rity analysts should thus consider the impact that file-system operations have on the security of the whole application. Moreover, the analysis should take into consideration how file-system vulnerabilities might in- teract with other vulnerabilities leading an attacker to breach into the web application. In this paper, we first propose a classification of file- system vulnerabilities, and then, based on this classification, we present a formal approach that allows one to exploit file-system vulnerabilities. We give a formal representation of web applications, databases and file- systems, and show how to reason about file-system vulnerabilities. We also show how to combine file-system vulnerabilities and SQL-Injection vulnerabilities for the identification of complex, multi-stage attacks. We have developed an automatic tool that implements our approach and we show its efficiency by discussing several real-world case studies, which are witness to the fact that our tool can generate, and exploit, complex attacks that, to the best of our knowledge, no other state-of-the-art-tool for the security of web applications can find

Reaching Approximate Byzantine Consensus with Multi-hop Communication

We address the problem of reaching consensus in the presence of Byzantine faults. In particular, we are interested in investigating the impact of messages relay on the network connectivity for a correct iterative approximate Byzantine consensus algorithm to exist. The network is modeled by a simple directed graph. We assume a node can send messages to another node that is up to $l$ hops away via forwarding by the intermediate nodes on the routes, where $l\in \mathbb{N}$ is a natural number. We characterize the necessary and sufficient topological conditions on the network structure. The tight conditions we found are consistent with the tight conditions identified for $l=1$, where only local communication is allowed, and are strictly weaker for $l>1$. Let $l^*$ denote the length of a longest path in the given network. For $l\ge l^*$ and undirected graphs, our conditions hold if and only if $n\ge 3f+1$ and the node-connectivity of the given graph is at least $2f+1$ , where $n$ is the total number of nodes and $f$ is the maximal number of Byzantine nodes; and for $l\ge l^*$ and directed graphs, our conditions is equivalent to the tight condition found for exact Byzantine consensus. Our sufficiency is shown by constructing a correct algorithm, wherein the trim function is constructed based on investigating a newly introduced minimal messages cover property. The trim function proposed also works over multi-graphs.Comment: 24 pages, 1 figure. arXiv admin note: text overlap with arXiv:1203.188

Algorithms For Extracting Timeliness Graphs

We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an edge of the timeliness graph if the link from p to q is timely (that is, there is bound on communication delays from p to q). The main goal of this paper is to approximate this timeliness graph by graphs having some properties (such as being trees, rings, ...). Given a family S of graphs, for runs such that the timeliness graph contains at least one graph in S then using an extraction algorithm, each correct process has to converge to the same graph in S that is, in a precise sense, an approximation of the timeliness graph of the run. For example, if the timeliness graph contains a ring, then using an extraction algorithm, all correct processes eventually converge to the same ring and in this ring all nodes will be correct processes and all links will be timely. We first present a general extraction algorithm and then a more specific extraction algorithm that is communication efficient (i.e., eventually all the messages of the extraction algorithm use only links of the extracted graph)

Local Charge of the nu=5/2 Fractional Quantum Hall State

Electrons in two dimensions and strong magnetic fields effectively lose their kinetic energy and display exotic behavior dominated by Coulomb forces. When the ratio of electrons to magnetic flux quanta in the system is near 5/2, the unique correlated phase that emerges is predicted to be gapped with fractionally charged quasiparticles and a ground state degeneracy that grows exponentially as these quasiparticles are introduced. Interestingly, the only way to transform between the many ground states would be to braid the fractional excitations around each other, a property with applications in quantum information processing. Here we present the first observation of localized quasiparticles at nu=5/2, confined to puddles by disorder. Using a local electrometer to compare how quasiparticles at nu=5/2 and nu=7/3 charge these puddles, we are able to extract the ratio of local charges for these states. Averaged over several disorder configurations and samples, we find the ratio to be 4/3, suggesting that the local charges are e/3 at seven thirds and e/4 at five halves, in agreement with theoretical predictions. This confirmation of localized e/4 quasiparticles is necessary for proposed interferometry experiments to test statistics and computational ability of the state at nu=5/2.Comment: 6 pages, 4 figures corrected titl

On the Design of Cryptographic Primitives

The main objective of this work is twofold. On the one hand, it gives a brief overview of the area of two-party cryptographic protocols. On the other hand, it proposes new schemes and guidelines for improving the practice of robust protocol design. In order to achieve such a double goal, a tour through the descriptions of the two main cryptographic primitives is carried out. Within this survey, some of the most representative algorithms based on the Theory of Finite Fields are provided and new general schemes and specific algorithms based on Graph Theory are proposed

Synchronous counting and computational algorithm design

Consider a complete communication network on n nodes, each of which is a state machine with s states. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree on which pulses are “odd” and which are “even”. We require that the solution is self-stabilising (reaching the correct operation from any initial state) and it tolerates f Byzantine failures (nodes that send arbitrary misinformation). Prior algorithms are expensive to implement in hardware: they require a source of random bits or a large number of states s. We use computational techniques to construct very compact deterministic algorithms for the first non-trivial case of f = 1. While no algorithm exists for n < 4, we show that as few as 3 states are sufficient for all values n ≥ 4. We prove that the problem cannot be solved with only 2 states for n = 4, but there is a 2-state solution for all values n ≥ 6.Peer reviewe

Understanding Autoimmune Mechanisms in Multiple Sclerosis Using Gene Expression Microarrays: Treatment Effect and Cytokine-related Pathways

Multiple sclerosis (MS) is a central nervous system disease in which activated autoreactive T-cells invade the blood brain barrier and initiate an inflammatory response that leads to myelin destruction and axonal loss. The etiology of MS, as well as the mechanisms associated with its unexpected onset, the unpredictable clinical course spanning decades, and the different rates of progression leading to disability over time, remains an enigma. We have applied gene expression microarrays technology in peripheral blood mononuclear cells (PBMC) to better understand MS pathogenesis and better target treatment approaches. A signature of 535 genes were found to distinguish immunomodulatory treatment effects between 13 treated and 13 untreated MS patients. In addition, the expression pattern of 1109 gene transcripts that were previously reported to significantly differentiate between MS patients and healthy subjects were further analyzed to study the effect of cytokine-related pathways on disease pathogenesis. When relative gene expression for 26 MS patients was compared to 18 healthy controls, 30 genes related to various cytokine-associated pathways were identified. These genes belong to a variety of families such as interleukins, small inducible cytokine subfamily and tumor necrosis factor ligand and receptor. Further analysis disclosed seven cytokine-associated genes within the immunomodulatory treatment signature, and two cytokine-associated genes SCYA4 (small inducible cytokine A4) and FCAR (Fc fragment of IgA, CD89) that were common to both the MS gene expression signature and the immunomodulatory treatment gene expression signature. Our results indicate that cytokine-associated genes are involved in various pathogenic pathways in MS and also related to immunomodulatory treatment effects

Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols

We define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of principals and the current global state of the session. Hereby, we can describe the operational semantics of principals and of an intruder in a simple and modular way. Furthermore, using proof theoretic tools like the analysis of permutability of rules, we are able to find efficient proof strategies that we prove complete for special classes of security protocols including Needham-Schroeder. Based on the results of this preliminary analysis, we have implemented a Prolog meta-interpreter which allows for rapid prototyping and for checking safety properties of security protocols, and we have applied it for finding error traces and proving correctness of practical examples