A Novel Lattice-Based CP-ABPRE Scheme for Cloud Sharing
The ciphertext-policy attribute-based proxy re-encryption (CP-ABPRE) scheme supports access control and can transform a ciphertext under an access policy to a ciphertext under another access policy without decrypting the ciphertexts, which is flexible and efficient for cloud sharing. The existing CP...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-10-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/11/10/1262 |
| _version_ | 1811306194202001408 |
|---|---|
| author | Juyan Li Chunguang Ma Kejia Zhang |
| author_facet | Juyan Li Chunguang Ma Kejia Zhang |
| author_sort | Juyan Li |
| collection | DOAJ |
| description | The ciphertext-policy attribute-based proxy re-encryption (CP-ABPRE) scheme supports access control and can transform a ciphertext under an access policy to a ciphertext under another access policy without decrypting the ciphertexts, 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 future comes. This paper presents an efficient unidirectional single-hop CP-ABPRE scheme with small public parameters from a lattice. For the transformation between two access structures, they are required to be disjoint. This paper uses the trapdoor sampling technique to generate the decryption key and the re-encryption key in constructing the scheme, and uses the decompose vectors technique to produce the re-encrypted ciphertexts in order to control their noise. Finally, we extended the scheme to a unidirectional single-hop CP-ABPRE scheme with keyword search for searching the encrypted data. Both schemes were proved secure under the learning with errors assumption, which is widely believed to be secure in quantum computer attacks. To the best of our knowledge, our scheme is the first CP-ABPRE scheme based on the learning with errors assumption. |
| first_indexed | 2024-04-13T08:41:16Z |
| format | Article |
| id | doaj.art-81d96e6b0bca400592f71468dcdee37e |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-04-13T08:41:16Z |
| publishDate | 2019-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-81d96e6b0bca400592f71468dcdee37e2022-12-22T02:53:54ZengMDPI AGSymmetry2073-89942019-10-011110126210.3390/sym11101262sym11101262A Novel Lattice-Based CP-ABPRE Scheme for Cloud SharingJuyan Li0Chunguang Ma1Kejia Zhang2College of Data Science and Technology, Heilongjiang University, Harbin 150080, ChinaCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, ChinaCollege of Data Science and Technology, Heilongjiang University, Harbin 150080, ChinaThe ciphertext-policy attribute-based proxy re-encryption (CP-ABPRE) scheme supports access control and can transform a ciphertext under an access policy to a ciphertext under another access policy without decrypting the ciphertexts, 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 future comes. This paper presents an efficient unidirectional single-hop CP-ABPRE scheme with small public parameters from a lattice. For the transformation between two access structures, they are required to be disjoint. This paper uses the trapdoor sampling technique to generate the decryption key and the re-encryption key in constructing the scheme, and uses the decompose vectors technique to produce the re-encrypted ciphertexts in order to control their noise. Finally, we extended the scheme to a unidirectional single-hop CP-ABPRE scheme with keyword search for searching the encrypted data. Both schemes were proved secure under the learning with errors assumption, which is widely believed to be secure in quantum computer attacks. To the best of our knowledge, our scheme is the first CP-ABPRE scheme based on the learning with errors assumption.https://www.mdpi.com/2073-8994/11/10/1262lweproxy re-encryptionattribute-based encryptioncloud sharing |
| spellingShingle | Juyan Li Chunguang Ma Kejia Zhang A Novel Lattice-Based CP-ABPRE Scheme for Cloud Sharing Symmetry lwe proxy re-encryption attribute-based encryption cloud sharing |
| title | A Novel Lattice-Based CP-ABPRE Scheme for Cloud Sharing |
| title_full | A Novel Lattice-Based CP-ABPRE Scheme for Cloud Sharing |
| title_fullStr | A Novel Lattice-Based CP-ABPRE Scheme for Cloud Sharing |
| title_full_unstemmed | A Novel Lattice-Based CP-ABPRE Scheme for Cloud Sharing |
| title_short | A Novel Lattice-Based CP-ABPRE Scheme for Cloud Sharing |
| title_sort | novel lattice based cp abpre scheme for cloud sharing |
| topic | lwe proxy re-encryption attribute-based encryption cloud sharing |
| url | https://www.mdpi.com/2073-8994/11/10/1262 |
| work_keys_str_mv | AT juyanli anovellatticebasedcpabpreschemeforcloudsharing AT chunguangma anovellatticebasedcpabpreschemeforcloudsharing AT kejiazhang anovellatticebasedcpabpreschemeforcloudsharing AT juyanli novellatticebasedcpabpreschemeforcloudsharing AT chunguangma novellatticebasedcpabpreschemeforcloudsharing AT kejiazhang novellatticebasedcpabpreschemeforcloudsharing |