應(yīng)網(wǎng)絡(luò)空間安全學(xué)院竇釗老師邀請(qǐng)，美國(guó)羅格斯大學(xué)Salim El Rouayheb副教授將于5月17日（星期五）出席“強(qiáng)網(wǎng)論道”第十二講，并作學(xué)術(shù)報(bào)告。歡迎感興趣的師生踴躍參加！
#騰訊會(huì)議：896-996-888
線下參會(huì)地址：網(wǎng)安樓426
報(bào)告題目：How to Secretly Multiply Matrices
主講人：Salim El Rouayheb副教授
報(bào)告時(shí)間：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.
報(bào)告內(nèi)容摘要：
I will talk about the problem of Secure Distributed Matrix Multiplication (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 Additive Secure Polynomial) Codes. We also derive lower bounds and prove that GASP codes are optimal in certain regimes.
