Revocable　identity-based　encryption　(RIBE)　with　server-aided　ciphertext　evolution　(RIBE-CE),　recently　proposed　by　Sun　et　al.　at　TCS　2020,　offers　significant　advantages　over　previous　identity　(or　key)　revocation　mechanisms　when　considering　the　scenario　of　a　secure　data　sharing　in　the　cloud　setting.　In　this　new　system　model,　the　user　(i.e.,　a　recipient)　can　utilize　the　current　short-term　decryption　key　to　decrypt　all　ciphertexts　sent　to　him,　meanwhile,　the　ciphertexts　in　the　cloud　evolve　to　new　ones　with　the　aided　of　the　cloud　server　and　the　old　ones　are　completely　deleted,　and　thus,　the　revoked　users　cannot　access　to　both　the　previously　and　subsequently　shared　data.　In　this　paper,　inspired　by　Sun　et　al.’s　work,　we　propose　the　first　lattice-based　RIBE-CE.　Our　scheme　is　more　efficient　and　secure　than　the　existing　constructions　of　lattice-based　RIBE.　Simultaneously,　the　private　key　generator　(PKG)　maintains　a　binary　tree　(BT)　to　handle　key　revocation　only　with　a　logarithmic　complexity　workload　in　time　key　update,　not　growing　linearly　in　the　numbers　of　system　users　N,　which　serves　as　one　solution　to　the　challenge　proposed　by　Sun　et　al.　and　based　on　the　hardness　of　the　learning　with　errors　(LWE)　problem,　we　prove　that　our　first　scheme　is　selectively　secure　in　the　standard　model.　Subsequently,　based　on　the　main　techniques　for　lattice　basis　delegation　with　hierarchical　IBE　(HIBE),　we　construct　our　second　lattice-based　RIBE-CE　scheme　with　decryption　key　exposure　resistance　(DKER),　a　default　security　requirement　for　RIBE,　which　has　not　been　considered　by　Sun　et　al.　©　2021,　Springer　Nature　Switzerland　AG.