School of Science, Xi'an University of Technology, Xi'an, Shaanxi, China.
School of Computer Science and Engineering, Xi'an University of Technology, Xi'an, Shaanxi, China.
PLoS One. 2019 Feb 25;14(2):e0212761. doi: 10.1371/journal.pone.0212761. eCollection 2019.
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).
最近，Kan Yang 等人提出了一种基于属性-关键字的加密方案用于数据发布-订阅服务（AKPS），这在云存储场景中非常有用。不幸的是，我们发现，在双线性 Diffie-Hellman（BDH）假设下，标签和陷门的不可区分性的安全证明存在缺陷。由于安全证明是密码方案的关键组成部分，因此，基于判定 Diffie-Hellman（DDH）假设，我们改进了安全证明方法，并为我们的提议中的 AKPS 方案提供了标签和陷门的不可区分性的新的安全证明，这比原始证明更加严格。此外，我们还证明了 AKPS 方案可以抵御数据可重放选择密文攻击（RCCA）。
