Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Identity-Based Matrix (Level) Fully Homomorphic Encryption Scheme

CHEN Hong, HUANG Jie, CHEN Honglin, WANG Runting, XIAO Chenglong, GUO Pengfei, JIN Haibo

Published Oct 1, 2020• 1 citation
Publisher

Abstract

With the development of quantum theory, traditional encryption algorithms are facing enormous challenges. Once quantum computers are available, existing encryption systems will no longer be secure. The lattice cipher is proven by theory to be a new type of encryption scheme, which can resist quantum algorithm. It has the property of fast computing speed and small space occupation, hence, it has become a hot issue in today??s research. The identity-based encryption scheme can improve the utilization of storage space and facilitate user public key management. Consequently, this paper based on the hard problem of learning with errors (LWE), constructs an identity-based matrix encryption scheme at first, then applies the improved key switching technology to reduce the dimension of homomorphic ciphertext to normal, and uses the mode conversion technique to reduce noise, realizing matrix homo-morphic operation, and getting an identity-based matrix (level) fully homomorphic encryption scheme. The scheme uses matrices as the storage structure, which has greatly improved the processing capability compared to other single-bit schemes. The scheme not only satisfies the addition and Hadamard product of the matrix, but also supports matrix dot multiplication. The experimental results show that compared with other methods, the improved key switching technology in this paper inputs less noise. Through the difficulty of the LWE problem, it is proven that the scheme satisfies IND-sID-CPA (indistinguishability-selective identity-chosen plaintext attack).

DOI
10.3778/j.issn.1673-9418.1910061

Related papers

Adaptive Secure Homomorphic Encryption Scheme

Ma Boyu, Chen Hong

Due to the threat of future quantum computers, it is necessary to develop cryptographic schemes that are resistant to quantum attacks. Lattice based cryptographic schemes have resistance to quantum attacks and security under worst-case assumptions that are difficult to solve. To solve the problems of large size of public and private keys, low encryption efficiency, and large noise growth in identity based encryption schemes, an adaptive secure identity based all homomorphic encryption scheme based on Learning with Errors (LWE) is constructed. This scheme uses {0,1} matrices to store plaintext, significantly improving encryption efficiency compared to single bit encryption schemes. It uses key conversion technology to achieve homomorphic operations and modulus conversion technology to reduce noise. It also converts IDs into bit sequences to construct an encryption scheme for adaptive security. Compared to selective security that only provides security guarantees for specific types of attacks, adaptive security is suitable for general scenarios, providing higher security guarantees and being able to cope with more challenging attack situations. It has been proven through the LWE problem that the security of our proposed scheme satisfies IND-ID-CPA. Finally, the experimental results indicate that this scheme introduces less noise, and has higher encryption efficiency and performance.

IEEE International Conference on Control, Electronics and Computer Technology (ICCECT)•Apr 26, 2024•0 citations

A Compact Multi-Identity Fully Homomorphic Encryption Scheme Without Fresh Ciphertexts

Ziwei Wang, Ruwei Huang, Xiyi Wei

The lattice-based multi-identity fully homomorphic encryption scheme combines the quantum security of lattice cryptography with the advantage of identity-based encryption. However, existing schemes face challenges such as large key sizes, inefficient ciphertext expansion processes, and reliance on outdated trapdoor designs, limiting their compactness and practicality. In this study, we propose a novel Compact Multi-Identity Fully Homomorphic Encryption Scheme (WZ-MIBFHE) that eliminates the need for fresh ciphertexts during expansion. First, we construct a compact identity-based encryption scheme by combining the YJW23 trapdoor and ABB10 under the standard model, proving its IND-sID-CPA security. The scheme is then adapted to ensure correctness and security when integrated with the decomposition method for ciphertext expansion. This adaptation also utilizes approximation errors to reduce overall noise. Finally, we expand the modified IBE scheme’s ciphertext using the decomposition method to construct the WZ-MIBFHE scheme. Compared to existing methods, WZ-MIBFHE reduces the lattice dimension to nlogq+logbq, improves public and private key sizes, and significantly lowers ciphertext expansion rates by removing the need for fresh ciphertexts. These improvements enhance both the compactness and efficiency of the scheme, making it a promising solution for multi-identity homomorphic encryption.

Applied Sciences•Jan 6, 2025•3 citations

Lattice-based Homomorphic Encryption for Privacy-protecting in IoT

Mengjiao Yang, Ruilin Zhang, Weiwei Wang +1 more

In IoT, the issue of protecting the privacy and security of sensitive data is of paramount importance. As an encryption method, homomorphic encryption (HE) can operate on the encrypted raw data without decrypting the original data, which greatly protects sensitive data. Most existing HE schemes are based on the traditional public key cryptosystem of public key infrastructure (PKI), which is cumbersome in certificate management and cannot resist quantum attacks. Therefore, this paper combines lattice cryptography and identity-based cryptosystem, constructs a homomorphic encryption algorithm based on the hard problem of lattice, concatenates user identity hash and random matrix to form a user public key, and then designs a lattice-based homomorphic encryption (LHE) scheme. The LHE scheme is proved to be secure based on the Learning With Errors (LWE) hard problem assumption. Compared with other lattice encryption algorithms, the proposed scheme has the smaller key length and ciphertext size. In addition, this paper applies the lattice-based homomorphic encryption scheme to the IoT and proposes a quantum attack-resistant data processing method to achieve quantum security of data during transmission.

International Conference on Advanced Computational Intelligence (ICACI)•Aug 1, 2026•0 citations

Efficient identity‐based leveled fully homomorphic encryption from RLWE

Xiaoqiang Sun, Jianping Yu, Ting Wang +2 more

Abstract Based on the learning with errors over rings (RLWE) assumption, a leveled fully homomorphic encryption (FHE) by the approximate eigenvector method under the same public key is proposed, which security can be reduced to the shortest vector problem on ideal lattices in the worst case. And the leveled FHE under different public keys is realized by the secret key switching without dimension reduction. Combine the public key of leveled FHE with the identity, we bring forward an efficient identity‐based leveled FHE scheme from the RLWE assumption. The security analysis shows that our identity‐based leveled FHE scheme is selective‐ID secure against chosen‐plaintext attacks in the random oracle model. And the efficiency analysis and simulation results show that the proposed identity‐based leveled FHE scheme is much more efficient than Gentry's and Wang's identity‐based cryptosystems based on the learning with errors assumption. Copyright © 2016 John Wiley & Sons, Ltd.

Security and Communication Networks•Nov 18, 2016•8 citations

Identity-based leveled fully homomorphic encryption over ideal lattices

Weili Wang, Bin Hu, Xiufeng Zhao

This paper proposes an efficient identity-based leveled fully homomorphic encryption (IBFHE) scheme over ideal lattice. First, we achieve an identity-based encryption (IBE) scheme in dual-LWE cryptosystem. Then, we take advantage of the eigenvector method to compile the IBE scheme into an IBFHE scheme. Compared with the previous scheme, our scheme is of shorter key size, smaller storage, and higher efficiency, owing to a new trapdoor generation function and algebraic structure of ideal lattice. The security analysis shows that our scheme is selective-identity secure against chosen-plaintext attacks in the standard model.

IEEE International Conference on Big Data Analysis (ICBDA)•Mar 1, 2017•2 citations

A Multi-Bit Fully Homomorphic Encryption with Shorter Public Key from LWE

Zhigang Chen, Xinxia Song

The efficiency of fully homomorphic encryption is a big question at present. To improve efficiency of fully homomorphic encryption, we use the technique of packed ciphertext to construct a multi-bit fully homomorphic encryption based on Learning with Errors problem. Our scheme has a short public key. Since our fully homomorphic encryption scheme builds on the basic encryption scheme that choose Learning with Errors samples from Gaussian distribution and add Gaussian error to it, which result in that the number of Learning with Errors samples decrease from 2nlogq to n+1. We prove that our fully homomorphic encryption scheme is feasible and its security relies on the hardness of Learning with Errors problem. In addition we adapt the optimization for the process of key switching from GHS13 and formal this new process of key switching for multi-bit fully homomorphic encryption. At last, we analyze the concert parameters and compare these parameters between our scheme and GHS13 scheme. The data show that our scheme has public key smaller by a factor of about logq than it in GHS13 scheme.

•Jan 1, 2015•1 citation
With the development of quantum theory, traditional encryption algorithms are facing enormous challenges. Once quantum computers are available, existing encryption systems will no longer be secure. The lattice cipher is proven by theory to be a new type of encryption scheme, which can resist quantum algorithm. It has the property of fast computing speed and small space occupation, hence, it has become a hot issue in today??s research. The identity-based encryption scheme can improve the utilization of storage space and facilitate user public key management. Consequently, this paper based on the hard problem of learning with errors (LWE), constructs an identity-based matrix encryption scheme at first, then applies the improved key switching technology to reduce the dimension of homomorphic ciphertext to normal, and uses the mode conversion technique to reduce noise, realizing matrix homo-morphic operation, and getting an identity-based matrix (level) fully homomorphic encryption scheme. The scheme uses matrices as the storage structure, which has greatly improved the processing capability compared to other single-bit schemes. The scheme not only satisfies the addition and Hadamard product of the matrix, but also supports matrix dot multiplication. The experimental results show that compared with other methods, the improved key switching technology in this paper inputs less noise. Through the difficulty of the LWE problem, it is proven that the scheme satisfies IND-sID-CPA (indistinguishability-selective identity-chosen plaintext attack).
Due to the threat of future quantum computers, it is necessary to develop cryptographic schemes that are resistant to quantum attacks. Lattice based cryptographic schemes have resistance to quantum attacks and security under worst-case assumptions that are difficult to solve. To solve the problems of large size of public and private keys, low encryption efficiency, and large noise growth in identity based encryption schemes, an adaptive secure identity based all homomorphic encryption scheme based on Learning with Errors (LWE) is constructed. This scheme uses {0,1} matrices to store plaintext, significantly improving encryption efficiency compared to single bit encryption schemes. It uses key conversion technology to achieve homomorphic operations and modulus conversion technology to reduce noise. It also converts IDs into bit sequences to construct an encryption scheme for adaptive security. Compared to selective security that only provides security guarantees for specific types of attacks, adaptive security is suitable for general scenarios, providing higher security guarantees and being able to cope with more challenging attack situations. It has been proven through the LWE problem that the security of our proposed scheme satisfies IND-ID-CPA. Finally, the experimental results indicate that this scheme introduces less noise, and has higher encryption efficiency and performance.
The lattice-based multi-identity fully homomorphic encryption scheme combines the quantum security of lattice cryptography with the advantage of identity-based encryption. However, existing schemes face challenges such as large key sizes, inefficient ciphertext expansion processes, and reliance on outdated trapdoor designs, limiting their compactness and practicality. In this study, we propose a novel Compact Multi-Identity Fully Homomorphic Encryption Scheme (WZ-MIBFHE) that eliminates the need for fresh ciphertexts during expansion. First, we construct a compact identity-based encryption scheme by combining the YJW23 trapdoor and ABB10 under the standard model, proving its IND-sID-CPA security. The scheme is then adapted to ensure correctness and security when integrated with the decomposition method for ciphertext expansion. This adaptation also utilizes approximation errors to reduce overall noise. Finally, we expand the modified IBE scheme’s ciphertext using the decomposition method to construct the WZ-MIBFHE scheme. Compared to existing methods, WZ-MIBFHE reduces the lattice dimension to nlogq+logbq, improves public and private key sizes, and significantly lowers ciphertext expansion rates by removing the need for fresh ciphertexts. These improvements enhance both the compactness and efficiency of the scheme, making it a promising solution for multi-identity homomorphic encryption.
In IoT, the issue of protecting the privacy and security of sensitive data is of paramount importance. As an encryption method, homomorphic encryption (HE) can operate on the encrypted raw data without decrypting the original data, which greatly protects sensitive data. Most existing HE schemes are based on the traditional public key cryptosystem of public key infrastructure (PKI), which is cumbersome in certificate management and cannot resist quantum attacks. Therefore, this paper combines lattice cryptography and identity-based cryptosystem, constructs a homomorphic encryption algorithm based on the hard problem of lattice, concatenates user identity hash and random matrix to form a user public key, and then designs a lattice-based homomorphic encryption (LHE) scheme. The LHE scheme is proved to be secure based on the Learning With Errors (LWE) hard problem assumption. Compared with other lattice encryption algorithms, the proposed scheme has the smaller key length and ciphertext size. In addition, this paper applies the lattice-based homomorphic encryption scheme to the IoT and proposes a quantum attack-resistant data processing method to achieve quantum security of data during transmission.
Abstract Based on the learning with errors over rings (RLWE) assumption, a leveled fully homomorphic encryption (FHE) by the approximate eigenvector method under the same public key is proposed, which security can be reduced to the shortest vector problem on ideal lattices in the worst case. And the leveled FHE under different public keys is realized by the secret key switching without dimension reduction. Combine the public key of leveled FHE with the identity, we bring forward an efficient identity‐based leveled FHE scheme from the RLWE assumption. The security analysis shows that our identity‐based leveled FHE scheme is selective‐ID secure against chosen‐plaintext attacks in the random oracle model. And the efficiency analysis and simulation results show that the proposed identity‐based leveled FHE scheme is much more efficient than Gentry's and Wang's identity‐based cryptosystems based on the learning with errors assumption. Copyright © 2016 John Wiley & Sons, Ltd.
This paper proposes an efficient identity-based leveled fully homomorphic encryption (IBFHE) scheme over ideal lattice. First, we achieve an identity-based encryption (IBE) scheme in dual-LWE cryptosystem. Then, we take advantage of the eigenvector method to compile the IBE scheme into an IBFHE scheme. Compared with the previous scheme, our scheme is of shorter key size, smaller storage, and higher efficiency, owing to a new trapdoor generation function and algebraic structure of ideal lattice. The security analysis shows that our scheme is selective-identity secure against chosen-plaintext attacks in the standard model.
The efficiency of fully homomorphic encryption is a big question at present. To improve efficiency of fully homomorphic encryption, we use the technique of packed ciphertext to construct a multi-bit fully homomorphic encryption based on Learning with Errors problem. Our scheme has a short public key. Since our fully homomorphic encryption scheme builds on the basic encryption scheme that choose Learning with Errors samples from Gaussian distribution and add Gaussian error to it, which result in that the number of Learning with Errors samples decrease from 2nlogq to n+1. We prove that our fully homomorphic encryption scheme is feasible and its security relies on the hardness of Learning with Errors problem. In addition we adapt the optimization for the process of key switching from GHS13 and formal this new process of key switching for multi-bit fully homomorphic encryption. At last, we analyze the concert parameters and compare these parameters between our scheme and GHS13 scheme. The data show that our scheme has public key smaller by a factor of about logq than it in GHS13 scheme.