Ahmed S. Mansour, Rafael F. Schaefer and Holger Boche. June 9, 2015

Size: px
Start display at page:

Download "Ahmed S. Mansour, Rafael F. Schaefer and Holger Boche. June 9, 2015"

Transcription

1 The Individual Secrecy Capacity of Degraded Multi-Receiver Wiretap Broadcast Channels Ahmed S. Mansour, Rafael F. Schaefer and Holger Boche Lehrstuhl für Technische Universität München, Germany Department of Electrical Engineering Princeton University, USA June 9, 2015 Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 1

2 Outline TU München 1 Introduction 2 Joint Secrecy Capacity Region 3 Individual Secrecy Capacity Region 4 Comparison of Secrecy Capacity Region 5 Conclusion & Future Work Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 2

3 Outline TU München 1 Introduction 2 Joint Secrecy Capacity Region 3 Individual Secrecy Capacity Region 4 Comparison of Secrecy Capacity Region 5 Conclusion & Future Work Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 3

4 Information Theoretic Security Secret Key encoding [Shannon 49] M = M K, Secrecy Requirement: I(M; Z n ) = 0. Transmit x n (m ) H(M) H(K) Wiretap Random Coding [Csiszár/Körner 78] Randomization message m r to confuse the eavesdropper. Secrecy Requirement: lim n I(M; Z n ) = 0. Transmit x n (m, m r ) R r I(X; Z). Random Coding + Secret Key encoding [Kang/Liu 10] m plays a role in confusing the eavesdropper. Secrecy Requirement: lim n I(M; Z n ) = 0. Transmit x n (m, m, m r ) R r + R I(X; Z). C. Shannon, Communication theory of secrecy systems, vol. 28, pp , Oct I. Csiszár and J. Körner, Broadcast channels with confidential messages, IEEE Trans. Inf. Theory, vol. 24, no. 3, pp , May 1978 W. Kang and N. Liu, Wiretap channel with shared key, Dublin, Ireland, Sep. 2010, pp. 1 5 Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 4

5 Degraded Multi-Receiver Wiretap BC (M 1,..., M k) X T n x Encoder Channel Yn 1 Y2 n Y3 n Yk n Z R 1 R 2 R n k R Z ˆM 1 ˆM 2 ˆM k Important Feature: X Y 1 Y 2 Y k Z Reliability Requirement: P e (C n ) P [ ˆM1 M 1 or... or ˆM k M k ]. Secrecy Requirement: Joint Secrecy: I(M 1,...,M k ; Z n ) τ n R j 1 n I(M j; Y n j ) + γ j (ɛ n ) Properties?, Which one? and Why??? Individual Secrecy: k j=1 I(M j; Z n ) τ n Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 5

6 Joint Secrecy Vs Individual Secrecy 1 Joint Secrecy: I(M 1,...,M k ; Z n ) τ n Focus of most previous works. Receivers do not trust each other. Conservative and immune against compromised receivers. Vanishing capacity for eavesdropper with statistical advantage. 2 Individual Secrecy: k j=1 I(M j; Z n ) τ n BC with message cognition. [Mansour/Schaefer/Boche 15] Mutual trust and Receiver cooperation. less conservative, secrecy might fails. Higher throughput is expected. How to encode? Use messages as secret keys. A. S. Mansour, R. F. Schaefer, and H. Boche, Capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints, CoRR, vol. abs/ , January 2015, [Online] Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 6

7 Outline TU München 1 Introduction 2 Joint Secrecy Capacity Region 3 Individual Secrecy Capacity Region 4 Comparison of Secrecy Capacity Region 5 Conclusion & Future Work Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 7

8 Joint Secrecy: Achievability and Converse Theorem 1: Capacity Region [Ekrem/Ulukus/ 09] The joint secrecy capacity region of the degraded multi-receiver wiretap BC is given by all rate tuples (R 1,..., R k ) R k + R j I(U j ; Y j U j+1 ) I(U j ; Z U j+1 ) where U 1 = X, U k+1 = and the union is taken over all random variables such that, U k U 2 X Y 1 Y 2 Y k Z. Achievability: Superposition encoding with Random binning. Converse: Standard Techniques + Prop. of Markov chain. For a two-receiver wiretap BC: R 2 I(U; Y 2 ) I(U; Z) R 1 I(X; Y 1 U) I(X; Z U) E. Ekrem and S. Ulukus, Secrecy capacity of a class of broadcast channels with an eavesdropper, EURASIP J. Wirel. Commun. Netw., pp. 1 29, March 2009 Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 8

9 Outline TU München 1 Introduction 2 Joint Secrecy Capacity Region 3 Individual Secrecy Capacity Region 4 Comparison of Secrecy Capacity Region 5 Conclusion & Future Work Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 9

10 Individual Secrecy: Achievability Theorem 2: Degraded Two-Receiver Wiretap BC The individual secrecy capacity region of the degraded two-receiver wiretap BC is given by the union of all rate pairs (R 1, R 2 ) R 2 + that satisfy R 2 I(U; Y 2 ) I(U; Z) R 1 I(X; Y 1 U) + I(U; Z) R 1 I(X; Y 1 U) I(X; Z U) + R 2 where the union is taken over all random variables (U, X), such that U X Y 1 Y 2 Z forms a Markov chain. Achievability: Random coding + Secret Key encoding. Y 1 can decode m 2 : Prop. of degraded BC. m 2 is used a secret key for Y 1. Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 10

11 Individual Secrecy: Multi-Receiver Wiretap BC Theorem 3: Capacity Region The individual secrecy capacity region of the degraded multireceiver wiretap BC is given by the union of all rate tuples (R 1,..., R k ) R k + that satisfy R j I(U j ; Y j U j+1 ) I(U j ; Z U j+1 ) + R j I(U j ; Y j U j+1 ) + I(U j+1 ; Z) k k R l I(U l ; Y l U l+1 ) l=j l=j k l=j+1 where U 1 = X, U k+1 = and the union runs over all random variables such that, U k U 2 X Y 1 Y 2 Y k Z. R l Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 11

12 Bounds Implication and Converse 1 R j I(U j ; Y j U j+1 ) I(U j ; Z U j+1 ) + k l=j+1 R l. Total Rate = Random Coded + Secret Key Encoded. Adapting the Joint converse by k l=j+1 R l. 2 R j I(U j ; Y j U j+1 ) + I(U j+1 ; Z) A User s Rate = Information in his own layer + Randomization Indcies of [ Lower Layers. R j 1 n I(M j ; Yj n M j+1 ) + I( M ] j+1 ; Z n ) + γ j (ɛ n ) 3 k l=j R l k l=j I(U l; Y l U l+1 ) A Randomization index can be used only once. Reliability Bound as in Degraded BC without secrecy. Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 12

13 Outline TU München 1 Introduction 2 Joint Secrecy Capacity Region 3 Individual Secrecy Capacity Region 4 Comparison of Secrecy Capacity Region 5 Conclusion & Future Work Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 13

14 Gaussian Two-Receiver Wiretap BC Theorem 4: Capacity Region: Joint Vs Individual Consider a two-receiver Gaussian wiretap BC, the joint secrecy capacity region is given by ( ) ( ) R 2 f 1 + ᾱp f 1 + ᾱp αp +σ2 2 αp +σ ( ) ( ) Z 2 R 1 f 1 + αp f 1 + αp, σ1 2 σz 2 while the individual secrecy capacity region is given by ( ) ( ) R 2 f 1 + ᾱp f 1 + ᾱp αp +σ2 2 αp +σ ( ) ( ) Z 2 R 1 f 1 + αp + f 1 + ᾱp σ1 2 αp +σ ( ) ( ) Z 2 R 1 f 1 + αp f 1 + αp + R σ1 2 σz 2 2, where f(x) = 1 2 log(x) and ᾱ = 1 α. Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 14

15 Example TU München Joint Secrecy Capacity Individual Secrecy Capacity Sweep over α. σ 2 1 = 0.05, σ 2 2 = 0.1, σ 2 Z = Higher throughput for Individual Secrecy R 1 > 0, although α = 0. R R 1 Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 15

16 Outline TU München 1 Introduction 2 Joint Secrecy Capacity Region 3 Individual Secrecy Capacity Region 4 Comparison of Secrecy Capacity Region 5 Conclusion & Future Work Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 16

17 Conclusion & Future Work Conclusion Investigated secrecy in degraded multi-receiver wiretap BC. Established the individual secrecy capacity region. Bigger capacity region as compared to the joint one. Extensions and Future work Extension to the Gaussian BC. (Done) Extension to the MIMO Gaussian BC. (In Progress) Investigation of the less noisy wiretap BC. (In Progress) Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 17

18 References I TU München C. Shannon, Communication theory of secrecy systems, vol. 28, pp , Oct I. Csiszár and J. Körner, Broadcast channels with confidential messages, IEEE Trans. Inf. Theory, vol. 24, no. 3, pp , May W. Kang and N. Liu, Wiretap channel with shared key, Dublin, Ireland, Sep. 2010, pp A. S. Mansour, R. F. Schaefer, and H. Boche, Capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints, CoRR, vol. abs/ , January 2015, [Online]. E. Ekrem and S. Ulukus, Secrecy capacity of a class of broadcast channels with an eavesdropper, EURASIP J. Wirel. Commun. Netw., pp. 1 29, March Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 18

19 Thank YOU! TU München Mansour, Schaefer and Boche Secrecy in Degraded Wiretap BC 19

Secret Key Agreement Using Conferencing in State- Dependent Multiple Access Channels with An Eavesdropper

Secret Key Agreement Using Conferencing in State- Dependent Multiple Access Channels with An Eavesdropper Secret Key Agreement Using Conferencing in State- Dependent Multiple Access Channels with An Eavesdropper Mohsen Bahrami, Ali Bereyhi, Mahtab Mirmohseni and Mohammad Reza Aref Information Systems and Security

More information

Performance-based Security for Encoding of Information Signals. FA ( ) Paul Cuff (Princeton University)

Performance-based Security for Encoding of Information Signals. FA ( ) Paul Cuff (Princeton University) Performance-based Security for Encoding of Information Signals FA9550-15-1-0180 (2015-2018) Paul Cuff (Princeton University) Contributors Two students finished PhD Tiance Wang (Goldman Sachs) Eva Song

More information

Secret Key Agreement Using Asymmetry in Channel State Knowledge

Secret Key Agreement Using Asymmetry in Channel State Knowledge Secret Key Agreement Using Asymmetry in Channel State Knowledge Ashish Khisti Deutsche Telekom Inc. R&D Lab USA Los Altos, CA, 94040 Email: ashish.khisti@telekom.com Suhas Diggavi LICOS, EFL Lausanne,

More information

AN INTRODUCTION TO SECRECY CAPACITY. 1. Overview

AN INTRODUCTION TO SECRECY CAPACITY. 1. Overview AN INTRODUCTION TO SECRECY CAPACITY BRIAN DUNN. Overview This paper introduces the reader to several information theoretic aspects of covert communications. In particular, it discusses fundamental limits

More information

An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel

An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 4, APRIL 2012 2427 An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel Ersen Ekrem, Student Member, IEEE,

More information

Primary Rate-Splitting Achieves Capacity for the Gaussian Cognitive Interference Channel

Primary Rate-Splitting Achieves Capacity for the Gaussian Cognitive Interference Channel Primary Rate-Splitting Achieves Capacity for the Gaussian Cognitive Interference Channel Stefano Rini, Ernest Kurniawan and Andrea Goldsmith Technische Universität München, Munich, Germany, Stanford University,

More information

Achieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel

Achieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel Achieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel Shahid Mehraj Shah and Vinod Sharma Department of Electrical Communication Engineering, Indian Institute of

More information

Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel

Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu

More information

Fading Wiretap Channel with No CSI Anywhere

Fading Wiretap Channel with No CSI Anywhere Fading Wiretap Channel with No CSI Anywhere Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 7 pritamm@umd.edu ulukus@umd.edu Abstract

More information

On the Secrecy Capacity of Fading Channels

On the Secrecy Capacity of Fading Channels On the Secrecy Capacity of Fading Channels arxiv:cs/63v [cs.it] 7 Oct 26 Praveen Kumar Gopala, Lifeng Lai and Hesham El Gamal Department of Electrical and Computer Engineering The Ohio State University

More information

Superposition Encoding and Partial Decoding Is Optimal for a Class of Z-interference Channels

Superposition Encoding and Partial Decoding Is Optimal for a Class of Z-interference Channels Superposition Encoding and Partial Decoding Is Optimal for a Class of Z-interference Channels Nan Liu and Andrea Goldsmith Department of Electrical Engineering Stanford University, Stanford CA 94305 Email:

More information

Capacity Bounds for Diamond Networks

Capacity Bounds for Diamond Networks Technische Universität München Capacity Bounds for Diamond Networks Gerhard Kramer (TUM) joint work with Shirin Saeedi Bidokhti (TUM & Stanford) DIMACS Workshop on Network Coding Rutgers University, NJ

More information

MIMO Multiple Access Channel with an Arbitrarily Varying Eavesdropper

MIMO Multiple Access Channel with an Arbitrarily Varying Eavesdropper MIMO Multiple Access Channel with an Arbitrarily Varying Eavesdropper Xiang He, Ashish Khisti, Aylin Yener Dept. of Electrical and Computer Engineering, University of Toronto, Toronto, ON, M5S 3G4, Canada

More information

A Comparison of Superposition Coding Schemes

A Comparison of Superposition Coding Schemes A Comparison of Superposition Coding Schemes Lele Wang, Eren Şaşoğlu, Bernd Bandemer, and Young-Han Kim Department of Electrical and Computer Engineering University of California, San Diego La Jolla, CA

More information

On the Secrecy Capacity of the Z-Interference Channel

On the Secrecy Capacity of the Z-Interference Channel On the Secrecy Capacity of the Z-Interference Channel Ronit Bustin Tel Aviv University Email: ronitbustin@post.tau.ac.il Mojtaba Vaezi Princeton University Email: mvaezi@princeton.edu Rafael F. Schaefer

More information

The Method of Types and Its Application to Information Hiding

The Method of Types and Its Application to Information Hiding The Method of Types and Its Application to Information Hiding Pierre Moulin University of Illinois at Urbana-Champaign www.ifp.uiuc.edu/ moulin/talks/eusipco05-slides.pdf EUSIPCO Antalya, September 7,

More information

Lecture 10: Broadcast Channel and Superposition Coding

Lecture 10: Broadcast Channel and Superposition Coding Lecture 10: Broadcast Channel and Superposition Coding Scribed by: Zhe Yao 1 Broadcast channel M 0M 1M P{y 1 y x} M M 01 1 M M 0 The capacity of the broadcast channel depends only on the marginal conditional

More information

Bounds and Capacity Results for the Cognitive Z-interference Channel

Bounds and Capacity Results for the Cognitive Z-interference Channel Bounds and Capacity Results for the Cognitive Z-interference Channel Nan Liu nanliu@stanford.edu Ivana Marić ivanam@wsl.stanford.edu Andrea J. Goldsmith andrea@wsl.stanford.edu Shlomo Shamai (Shitz) Technion

More information

Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets

Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets Shivaprasad Kotagiri and J. Nicholas Laneman Department of Electrical Engineering University of Notre Dame Notre Dame,

More information

Group Secret Key Agreement over State-Dependent Wireless Broadcast Channels

Group Secret Key Agreement over State-Dependent Wireless Broadcast Channels Group Secret Key Agreement over State-Dependent Wireless Broadcast Channels Mahdi Jafari Siavoshani Sharif University of Technology, Iran Shaunak Mishra, Suhas Diggavi, Christina Fragouli Institute of

More information

The Capacity Region of the Cognitive Z-interference Channel with One Noiseless Component

The Capacity Region of the Cognitive Z-interference Channel with One Noiseless Component 1 The Capacity Region of the Cognitive Z-interference Channel with One Noiseless Component Nan Liu, Ivana Marić, Andrea J. Goldsmith, Shlomo Shamai (Shitz) arxiv:0812.0617v1 [cs.it] 2 Dec 2008 Dept. of

More information

Spectrum Leasing via Cooperation for Enhanced. Physical-Layer Secrecy

Spectrum Leasing via Cooperation for Enhanced. Physical-Layer Secrecy Spectrum Leasing via Cooperation for Enhanced 1 Physical-Layer Secrecy Keonkook Lee, Member, IEEE, Chan-Byoung Chae, Senior Member, IEEE, Joonhyuk Kang, Member, IEEE arxiv:1205.0085v1 [cs.it] 1 May 2012

More information

The Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel

The Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel The Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel Stefano Rini, Daniela Tuninetti, and Natasha Devroye Department

More information

Variable Length Codes for Degraded Broadcast Channels

Variable Length Codes for Degraded Broadcast Channels Variable Length Codes for Degraded Broadcast Channels Stéphane Musy School of Computer and Communication Sciences, EPFL CH-1015 Lausanne, Switzerland Email: stephane.musy@ep.ch Abstract This paper investigates

More information

On Gaussian MIMO Broadcast Channels with Common and Private Messages

On Gaussian MIMO Broadcast Channels with Common and Private Messages On Gaussian MIMO Broadcast Channels with Common and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 20742 ersen@umd.edu

More information

Explicit Capacity-Achieving Coding Scheme for the Gaussian Wiretap Channel. Himanshu Tyagi and Alexander Vardy

Explicit Capacity-Achieving Coding Scheme for the Gaussian Wiretap Channel. Himanshu Tyagi and Alexander Vardy Explicit Capacity-Achieving Coding Scheme for the Gaussian Wiretap Channel Himanshu Tyagi and Alexander Vardy The Gaussian wiretap channel M Encoder X n N(0,σ 2 TI) Y n Decoder ˆM N(0,σ 2 WI) Z n Eavesdropper

More information

The Gallager Converse

The Gallager Converse The Gallager Converse Abbas El Gamal Director, Information Systems Laboratory Department of Electrical Engineering Stanford University Gallager s 75th Birthday 1 Information Theoretic Limits Establishing

More information

A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying

A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying Ahmad Abu Al Haija, and Mai Vu, Department of Electrical and Computer Engineering McGill University Montreal, QC H3A A7 Emails: ahmadabualhaija@mailmcgillca,

More information

Shannon s noisy-channel theorem

Shannon s noisy-channel theorem Shannon s noisy-channel theorem Information theory Amon Elders Korteweg de Vries Institute for Mathematics University of Amsterdam. Tuesday, 26th of Januari Amon Elders (Korteweg de Vries Institute for

More information

The Capacity Region of the Gaussian MIMO Broadcast Channel

The Capacity Region of the Gaussian MIMO Broadcast Channel 0-0 The Capacity Region of the Gaussian MIMO Broadcast Channel Hanan Weingarten, Yossef Steinberg and Shlomo Shamai (Shitz) Outline Problem statement Background and preliminaries Capacity region of the

More information

A Formula for the Capacity of the General Gel fand-pinsker Channel

A Formula for the Capacity of the General Gel fand-pinsker Channel A Formula for the Capacity of the General Gel fand-pinsker Channel Vincent Y. F. Tan Institute for Infocomm Research (I 2 R, A*STAR, Email: tanyfv@i2r.a-star.edu.sg ECE Dept., National University of Singapore

More information

Research Collection. The relation between block length and reliability for a cascade of AWGN links. Conference Paper. ETH Library

Research Collection. The relation between block length and reliability for a cascade of AWGN links. Conference Paper. ETH Library Research Collection Conference Paper The relation between block length and reliability for a cascade of AWG links Authors: Subramanian, Ramanan Publication Date: 0 Permanent Link: https://doiorg/0399/ethz-a-00705046

More information

Outer Bounds on the Secrecy Capacity Region of the 2-user Z Interference Channel With Unidirectional Transmitter Cooperation

Outer Bounds on the Secrecy Capacity Region of the 2-user Z Interference Channel With Unidirectional Transmitter Cooperation Outer Bounds on the Secrecy Capacity Region of the 2-user Z Interference Channel With Unidirectional Transmitter Cooperation Parthajit Mohapatra, Chandra R. Murthy, and Jemin Lee itrust, Centre for Research

More information

Two Applications of the Gaussian Poincaré Inequality in the Shannon Theory

Two Applications of the Gaussian Poincaré Inequality in the Shannon Theory Two Applications of the Gaussian Poincaré Inequality in the Shannon Theory Vincent Y. F. Tan (Joint work with Silas L. Fong) National University of Singapore (NUS) 2016 International Zurich Seminar on

More information

SHARED INFORMATION. Prakash Narayan with. Imre Csiszár, Sirin Nitinawarat, Himanshu Tyagi, Shun Watanabe

SHARED INFORMATION. Prakash Narayan with. Imre Csiszár, Sirin Nitinawarat, Himanshu Tyagi, Shun Watanabe SHARED INFORMATION Prakash Narayan with Imre Csiszár, Sirin Nitinawarat, Himanshu Tyagi, Shun Watanabe 2/40 Acknowledgement Praneeth Boda Himanshu Tyagi Shun Watanabe 3/40 Outline Two-terminal model: Mutual

More information

On the Impact of Quantized Channel Feedback in Guaranteeing Secrecy with Artificial Noise

On the Impact of Quantized Channel Feedback in Guaranteeing Secrecy with Artificial Noise On the Impact of Quantized Channel Feedback in Guaranteeing Secrecy with Artificial Noise Ya-Lan Liang, Yung-Shun Wang, Tsung-Hui Chang, Y.-W. Peter Hong, and Chong-Yung Chi Institute of Communications

More information

II. THE TWO-WAY TWO-RELAY CHANNEL

II. THE TWO-WAY TWO-RELAY CHANNEL An Achievable Rate Region for the Two-Way Two-Relay Channel Jonathan Ponniah Liang-Liang Xie Department of Electrical Computer Engineering, University of Waterloo, Canada Abstract We propose an achievable

More information

A Comparison of Two Achievable Rate Regions for the Interference Channel

A Comparison of Two Achievable Rate Regions for the Interference Channel A Comparison of Two Achievable Rate Regions for the Interference Channel Hon-Fah Chong, Mehul Motani, and Hari Krishna Garg Electrical & Computer Engineering National University of Singapore Email: {g030596,motani,eleghk}@nus.edu.sg

More information

Enhancing Secrecy Rates and Resourse Allocation in Single-User & Multi-User Fading Wiretap Channels

Enhancing Secrecy Rates and Resourse Allocation in Single-User & Multi-User Fading Wiretap Channels Enhancing Secrecy Rates and Resourse Allocation in Single-User & Multi-User Fading Wiretap Channels (Thesis Colloqium) Shahid Mehraj Shah Dept. of ECE, Indian Institute of Science, Bangalore June 22nd

More information

ECE Information theory Final (Fall 2008)

ECE Information theory Final (Fall 2008) ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1

More information

Secrecy in the 2-User Symmetric Interference Channel with Transmitter Cooperation: Deterministic View

Secrecy in the 2-User Symmetric Interference Channel with Transmitter Cooperation: Deterministic View Secrecy in the 2-User Symmetric Interference Channel with Transmitter Cooperation: Deterministic View P. Mohapatra 9 th March 2013 Outline Motivation Problem statement Achievable scheme 1 Weak interference

More information

On the Capacity Region for Secure Index Coding

On the Capacity Region for Secure Index Coding On the Capacity Region for Secure Index Coding Yuxin Liu, Badri N. Vellambi, Young-Han Kim, and Parastoo Sadeghi Research School of Engineering, Australian National University, {yuxin.liu, parastoo.sadeghi}@anu.edu.au

More information

Information-Theoretic Security: an overview

Information-Theoretic Security: an overview Information-Theoretic Security: an overview Rui A Costa 1 Relatório para a disciplina de Seminário, do Mestrado em Informática da Faculdade de Ciências da Universidade do Porto, sob a orientação do Prof

More information

UCSD ECE 255C Handout #12 Prof. Young-Han Kim Tuesday, February 28, Solutions to Take-Home Midterm (Prepared by Pinar Sen)

UCSD ECE 255C Handout #12 Prof. Young-Han Kim Tuesday, February 28, Solutions to Take-Home Midterm (Prepared by Pinar Sen) UCSD ECE 255C Handout #12 Prof. Young-Han Kim Tuesday, February 28, 2017 Solutions to Take-Home Midterm (Prepared by Pinar Sen) 1. (30 points) Erasure broadcast channel. Let p(y 1,y 2 x) be a discrete

More information

Joint Source-Channel Coding for the Multiple-Access Relay Channel

Joint Source-Channel Coding for the Multiple-Access Relay Channel Joint Source-Channel Coding for the Multiple-Access Relay Channel Yonathan Murin, Ron Dabora Department of Electrical and Computer Engineering Ben-Gurion University, Israel Email: moriny@bgu.ac.il, ron@ee.bgu.ac.il

More information

Capacity bounds for multiple access-cognitive interference channel

Capacity bounds for multiple access-cognitive interference channel Mirmohseni et al. EURASIP Journal on Wireless Communications and Networking, :5 http://jwcn.eurasipjournals.com/content///5 RESEARCH Open Access Capacity bounds for multiple access-cognitive interference

More information

Katalin Marton. Abbas El Gamal. Stanford University. Withits A. El Gamal (Stanford University) Katalin Marton Withits / 9

Katalin Marton. Abbas El Gamal. Stanford University. Withits A. El Gamal (Stanford University) Katalin Marton Withits / 9 Katalin Marton Abbas El Gamal Stanford University Withits 2010 A. El Gamal (Stanford University) Katalin Marton Withits 2010 1 / 9 Brief Bio Born in 1941, Budapest Hungary PhD from Eötvös Loránd University

More information

Channel Coding for Secure Transmissions

Channel Coding for Secure Transmissions Channel Coding for Secure Transmissions March 27, 2017 1 / 51 McEliece Cryptosystem Coding Approach: Noiseless Main Channel Coding Approach: Noisy Main Channel 2 / 51 Outline We present an overiew of linear

More information

Simultaneous Nonunique Decoding Is Rate-Optimal

Simultaneous Nonunique Decoding Is Rate-Optimal Fiftieth Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 1-5, 2012 Simultaneous Nonunique Decoding Is Rate-Optimal Bernd Bandemer University of California, San Diego La Jolla, CA

More information

Error Exponent Region for Gaussian Broadcast Channels

Error Exponent Region for Gaussian Broadcast Channels Error Exponent Region for Gaussian Broadcast Channels Lihua Weng, S. Sandeep Pradhan, and Achilleas Anastasopoulos Electrical Engineering and Computer Science Dept. University of Michigan, Ann Arbor, MI

More information

Secret Key and Private Key Constructions for Simple Multiterminal Source Models

Secret Key and Private Key Constructions for Simple Multiterminal Source Models Secret Key and Private Key Constructions for Simple Multiterminal Source Models arxiv:cs/05050v [csit] 3 Nov 005 Chunxuan Ye Department of Electrical and Computer Engineering and Institute for Systems

More information

On Function Computation with Privacy and Secrecy Constraints

On Function Computation with Privacy and Secrecy Constraints 1 On Function Computation with Privacy and Secrecy Constraints Wenwen Tu and Lifeng Lai Abstract In this paper, the problem of function computation with privacy and secrecy constraints is considered. The

More information

MULTITERMINAL SECRECY AND TREE PACKING. With Imre Csiszár, Sirin Nitinawarat, Chunxuan Ye, Alexander Barg and Alex Reznik

MULTITERMINAL SECRECY AND TREE PACKING. With Imre Csiszár, Sirin Nitinawarat, Chunxuan Ye, Alexander Barg and Alex Reznik MULTITERMINAL SECRECY AND TREE PACKING With Imre Csiszár, Sirin Nitinawarat, Chunxuan Ye, Alexander Barg and Alex Reznik Information Theoretic Security A complementary approach to computational security

More information

Capacity Region of Reversely Degraded Gaussian MIMO Broadcast Channel

Capacity Region of Reversely Degraded Gaussian MIMO Broadcast Channel Capacity Region of Reversely Degraded Gaussian MIMO Broadcast Channel Jun Chen Dept. of Electrical and Computer Engr. McMaster University Hamilton, Ontario, Canada Chao Tian AT&T Labs-Research 80 Park

More information

Information Theory. Lecture 10. Network Information Theory (CT15); a focus on channel capacity results

Information Theory. Lecture 10. Network Information Theory (CT15); a focus on channel capacity results Information Theory Lecture 10 Network Information Theory (CT15); a focus on channel capacity results The (two-user) multiple access channel (15.3) The (two-user) broadcast channel (15.6) The relay channel

More information

Representation of Correlated Sources into Graphs for Transmission over Broadcast Channels

Representation of Correlated Sources into Graphs for Transmission over Broadcast Channels Representation of Correlated s into Graphs for Transmission over Broadcast s Suhan Choi Department of Electrical Eng. and Computer Science University of Michigan, Ann Arbor, MI 80, USA Email: suhanc@eecs.umich.edu

More information

Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information

Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information 204 IEEE International Symposium on Information Theory Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information Omur Ozel, Kaya Tutuncuoglu 2, Sennur Ulukus, and Aylin Yener

More information

Keyless authentication in the presence of a simultaneously transmitting adversary

Keyless authentication in the presence of a simultaneously transmitting adversary Keyless authentication in the presence of a simultaneously transmitting adversary Eric Graves Army Research Lab Adelphi MD 20783 U.S.A. ericsgra@ufl.edu Paul Yu Army Research Lab Adelphi MD 20783 U.S.A.

More information

The Capacity Region of a Class of Discrete Degraded Interference Channels

The Capacity Region of a Class of Discrete Degraded Interference Channels The Capacity Region of a Class of Discrete Degraded Interference Channels Nan Liu Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 74 nkancy@umd.edu

More information

SHARED INFORMATION. Prakash Narayan with. Imre Csiszár, Sirin Nitinawarat, Himanshu Tyagi, Shun Watanabe

SHARED INFORMATION. Prakash Narayan with. Imre Csiszár, Sirin Nitinawarat, Himanshu Tyagi, Shun Watanabe SHARED INFORMATION Prakash Narayan with Imre Csiszár, Sirin Nitinawarat, Himanshu Tyagi, Shun Watanabe 2/41 Outline Two-terminal model: Mutual information Operational meaning in: Channel coding: channel

More information

Soft Covering with High Probability

Soft Covering with High Probability Soft Covering with High Probability Paul Cuff Princeton University arxiv:605.06396v [cs.it] 20 May 206 Abstract Wyner s soft-covering lemma is the central analysis step for achievability proofs of information

More information

Optimal Power Allocation for Achieving Perfect Secrecy Capacity in MIMO Wire-Tap Channels

Optimal Power Allocation for Achieving Perfect Secrecy Capacity in MIMO Wire-Tap Channels Optimal Power Allocation for Achieving Perfect Secrecy Capacity in MIMO Wire-Tap Channels Jia Liu, Y. Thomas Hou, and Hanif D. Sherali Bradley Department of Electrical and Computer Engineering Grado Department

More information

On the Duality of Gaussian Multiple-Access and Broadcast Channels

On the Duality of Gaussian Multiple-Access and Broadcast Channels On the Duality of Gaussian ultiple-access and Broadcast Channels Xiaowei Jin I. INTODUCTION Although T. Cover has been pointed out in [] that one would have expected a duality between the broadcast channel(bc)

More information

Degrees of Freedom Region of the Gaussian MIMO Broadcast Channel with Common and Private Messages

Degrees of Freedom Region of the Gaussian MIMO Broadcast Channel with Common and Private Messages Degrees of Freedom Region of the Gaussian MIMO Broadcast hannel with ommon and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and omputer Engineering University of Maryland, ollege

More information

arxiv: v1 [cs.it] 4 Jun 2018

arxiv: v1 [cs.it] 4 Jun 2018 State-Dependent Interference Channel with Correlated States 1 Yunhao Sun, 2 Ruchen Duan, 3 Yingbin Liang, 4 Shlomo Shamai (Shitz) 5 Abstract arxiv:180600937v1 [csit] 4 Jun 2018 This paper investigates

More information

Reliable Computation over Multiple-Access Channels

Reliable Computation over Multiple-Access Channels Reliable Computation over Multiple-Access Channels Bobak Nazer and Michael Gastpar Dept. of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA, 94720-1770 {bobak,

More information

EE5139R: Problem Set 7 Assigned: 30/09/15, Due: 07/10/15

EE5139R: Problem Set 7 Assigned: 30/09/15, Due: 07/10/15 EE5139R: Problem Set 7 Assigned: 30/09/15, Due: 07/10/15 1. Cascade of Binary Symmetric Channels The conditional probability distribution py x for each of the BSCs may be expressed by the transition probability

More information

Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function

Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function Dinesh Krithivasan and S. Sandeep Pradhan Department of Electrical Engineering and Computer Science,

More information

On Network Interference Management

On Network Interference Management On Network Interference Management Aleksandar Jovičić, Hua Wang and Pramod Viswanath March 3, 2008 Abstract We study two building-block models of interference-limited wireless networks, motivated by the

More information

Exact Random Coding Error Exponents of Optimal Bin Index Decoding

Exact Random Coding Error Exponents of Optimal Bin Index Decoding Exact Random Coding Error Exponents of Optimal Bin Index Decoding Neri Merhav Department of Electrical Engineering Technion - Israel Institute of Technology Technion City, Haifa 32000, ISRAEL E mail: merhav@ee.technion.ac.il

More information

A Systematic Approach for Interference Alignment in CSIT-less Relay-Aided X-Networks

A Systematic Approach for Interference Alignment in CSIT-less Relay-Aided X-Networks A Systematic Approach for Interference Alignment in CSIT-less Relay-Aided X-Networks Daniel Frank, Karlheinz Ochs, Aydin Sezgin Chair of Communication Systems RUB, Germany Email: {danielfrank, karlheinzochs,

More information

End-to-end Secure Multi-hop Communication with Untrusted Relays is Possible

End-to-end Secure Multi-hop Communication with Untrusted Relays is Possible End-to-end Secure Multi-hop Communication with Untrusted Relays is Possible Xiang He Aylin Yener Wireless Communications and Networking Laboratory Electrical Engineering Department The Pennsylvania State

More information

On Source-Channel Communication in Networks

On Source-Channel Communication in Networks On Source-Channel Communication in Networks Michael Gastpar Department of EECS University of California, Berkeley gastpar@eecs.berkeley.edu DIMACS: March 17, 2003. Outline 1. Source-Channel Communication

More information

Information Theoretic Security and Privacy of Information Systems. Edited by Holger Boche, Ashish Khisti, H. Vincent Poor, and Rafael F.

Information Theoretic Security and Privacy of Information Systems. Edited by Holger Boche, Ashish Khisti, H. Vincent Poor, and Rafael F. Information Theoretic Security and Privacy of Information Systems Edited by Holger Boche, Ashish Khisti, H. Vincent Poor, and Rafael F. Schaefer 1 Secure source coding Paul Cuff and Curt Schieler Abstract

More information

On the Duality between Multiple-Access Codes and Computation Codes

On the Duality between Multiple-Access Codes and Computation Codes On the Duality between Multiple-Access Codes and Computation Codes Jingge Zhu University of California, Berkeley jingge.zhu@berkeley.edu Sung Hoon Lim KIOST shlim@kiost.ac.kr Michael Gastpar EPFL michael.gastpar@epfl.ch

More information

The Capacity Region of the Gaussian Cognitive Radio Channels at High SNR

The Capacity Region of the Gaussian Cognitive Radio Channels at High SNR The Capacity Region of the Gaussian Cognitive Radio Channels at High SNR 1 Stefano Rini, Daniela Tuninetti and Natasha Devroye srini2, danielat, devroye @ece.uic.edu University of Illinois at Chicago Abstract

More information

On the Capacity of the Interference Channel with a Relay

On the Capacity of the Interference Channel with a Relay On the Capacity of the Interference Channel with a Relay Ivana Marić, Ron Dabora and Andrea Goldsmith Stanford University, Stanford, CA {ivanam,ron,andrea}@wsl.stanford.edu Abstract Capacity gains due

More information

Coding for Noisy Write-Efficient Memories

Coding for Noisy Write-Efficient Memories Coding for oisy Write-Efficient Memories Qing Li Computer Sci. & Eng. Dept. Texas A & M University College Station, TX 77843 qingli@cse.tamu.edu Anxiao (Andrew) Jiang CSE and ECE Departments Texas A &

More information

Relay Networks With Delays

Relay Networks With Delays Relay Networks With Delays Abbas El Gamal, Navid Hassanpour, and James Mammen Department of Electrical Engineering Stanford University, Stanford, CA 94305-9510 Email: {abbas, navid, jmammen}@stanford.edu

More information

Minimum Energy Per Bit for Secret Key Acquisition Over Multipath Wireless Channels

Minimum Energy Per Bit for Secret Key Acquisition Over Multipath Wireless Channels Minimum Energy Per Bit for Secret Key Acquisition Over Multipath Wireless Channels Tzu-Han Chou Email: tchou@wisc.edu Akbar M. Sayeed Email: akbar@engr.wisc.edu Stark C. Draper Email: sdraper@ece.wisc.edu

More information

Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels

Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels Xiaojun Tang WINLAB, Rutgers University Ruoheng Liu Princeton University Predrag Spasojević WINLAB, Rutgers University H. Vincent

More information

Secrecy Outage Performance of Cooperative Relay Network With Diversity Combining

Secrecy Outage Performance of Cooperative Relay Network With Diversity Combining Secrecy Outage erformance of Cooperative Relay Network With Diversity Combining Khyati Chopra Dept. of lectrical ngineering Indian Institute of Technology, Delhi New Delhi-110016, India mail: eez148071@ee.iitd.ac.in

More information

On the Capacity Region of the Gaussian Z-channel

On the Capacity Region of the Gaussian Z-channel On the Capacity Region of the Gaussian Z-channel Nan Liu Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 74 nkancy@eng.umd.edu ulukus@eng.umd.edu

More information

Common Randomness Principles of Secrecy

Common Randomness Principles of Secrecy Common Randomness Principles of Secrecy Himanshu Tyagi Department of Electrical and Computer Engineering and Institute of Systems Research 1 Correlated Data, Distributed in Space and Time Sensor Networks

More information

Cut-Set Bound and Dependence Balance Bound

Cut-Set Bound and Dependence Balance Bound Cut-Set Bound and Dependence Balance Bound Lei Xiao lxiao@nd.edu 1 Date: 4 October, 2006 Reading: Elements of information theory by Cover and Thomas [1, Section 14.10], and the paper by Hekstra and Willems

More information

ProblemsWeCanSolveWithaHelper

ProblemsWeCanSolveWithaHelper ITW 2009, Volos, Greece, June 10-12, 2009 ProblemsWeCanSolveWitha Haim Permuter Ben-Gurion University of the Negev haimp@bgu.ac.il Yossef Steinberg Technion - IIT ysteinbe@ee.technion.ac.il Tsachy Weissman

More information

On the Capacity of Interference Channels with Degraded Message sets

On the Capacity of Interference Channels with Degraded Message sets On the Capacity of Interference Channels with Degraded Message sets Wei Wu, Sriram Vishwanath and Ari Arapostathis arxiv:cs/060507v [cs.it] 7 May 006 Abstract This paper is motivated by a sensor network

More information

Mismatched Multi-letter Successive Decoding for the Multiple-Access Channel

Mismatched Multi-letter Successive Decoding for the Multiple-Access Channel Mismatched Multi-letter Successive Decoding for the Multiple-Access Channel Jonathan Scarlett University of Cambridge jms265@cam.ac.uk Alfonso Martinez Universitat Pompeu Fabra alfonso.martinez@ieee.org

More information

Secret Message Capacity of Erasure Broadcast Channels with Feedback

Secret Message Capacity of Erasure Broadcast Channels with Feedback Secret Message Capacity of Erasure Broadcast Channels with Feedback László Czap Vinod M. Prabhakaran Christina Fragouli École Polytechnique Fédérale de Lausanne, Switzerland Email: laszlo.czap vinod.prabhakaran

More information

Multicoding Schemes for Interference Channels

Multicoding Schemes for Interference Channels Multicoding Schemes for Interference Channels 1 Ritesh Kolte, Ayfer Özgür, Haim Permuter Abstract arxiv:1502.04273v1 [cs.it] 15 Feb 2015 The best known inner bound for the 2-user discrete memoryless interference

More information

The Poisson Channel with Side Information

The Poisson Channel with Side Information The Poisson Channel with Side Information Shraga Bross School of Enginerring Bar-Ilan University, Israel brosss@macs.biu.ac.il Amos Lapidoth Ligong Wang Signal and Information Processing Laboratory ETH

More information

to be almost surely min{n 0, 3

to be almost surely min{n 0, 3 1 The DoF Region of the Three-Receiver MIMO Broadcast Channel with Side Information and Its Relation to Index Coding Capacity Behzad Asadi, Lawrence Ong, and Sarah J Johnson arxiv:160803377v1 [csit] 11

More information

On Achievability for Downlink Cloud Radio Access Networks with Base Station Cooperation

On Achievability for Downlink Cloud Radio Access Networks with Base Station Cooperation On Achievability for Downlink Cloud Radio Access Networks with Base Station Cooperation Chien-Yi Wang, Michèle Wigger, and Abdellatif Zaidi 1 Abstract arxiv:1610.09407v1 [cs.it] 8 Oct 016 This work investigates

More information

Interactions of Information Theory and Estimation in Single- and Multi-user Communications

Interactions of Information Theory and Estimation in Single- and Multi-user Communications Interactions of Information Theory and Estimation in Single- and Multi-user Communications Dongning Guo Department of Electrical Engineering Princeton University March 8, 2004 p 1 Dongning Guo Communications

More information

Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities

Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities Vincent Y. F. Tan Dept. of ECE and Dept. of Mathematics National University of Singapore (NUS) September 2014 Vincent Tan

More information

Exploiting Partial Channel State Information for Secrecy over Wireless Channels

Exploiting Partial Channel State Information for Secrecy over Wireless Channels Exploiting Partial Channel State Information for Secrecy over Wireless Channels Matthieu R. Bloch and J. Nicholas Laneman Abstract In this paper, we investigate the effect of partial channel state information

More information

Information Masking and Amplification: The Source Coding Setting

Information Masking and Amplification: The Source Coding Setting 202 IEEE International Symposium on Information Theory Proceedings Information Masking and Amplification: The Source Coding Setting Thomas A. Courtade Department of Electrical Engineering University of

More information

Draft. On Limiting Expressions for the Capacity Region of Gaussian Interference Channels. Mojtaba Vaezi and H. Vincent Poor

Draft. On Limiting Expressions for the Capacity Region of Gaussian Interference Channels. Mojtaba Vaezi and H. Vincent Poor Preliminaries Counterexample Better Use On Limiting Expressions for the Capacity Region of Gaussian Interference Channels Mojtaba Vaezi and H. Vincent Poor Department of Electrical Engineering Princeton

More information

An Uplink-Downlink Duality for Cloud Radio Access Network

An Uplink-Downlink Duality for Cloud Radio Access Network An Uplin-Downlin Duality for Cloud Radio Access Networ Liang Liu, Prati Patil, and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto, ON, 5S 3G4, Canada Emails: lianguotliu@utorontoca,

More information

Arimoto Channel Coding Converse and Rényi Divergence

Arimoto Channel Coding Converse and Rényi Divergence Arimoto Channel Coding Converse and Rényi Divergence Yury Polyanskiy and Sergio Verdú Abstract Arimoto proved a non-asymptotic upper bound on the probability of successful decoding achievable by any code

More information