Two-hop Secure Communication Using an Untrusted Relay

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Accepted for publication in EURASIP Journal on Communications and Networks, Special Issue on Wireless Physical Layer Security

Scientific paper

We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The intermediate node is willing to employ a designated relaying scheme to facilitate reliable communication between the source and the destination. Yet, the information it relays needs to be kept secret from it. In this two-hop communication scenario, where the use of the untrusted relay node is essential, we find that a positive secrecy rate is achievable. The center piece of the achievability scheme is the help provided by either the destination node with transmission capability, or an external "good samaritan" node. In either case, the helper performs cooperative jamming that confuses the eavesdropping relay and disables it from being able to decipher what it is relaying. We next derive an upper bound on the secrecy rate for this system. We observe that the gap between the upper bound and the achievable rate vanishes as the power of the relay node goes to infinity. Overall, the paper presents a case for intentional interference, i.e., cooperative jamming, as an enabler for secure communication.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Two-hop Secure Communication Using an Untrusted Relay does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two-hop Secure Communication Using an Untrusted Relay, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-hop Secure Communication Using an Untrusted Relay will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-617335

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.