Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices

Gür, Kamil Doruk; Polyakov, Yuriy; Rohloff, Kurt; Ryan, Gerard; Sajjadpour, Hadi; Savaş, Erkay

doi:10.1109/tc.2018.2874479

Cited by 24 publications

(8 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chen et al [18] improved on the basis of [17], and implemented a large universe CP-ABE scheme using the full-rank differences function, which can obtain greater efficiency. To further improve efficiency, Gür et al [19] constructs and implements the CP-ABE scheme from lattices under the RLWE assumption. They employ Gaussian sampling for bigger bases of the gadget matrix, which reduces execution times and storage requirements.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient lattice-based revocable attribute-based encryption against decryption key exposure for cloud file sharing

Huang

Gao

2023

J Cloud Comp

View full text Add to dashboard Cite

Cloud file sharing (CFS) has become one of the important tools for enterprises to reduce technology operating costs and improve their competitiveness. Due to the untrustworthy cloud service provider, access control and security issues for sensitive data have been key problems to be addressed. Current solutions to these issues are largely related to the traditional public key cryptography, access control encryption or attribute-based encryption based on the bilinear mapping. The rapid technological advances in quantum algorithms and quantum computers make us consider the transition from the tradtional cryptographic primitives to the post-quantum counterparts. In response to these problems, we propose a lattice-based Ciphertext-Policy Attribute-Based Encryption(CP-ABE) scheme, which is designed based on the ring learing with error problem, so it is more efficient than that designed based on the learing with error problem. In our scheme, the indirect revocation and binary tree-based data structure are introduced to achieve efficient user revocation and dynamic management of user groups. At the same time, in order to further improve the efficiency of the scheme and realize file sharing across enterprises, the scheme also allows multiple authorities to jointly set up system parameters and manage distribute keys. Furthermore, by re-randomizing the user’s private key and update key, we achieve decryption key exposure resistance(DKER) in the scheme. We provide a formal security model and a series of security experiments, which show that our scheme is secure under chosen-plaintext attacks. Experimental simulations and evaluation analyses demonstrate the high efficiency and practicality of our scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Lattices with trapdoors are described in [8,19,29], and they are statistically indistinguishable from randomly chosen lattices. But trapdoors have some extra information that can be used for efficient solution to the hard problem on lattices.…”

Section: Lattice Trapdoorsmentioning

confidence: 99%

Efficient lattice-based revocable attribute-based encryption against decryption key exposure for cloud file sharing

Huang

Gao

2023

J Cloud Comp

View full text Add to dashboard Cite

show abstract

“…A multiauthority ABE scheme can reduce the pressure of a single attribute authority and improve system efficiency. In 2019, based on Zhangjiang's construction [4], Gur et al [16] made an implement of Zhangjiang's construction. And based on [9], Wang et al [17] constructed a three-to-one recording technique and proposed another lattice-based CP-ABE scheme.…”

Section: Related Workmentioning

confidence: 99%

“….). e above lattice-based ABE schemes [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19] are not suitable for this scenario; that is, they do not support homomorphic operations on the ciphertext. e first fully homomorphic encryption (FHE) scheme was proposed by Gentry [20] in 2009.…”

Section: Related Workmentioning

confidence: 99%

“…In the user's attribute set and access policy, at most one attribute value can be set under each attribute category. It is obvious that the size is dependency on the number of attribute categories k. As shown in Figure 1, according to the suggestion in [16,27,31], we set the parameters n � 284, q � 2 24 , and ℓ � 1, 2, 4, 8, 32, 128, respectively. e comparison shows that the ciphertext sizes of [21,24] growth based on the total number of system's attributes ℓ while it is fixed in our scheme no matter what the total number of system's attributes ℓ is, and when ℓ � 2, the size of ciphertext in our scheme is reduced by at least 73.3%, not to mention ℓ > 2. e comparison of time complexity is shown in Table 3.…”

Section: Performance Analysismentioning

confidence: 99%

See 1 more Smart Citation

Attribute-Based Fully Homomorphic Encryption Scheme from Lattices with Short Ciphertext

Liu

Pan

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Attribute-based encryption (ABE) is a good choice for one-to-many communication and fine-grained access control of the encryption data in a cloud environment. Fully homomorphic encryption (FHE) allows cloud servers to make valid operations on encrypted data without decrypting. Attribute-based fully homomorphic encryption (ABFHE) from lattices not only combines the bilateral advantages/facilities of ABE and FHE but also can resist quantum attacks. However, in the most previous ABFHE schemes, the growth of ciphertext size usually depends on the total number of system’s attributes which leads to high communication overhead and long running time of encryption and decryption. In this paper, based on the LWE problem on lattices, we propose an attribute-based fully homomorphic scheme with short ciphertext. More specifically, by classifying the system’s attributes and using the special structure matrix in MP12, we remove the dependency of ciphertext size on system’s attributes ℓ and the ciphertext size is no longer increased with the total number of system’s attributes. In addition, by introducing the function G − 1 in the homomorphic operations, we completely rerandomize the error term in the new ciphertext and have a very tight and simple error analysis using sub-Gaussianity. Besides, performance analysis shows that when ℓ = 2 and n = 284 according to the parameter suggestion given by Micciancio and Dai et al., the size of ciphertext in our scheme is reduced by at least 73.3%, not to mention ℓ > 2 . The larger the ℓ , the more observable of our scheme. The short ciphertext in our construction can not only reduce the communication overhead but also reduce the running time of encryption and decryption. Finally, our scheme is proved to be secure in the standard model.

show abstract

Efficient Revocable Attribute-Based Encryption from R-LWE in Cloud Storage

Liu

Jiang

2021

Advances in Intelligent Automation and Soft Computing

View full text Add to dashboard Cite

Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices

Cited by 24 publications

References 27 publications

Efficient lattice-based revocable attribute-based encryption against decryption key exposure for cloud file sharing

Efficient lattice-based revocable attribute-based encryption against decryption key exposure for cloud file sharing

Attribute-Based Fully Homomorphic Encryption Scheme from Lattices with Short Ciphertext

Efficient Revocable Attribute-Based Encryption from R-LWE in Cloud Storage

Contact Info

Product

Resources

About