Abstract: Searchable symmetric encryption (SSE) has been widely concerned because of its high search efficiency. Supporting conjunctive queries can effectively improve the usability of the scheme. However, most of the existing schemes with supporting conjunctive queries just work on static databases, which do not support dynamic updates of encrypted database, such as add or delete operation. Combined with the definition of symmetric hidden vectors encryption (SHVE), a new definition, called dynamic symmetric hidden vectors encryption (DSHVE), is proposed. On the basis of this definition, a DSHVE scheme supporting update operations is constructed. At the same time, by designing oblivious dynamic cross-tags and critical data access structures based on blinded exponentiations, a dynamic searchable symmetrical encryption scheme with supporting conjunctive queries is constructed. Then details about our proposal are introduced and a formal analysis of its security is presented. Theoretic analysis and experimental results show that, without significantly increasing the storage and computing costs, only documents identifications that match the query are revealed, which avoiding revealing more result patterns. In addition, by a single round of communication for conjunctive queries, the proposed scheme has lower communication overhead and higher search efficiency.