Secure computation is a canonical open problem in theoretical computer science and cryptography. In secure computation, a number of users, each holding an independent message, wish to compute a function of the messages without revealing any additional information. We will take an information theoretic approach to the linear secure computation problem where the function is a linear transformation of the messages. We will discuss the fundamental limits on randomness cost (how many noise symbols are required) and round complexity (how many communication rounds are required). Various open problems will be highlighted.
 

Hua Sun received his B.E. in Communications Engineering from Beijing University of Posts and Telecommunications, China, in 2011, M.S. in Electrical and Computer Engineering from University of California Irvine, USA, in 2013, and Ph.D. in Electrical Engineering from University of California Irvine, USA, in 2017. He is an Assistant Professor in the Department of Electrical Engineering at the University of North Texas, USA. His research interests include information theory and its applications to communications, networking, privacy, security and storage. His co-authored papers received the IEEE Jack Keil Wolf ISIT Student Paper Award in 2016, and an IEEE GLOBECOM Best Paper Award in 2016.