Integrity audit technology is proposed to protect data in remote cloud servers from being tampered with. However, the challenge is that the computational complexity is too large for users with resource-constrained devices during integrity verification. Also, many prior works lack support for dynamic operations. In this paper, a trusted third party is employed to complete the public auditing to reduce the computational complexity of users. Meanwhile, a trusted proxy server is employed to compute the tags under the delegation of the data owner. To improve the efficiency of data retrieval and support dynamic operations, a new authentication structure is proposed by combining Merkle Hash Tree and B* tree. Based on the new authentication structure, we propose a public integrity auditing scheme, which is secure against forge attacks under the assumptions of the discrete logarithm problem and the computational Diffie-Hellman problem in bilinear groups in the random oracle model. Security analysis and experiment results show that our scheme is provably secure and has low communication complexity and computational complexity.

提出了完整性审核技术，以保护远程云服务器中的数据不被篡改。然而，挑战在于完整性验证期间对于资源受限设备的用户而言，计算复杂性太大。而且，许多先前的工作缺乏对动态操作的支持。在本文中，使用受信任的第三方来完成公共审核，以降低用户的计算复杂性。同时，在数据所有者的委托下，使用受信任的代理服务器来计算标签。为了提高数据检索的效率并支持动态操作，提出了一种结合Merkle Hash树和B *树的新认证结构。在新的身份验证结构的基础上，我们提出了公共完整性审核方案，在离散对数问题和随机oracle模型中双线性组的计算Diffie-Hellman问题的假设下，它可以安全地防止伪造攻击。安全分析和实验结果表明，该方案具有良好的安全性，通信复杂度和计算复杂度均较低。