TY - GEN
T1 - Secrecy and reliable byzantine detection in a gaussian untrusted two-hop link
AU - He, Xiang
AU - Yener, Aylin
PY - 2010/7/27
Y1 - 2010/7/27
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77954826381&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954826381&partnerID=8YFLogxK
U2 - 10.1109/ITWKSPS.2010.5503151
DO - 10.1109/ITWKSPS.2010.5503151
M3 - Conference contribution
AN - SCOPUS:77954826381
SN - 9781424463725
T3 - IEEE Information Theory Workshop 2010, ITW 2010
BT - IEEE Information Theory Workshop 2010, ITW 2010
T2 - IEEE Information Theory Workshop 2010, ITW 2010
Y2 - 6 January 2010 through 8 January 2010
ER -