Work

Fog-Popularity-Based Encrypted Data Search With Constant Complexity in Multiuser Setting

Year: 2026
Type: article
Abstract: Cross-regional data sharing scenarios are common in cloud-fog architectures for their low latency, with a large number of connected devices generating mass data. Encrypted data retrieval is necessary for privacy but brings challenges. Public key authenticated encryption with keyword search (PAEKS) is an advanced and promising cryptographic technology that enables retrieval of encrypted data against keyword guessing attacks (KGAs). However, traditional PAEKS schemes suffer from the problem that the complexity of cryptographic computation is proportional to the number of users in a multiuser environment, leading to significant redundancy in computation and communication overhead. In this article, we consider the fog architecture to share cross-regional encrypted data, avoiding KGA in a multiuser environment. Therefore, we propose fog-popularity-based public key authentication with keyword search (FP-PAEKS) to result in an efficient and secure data retrieval scheme, in which the constant ciphertexts and trapdoors are achieved although the size linear growth. Technically, we define high and low prevalence during ciphertext generation to categorize the data such that different encryption strategies and storage locations are employed according to data prevalence. Therefore, our proposal adapts to complex network architectures. The experimental results show that our scheme achieves a lower test execution cost due to the popularity classification equipment during matching operations.
Language: English
Open Access status: hybrid
Estimated APC paid: $2,645
OpenAlex ID: W7204143095
FWCI:
Cites: 27
Cited by:
Related to: 10