L
Lihua Wang
Researcher at National Institute of Information and Communications Technology
Publications - 15
Citations - 1364
Lihua Wang is an academic researcher from National Institute of Information and Communications Technology. The author has contributed to research in topics: Homomorphic encryption & Encryption. The author has an hindex of 8, co-authored 15 publications receiving 898 citations. Previous affiliations of Lihua Wang include University of Tsukuba.
Papers
More filters
Journal ArticleDOI
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption
TL;DR: This paper presented a privacy-preserving deep learning system in which many learning participants perform neural network-based deep learning over a combined dataset of all, without revealing the participant's identity.
Posted Content
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption.
TL;DR: This work revisits the previous work by Shokri and Shmatikov (ACM CCS 2015) and builds an enhanced system with the following properties: no information is leaked to the server and accuracy is kept intact, compared with that of the ordinary deep learning system also over the combined dataset.
Proceedings ArticleDOI
Scalable and Secure Logistic Regression via Homomorphic Encryption
TL;DR: Perhaps surprisingly, despite the non-polynomial tasks of training in logistic regression, it is shown that only additively homomorphic encryption is needed to build this system, which is secure and scalable with the dataset size.
Posted Content
Scalable and Secure Logistic Regression via Homomorphic Encryption.
TL;DR: In this article, the authors proposed a secure system for both the training and predicting data in logistic regression via homomorphic encryption, which is scalable in both the dataset size and dimension, tolerating big size for example of hundreds of millions (10s) records.
Journal ArticleDOI
Combinatorial Constructions for Optimal Splitting Authentication Codes
Gennian Ge,Ying Miao,Lihua Wang +2 more
TL;DR: This paper shows that the necessary conditions for the existence of a $(v,u \times c,1)-splitting BIBD (or, equivalently, an optimal c- Splitting authentication code with ...) are shown.