35,015 research outputs found

    Attacks on quantum key distribution protocols that employ non-ITS authentication

    Full text link
    We demonstrate how adversaries with unbounded computing resources can break Quantum Key Distribution (QKD) protocols which employ a particular message authentication code suggested previously. This authentication code, featuring low key consumption, is not Information-Theoretically Secure (ITS) since for each message the eavesdropper has intercepted she is able to send a different message from a set of messages that she can calculate by finding collisions of a cryptographic hash function. However, when this authentication code was introduced it was shown to prevent straightforward Man-In-The-Middle (MITM) attacks against QKD protocols. In this paper, we prove that the set of messages that collide with any given message under this authentication code contains with high probability a message that has small Hamming distance to any other given message. Based on this fact we present extended MITM attacks against different versions of BB84 QKD protocols using the addressed authentication code; for three protocols we describe every single action taken by the adversary. For all protocols the adversary can obtain complete knowledge of the key, and for most protocols her success probability in doing so approaches unity. Since the attacks work against all authentication methods which allow to calculate colliding messages, the underlying building blocks of the presented attacks expose the potential pitfalls arising as a consequence of non-ITS authentication in QKD-postprocessing. We propose countermeasures, increasing the eavesdroppers demand for computational power, and also prove necessary and sufficient conditions for upgrading the discussed authentication code to the ITS level.Comment: 34 page

    Composing security protocols: from confidentiality to privacy

    Get PDF
    Security protocols are used in many of our daily-life applications, and our privacy largely depends on their design. Formal verification techniques have proved their usefulness to analyse these protocols, but they become so complex that modular techniques have to be developed. We propose several results to safely compose security protocols. We consider arbitrary primitives modeled using an equational theory, and a rich process algebra close to the applied pi calculus. Relying on these composition results, we derive some security properties on a protocol from the security analysis performed on each of its sub-protocols individually. We consider parallel composition and the case of key-exchange protocols. Our results apply to deal with confidentiality but also privacy-type properties (e.g. anonymity) expressed using a notion of equivalence. We illustrate the usefulness of our composition results on protocols from the 3G phone application and electronic passport

    Squashing Models for Optical Measurements in Quantum Communication

    Full text link
    Measurements with photodetectors necessarily need to be described in the infinite dimensional Fock space of one or several modes. For some measurements a model has been postulated which describes the full mode measurement as a composition of a mapping (squashing) of the signal into a small dimensional Hilbert space followed by a specified target measurement. We present a formalism to investigate whether a given measurement pair of mode and target measurements can be connected by a squashing model. We show that the measurements used in the BB84 protocol do allow a squashing description, although the six-state protocol does not. As a result, security proofs for the BB84 protocol can be based on the assumption that the eavesdropper forwards at most one photon, while the same does not hold for the six-state protocol.Comment: 4 pages, 2 figures. Fixed a typographical error. Replaced the six-state protocol counter-example. Conclusions of the paper are unchange

    Groupoid Semantics for Thermal Computing

    Full text link
    A groupoid semantics is presented for systems with both logical and thermal degrees of freedom. We apply this to a syntactic model for encryption, and obtain an algebraic characterization of the heat produced by the encryption function, as predicted by Landauer's principle. Our model has a linear representation theory that reveals an underlying quantum semantics, giving for the first time a functorial classical model for quantum teleportation and other quantum phenomena.Comment: We describe a groupoid model for thermodynamic computation, and a quantization procedure that turns encrypted communication into quantum teleportation. Everything is done using higher category theor

    Hyporheic invertebrates as bioindicators of ecological health in temporary rivers: a meta-analysis

    Get PDF
    Worldwide, many rivers cease flow and dry either naturally or owing to human activities such as water extraction. However, even when surface water is absent, diverse assemblages of aquatic invertebrates inhabit the saturated sediments below the river bed (hyporheic zone). In the absence of surface water or flow, biota of this zone may be sampled as an alternative to surface water-based ecological assessments. The potential of hyporheic invertebrates as ecological indicators of river health, however, is largely unexplored. We analysed hyporheic taxa lists from the international literature on temporary rivers to assess compositional similarity among broad-scale regions and sampling conditions, including the presence or absence of surface waters and flow, and the regional effect of hydrological phase (dry channel, non-flowing waters, surface flow) on richness. We hypothesised that if consistent patterns were found, then effects of human disturbances in temporary rivers may be assessable using hyporheic bioindicators. Assemblages differed geographically and by climate, but hydrological phase did not have a strong effect at the global scale. However, hyporheic assemblage composition within regions varied along a gradient of higher richness during wetter phases

    Abstracting object interactions using composition filters

    Get PDF
    It is generally claimed that object-based models are very suitable for building distributed system architectures since object interactions follow the client-server model. To cope with the complexity of today's distributed systems, however, we think that high-level linguistic mechanisms are needed to effectively structure, abstract and reuse object interactions. For example, the conventional object-oriented model does not provide high-level language mechanisms to model layered system architectures. Moreover, we consider the message passing model of the conventional object-oriented model as being too low-level because it can only specify object interactions that involve two partner objects at a time and its semantics cannot be extended easily. This paper introduces Abstract Communication Types (ACTs), which are objects that abstract interactions among objects. ACTs make it easier to model layered communication architectures, to enforce the invariant behavior among objects, to reduce the complexity of programs by hiding the interaction details in separate modules and to improve reusability through the application of object-oriented principles to ACT classes. We illustrate the concept of ACTs using the composition filters model
    • …
    corecore