### Abstract

We investigate the K -user many-to-one interference channel with confidential messages in which the Kth user experiences interference from all other K - 1 users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is log2(K - 1) bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.

Original language | English (US) |
---|---|

Title of host publication | 2009 IEEE International Symposium on Information Theory, ISIT 2009 |

Pages | 2086-2090 |

Number of pages | 5 |

DOIs | |

State | Published - Nov 19 2009 |

Event | 2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of Duration: Jun 28 2009 → Jul 3 2009 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

ISSN (Print) | 2157-8102 |

### Other

Other | 2009 IEEE International Symposium on Information Theory, ISIT 2009 |
---|---|

Country | Korea, Republic of |

City | Seoul |

Period | 6/28/09 → 7/3/09 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

*2009 IEEE International Symposium on Information Theory, ISIT 2009*(pp. 2086-2090). [5205291] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205291

}

*2009 IEEE International Symposium on Information Theory, ISIT 2009.*, 5205291, IEEE International Symposium on Information Theory - Proceedings, pp. 2086-2090, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5205291

**The gaussian many-to-one interference channel with confidential messages.** / He, Xiang; Yener, Aylin.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - The gaussian many-to-one interference channel with confidential messages

AU - He, Xiang

AU - Yener, Aylin

PY - 2009/11/19

Y1 - 2009/11/19

N2 - We investigate the K -user many-to-one interference channel with confidential messages in which the Kth user experiences interference from all other K - 1 users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is log2(K - 1) bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.

AB - We investigate the K -user many-to-one interference channel with confidential messages in which the Kth user experiences interference from all other K - 1 users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is log2(K - 1) bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.

UR - http://www.scopus.com/inward/record.url?scp=70449485076&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449485076&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2009.5205291

DO - 10.1109/ISIT.2009.5205291

M3 - Conference contribution

AN - SCOPUS:70449485076

SN - 9781424443130

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2086

EP - 2090

BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

ER -