In　the　realm　of　secure　data　outsourcing,　verifiable　dynamic　searchable　symmetric　encryption　(VDSSE)　enables　a　client　to　verify　search　results　obtained　from　an　untrusted　server　while　protecting　the　data　privacy.　Nevertheless,　the　storage　cost　of　verification　structure　in　some　schemes　escalates　linearly　with　the　number　of　keywords,　and　the　generation　of　proofs　demands　a　substantial　number　of　exponentiation　operations.　Moreover,　some　schemes　overlook　forward　and　backward　security　in　the　dynamic　database.　In　this　article,　we　introduce　FB-VDSSE,　an　advanced　VDSSE　scheme　that　ensures　both　forward　and　backward　security.　Specifically,　we　introduce　an　efficient　accumulation　commitment　verification　structure　(AC-VS)　that　attains　a　commitment　verification　value　with　a　constant-size　storage　cost.　Based　on　the　AC-VS,　we　further　propose　a　forward　and　backward　secure　VDSSE　scheme.　Within　this　scheme,　the　server　exclusively　generates　a　membership　proof　at　the　corresponding　index　of　the　vector,　reducing　the　computation　cost　associated　with　the　search　operation.　Finally,　we　provide　the　security　proof　and　functional　comparison,　demonstrating　that　our　scheme　effectively　ensures　forward　security,　backward　security,　and　verifiability.　Additionally,　the　experimental　evaluations　underscore　the　efficiency　of　our　scheme,　showcasing　its　superior　performance　compared　to　relevant　schemes　in　practical　scenarios.　©　2014　IEEE.