Fucai Luo

Fucai Luo

Auto-generated profile, based on publicly available information

Fucai Luo

University of Chinese Academy of Sciences

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 October 2022 in Computer Standards & Interfaces
Verified
Journal Article
Closed access
FLFucai Luo
Fucai Luo
SASaif Al-Kuwari
Saif Al-Kuwari
HWHaiyan Wang
Haiyan Wang
FWFuqun Wang
Fuqun Wang
KCKefei Chen
Kefei Chen

23 April 2018 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
FLFucai Luo
Fucai Luo
FWFuqun Wang
Fuqun Wang
KWKunpeng Wang
Kunpeng Wang
JLJie Li
Jie Li
KCKefei Chen
Kefei Chen
Very recently, Costache and Smart proposed a fully homomorphic encryption (FHE) scheme based on the Learning with Rounding (LWR) problem, which removes the noise (typically, Gaussian noise) sampling needed in the previous lattices-based FHEs. But their scheme did not work, since the noise of homomorphic multiplication is complicated and large, which leads to failure of decryption. More specifically, they chose LWR instances as a public key and the private key therein as a secret key and then used the tensor product to implement homomorphic multiplication, which resulted in a tangly modulus problem. Recall that there are two moduli in the LWR instances, and then the moduli will tangle together due to the tensor product. Inspired by their work, we built the first workable LWR-based FHE scheme eliminating the tangly modulus problem by cleverly adopting the celebrated approximate eigenvector method proposed by Gentry et al. at Crypto 2013. Roughly speaking, we use a specific matrix multiplication to perform the homomorphic multiplication, hence no tangly modulus problem. Furthermore, we also extend the LWR-based FHE scheme to the multikey setting using the tricks used to construct LWE-based multikey FHE by Mukherjee and Wichs at Eurocrypt 2016. Our LWR-based multikey FHE construction provides an alternative to the existing multikey FHEs and can also be applied to multiparty computation with higher efficiency.

15 August 2018
Verified
Book Chapter
Closed access
PDF file
FLFucai Luo
Fucai Luo
KWKunpeng Wang
Kunpeng Wang

1 November 2019 in IET Information Security
Verified
Journal Article
Open access
PDF file
FLFucai Luo
Fucai Luo
FWFuqun Wang
Fuqun Wang
KWKunpeng Wang
Kunpeng Wang
KCKefei Chen
Kefei Chen
Almost all existing well‐known fully homomorphic encryption (FHE) schemes, which are based on either the learning with errors (LWE) or the ring LWE problem, require expensive Gaussian noise sampling. In this study, the authors propose an FHE scheme based on the ring learning with rounding (RLWR) problem. The learning with rounding (LWR) problem was proposed as a deterministic variant of LWE, while the RLWR is a variant of LWR. Sampling an LWR instance does not require Gaussian noise sampling process, and neither does an RLWR instance. Thus, our FHE scheme can be instantiated without the need for Gaussian noise sampling. To implement homomorphic operations, we devise a specific relinearisation method. Furthermore, we also prove that our RLWR‐based FHE scheme is IND‐CPA secure under RLWR assumption.

6 September 2018
Verified
Book Chapter
Closed access
PDF file
FLFucai Luo
Fucai Luo
KWKunpeng Wang
Kunpeng Wang
CLChanglu Lin
Changlu Lin

1 July 2019
Verified
Conference Paper
Closed access
FWFei Wu
Fei Wu
FLFucai Luo
Fucai Luo
KCKuosong Chen
Kuosong Chen
WLWei Lin
Wei Lin
ZLZiang Lu
Ziang Lu
With the rapid development of mobile communication technology and mobile Internet technology, mobile terminals are becoming more and more irreplaceable in people's life and work. In the present power industry, Android-based smart mobile terminals are widely used to carry out various kinds of operations. Compared with traditional desktop computers, smart mobile terminals provide users with convenience and are more vulnerable to attack and control. Considering the security protection of the core layer of smart mobile terminal, this paper designs an Android lightweight kernel layer mandatory access control framework, deeply analyses and discusses the necessity of terminal kernel layer security protection, proposes a verifiable lightweight kernel layer access control model, and formalizes the model. This paper describes and uses FVT method to discuss security policy conflict detection technology. Finally, the availability and shortcomings of the model on three typical smart mobile terminals are verified by experiments.