Dynamic Multi-User Authorization in Ciphertext Retrieval With Proxy Re-Encryption
Ciphertext retrieval technology has been widely explored with the increasing popularity of cloud computing. Proxy re-encryption with Keyword search (PREKS) can support multi-user retrieval without increasing data owner's overhead, but users can continue searching once they have obtained search rights. It is difficult for a data owner to revoke a user's access rights because the data is stored in the cloud. In general, under the premise of forward and backward security, the user's search permission can be revoked by updating the ciphertext. Nevertheless, this approach may expose user or data privacy to cloud servers. In this paper, we utilize the Chinese Remainder Theorem to generate DO-Authorization and DU-Authentication factors, and realizes the authorization and revocation of a specific single user by adding or deleting authorization items. In addition, we use a designated tester algorithm in the ciphertext retrieval process to improve system security. Subsequent security analysis proves that the proposed scheme can resist the Chosen Keyword Attack and Keyword Guessing Attack. Simulation results indicate that the proposed scheme has high efficiency, especially in the user revocation phase
Authors
- Hui Li (ORCID: https://orcid.org/0000-0001-8310-7169)
- Kai Fan (ORCID: https://orcid.org/0000-0001-6870-6657)
- Kan Yang (ORCID: https://orcid.org/0000-0003-4234-9596)
- Yintang Yang (ORCID: https://orcid.org/0000-0001-9745-5404)
- Nan Gao (ORCID: https://orcid.org/0000-0001-5129-5118)
- Haoyang Wang (ORCID: https://orcid.org/0000-0002-6663-0692)
Institutions
- Xidian University (CN)
- University of Memphis (US)
Publication Details
- Journal
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2025-06-06
- DOI
- https://doi.org/10.1109/tdsc.2025.3577208
- Citations
- 1
- Primary Topic
- Cryptography and Data Security
- Type
- article
- Field-Weighted Citation Impact
- 2.48