BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/486
DTSTAMP:20230914T125926Z
SUMMARY:Reliable\, Deniable\, Hidable Communication: Using Noise as Camoufl
 age
DESCRIPTION:Speaker: Sidharth Jaggi (The Chinese University of Hong Kong\nD
 epartment of Information Engineering\nRoom 706\, Ho Sin-Hang Engineering B
 uilding\nShatin\, N.T.\nHong Kong)\n\nAbstract: \nAbstract: A transmitter
  Alice may wish to  reliably transmit a message to a receiver Bob over a 
 binary symmetric channel (BSC)\, while simultaneously ensuring that her tr
 ansmission is deniable from an eavesdropper Willie. That is\, if Willie li
 stening to Alice's transmissions over a "significantly noisier" BSC than t
 he one to Bob\, he should be unable to estimate even whether Alice is tran
 smitting. Even when Alice's (potential) communication scheme is publicly k
 nown to Willie (with  no common randomness between Alice and Bob)\, we pr
 ove that over n channel uses Alice can transmit a message of length $O(\\s
 qrt{n})$ bits to Bob\, deniably from Willie. We also prove information-the
 oretic order-optimality of our results. Finally\, we demonstrate that in t
 he scenario when the channel noise parameters are unknown to all parties p
 rior to communication\, the communication scaling can be significantly imp
 roved\, to be linear in n. If time permits\, will briefly describe AWGN ve
 rsion of the problem\, and also a network version of the problem (the mate
 rial in this talk is based on several joint works\, with Pak Hou Che\, May
 ank Bakshi\, Chung Chan\, Zonghao Chen\, Alex Sprintson\, and Swanand Kadh
 e).\n\nThe 1 hour talk will be followed by an additional half hour with mo
 re details for those who are interested.\n \nBio: B.Tech. ('00)\, EE\, II
 T Bombay\,\nMS/Ph.D. ('05) EE\, CalTech\,\nPostdoctoral Associate ('06) LI
 DS\, MIT\,\nCurrently Associate Professor\, Dept. of Information Engineeri
 ng\, The Chinese University of Hong Kong.\nResearch interests: Network cod
 ing and network error-correcting algorithms\, coding theory\, steganograph
 y\, group testing\, compressive sensing.\n \n \n
URL:https://www.tcs.tifr.res.in/web/events/486
DTSTART;TZID=Asia/Kolkata:20140505T160000
DTEND;TZID=Asia/Kolkata:20140505T173000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR