Dynamic searchable encryption has attracted wide attention due to its ability to add， delete， and search data on cloud servers. The existing dynamic searchable encryption schemes are usually constructed using highly secure cryptographic primitives， and multiple bilinear pairing operations need to be performed during scheme searching. In view of the large computational overhead of dynamic searchable encryption schemes when searching on servers， a Puncturable PseudoRandom Function （PPRF） was introduced into dynamic searchable encryption， and a dynamic searchable encryption scheme based on PPRF was designed and proposed. In this scheme， file identifiers did not need to be encrypted using symmetric encryption algorithms， and it is also not necessary to decrypt ciphertext to obtain file identifiers during server searches， and the client and the server were able to complete data search with only one interaction. At the same time， in the scheme， the key was marked when deleting keywords， the marked key was used to calculate the PPRF during search， and backward security was implemented with a forward-secure scheme， thereby ensuring security while improving search efficiency. According to security model of the dynamic searchable encryption scheme， the security of the scheme was verified. Simulation results show that compared with ROSE （RObust Searchable Encryption） scheme built on Key-Updatable Pseudorandom Function （KUPRF）， Janus++ scheme built on Symmetric Puncturable Encryption （SPE）， and Aura scheme built on Symmetric Revocable Encryption （SRE）， the proposed scheme has the average search time of each keyword reduced by 17%， 65%， and 58%， respectively. It can be seen that the proposed scheme is effective and feasible， and reduces the search cost of the server effectively， improves the search efficiency of the scheme， and increases the practicality of the scheme.