Loading in 5 sec....

Reliable Deniable Communication: Hiding Messages in NoisePowerPoint Presentation

Reliable Deniable Communication: Hiding Messages in Noise

Download Presentation

Reliable Deniable Communication: Hiding Messages in Noise

Loading in 2 Seconds...

- 70 Views
- Uploaded on
- Presentation posted in: General

Download Presentation
## PowerPoint Slideshow about 'Reliable Deniable Communication: Hiding Messages in Noise ' - colm

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

### Reliable Deniable Communication: Hiding Messages in Noise

Pak HouChe

MayankBakshi

SidharthJaggi

The Chinese University

of Hong Kong

The Institute of

Network Coding

Hypothesis Testing

- Want:

Hypothesis Testing

- Want:
- Known: for opt. estimator

Hypothesis Testing

- Want:
- Known: for opt. estimator
- , (w.h.p.)

Bash, Goeckel & Towsley [1]

Shared secret

bits

AWGN channels

Capacity = bits

[1] B. A. Bash, D. Goeckel and D. Towsley, “Square root law for communication with low probability of detection on AWGN channels,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2012, pp. 448–452.

Main Theorems

- Theorem 1
- Deniability low weight codewords

- Theorem 2
- Converse of reliability

- Theorem 3
- Achievability (reliability & deniability)

- Theorem 4
- Trade-off between deniability & size of codebook

Theorem 1 (wt(c.w.))(high deniability => low weight codewords)

Theorem 2 (Converse)

- ,if
- if

Theorem 3 – Reliability

- Random codebook ( i.i.d. ) )
- minimum distance decoder
- For ,

log(# vectors)

log(# codewords)

Theorem 3 – Deniability proof sketch

- Recall: want to show

Theorem 3 – Deniability proof sketch

- Recall: want to show

Theorem 3 – Deniability proof sketch

!!!

Theorem 3 – Deniability proof sketch

!!!

Theorem 3 – Deniability proof sketch

with high probability

Theorem 3 – Deniability proof sketch

# codewords of “type”

Theorem 3 – Deniability proof sketch

Theorem 3 – Deniability proof sketch

Theorem 3 – Deniability proof sketch

Theorem 3 – Deniability proof sketch

Theorem 3 – Deniability proof sketch

- w.p.

Theorem 3 – Deniability proof sketch

- w.p.
- close to w.p.
- , w.h.p.