EUVIMEDEUVIMED entdecken
Crossref

Toward Authenticated Encrypted Search With Constant Trapdoor for Mobile Cloud Systems

Gang Xu, Xinyu Fan, Shiyuan Xu, Yibo Cao, Kejia Zhang, Jiawen Kang, Dusit Niyato

IEEE Transactions on Mobile Computing · 2026-04 · 25 (4) · 4890-4903

DOI: 10.1109/tmc.2025.3627241 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Mobile Computing, 2026-04. Verfasst von Gang Xu und 6 weiteren Autor:innen. Die Arbeit wurde bisher 28-mal zitiert (Crossref) und nennt 53 Literaturangaben. Gefördert von: NSFC, Open Foundation of State Key Laboratory of Networking and Switching Technology.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Mobile cloud computing has become widely adopted for its convenience in data storage and sharing, but it also introduces challenges related to data privacy and security. To address these issues, public key authenticated encryption with keyword search (PAEKS) has emerged as a potential solution that ensures data privacy while resisting internal keyword guessing attacks (IKGAs). Unfortunately, most existing PAEKS schemes have limited adaptability to multi-user scenarios. Specifically, in PAEKS, ciphertext generation requires the participation of users’ secret keys, which results in ciphertexts being unique, even when the same keywords are encrypted by different users. Consequently, the number of trapdoors used to match the ciphertexts grows linearly with the amount of senders. Designing an efficient PAEKS scheme for multiple users remains an open challenge. In this paper, we propose CT-PAEKS, a lattice-based PAEKS scheme with constant trapdoor for data privacy-preserving in mobile cloud computing. CT-PAEKS introduces an additional administrator, enabling the receiver to generate a unified search trapdoor for ciphertexts from multiple senders. Additionally, it allows multiple senders to generate a single ciphertext for the same keyword encryption, thus avoiding ciphertext duplication. Furthermore, CT-PAEKS supports fast search during ciphertext matching, allowing all corresponding ciphertexts to be identified with a single match. We also formalize and prove the security of CT-PAEKS in the random oracle model. Comprehensive performance evaluations indicate that our scheme outperforms prior arts, achieving the 1.7 × −2.7× and 2.0×−4.4× reduction in terms of computational and communication overhead, respectively.

Förderung

  • NSFC
  • Open Foundation of State Key Laboratory of Networking and Switching Technology

Zitieren

APA

Xu, G., Fan, X., Xu, S., Cao, Y., Zhang, K., Kang, J., & Niyato, D. (2026). Toward Authenticated Encrypted Search With Constant Trapdoor for Mobile Cloud Systems. IEEE Transactions on Mobile Computing, 25(4), 4890-4903. https://doi.org/10.1109/tmc.2025.3627241

Vancouver

Xu G, Fan X, Xu S, Cao Y, Zhang K, Kang J, et al. Toward Authenticated Encrypted Search With Constant Trapdoor for Mobile Cloud Systems. IEEE Transactions on Mobile Computing. 2026;25(4):4890-4903. doi:10.1109/tmc.2025.3627241

BibTeX
@article{Xu2026,
  author = {Xu, Gang and Fan, Xinyu and Xu, Shiyuan and Cao, Yibo and Zhang, Kejia and Kang, Jiawen and Niyato, Dusit},
  title = {Toward Authenticated Encrypted Search With Constant Trapdoor for Mobile Cloud Systems},
  journal = {IEEE Transactions on Mobile Computing},
  year = {2026},
  volume = {25},
  number = {4},
  pages = {4890--4903},
  doi = {10.1109/tmc.2025.3627241}
}
Kostenlos starten →