SPEAKER: Professor Shuhong Gao, Clemson University
TOPIC: Efficient Fully Homomorphic Encryption Scheme
DATE: May 10, 2018
TIME: 11:00AM-12:00PM
LOCATION: EIT-3142
INVITED BY: Guang Gong
ABSTRACT: As cloud computing, internet of things (IoT) and blockchain technology become increasingly prevalent, there is an urgent need to protect the privacy of massive volumes of sensitive data collected or stored in computer networks or cloud servers, as many of the networks or servers can be vulnerable to external and internal threats such as malicious hackers or curious insiders. The Holy-Grail of cryptography is to have a practical fully homomorphic encryption scheme that allows any third party (including cloud servers, hackers, miners or insiders) to perform searching or analytics of an arbitrary function on the encrypted data (without decryption), while no information on the original data is leaked. The breakthrough was made by Gentry in 2009 who discovered the first fully homomorphic encryption scheme, and since then many improvements have been made on more designing efficient homomorphic encryption schemes. The main bottlenecks are in bootstrapping and large cipher expansion (the ratio of the size of ciphertexts to that of messages). In this talk, we present a compact fully homomorphic encryption scheme whose cipher expansion is 6 under private-key encryption and 20 under public-key encryption, and whose bootstrapping algorithm is suitable for hardware implementation.
BIOGRAPHY: Shuhong Gao received his BS (1983) and MS (1986) from Department of Mathematics, Sichuan University, China, and PhD (1993) from Department of Combinatorics and Optimization, University of Waterloo, Canada. From 1993 to 1995, he was an NSERC Postdoctoral Fellow in Department of Computer Science, University of Toronto, Canada. He joined Clemson University in USA in 1995 as an assistant professor in Mathematical Sciences, and was promoted to associate professor in 2000 (with early tenure) and to full professor in 2002. Professor Gao's research interests include coding theory, cryptography, symbolic computation, computational number theory and computational algebraic geometry and has published over 70 papers in the related areas. He has graduated 15 PhD students and his research has been supported by grants from NSA, NSF and ONR. He is currently an associate Editor for two international journals: Finite Fields and Their Applications, and Applicable Algebra in Engineering, Communication and Computing. More information about his research and teaching can be found at Applicable Algebra Lab: https://www.math.clemson.edu/aca/