Data　outsourcing　has　become　more　and　more　popular　due　to　its　low　cost　and　flexibility.　However,　there　is　a　problem　that　the　cloud　server　used　to　store　data　is　partially　trusted.　Searchable　encryption　is　an　efficient　technology　that　is　devoted　to　helping　people　conduct　accurate　searches　without　leaking　information.　Nonetheless,　most　existing　schemes　cannot　support　dynamic　updates　or　meet　the　privacy　requirements　of　all　users.　There　have　been　some　experiments　to　solve　these　issues　by　implementing　a　dynamically　searchable　asymmetric　encryption　scheme.　This　paper　proposes　an　efficient　searchable　encryption　scheme　based　on　the　Authenticator　Bloom　Filter　(ABF).　The　solution　can　support　dynamic　updates　and　multiple　users　and　meet　forward　and　backward　security.　This　paper　uses　an　ABF　to　improve　the　efficiency　of　searches　and　updates　while　playing　a　significant　role　in　dynamic　updates.　This　paper　designs　a　new　token　encryption　scheme　and　file　set　encryption　scheme,　which　not　only　helps　users　reduce　time　in　searches　and　updates　but　also　supports　multi-user　modes.　Experiments　show　that　the　proposed　scheme　takes　less　time　in　searching　and　updating　algorithms,　especially　when　the　keyword　does　not　exist.　The　solution　also　takes　into　account　the　problem　of　history　storage　when　updating,　which　reduces　the　unnecessary　consumption　of　memory　and　avoids　multiple　storage　states　for　the　same　file.