Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
Authors:
- 31 August 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (1) , 177-192
Abstract
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the source and the destination nodes are allowed to transmit, and the relay receives a superposition of their transmitted signals. We propose a new coding scheme that satisfies two requirements simultaneously: the transmitted message must be kept secret from the relay node, and the destination must be able to detect any Byzantine attack that the relay node might launch reliably and fast. The three main components of the proposed scheme are the nested lattice code, the privacy amplification scheme, and the algebraic manipulation detection (AMD) code. Specifically, for the Gaussian two-hop network, we show that lattice coding can successfully pair with AMD codes enabling its first application to a noisy channel model. We prove, using this new coding scheme, that the probability that the Byzantine attack goes undetected decreases exponentially fast with respect to the number of channel uses, while the loss in the secrecy rate, compared to the rate achievable when the relay is honest, can be made arbitrarily small. In addition, in contrast with prior work in Gaussian channels, the notion of secrecy provided here is strong secrecy.Keywords
All Related Versions
This publication has 33 references indexed in Scilit:
- The Gaussian Many-to-One Interference Channel With Confidential MessagesIEEE Transactions on Information Theory, 2011
- Joint Physical Layer Coding and Network Coding for Bidirectional RelayingIEEE Transactions on Information Theory, 2010
- Nonlinear network coding is necessary to combat general Byzantine attacks2009
- Wiretap channel type II with an active eavesdropper2009
- An algebraic watchdog for wireless network coding2009
- Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate RegionsIEEE Transactions on Information Theory, 2008
- Resilient Network Coding in the Presence of Byzantine AdversariesIEEE Transactions on Information Theory, 2008
- Achieving$ 1over 2log (1+ hboxSNR)$on the AWGN Channel With Lattice Encoding and DecodingIEEE Transactions on Information Theory, 2004
- Common randomness and secret key generation with a helperIEEE Transactions on Information Theory, 2000
- Wire-Tap Channel IIAT&T Bell Laboratories Technical Journal, 1984