Attribute-based encryption (ABE) has been an active research area in cryptography due to its attractive applications. But almost all attribute-based encryption schemes are based on bilinear maps, which leave them vulnerable to quantum cryptanalysis. The lattice-based ABE schemes from the Learning with errors (LWE) have appeared, but they are not efficient enough for practical applications. Thus we propose an efficient attribute-based encryption based on the Learning with errors over Rings (R-LWE), which is called ABER-LWE. The security analysis shows that ABER-LWEscheme is secure in the selective-set model under the R-LWE assumption, whose security can reduce to the hardness of the shortest vector problem in the worst case on ideal lattices. The efficiency analysis indicates that ABER-LWEis more efficient than previous ABE cryptosystems on lattices.
Attribute-based encryption (ABE) has been an active research area in cryptography due to its attractive applications. But almost all attribute-based encryption schemes are based on bilinear maps, which leave them vulnerable to quantum cryptanalysis. The lattice-based ABE schemes from the Learning with errors (LWE) have appeared, but they are not efficient enough for practical applications. Thus we propose an efficient attribute-based encryption based on the Learning with errors over Rings (R-LWE), which is called ABER-LWE. The security analysis shows that ABER-LWEscheme is secure in the selective-set model under the R-LWE assumption, whose security can reduce to the hardness of the shortest vector problem in the worst case on ideal lattices. The efficiency analysis indicates that ABER-LWEis more efficient than previous ABE cryptosystems on lattices.
The recent promising results on the hardness of lattice problems have inspired the construction of several Attribute-based Encryption (ABE) schemes from the quantum resistant perspective. However, these schemes are insufficient enough for supporting real-world applications due to inherent quadratic overhead problem in the use of Learning With Error (LWE). To solve this problem, this paper proposed a Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme from a more lightweight ideal lattice classes- Ring-Learning with Errors (Ring-LWE), that further called as CP-ABER-LWEscheme. Compared to existing R-LWE based ABE scheme, the proposed CP-ABER-LWEis capable to handle a monotone access structure and enjoys collusion resistance properties. We exploited Linear Secret Scheme (LSSS) to express a monotone access structure. For resist to collusion attack, we applied the private key randomization technique to blind the user's private key. The proposed scheme CP-ABER-LWEis further proven to be secure under the Decision Ring-LWEd,q,χproblem in the selective set model.
Since the introduction of the ring learning with errors (R-LWE) by Lyubashevsky, Peikert and Regev, many efficient and secure applications were founded in cryptography. In this paper, we mainly present an efficient public-key encryption scheme based on the R-LWE assumption. It is very simple to describe and analyze. As well as it can achieve security against certain key-dependent message (KDM) attacks. Namely, this efficient encryption scheme can securely encrypt its own secret key. The security of this scheme follows from the already proven hardness of the R-LWE problem since the R-LWE assumption is reducible to worst-case problems on the ideal lattice. Besides, the scheme enjoys a high level efficiency and low cost since the operations of the scheme are very simple and fast. The cost of both the encryption and decryption is only polylog(n) bit per message symbol.
We propose a large universe attribute-based encryption (ABE ) scheme from lattices. It is inspired by Brent Waters' scheme which is a large universe attribute-based encryption using bilinear map. It is a very practical scheme but this scheme may not be security with the developing quantum computer. So we extend their good idea of large universe attribute-based encryption to lattices based cryptosystem. And our scheme is the first large universe ABE scheme from lattices. In a large universe ABE system any string can be used as attribute and attributes need not be determined at system setup. This is a desirable feature. And the master private key of our scheme is too short too a matrix. Moreover, our scheme is high efficient due to the ciphertext of our scheme is divided into three parts. Finally, under Learning with Errors assumption, we prove our scheme is secure under the select attribute attack.
The advent of quantum computing poses a significant threat to traditional cryptographic algorithms, including RSA, Diffie-Hellman, and Elliptic Curve Cryptography, due to the capabilities of quantum algorithms like Shor’s algorithm. Post-quantum cryptography (PQC) has emerged to address these challenges, with lattice-based cryptography (LBC) being a prominent candidate. LBC, underpinned by hard mathematical problems like Learning with Errors (LWE) and Ring-LWE (RLWE), offers robust security against quantum and classical adversaries. In parallel, Ciphertext-Policy Attribute-Based Encryption (CPABE) has become a critical tool for enabling fine-grained access control in data-sharing scenarios, such as secure cloud storage and IoT. While existing CP-ABE implementations rely on bilinear pairings vulnerable to quantum attacks, lattice-based CPABE schemes provide a quantum-resistant alternative. Despite their potential, these schemes face challenges in computational efficiency, collusion resistance, and implementation correctness. Our contributions include a detailed mathematical breakdown of one of the state-of-the-art (SOTA) lattice-based CP-ABE schemes and a novel correctness proof for the same scheme.
Compared to the classical cryptography, lattice-based cryptography is more secure, flexible and simple, and it is believed to be secure against quantum computers.In this paper, an efficient signature scheme is proposed from the ring learning with errors (R-LWE), which avoids sampling from discrete Gaussians and has the characteristics of the much simpler description etc.Then, the scheme is implemented in C/C++ and makes a comparison with the RSA signature scheme in detail.Additionally, a linearly homomorphic signature scheme without trapdoor is proposed from the R-LWE assumption.The security of the above two schemes are reducible to the worst-case hardness of shortest vectors on ideal lattices.The security analyses indicate the proposed schemes are unforgeable under chosen message attack model, and the efficiency analyses also show that the above schemes are much more efficient than other correlative signature schemes.
Multi-authority attribute-based encryption (MA-ABE) has received increasing attention due to the proliferation of decentralized applications and services. Since its inception, various constructions have been proposed with different security assumptions. However, in light of the threat from quantum attacks, one major challenge is to construct an MA-ABE with post-quantum cryptography techniques. Nonetheless, existing post-quantum solutions have so far been constrained by either efficiency or the need for interactions among authorities, which limits the application of MA-ABE in emerging decentralized applications. In this work, we propose a truly decentralized and more efficient MA-ABE by leveraging the Ring Learning with Error (RLWE) problem. We achieve this by first adapting the generalized compact knapsack problem for an efficient lattice trapdoor sampler. To support any DNF access policy, we develop a ring-based monotone linear secret sharing scheme derived from the Lewko-Waters transformation. The complexity analysis shows that compared to the state of the art, our scheme improves by a factor of N2/logN on encryption and N/logN on decryption, where N is the lattice dimension. Experimental results demonstrate an encryption and decryption time of 28.60 and 15.71 seconds respectively when N =1024, thereby showing the feasibility of our construction in real-world applications.