Department of Information Security, Military College of Signals (MCS), NUST, Islamabad, Pakistan.
Department of Computer Science, Shaheed Benazir Bhutto University Sheringal, Sheringal, Dir(U), Pakistan.
PLoS One. 2024 Oct 29;19(10):e0268803. doi: 10.1371/journal.pone.0268803. eCollection 2024.
Cloud computing liberates enterprises and organizations from expensive data centers and complex IT infrastructures by offering the on-demand availability of vast storage and computing power over the internet. Among the many service models in practice, the public cloud for its operation cost saving, flexibility, and better customer support popularity in individuals and organizations. Nonetheless, this shift in the trusted domain from the concerned users to the third-party service providers pops up many privacy and security concerns. These concerns hindrance the wide adaptation for many of its potential applications. Furthermore, classical encryption techniques render the encrypted data useless for many of its valuable operations. The combined concept of attribute-based encryption (ABE) and searchable encryption (SE), commonly known as attribute-based keyword searching (ABKS), emerges as a promising technology for these concerns. However, most of the contemporary ABE-based keyword searching schemes incorporate costly pairing and computationally heavy secret sharing mechanisms for its realization. Our proposed scheme avoids the expensive bilinear pairing operation during the searching operation and costly Lagrange interpolation for secret reconstruction. Besides, our proposed scheme enables the updation of access control policy without entirely re-encrypting the ciphertext. The security of our scheme in the selective-set model is proved under the Decisional Bilinear Diffie-Hellmen (DBDH) assumption and collision-free. Finally, the experimental results and performance evaluation demonstrate its communication and overall efficiency.
云计算通过互联网提供了大规模存储和计算能力的按需可用性，使企业和组织摆脱了昂贵的数据中心和复杂的 IT 基础架构。在实际应用的众多服务模型中，公有云因其运营成本节约、灵活性和更好的客户支持而在个人和组织中广受欢迎。然而，这种信任域从相关用户向第三方服务提供商的转移引发了许多隐私和安全问题。这些问题阻碍了其许多潜在应用的广泛采用。此外，经典的加密技术使得加密数据对于许多有价值的操作变得毫无用处。基于属性的加密 (ABE) 和可搜索加密 (SE) 的组合概念，通常称为基于属性的关键字搜索 (ABKS)，作为解决这些问题的有前途的技术出现了。然而，大多数基于当代 ABE 的关键字搜索方案都包含昂贵的配对运算和计算密集型秘密共享机制来实现这一点。我们提出的方案在搜索操作期间避免了昂贵的双线性对运算，并且在秘密重构时避免了昂贵的 Lagrange 插值运算。此外，我们提出的方案还允许在不重新完全加密密文的情况下更新访问控制策略。我们的方案在选择性集模型下的安全性是在判定双线性 Diffie-Hellman (DBDH) 假设和无冲突下证明的。最后，实验结果和性能评估证明了其通信和整体效率。
