{"517551":{"#nid":"517551","#data":{"type":"event","title":"ARC Colloquium: Amit Sahai - UCLA","body":[{"value":"\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EAlgorithms \u0026amp; Randomness Center (ARC) \u003C\/strong\u003E\u003C\/p\u003E\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EAmit Sahai\u003Cbr \/\u003E\u003C\/strong\u003E\u003C\/p\u003E\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EFriday, April 15, 20116\u003C\/strong\u003E\u003C\/p\u003E\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EKlaus 1116 West - 2:00 pm\u003C\/strong\u003E\u003C\/p\u003E\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003E(Refreshments will be served in Klaus Atrium at 3 pm)\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003ETitle: \u003Cbr \/\u003E\u003C\/strong\u003EHiding Secrets in Software\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EAbstract:\u003C\/strong\u003E\u003Cbr \/\u003EThe goal of general-purpose program obfuscation is to make an arbitrary computer program \u201cunintelligible\u201d while preserving its functionality. Obfuscation allows us to achieve a powerful capability: software that can keep a secret. This talk will cover recent advances in obfuscation research, yielding constructions of general-purpose obfuscation mechanisms based on new mathematical structures.\u003Cstrong\u003E\u003Cbr \/\u003EBio: \u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003EProfessor Amit Sahai received his Ph.D. in Computer Science from MIT in 2000. From 2000 to 2004, he was on the faculty at Princeton University; in 2004 he joined UCLA, where he currently holds the position of Professor of Computer Science. His research interests are in security and cryptography, and theoretical computer science more broadly. He is the co-inventor of Attribute-Based Encryption, Functional Encryption, and Indistinguishability Obfuscation. He has published more than 100 original technical research papers at venues such as the ACM Symposium on Theory of Computing (STOC), CRYPTO, and the Journal of the ACM. He has given a number of invited talks at institutions such as MIT, Stanford, and Berkeley, including the 2004 Distinguished Cryptographer Lecture Series at NTT Labs, Japan. Professor Sahai is the recipient of numerous honors; he was named an Alfred P. Sloan Foundation Research Fellow in 2002, received an Okawa Research Grant Award in 2007, a Xerox Foundation Faculty Award in 2010, a Google Faculty Research Award in 2010, and a 2012 Pazy Memorial Award. He was awarded the 2016 Lockheed Martin Excellence in Teaching Award. His research has been covered by several news agencies including the BBC World Service, Quanta Magazine, Wired, and IEEE Spectrum.\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EUrl:\u003C\/strong\u003E \u003Ca href=\u0022http:\/\/web.cs.ucla.edu\/~sahai\/\u0022 title=\u0022http:\/\/web.cs.ucla.edu\/~sahai\/\u0022\u003Ehttp:\/\/web.cs.ucla.edu\/~sahai\/\u003C\/a\u003E\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EHost:\u003C\/strong\u003E Lance Fortnow (\u003Ca href=\u0022mailto:fortnow@cc.gatech.edu\u0022\u003Efortnow@cc.gatech.edu\u003C\/a\u003E)\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Talk is at 2 pm instead of 1 pm - Klaus 1116 West"}],"uid":"27466","created_gmt":"2016-03-25 11:18:57","changed_gmt":"2017-04-13 21:16:11","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2016-04-15T15:00:00-04:00","event_time_end":"2016-04-15T16:00:00-04:00","event_time_end_last":"2016-04-15T16:00:00-04:00","gmt_time_start":"2016-04-15 19:00:00","gmt_time_end":"2016-04-15 20:00:00","gmt_time_end_last":"2016-04-15 20:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"},{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"}],"categories":[],"keywords":[{"id":"111051","name":"Algorithm and Randomness Center"},{"id":"4265","name":"ARC"},{"id":"115001","name":"Computational Complexity"},{"id":"114991","name":"Computational Learning Theory"},{"id":"109","name":"Georgia Tech"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[{"id":"78751","name":"Undergraduate students"},{"id":"78761","name":"Faculty\/Staff"},{"id":"78771","name":"Public"},{"id":"174045","name":"Graduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EDani Denton\u003Cbr \/\u003Edenton at cc dot gatech dot edu\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}