Abstract: DSSE (dynamic searchable symmetric encryption), which has forward/backward privacy and high search efficiency, supports addition and deletion of encrypted index. Relevant research has been a hot spot and many new schemes have been constructed in recent years, such as Aura. Aiming at the problems of high ciphertext storage overhead and mistaken deletion in Aura scheme, a more strict correctness definition of SRE (symmetric revokable encryption) primitive is given, and the condition of mistaken deletion is analyzed theoretically. In addition, an insertion position selection algorithm is designed to avoid node reuse due to Hash collision. On this basis, a searchable symmetric encryption scheme based on SRE is constructed by adding a deletion list and using a t-puncturable pseudorandom function. Puncturing all unused nodes at one time, the scheme not only effectively reduces the computing overhead on the cloud server during search phase, but also avoids revealing unused keys and gains better security. Finally, the scheme is analyzed in terms of search efficiency, storage overhead, communication overhead and security. Theoretical analysis and experimental results show that the scheme can effectively reduce the space overhead of ciphertext storage on the server, avoid the mistaken deletion, and improve the search efficiency on large-scale nodes.