{"641916":{"#nid":"641916","#data":{"type":"event","title":"PhD Proposal by Tianxin Tang","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ETitle:\u003C\/strong\u003E Searchable Encryption Revisited\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003ETianxin Tang\u003C\/p\u003E\r\n\r\n\u003Cp\u003EPh.D. Student in Computer Science\u003C\/p\u003E\r\n\r\n\u003Cp\u003ESchool of Computer Science\u003C\/p\u003E\r\n\r\n\u003Cp\u003ECollege of Computing\u003C\/p\u003E\r\n\r\n\u003Cp\u003EGeorgia Institute of Technology\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EDate:\u003C\/strong\u003E Wed December 9 2020\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ETime:\u003C\/strong\u003E 10:00 AM to 11:30 AM (EST)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ELocation:\u003C\/strong\u003E (remote via Bluejeans) \u003Ca href=\u0022https:\/\/bluejeans.com\/801214521\u0022 title=\u0022https:\/\/bluejeans.com\/801214521\u0022\u003Ehttps:\/\/bluejeans.com\/801214521\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ECommittee\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E- Dr. Sasha Boldyreva (Advisor, School of Computer Science, Georgia Institute of Technology, US)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E- Dr. Vlad Kolesnikov (School of Computer Science, Georgia Institute of Technology, US)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E- Dr. Wenke Lee (School of Computer Science, Georgia Institute of Technology, US)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E- Dr. Bogdan Warinschi (Department of Computer Science, University of Bristol, UK)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAbstract\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe past decade has witnessed increasing demands from corporations and\u003C\/p\u003E\r\n\r\n\u003Cp\u003Eindividuals on data outsourcing to third-party cloud providers. How can the\u003C\/p\u003E\r\n\r\n\u003Cp\u003Eservice provider offer search functionality without sacrificing clients\u0026#39; data\u003C\/p\u003E\r\n\r\n\u003Cp\u003Eprivacy remains an intriguing problem. Searchable encryption (SE), is an area\u003C\/p\u003E\r\n\r\n\u003Cp\u003Ethat explicitly targets the outsourced setting, offering privacy-preserving\u003C\/p\u003E\r\n\r\n\u003Cp\u003Esolutions for accessing the encrypted data. We revisit SE and focus on more\u003C\/p\u003E\r\n\r\n\u003Cp\u003Eversatile functionalities: first, similarity search in a keyless setting;\u003C\/p\u003E\r\n\r\n\u003Cp\u003Esecond, secure approximate k-NN search. Due to emerging leakage-abusing attacks\u003C\/p\u003E\r\n\r\n\u003Cp\u003Ein SE, we also consider the third problem, constructing a practical SE\u003C\/p\u003E\r\n\r\n\u003Cp\u003Esupporting keyword search with minimal leakage.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003EWe adopt a provable security approach attacking the above problems: define the\u003C\/p\u003E\r\n\r\n\u003Cp\u003Esyntax, correctness, security sufficient for practice; propose constructions\u003C\/p\u003E\r\n\r\n\u003Cp\u003Emeeting the correctness and security requirements, only relying on standard\u003C\/p\u003E\r\n\r\n\u003Cp\u003Ecryptographic hardness assumptions. For the first problem, how to conduct\u003C\/p\u003E\r\n\r\n\u003Cp\u003Esimilarity search without the secret keys, we propose a non-interactive protocol\u003C\/p\u003E\r\n\r\n\u003Cp\u003Ecalled keyless fuzzy search (KlFS). It masks public fuzzy-searchable databases\u003C\/p\u003E\r\n\r\n\u003Cp\u003Eso that only users who possess close data to parts of the database can access\u003C\/p\u003E\r\n\r\n\u003Cp\u003Ethe masked contents. The security level of the construction relies on the\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026quot;closeness-unpredictability\u0026rdquo; property of the database. For the second problem,\u003C\/p\u003E\r\n\r\n\u003Cp\u003Esecure approximate k-NN search, we show how to utilize ORAM techniques and\u003C\/p\u003E\r\n\r\n\u003Cp\u003Econstruct a privacy-preserving approximate k-NN protocol that hides the access\u003C\/p\u003E\r\n\r\n\u003Cp\u003Epattern, query pattern, and volume pattern. Finally, for the last problem, we\u003C\/p\u003E\r\n\r\n\u003Cp\u003Efocus on a strong security notion of searchable encryption with keyword search\u003C\/p\u003E\r\n\r\n\u003Cp\u003Ethat hides access, query, and volume pattern. We propose a practical ORAM-based\u003C\/p\u003E\r\n\r\n\u003Cp\u003Econstruction, more efficient than known ORAM-based ones, and more secure than\u003C\/p\u003E\r\n\r\n\u003Cp\u003Eavailable structured encryption schemes.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Searchable Encryption Revisited"}],"uid":"27707","created_gmt":"2020-12-07 22:40:40","changed_gmt":"2020-12-07 22:40:40","author":"Tatianna Richardson","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2020-12-09T10:00:00-05:00","event_time_end":"2020-12-09T12:00:00-05:00","event_time_end_last":"2020-12-09T12:00:00-05:00","gmt_time_start":"2020-12-09 15:00:00","gmt_time_end":"2020-12-09 17:00:00","gmt_time_end_last":"2020-12-09 17:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"221981","name":"Graduate Studies"}],"categories":[],"keywords":[{"id":"102851","name":"Phd proposal"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1788","name":"Other\/Miscellaneous"}],"invited_audience":[{"id":"78761","name":"Faculty\/Staff"},{"id":"78771","name":"Public"},{"id":"174045","name":"Graduate students"},{"id":"78751","name":"Undergraduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}