Secure communication with a byzantine relay

Xiang He, Aylin Yener

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    12 Scopus citations

    Abstract

    We consider a communication scenario where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine attacker. Hence for secure communication, two requirements must be met simultaneously: the transmitted message must be kept secret, and a Byzantine attack must be detected reliably. Both a discrete noiseless adder model with the relay receiving the real sum of two signals and a Gaussian model are considered. In both models, the loss in rate due to Byzantine detection can be made arbitrarily small. For the discrete adder model, we show that the probability that the adversary wins decreases exponentially with the number of channel uses. For the Gaussian model, we show that this probability decreases exponentially with the square root of the number of channel uses. The rate derived in this paper is the strong secrecy rate, and the rate loss incurred due to the untrusted and Byzantine relay is measured with respect to the achievable secrecy rate when the relay is untrusted but honest. The result is obtained via a careful combination of the algebraic manipulation detection (AMD) code, the linear wiretap code constructed from low density parity check (LDPC) code, randomly generated wire-tap code and for the Gaussian model the lattice code.

    Original languageEnglish (US)
    Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
    Pages2096-2100
    Number of pages5
    DOIs
    StatePublished - Nov 19 2009
    Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
    Duration: Jun 28 2009Jul 3 2009

    Publication series

    NameIEEE International Symposium on Information Theory - Proceedings
    ISSN (Print)2157-8102

    Other

    Other2009 IEEE International Symposium on Information Theory, ISIT 2009
    CountryKorea, Republic of
    CitySeoul
    Period6/28/097/3/09

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Information Systems
    • Modeling and Simulation
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'Secure communication with a byzantine relay'. Together they form a unique fingerprint.

  • Cite this

    He, X., & Yener, A. (2009). Secure communication with a byzantine relay. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 2096-2100). [5205271] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205271