{"619157":{"#nid":"619157","#data":{"type":"event","title":"Ph.D. Dissertation Defense - Keerthi Arumugam","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ETitle\u003C\/strong\u003E\u003Cem\u003E:\u0026nbsp; \u003C\/em\u003E\u003Cem\u003ECovert Communication Over Multi-user Channels\u003C\/em\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ECommittee:\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. Matthieu Bloch, ECE, Chair , Advisor\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. John Barry, ECE\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. Mary Ann Weitnauer, ECE\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. Mark Davenport, ECE\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. Sebastian Pokutta, ISyE\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAbstract: \u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe\u0026nbsp;objective\u0026nbsp;of\u0026nbsp;the\u0026nbsp;proposed\u0026nbsp;research\u0026nbsp;is to characterize\u0026nbsp;the\u0026nbsp;maximum rate at which information can be transmitted reliably to a legitimate receiver over certain multi-user channels while simultaneously escaping detection from one or more adversaries.\u0026nbsp;Specifically, we investigate\u0026nbsp;the\u0026nbsp;fundamental limits\u0026nbsp;of\u0026nbsp;covert communication over the following multi-user channel models\u0026nbsp;\u0026mdash; a K-user discrete memoryless multiple-access channel (MAC) monitored by a single warden,\u0026nbsp;a discrete memoryless broadcast channel in which one of the receivers is a warden trying to detect the presence of a covert message, and a relay channel model in which the relay aids covert transmission amidst two non-colluding wardens each monitoring the transmitter and the relay, respectively. In all three models, we observe that the covert throughput is subject to the square-root law.\u0026nbsp; Also, building upon a previous result that codeword-level asynchronism results in an improved\u0026nbsp;covert throughput that circumvents the square-root law, we analyze the impact on the covert throughput as a result of\u0026nbsp;symbol-level asynchronism at the receiver and the warden.\u0026nbsp;\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Covert Communication Over Multi-user Channels "}],"uid":"28475","created_gmt":"2019-03-12 21:23:43","changed_gmt":"2019-03-14 17:18:10","author":"Daniela Staiculescu","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2019-03-26T12:00:00-04:00","event_time_end":"2019-03-26T14:00:00-04:00","event_time_end_last":"2019-03-26T14:00:00-04:00","gmt_time_start":"2019-03-26 16:00:00","gmt_time_end":"2019-03-26 18:00:00","gmt_time_end_last":"2019-03-26 18:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"434381","name":"ECE Ph.D. Dissertation Defenses"}],"categories":[],"keywords":[{"id":"100811","name":"Phd Defense"},{"id":"1808","name":"graduate students"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1788","name":"Other\/Miscellaneous"}],"invited_audience":[{"id":"78771","name":"Public"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}