Improving the proof of "Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms"

PLoS One. 2019 Feb 25;14(2):e0212761. doi: 10.1371/journal.pone.0212761. eCollection 2019.

Abstract

Most recently, Kan Yang et al. proposed an attribute-keyword based encryption scheme for data publish-subscribe service(AKPS), which is highly useful for cloud storage scenario. Unfortunately, we discover that there is a flaw in the security proof of indistinguishability of the tag and trapdoor against chosen keyword attack under the Bilinear Diffie-Hellman (BDH) assumption. As the security proof is a key component for a cryptographic scheme, based on the Decisional Diffie-Hellman (DDH) assumption, we improve the security proof method and give a new security proof of the AKPS scheme for indistinguishability of the tag and trapdoor in our proposal, which is more rigorous than the original one. Furthermore, we also demonstrate that the AKPS scheme is secure against data Replayable Chosen Ciphertext Attack (RCCA).

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms*
  • Cloud Computing*
  • Computer Security
  • Confidentiality*
  • Information Storage and Retrieval*

Grants and funding

This research is supported by the National Natural Science Foundation of China (No. 61572019 http://www.nsfc.gov.cn), the Key Project of Research Foundation of Natural Science Foundation of Shaanxi Province of China (NO.2016JZ001. http://www.sninfo.gov.cn/).