A verifiable dictionary-based searchable encryption scheme is proposed for verifying the completeness of search results. The security of the proposed scheme is analyzed under the security model of adaptive indistinguishability. Compared with the existing schemes, the proposed scheme has advantages in the following aspects:the size of trapdoor is constant, the updating doesn't require recalculation, and especially the search result is verifiable.