Fucai Luo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Fucai Luo has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
Kunpeng Wang
School of Cyber Security, University of Chinese Academy of Sciences Beijing People's Republic of China
4 shared publicationsFuqun Wang
3 shared publicationsKefei Chen
3 shared publicationsChanglu Lin
Fujian Normal University
1 shared publication- Fei Wu
Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing, China
1 shared publication - Haiyan Wang
Department of New Networks, PengCheng Laboratory, Shenzhen, China
1 shared publication
Latest Publications
- 20 October 2022
- Published by Elsevier in Computer Standards & Interfaces
- Vol. 84
Revocable attribute-based encryption from standard lattices
- 20 October 2022
- Published by Elsevier in Computer Standards & Interfaces
- Vol. 84
Revocable attribute-based encryption from standard lattices
- Open Access
- 1 November 2019
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 13 (6) , 639-648
Fully homomorphic encryption based on the ring learning with rounding problem
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.
- 1 November 2019
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 13 (6) , 639-648
Open AccessFully homomorphic encryption based on the ring learning with rounding problem
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.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 353-358
A Light-weight Kernel-level Mandatory Access Control Framework for Android
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.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 353-358
A Light-weight Kernel-level Mandatory Access Control Framework for Android
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.
- 6 September 2018
- Published by Springer Nature
- p. 101-115
Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- 6 September 2018
- Published by Springer Nature
- p. 101-115
Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- 15 August 2018
- Published by Springer Nature
- p. 347-365
Verifiable Decryption for Fully Homomorphic Encryption
- 15 August 2018
- Published by Springer Nature
- p. 347-365
Verifiable Decryption for Fully Homomorphic Encryption
- Open Access
- 23 April 2018
- Published by Wiley in Security and Communication Networks
- Vol. 2018, 1-12
LWR-Based Fully Homomorphic Encryption, Revisited
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.
- 23 April 2018
- Published by Wiley in Security and Communication Networks
- Vol. 2018, 1-12
Open AccessLWR-Based Fully Homomorphic Encryption, Revisited
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.