Secrecy and reliable byzantine detection in a gaussian untrusted two-hop link

Xiang He, Aylin Yener

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

    2 Scopus citations

    Abstract

    We consider a Gaussian two-hop link where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine attacker. Both the source and the destination have transmission capability, and the relay node receives a superposition of their transmitted signals plus noise. The proposed coding scheme ensures that the probability of an undetected Byzantine attack decreases exponentially fast with respect to the number of channel uses NT while the loss in the secrecy rate can be made arbitrarily small. This improves our previous result where this probability only decreased exponentially with respect to √NT.

    Original languageEnglish (US)
    Title of host publicationIEEE Information Theory Workshop 2010, ITW 2010
    DOIs
    StatePublished - Jul 27 2010
    EventIEEE Information Theory Workshop 2010, ITW 2010 - Cairo, Egypt
    Duration: Jan 6 2010Jan 8 2010

    Publication series

    NameIEEE Information Theory Workshop 2010, ITW 2010

    Other

    OtherIEEE Information Theory Workshop 2010, ITW 2010
    CountryEgypt
    CityCairo
    Period1/6/101/8/10

    All Science Journal Classification (ASJC) codes

    • Computational Theory and Mathematics
    • Theoretical Computer Science

    Fingerprint Dive into the research topics of 'Secrecy and reliable byzantine detection in a gaussian untrusted two-hop link'. Together they form a unique fingerprint.

  • Cite this

    He, X., & Yener, A. (2010). Secrecy and reliable byzantine detection in a gaussian untrusted two-hop link. In IEEE Information Theory Workshop 2010, ITW 2010 [5503151] (IEEE Information Theory Workshop 2010, ITW 2010). https://doi.org/10.1109/ITWKSPS.2010.5503151