A Novel Lattice-Based Ciphertext-Policy Attribute-Based Proxy Re-encryption for Cloud Sharing

Abstract

Proxy re-encryption plays an important role in cloud sharing. Ciphertext-policy attribute-based proxy re-encryption (CP-ABPRE) scheme supports access control and can convert the ciphertext under an access policy to a ciphertext under another access policy, which is flexible and efficient for cloud sharing. The existing CP-ABPRE schemes are constructed by bilinear pairing or multi-linear maps which are fragile when the post-quantum comes. In this paper, a unidirectional singlehop CP-ABPRE scheme with small size of public parameters was presented by using trapdoor sampling, and proved secure under learning with errors assumption which is widely believed secure in quantum computer attacks.

A Survey on Attribute-Based Encryption Schemes Suitable for the Internet of Things

“…Indeed, such schemes are built on lattices, oftentimes relying on the learning with errors (LWEs) problem. This means that the size of encryption and decryption keys are too large (typically in the order of gigabytes [25], [26]) to fit IoT devices. Since quantum computers will be available to major actors in the next decades, we believe the research should push to find more efficient ABE quantum-resistant schemes.…”

“…Recent surveys [17], [20], [24] do not explore novel strategies, e.g., ABE schemes with asymmetric pairings, and they do not quantitatively estimate the KPIs of the suitable schemes through experiments. In the present work, we do not survey lattice-based ABE schemes, for example [25], [26]: although they are interesting from a post-quantum perspective, they seem to be too burdensome for the class of constrained IoT devices that we consider in this article.…”

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

“…Therefore, there is less relevant literature about lattice-based ABPRE. Li et al [17] designed the first ciphertext-policy ABPRE under the LWE assumption. Their scheme only supported the access structure of the AND gate, and the access policy's expressiveness was relatively weak.…”

“…To be able to control the proxy's ability to re-encrypt the original ciphertext, Liang et al [18] constructed the conditional ABPRE from lattice firstly, which met the requirements of more fine-grained data sharing. However, the schemes of [17] and [18] only satisfied the nature of single-use. This limited the practicality of the scheme.…”

“…In this part, we compare our KPAB-VPRE with other relevant schemes [13,17,[28][29][30] in terms of the size of the ciphertext, access policy, multi-use, security model, and re-encryption verifiability. And Table 3 displays the comparison's findings.…”