Verifiable Data Search with Fine-Grained Authorization in Edge Computing

In the research of searchable encryption, fine-grained data authorization is a convenient way to manage search rights for users. Recently, Liu et al. proposed scheme with verification, which can control and verify results. this paper, we first present forgery attack against al.’s then propose novel verifiable in edge environment. Based on key aggregate mechanism Merkle hash tree, our not only achieves file-oriented permission management but also implements correctness completeness verification addition, assistance server, resource-constrained users easily perform tasks verification. Finally, prove secure based decision l -bilinear Diffie–Hellman exponent problem. The performance analysis experiment results demonstrate that has lower computation, communication, storage costs contrast existing schemes.