报告题目：Provably Secure and Computationally Efficient Searchable Symmetric Encryption
报告时间：2019年7月6日下午14:30
报告地点：计算机楼A515
报告人：Alex X. Liu
报告人简介：
Alex X. Liu received his Ph.D. degree in Computer Science from The University of Texas at Austin in 2006, and is a professor at the Department of Computer Science and Engineering, Michigan State University. He received the IEEE & IFIP William C. Carter Award in 2004, a National Science Foundation CAREER award in 2009, and the Michigan State University Withrow Distinguished Scholar Award in 2011. He has served as an Editor for IEEE/ACM Transactions on Networking, and he is currently an Associate Editor for IEEE Transactions on Dependable and Secure Computing and IEEE Transactions on Mobile Computing, and an Area Editor for Computer Communications. He has served as the TPC Co-Chair for ICNP 2014 and IFIP Networking 2019. He received Best Paper Awards from ICNP-2012, SRDS-2012, and LISA-2010. His research interests focus on networking and security. He is a Fellow of the IEEE.
报告内容简介：
Driven by lower cost, higher reliability, better performance, and faster deployment, data and computing services have been increasingly outsourced to clouds such as Amazon EC2. However, privacy has been the key road block to cloud computing. On one hand, to leverage the computing and storage capability offered by clouds, we need to store data on clouds. On the other hand, due to many reasons, we may not fully trust the clouds for data privacy. In this talk, I will present our work on high-speed query processing with strong privacy protection for cloud computing. We aim to achieve both provable security and computational efficiency for both range queries and keywork queries. For security, we aim to satisfy the strongest security model of adaptive security. For efficiency, we aim to achieve a query processing speed of a few milliseconds over millions of records.
主办单位：
澳门永利最老登录入口
澳门永利最老登录入口软件学院
澳门永利最老登录入口计算机科学技术研究所
符号计算与知识工程教育部重点实验室
澳门永利最老登录入口国家级计算机实验教学示范中心
