Abstract.A common way by which attackers gain control of hosts is through remote exploits. A new dimension to the problem is added by worms which use exploit code to self-propagate, and are becoming a commonplace occurrence. Defense mechanisms exist but popular ones are signature-based techniques which use known byte patterns, and they can be thwarted using polymorphism, metamorphism and other obfuscations. In this paper, we argue that exploit code is characterized by more than just a byte pattern because, in addition, there is a definite control and data flow. We propose a fast static analysis based approach which is essentially a litmus test and operates by making a distinction between data, programs and program-like exploit code. We have implemented a prototype called styx and evaluated it against real data collected at our organizational network. Results show that it is able to detect a variety of exploit code and can also generate very specific signatures. Moreover, it shows initial promise against polymorphism and metamorphism.

No abstract

We provide a detailed estimate for the logical resource requirements of the quantum linear-system algorithm (Harrow et al. in Phys Rev Lett 103:150502, 2009) including the recently described elaborations and application to computing the electromagnetic scattering cross section of a metallic target (Clader et al. in Phys Rev Lett 110:250504, 2013). Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width (related to parallelism), circuit depth (total number of steps), the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the stanThis article is part of topical collection on Quantum Computer Science.Disclaimer: The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of IARPA, DoI/NBC, or the US Government. dard set {X, Y, Z , H, S, T, CNOT}. In order to perform these estimates, we used an approach that combines manual analysis with automated estimates generated via the Quipper quantum programming language and compiler. Our estimates pertain to the explicit example problem size N = 332,020,680 beyond which, according to a crude big-O complexity comparison, the quantum linear-system algorithm is expected to run faster than the best known classical linear-system solving algorithm. For this problem size, a desired calculation accuracy ε = 0.01 requires an approximate circuit width 340 and circuit depth of order 10 25 if oracle costs are excluded, and a circuit width and circuit depth of order 10 8 and 10 29 , respectively, if the resource requirements of oracles are included, indicating that the commonly ignored oracle resources are considerable. In addition to providing detailed logical resource estimates, it is also the purpose of this paper to demonstrate explicitly (using a fine-grained approach rather than relying on coarse big-O asymptotic approximations) how these impressively large numbers arise with an actual circuit implementation of a quantum algorithm. While our estimates may prove to be conservative as more efficient advanced quantum-computation techniques are developed, they nevertheless provide a valid baseline for research targeting a reduction of the algorithmic-level resource requirements, implying that a reduction by many orders of magnitude is necessary for the algorithm to become practical. Electronic supplementary material

No abstract

Synthetic biology has developed numerous parts for the precise control of protein expression. However, relatively little is known about the burden these place on a host, or their reliability under varying environmental conditions. To address this, we made use of synthetic transcriptional and translational elements to create a combinatorial library of constructs that modulated expression strength of a green fluorescent protein. Combining this library with a microbioreactor platform, we were able to perform a detailed large-scale assessment of transient expression and growth characteristics of two Escherichia coli strains across several temperatures. This revealed significant differences in the robustness of both strains to differing types of protein expression, and a complex response of transcriptional and translational elements to differing temperatures. This study supports the development of reliable synthetic biological systems capable of working across different hosts and environmental contexts. Plasmids developed during this work have been made publicly available to act as a reference set for future research.

No abstract

We consider a network traffic model consisting of an infinite number of sources linked to a server. Sources initiate transmissions to the server at Poisson time points. The duration of each transmission has a heavy-tailed distribution. We show that suitable scalings of the traffic process converge to a totally skewed stable Lévy motion in Skorohod space, equipped with the Skorohod M 1 topology. This allows us to prove a heavy-traffic theorem for a single-server fluid model.

Vehicular networks require secure communication, especially for safety applications. A public key infrastructure using a Combinatorial Certificate Scheme was implemented in the US Vehicle Infrastructure Integration (VII) Proof-ofConcept (PoC) trial to secure V2V communication and preserve vehicle privacy. This paper analyzes the privacy and scalability of the Combinatorial Certificate approach for a nationwide network of 200 million vehicles. It examines the tradeoffs between privacy, the ability to efficiently detect and remove bad actors, and the need to minimize the impact on innocent vehicles due to revocation and replacement of compromised shared certificates. Key findings include the level of vehicle anonymity that exists in situations of low vehicular density and the impact that certificate revocations have on innocent vehicles. A refinement to the Combinatorial Certificate Scheme is described that improves the innocent vehicle re-key quota lifetime by an order of magnitude.