Reliable Deniable Communication: Hiding Messages from Noise Pak Hou Che Joint Work with Sidharth Jaggi, Mayank Bakshi and Madhi Jafari Siavoshani Institute.

Slides:



Advertisements
Similar presentations
 Ammar Abh-Hhdrohss Islamic University -Gaza 1 Chapter 2 Concatenated codes.
Advertisements

Applied Algorithmics - week7
Cryptography for Unconditionally Secure Message Transmission in Networks Kaoru Kurosawa.
Qiwen Wang, Sidharth Jaggi, Shuo-Yen Robert Li Institute of Network Coding (INC) The Chinese University of Hong Kong October 19, 2011 IEEE Information.
Reliable Deniable Communication: Hiding Messages in Noise Mayank Bakshi Mahdi Jafari Siavoshani ME Sidharth Jaggi The Chinese University of Hong Kong The.
Noisy Group Testing (Quick and Efficient) Sheng Cai, Mayank Bakshi, Sidharth Jaggi The Chinese University of Hong Kong Mohammad Jahangoshahi Sharif University.
FOUR WEEKS PROJECT TOPIC: ERROR DETECTION AND CORRECTION GROUP MEMBERS: ALEX NYARKO ANTHONY TSETSE BENJAMIN BOATENG SUPERVISOR: ZOLTAN SAFAR DATE: JUNE.
Amplify-and-Forward in Wireless Relay Networks Samar Agnihotri, Sidharth Jaggi, Minghua Chen Institute of Network Coding The Chinese University of Hong.
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
The 1’st annual (?) workshop. 2 Communication under Channel Uncertainty: Oblivious channels Michael Langberg California Institute of Technology.
Resilient Network Coding in the presence of Byzantine Adversaries Michelle Effros Michael Langberg Tracey Ho Sachin Katti Muriel Médard Dina Katabi Sidharth.
Sep 06, 2005CS477: Analog and Digital Communications1 Introduction Analog and Digital Communications Autumn
Introduction to Modern Cryptography Lecture 5 Number Theory: 1. Quadratic residues. 2. The discrete log problem. Intro to Public Key Cryptography Diffie.
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
Tracey Ho Sidharth Jaggi Tsinghua University Hongyi Yao California Institute of Technology Theodoros Dikaliotis California Institute of Technology Chinese.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
Error Correcting Codes To detect and correct errors Adding redundancy to the original message Crucial when it’s impossible to resend the message (interplanetary.
1 Chapter 1 Introduction. 2 Outline 1.1 A Very Abstract Summary 1.2 History 1.3 Model of the Signaling System 1.4 Information Source 1.5 Encoding a Source.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Generalized Communication System: Error Control Coding Occurs In Right Column. 6.
Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms Chun Lam Chan, Pak Hou Che and Sidharth.
Barriers to Communication Linzi J Kemp Sept 2003.
Channel Polarization and Polar Codes
林茂昭 教授 台大電機系 個人專長 錯誤更正碼 數位通訊
SUPER: Sparse signals with Unknown Phases Efficiently Recovered Sheng Cai, Mayank Bakshi, Sidharth Jaggi and Minghua Chen The Chinese University of Hong.
Boulat A. Bash Dennis Goeckel Don Towsley LPD Communication when the Warden Does Not Know When.
Channel Coding Part 1: Block Coding
Network Coding and Information Security Raymond W. Yeung The Chinese University of Hong Kong Joint work with Ning Cai, Xidian University.
Daphne Koller Message Passing Loopy BP and Message Decoding Probabilistic Graphical Models Inference.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
Communication Systems EE SUMMER CAMP ‘06 Binit Mohanty Ketan Rajawat.
Cryptography Dec 29. This Lecture In this last lecture for number theory, we will see probably the most important application of number theory in computer.
Channel Capacity
ITGD3101Modern Telecommunications Lecture-1- Pulse Code Modulation week 1- S1/ Dr. Anwar Mousa University of Palestine Faculty of Information.
Fast and robust sparse recovery New Algorithms and Applications The Chinese University of Hong Kong The Institute of Network Coding Sheng Cai Eric Chan.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
Toward a Secure Data-Rate Theorem Paul Cuff. Control Setting Controller Encoder System (Plant) Sensors Rate R UiUi XiXi YiYi.
Iterative Soft Decoding of Reed-Solomon Convolutional Concatenated Codes Li Chen Associate Professor School of Information Science and Technology, Sun.
Introduction to Coding Theory. p2. Outline [1] Introduction [2] Basic assumptions [3] Correcting and detecting error patterns [4] Information rate [5]
Stochastic Threshold Group Testing Chun Lam Chan, Sheng Cai, Mayank Bakshi, Sidharth Jaggi The Chinese University of Hong Kong Venkatesh Saligrama Boston.
Error Correction and Partial Information Rewriting for Flash Memories Yue Li joint work with Anxiao (Andrew) Jiang and Jehoshua Bruck.
Cooperative Communication in Sensor Networks: Relay Channels with Correlated Sources Brian Smith and Sriram Vishwanath University of Texas at Austin October.
Multimedia Transmission Over Cognitive Radio Networks using Decode-and-Forward Multi-Relays and Rateless Coding Abdelaali Chaoub, Elhassane Ibn-Elhaj National.
Coding Theory Efficient and Reliable Transfer of Information
1 Private codes or Succinct random codes that are (almost) perfect Michael Langberg California Institute of Technology.
University of Massachusetts Amherst · Department of Computer Science Square Root Law for Communication with Low Probability of Detection on AWGN Channels.
Superposition encoding A distorted version of is is encoded into the inner codebook Receiver 2 decodes using received signal and its side information Decoding.
Name Iterative Source- and Channel Decoding Speaker: Inga Trusova Advisor: Joachim Hagenauer.
On Coding for Real-Time Streaming under Packet Erasures Derek Leong *#, Asma Qureshi *, and Tracey Ho * * California Institute of Technology, Pasadena,
Communication and Management
The Communication Model Speech 8 key terms You will present today’s information in the form a speech on WEDNESDAY
Reliable Deniable Communication: Hiding Messages in Noise The Chinese University of Hong Kong The Institute of Network Coding Pak Hou Che Mayank Bakshi.
The Communication Model Speech 8 key terms You will present today’s information in the form a speech on WEDNESDAY
RELIABLE COMMUNICATION 1 IN THE PRESENCE OFLIMITEDADVERSARIES.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
ON AVCS WITH QUADRATIC CONSTRAINTS Farzin Haddadpour Joint work with Madhi Jafari Siavoshani, Mayank Bakshi and Sidharth Jaggi Sharif University of Technology,
Compression for Fixed-Width Memories Ori Rottenstriech, Amit Berman, Yuval Cassuto and Isaac Keslassy Technion, Israel.
Secure Error-Correcting (SEC) Network Codes Raymond W. Yeung Institute of Network Coding & Department of Information Engineering The Chinese University.
Dennis Goeckel Electrical and Computer Engineering (ECE) University of Massachusetts at Amherst Fundamental Limits of Covert Communications Joint work.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany DATA COMMUNICATION introduction A.J. Han Vinck May 10, 2003.
Chapter 4: Information Theory. Learning Objectives LO 4.1 – Understand discrete and continuous messages, message sources, amount of information and its.
Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching Marco Molinaro David Woodruff Grigory Yaroslavtsev Georgia Tech.
RELIABLE COMMUNICATION
Reliable Deniable Communication: Hiding Messages in Noise
Distributed Compression For Binary Symetric Channels
Information-Theoretic Security
tUAN THANH NGUYEN Nanyang Technological University (NTU), Singapore
Lecture 11 The Noiseless Coding Theorem (Section 3.4)
Theory of Information Lecture 13
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

Reliable Deniable Communication: Hiding Messages from Noise Pak Hou Che Joint Work with Sidharth Jaggi, Mayank Bakshi and Madhi Jafari Siavoshani Institute of Network Coding The Chinese University of Hong Kong

Introduction Is Alice talking to someone? Alice Willie Bob

Introduction Is Alice talking to someone? Alice Willie Bob Goal: decode message Goal: detect Alice’s status Goal: transmit reliably & deniably

Model M T Alice’s Encoder

Model M T BSC(p b ) Alice’s Encoder Bob’s Decoder

Model M T BSC(p b ) Alice’s Encoder Bob’s Decoder

Model M T BSC(p b ) Alice’s Encoder Bob’s Decoder BSC(p w ) Willie’s Estimator

Model M T BSC(p b ) Alice’s Encoder Bob’s Decoder BSC(p w ) Willie’s Estimator

Model M T BSC(p b ) Alice’s Encoder Bob’s Decoder BSC(p w ) Willie’s Estimator Asymmetry p b < p w

Prior Work AliceBob Willie Shared secret ([1] Bash, Goeckel & Towsley) [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.

Our Case AliceBob Willie Asymmetry p b < p w

Hypothesis Testing Willie’s Estimation Alice’s Transmit Status

Hypothesis Testing Willie’s Estimation Alice’s Transmit Status

Hypothesis Testing Willie’s Estimation Alice’s Transmit Status

Hypothesis Testing Willie’s Estimation Alice’s Transmit Status

Intuition

Theorem 1 (high deniability => low weight codewords)

Theorem 2 & 3 (Converse & achievability for reliable & deniable comm.)

Theorem 2 & 3 0 1/2 p b >p w

Theorem 2 & 3 0 1/2

Theorem 2 & 3 0 1/2 p w =1/2

Theorem 2 & 3 0 1/2

Theorem 2 & 3 0 1/2

Theorem 2 & 3 0 1/2 p b =1/2

Theorem 2 & 3 0 1/2

Theorem 2 & 3 0 1/2

Theorem 2 & 3 0 1/2

Theorem 2 & 3 0 1/2 p w >p b

Theorem 2 & 3 0 1/2

Theorem 2 & 3 0 1/2

Theorem 3 – Proof Idea

0n logarithm of # codewords

Theorem 3 – Proof Idea 0n logarithm of # codewords

Theorem 3 – Proof Idea 0n logarithm of # codewords Too few codewords => Not deniable (Thm4)

Theorem 3 – Proof Idea 0n logarithm of # codewords

Theorem 3 – Proof Idea 0n logarithm of # codewords

Theorem 3 – Proof Idea Logarithm of # codewords

Theorem 3 – Proof Idea

0n logarithm of # codewords

Theorem 3 – Proof Idea 0n logarithm of # codewords

Theorem 3 – Proof Idea 0n logarithm of # codewords

Theorem 3 – Sketch Proof

Summary 0 1/2

Summary 0 1/2