Reliable Deniable Communication: Hiding Messages in Noise
description
Transcript of Reliable Deniable Communication: Hiding Messages in Noise
![Page 1: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/1.jpg)
Reliable Deniable Communication: Hiding Messages in Noise
Mayank Bakshi Mahdi Jafari Siavoshani
ME
Sidharth Jaggi
The Chinese University of Hong Kong
The Institute of Network Coding
Pak Hou (Howard) Che
![Page 2: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/2.jpg)
Alice
Reliability
Bob
![Page 3: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/3.jpg)
Willie(the Warden)
Reliability
Deniability
AliceBob
![Page 4: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/4.jpg)
Willie-sky
Reliability
Deniability
AliceBob
![Page 5: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/5.jpg)
M
T
t
�⃑�
Alice’s Encoder
𝑁=2𝜃 (√𝑛)
![Page 6: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/6.jpg)
M
T
Message Trans. Status
BSC(pb) �̂�=𝐷𝑒𝑐 (�⃑�𝑏)�⃑�𝑏�⃑�
Alice’s EncoderBob’s Decoder
𝑁=2𝜃 (√𝑛)
�̂�
![Page 7: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/7.jpg)
M
T
Message Trans. Status
BSC(pb) �̂�=𝐷𝑒𝑐 (�⃑�𝑏)�⃑�𝑏�⃑�
Alice’s EncoderBob’s Decoder
BSC(pw)
�̂�=𝐷𝑒𝑐 (�⃑�𝑤)
�⃑�𝑤
𝑁=2𝜃 (√𝑛)
Willie’s (Best) Estimator
�̂�
�̂�
![Page 8: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/8.jpg)
Bash, Goeckel & Towsley [1]Shared secret
[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.
€
O n .log(n)( ) bits
AWGN channels
But capacity only
€
O n( ) bits!
![Page 9: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/9.jpg)
This workNo shared secret
BSC(pb)
BSC(pw)
pb < pw
![Page 10: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/10.jpg)
Wicked Willie(s) Base-station Bob
Aerial Alice
Directional antenna
![Page 11: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/11.jpg)
Steganography: Other work
![Page 12: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/12.jpg)
Steganography: Other work
![Page 13: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/13.jpg)
Other work: “Common” modelShared secret key
Capacity O(n) message bitsInformation-theoretically tight characterization(Gel’fand-Pinsker/Dirty paper coding)
O(n.log(n)) bits (not optimized)
[2] Y. Wang and P. Moulin, "Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions," IEEE Trans. on Information Theory, special issue on Information Theoretic Security, June 2008
Stegotext(covertext,message,key)
Message,Covertext
No noise
d(stegotext,covertext) “small”
![Page 14: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/14.jpg)
Other work: Square-root “law”(“empirical”)
•“Steganographic capacity is a loosely-defined concept, indicating the size of payload whichmay securely be embedded in a cover object using a particular embedding method. What constitutes “secure” embedding is a matter for debate, but we will argue that capacity should grow only as the square root of the cover size under a wide range of definitions of security.” [3]
•“Thanks to the Central Limit Theorem, the more covertext we give the warden, the better he will be able to estimate its statistics, and so the smaller the rate at which [the steganographer] will be able to tweak bits safely.” [4]
[3] A. Ker, T. Pevny`, J. Kodovsky`, and J. Fridrich, “The square root law of steganographic capacity,” in Proceedings of the 10th ACM workshop on Multimedia and security. ACM, 2008, pp. 107–116.[4] R. Anderson, “Stretching the limits of steganography,” in Information Hiding, 1996, pp. 39–48.
•“[T]he reference to the Central Limit Theorem... suggests that a square root relationship should be considered. “ [3]
![Page 15: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/15.jpg)
M
T
Message Trans. Status
BSC(pb) �̂�=𝐷𝑒𝑐 (�⃑�𝑏)�⃑�𝑏�⃑�
Alice’s EncoderBob’s Decoder
BSC(pw)
�̂�=𝐷𝑒𝑐 (�⃑�𝑤)
�⃑�𝑤
𝑁=2𝜃 (√𝑛)
Willie’s (Best) Estimator
�̂�
�̂�
![Page 16: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/16.jpg)
Hypothesis Testing Willie’s Estimate
Alice’s Transmission
Status
𝛼=Pr ( �̂�=1|𝐓=0 ) , 𝛽=Pr ( �̂�=0|𝐓=1 )
![Page 17: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/17.jpg)
Hypothesis Testing Willie’s Estimate
Alice’s Transmission
Status
![Page 18: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/18.jpg)
Hypothesis Testing Willie’s Estimate
Alice’s Transmission
Status
![Page 19: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/19.jpg)
Hypothesis Testing Willie’s Estimate
Alice’s Transmission
Status
![Page 20: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/20.jpg)
Intuition
𝐓=0 , 𝐲𝑤=�⃑�𝑤 Binomial(𝑛 ,𝑝𝑤)
![Page 21: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/21.jpg)
Intuition
![Page 22: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/22.jpg)
Theorem 1 (Wt(c.w.))(high deniability => low weight codewords)
Too many codewords with weight “much ” greater than𝑐 √𝑛 , h𝑡 𝑒𝑛 h𝑡 𝑒𝑠𝑦𝑠𝑡𝑒𝑚𝑖𝑠 “not very” deniable
![Page 23: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/23.jpg)
Theorems 2 & 3(Converse & achievability for reliable & deniable comm.)
![Page 24: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/24.jpg)
Theorems 2 & 3
𝑝𝑏
𝑝𝑤
0 1/2
1/2
pb>pw
![Page 25: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/25.jpg)
Theorems 2 & 3
𝑝𝑏
𝑝𝑤
0 1/2
1/2
𝑁=0(Symmetrizability)
![Page 26: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/26.jpg)
Theorems 2 & 3
𝑝𝑏
𝑝𝑤
0 1/2
1/2pw=1/2
![Page 27: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/27.jpg)
Theorems 2 & 3
𝑝𝑏
𝑝𝑤
0 1/2
1/2
€
N ≈ 2(1−H (pb ))n
(BSC(pb))
![Page 28: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/28.jpg)
Theorems 2 & 3
𝑝𝑏
𝑝𝑤
0 1/2
1/2
pb=0
![Page 29: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/29.jpg)
Theorems 2 & 3
𝑝𝑏
𝑝𝑤
0 1/2
1/2
𝑁=2𝑂 (√𝑛 log𝑛) ,( 𝑛√𝑛)=2𝑂 (√𝑛 log𝑛)
![Page 30: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/30.jpg)
Theorems 2 & 3
𝑝𝑏
𝑝𝑤
0 1/2
1/2
pw>pb
![Page 31: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/31.jpg)
Theorems 2 & 3
𝑝𝑏
𝑝𝑤
0 1/2
1/2𝑁=2𝑂 (√𝑛)
“Standard” IT inequalities+
Wt(“most codewords”)<√n(Thm 1)
![Page 32: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/32.jpg)
Theorems 2 & 3
𝑝𝑏
𝑝𝑤
0 1/2
1/2
Main thm:
![Page 33: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/33.jpg)
𝑤𝑡𝐻 (𝒚𝑤 )
0 n
logarithm of# codewords
log ( 𝑛𝑛/2)≈𝑛
![Page 34: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/34.jpg)
𝑤𝑡𝐻 (𝐲𝑤)0 n𝑝𝑤𝑛+𝑂 (√𝑛)𝑝𝑤𝑛
log(# codewords)
Pr�⃑�𝑤
(𝑤𝑡𝐻 (𝐲𝑤 ))
𝑂 (1/√𝑛)
𝑛𝐻 (𝑝𝑤 )
𝐱=0⃗
![Page 35: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/35.jpg)
𝑤𝑡𝐻 (𝐲𝑤)0 n
(𝑝¿¿𝑤∗𝜌)𝑛+𝑂(√𝑛)¿(𝑝¿¿𝑤∗𝜌 )𝑛¿(𝑝¿¿𝑤∗𝜌 )𝑛−𝑂(√𝑛)¿
log(# codewords)
Pr𝐌 ,𝐙𝑤
(𝑤𝑡𝐻 (𝐲𝑤 ))
𝑛𝐻 (𝑝𝑤∗𝜌 )
𝑐 √𝑛
𝑂 (1/√𝑛)
![Page 36: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/36.jpg)
![Page 37: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/37.jpg)
Theorem 3 – Reliability proof sketch
0 n
Noise magnitude >> Codeword weight!!!
![Page 38: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/38.jpg)
Theorem 3 – Reliability proof sketch
.
.
.
1000001000000000100100000010000000100
0001000000100000010000000010000000001
0010000100000001010010000000100010011
0000100000010000000000010000000010000
Random code
2O(√n) codewords
Weight O(√n)
![Page 39: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/39.jpg)
Theorem 3 – Reliability proof sketch
.
.
.
1000001000010000100100000010000000100
0001000000100000010000000010000000001
0010000100000001010010000000100010011
0000100000010000000000010000000010000
•E(Intersection of 2 codewords) = O(1)
Weight O(√n)
•Pr(dmin(x) < c√n) < 2-O(√n)
•“Most” codewords “well-isolated”
![Page 40: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/40.jpg)
Theorem 3 – dmin decoding
•Pr(x decoded to x’) < 2-O(√n)
+ O(√n)
x
x’
![Page 41: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/41.jpg)
• Recall: want to show
Theorem 3 – Deniability proof sketch
![Page 42: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/42.jpg)
Theorem 4 – unexpected detour
𝑤𝑡𝐻 (𝒚𝑤 )
0 n
logarithm of# codewords
![Page 43: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/43.jpg)
𝑤𝑡𝐻 (𝒚𝑤 )
0 n
logarithm of# codewords
Too few codewords=> Not deniable
Theorem 4 – unexpected detour
![Page 44: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/44.jpg)
𝑤𝑡𝐻 (𝐲𝑤)0 n
(𝑝¿¿𝑤∗𝜌)𝑛+𝑂(√𝑛)¿(𝑝¿¿𝑤∗𝜌 )𝑛¿(𝑝¿¿𝑤∗𝜌 )𝑛−𝑂(√𝑛)¿
log(# codewords)
Pr𝐌 ,𝐙𝑤
(𝑤𝑡𝐻 (𝐲𝑤 ))
𝑛𝐻 (𝑝𝑤∗𝜌 )
𝑐 √𝑛
𝑂 (1/√𝑛)
![Page 45: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/45.jpg)
• Recall: want to show
𝐏0 𝐏1
Theorem 3 – Deniability proof sketch
![Page 46: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/46.jpg)
0 n
log(# codewords)
𝑛𝐻 (𝑝𝑤 )
Theorem 3 – Deniability proof sketch
![Page 47: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/47.jpg)
𝑤𝑡𝐻 (𝒚𝑤 )
0 n
logarithm of# codewords
Theorem 3 – Deniability proof sketch
![Page 48: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/48.jpg)
𝐏0 𝐏1
!!!
Theorem 3 – Deniability proof sketch
![Page 49: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/49.jpg)
𝐏0 𝐏1
!!!
Theorem 3 – Deniability proof sketch
![Page 50: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/50.jpg)
𝐏1𝑬𝑪(𝐏¿¿1)¿
Theorem 3 – Deniability proof sketch
![Page 51: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/51.jpg)
𝑤𝑡𝐻 (𝒚𝑤 )
0 n𝑝𝑤𝑛+𝑂 (√𝑛)𝑝𝑤𝑛
logarithm of# codewords
Theorem 3 – Deniability proof sketch
![Page 52: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/52.jpg)
# codewords of “type”
𝑇 1𝑇 2
𝑇 3
Theorem 3 – Deniability proof sketch
![Page 53: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/53.jpg)
Theorem 3 – Deniability proof sketch
![Page 54: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/54.jpg)
Theorem 3 – Deniability proof sketch
![Page 55: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/55.jpg)
![Page 56: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/56.jpg)
Theorem 3 – Deniability proof sketch
![Page 57: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/57.jpg)
• w.p.
Theorem 3 – Deniability proof sketch
![Page 58: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/58.jpg)
• w.p.
Theorem 3 – Deniability proof sketch
![Page 59: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/59.jpg)
• w.p. • close to w.p.
Theorem 3 – Deniability proof sketch
![Page 60: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/60.jpg)
• w.p. • close to w.p. • , w.h.p.
Theorem 3 – Deniability proof sketch
![Page 61: Reliable Deniable Communication: Hiding Messages in Noise](https://reader038.fdocuments.us/reader038/viewer/2022110105/5681693d550346895de0b64e/html5/thumbnails/61.jpg)
Summary