{"584543":{"#nid":"584543","#data":{"type":"event","title":"ECE Telecommunications Seminar","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ESeminar Title: \u003C\/strong\u003EPrivacy and Statistical Inference: An Information-theoretic Approach\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ESpeaker and Affiliation: \u003C\/strong\u003ELalitha Sankar,\u0026nbsp;Department of Electrical, Computer, and Energy Engineering at Arizona State University\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAbstract:\u003C\/strong\u003E\u0026nbsp; As information about individuals and enterprises moves to an entirely digital medium, keeping certain aspects of the data confidential (even) from the legitimate data users, i.e., the problem of information privacy, is becoming an important and immediate societal problem. While the benefits (utility) of electronic data are multi-fold, there is a need to provide precise guarantees and limits on the private data leaked and quantify the tradeoff between utility and privacy. In this talk, we introduce an information-theoretic (IT) framework to formulate and study the privacy-utility tradeoff (PUT) problem and illustrate the effect of randomizing privacy mechanisms designed to minimize mutual information based leakage measure for a desired utility. We then focus on a specific problem of publishing datasets with privacy guarantees for the statistical inference problem of binary hypothesis testing under the Neyman-Pearson formulation. We present a PUT problem using mutual information as the privacy metric and the relative entropy between the two distributions of the output (postrandomization) source classes as the utility metric. For the high privacy regime, we present a Euclidean information-theoretic (E-IT) approximation to the tradeoff problem and show that the solution to the E-IT approximation is independent of the alphabet size and preserves the privacy of the source symbols in inverse proportion to their likelihood. Time permitting we may discuss comparisons of IT-based privacy metrics with others such as differential\u0026nbsp;privacy.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EA part of the presentation is based on joint work with Jiachun Liao, Vincent Tan, and Flavio du Pin Calmon.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EBio:\u0026nbsp;\u0026nbsp;\u003C\/strong\u003ELalitha Sankar received the B.Tech degree from the Indian Institute of Technology, Bombay, the M.S. degree from the University of Maryland, and the Ph.D degree from Rutgers University in 2007. She is presently an Assistant Professor in the ECEE department at Arizona State University. Prior to this, she was an Associate Research Scholar at Princeton University. Following her doctorate, Dr Sankar was a recipient of a three year Science and Technology Teaching Postdoctoral Fellowship from the Council on Science and Technology at Princeton University. Prior to her doctoral studies, she was a Senior Member of Technical Staff at AT\u0026amp;T Shannon Laboratories. Her research interests include information privacy and cyber-security in distributed and cyber-physical systems, network information theory and its applications to model and study large data systems. She received the NSF CAREER award in 2014. She received the IEEE Globecom 2011 Best Paper Award for her work on privacy of side-information in multi-user data systems. For her doctoral work, she received the 2007-2008 Electrical Engineering Academic Achievement Award from Rutgers University.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003ELalitha Sankar, of the Department of Electrical, Computer, and Energy Engineering at Arizona State University, will speak on the topic, \u0026quot;Privacy and Statistical Inference: An Information-theoretic Approach.\u0026quot;\u003C\/p\u003E\r\n","format":"limited_html"}],"field_summary_sentence":[{"value":"Lalitha Sankar, of the Department of Electrical, Computer, and Energy Engineering at Arizona State University, will speak on the topic, \u0022Privacy and Statistical Inference: An Information-theoretic Approach.\u0022"}],"uid":"27241","created_gmt":"2016-12-01 18:20:15","changed_gmt":"2017-04-13 21:13:45","author":"Jackie Nemeth","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2016-12-07T14:00:00-05:00","event_time_end":"2016-12-07T15:00:00-05:00","event_time_end_last":"2016-12-07T15:00:00-05:00","gmt_time_start":"2016-12-07 19:00:00","gmt_time_end":"2016-12-07 20:00:00","gmt_time_end_last":"2016-12-07 20:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"1255","name":"School of Electrical and Computer Engineering"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[{"id":"78761","name":"Faculty\/Staff"},{"id":"78771","name":"Public"},{"id":"78751","name":"Undergraduate students"},{"id":"174045","name":"Graduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EMatthieu Bloch\u003C\/p\u003E\r\n\r\n\u003Cp\u003ESchool of Electrical and Computer Engineering\u003C\/p\u003E\r\n\r\n\u003Cp\u003E404.385.4825\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022mailto:matthieu.bloch@ece.gatech.edu\u0022\u003Ematthieu.bloch@ece.gatech.edu\u003C\/a\u003E\u003C\/p\u003E\r\n","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}