Verifiable attribute-based keyword search (VABKS) facilitates search queries and achieves fine-grained access control over encrypted data in cloud storage while ensuring the integrity of search results for data users. However, it still suffers from several issues in practice. First, VABKS is based on attribute-based encryption (ABE). It therefore inherits the shortcomings of ABE, such as a key escrow and one single point of failure. Second, most VABKS ignore the interest of cloud service providers since the data user deliberately can claim that he obtained a wrong or fake result without paying. Third, misbehaving data users and cloud service providers do not get any punishment. Both of them are still available and enjoy/provide the query service. To address these issues, we propose a novel primitive called revocable registered attribute-based keyword search supporting fairness, which is an enhanced VABKS. It not only ensures fairness between the data user and cloud service provider but also provides the ability to revoke the query capability of malicious participants. Extensive experiment results demonstrate that our proposed scheme is effective and enjoys superior functionalities.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Revocable Registered Attribute-Based Keyword Search Supporting Fairness

  • Zongmin Wang,
  • Qiang Wang,
  • Fucai Zhou,
  • Jian Xu

摘要

Verifiable attribute-based keyword search (VABKS) facilitates search queries and achieves fine-grained access control over encrypted data in cloud storage while ensuring the integrity of search results for data users. However, it still suffers from several issues in practice. First, VABKS is based on attribute-based encryption (ABE). It therefore inherits the shortcomings of ABE, such as a key escrow and one single point of failure. Second, most VABKS ignore the interest of cloud service providers since the data user deliberately can claim that he obtained a wrong or fake result without paying. Third, misbehaving data users and cloud service providers do not get any punishment. Both of them are still available and enjoy/provide the query service. To address these issues, we propose a novel primitive called revocable registered attribute-based keyword search supporting fairness, which is an enhanced VABKS. It not only ensures fairness between the data user and cloud service provider but also provides the ability to revoke the query capability of malicious participants. Extensive experiment results demonstrate that our proposed scheme is effective and enjoys superior functionalities.