13,821 research outputs found

    Secure Refinements of Communication Channels

    Get PDF
    It is a common practice to design a protocol (say Q) assuming some secure channels. Then the secure channels are implemented using any standard protocol, e.g. TLS. In this paper, we study when such a practice is indeed secure. We provide a characterization of both confidential and authenticated channels. As an application, we study several protocols of the literature including TLS and BAC protocols. Thanks to our result, we can consider a larger number of sessions when analyzing complex protocols resulting from explicit implementation of the secure channels of some more abstract protocol Q

    Secure refinements of communication channels

    Get PDF
    It is a common practice to design a protocol (say Q) assuming some secure channels. Then the secure channels are implemented using any standard protocol, e.g. TLS. In this paper, we study when such a practice is indeed secure. We provide a characterization of both confidential and authenticated channels. As an application, we study several protocols of the literature including TLS and BAC protocols. Thanks to our result, we can consider a larger number of sessions when analyzing complex protocols resulting from explicit implementation of the secure channels of some more abstract protocol Q

    A Note on the Information-Theoretic-(in)Security of Fading Generated Secret Keys

    Full text link
    In this work we explore the security of secret keys generated via the electromagnetic reciprocity of the wireless fading channel. Identifying a new sophisticated colluding attack, we explore the information-theoretic-security for such keys in the presence of an all-powerful adversary constrained only by the laws of quantum mechanics. Specifically, we calculate the reduction in the conditional mutual information between transmitter and receiver that can occur when an adversary with unlimited computational and communication resources places directional antenna interceptors at chosen locations. Such locations, in principal, can be arbitrarily far from the intended receiver yet still influence the secret key rate.Comment: 4 pages, 2 figures. This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

    A secure archive for Voice-over-IP conversations

    Full text link
    An efficient archive securing the integrity of VoIP-based two-party conversations is presented. The solution is based on chains of hashes and continuously chained electronic signatures. Security is concentrated in a single, efficient component, allowing for a detailed analysis.Comment: 9 pages, 2 figures. (C) ACM, (2006). This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of VSW06, June, 2006, Berlin, German

    The Embedding Capacity of Information Flows Under Renewal Traffic

    Full text link
    Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching rule is that of a maximum causal delay, and the problem is related to embedding a flow of packets in cover traffic such that no traffic analysis can detect it. We study the best undetectable embedding policy and the corresponding maximum flow rate ---that we call the embedding capacity--- under the assumption that the cover traffic can be modeled as arbitrary renewal processes. We find that computing the embedding capacity requires the inversion of very structured linear systems that, for a broad range of renewal models encountered in practice, admits a fully analytical expression in terms of the renewal function of the processes. Our main theoretical contribution is a simple closed form of such relationship. This result enables us to explore properties of the embedding capacity, obtaining closed-form solutions for selected distribution families and a suite of sufficient conditions on the capacity ordering. We evaluate our solution on real network traces, which shows a noticeable match for tight delay constraints. A gap between the predicted and the actual embedding capacities appears for looser constraints, and further investigation reveals that it is caused by inaccuracy of the renewal traffic model rather than of the solution itself.Comment: Sumbitted to IEEE Trans. on Information Theory on March 10, 201

    Advances in optimal routing through computer networks

    Get PDF
    The optimal routing problem is defined. Progress in solving the problem during the previous decade is reviewed, with special emphasis on technical developments made during the last few years. The relationships between the routing, the throughput, and the switching technology used are discussed and their future trends are reviewed. Economic aspects are also briefly considered. Modern technical approaches for handling the routing problems and, more generally, the flow control problems are reviewed

    Music in electronic markets: an empirical study

    Get PDF
    Music plays an important, and sometimes overlooked part in the transformation of communication and distribution channels. With a global market volume exceeding US$40 billion, music is not only one of the primary entertainment goods in its own right. Since music is easily personalized and transmitted, it also permeates many other services across cultural borders, anticipating social and economic trends. This article presents one of the first detailed empirical studies on the impact of internet technologies on a specific industry. Drawing on more than 100 interviews conducted between 1996 and 2000 with multinational and independent music companies in 10 markets, strategies of the major players, current business models, future scenarios and regulatory responses to the online distribution of music files are identified and evaluated. The data suggest that changes in the music industry will indeed be far-reaching, but disintermediation is not the likely outcome
    • 

    corecore