应网络空间清静学院窦钊先生约请，美国罗格斯大学Salim El Rouayheb副教授将于5月17日（星期五）出席“强网论道”第十二讲，并作学术报告 �＝哟行巳さ氖ι辉炯尤耄�
#腾讯聚会：896-996-888
线下参会地点：网安楼426
报告问题：How to Secretly Multiply Matrices
主讲人：Salim El Rouayheb副教授
报告时间：5月17日（星期五）下昼14:00-15:00
主讲人先容：
Salim El Rouayheb is an associate professor in the ECE Department at Rutgers University. From 2013 to 2017, he was an assistant professor at the ECE Department at the Illinois Institute of Technology, Chicago. He was a research scholar at the Electrical Engineering Department at Princeton University (2012-2013) and a postdoc at the EECS department at the University of California, Berkeley (2010-2011). He received his Ph.D. degree in Electrical Engineering from Texas A&M University, College Station, in 2009. In 2019, he was the Rutgers University Walter Tyson Junior Faculty Chair. He received the Google Faculty Award in 2018 and the NSF CAREER award in 2016. His research interests lie in the area of information-theoretic security and privacy of data in networks and distributed systems.
报告内容摘要：
I will talk about the problem ofSecureDistributedMatrixMultiplication(SDMM) in which a data owner wishes to compute the product of two matrices using the assistance of honest but curious, and possibly non-responsive, helpers. Building on Shamir’s classical results on secret sharing, I will establish a connection between SDMM codes with low communication cost to a new combinatorial object that we call Additive Degree Table (ADT). By studying ADTs, we devise a new parameterized family of codes for SDMM that we call GASP (Gap AdditiveSecurePolynomial) Codes. We also derive lower bounds and prove that GASP codes are optimal in certain regimes.
