Cloud-aided　scalable　revocable　identity-based　encryption　with　ciphertext　update　(CA-RIBE-CU),　introduced　by　Wang　et　al.　in　2017　and　revocable　identity-based　encryption　with　server-aided　ciphertext　evolution　(RIBE-CE),　proposed　by　Sun　et　al.　in　2020,　both　offer　significant　advantages　over　previous　identity　revocation　mechanisms　when　considering　the　scenario　of　a　secure　data　sharing　in　the　cloud　setting.　In　these　two　primitives,　the　user　(i.e.,　receiver)　can　utilize　the　short-term　decryption　keys　to　decrypt　all　encrypted　data　(i.e.,　ciphertexts)　sent　to　him　or　her,　meanwhile,　the　ciphertexts　stored　in　the　cloud　will　update　to　new　ones　with　the　aided　of　the　cloud　service　provider　(CSP)　and　without　any　interaction　with　data　owners,　and　the　old　ones　are　completely　deleted,　and　thus,　the　revoked　users　cannot　access　to　both　the　previously　and　subsequently　shared　data,　i.e.,　to　achieve　both　identity　revocation　and　ciphertext　update　simultaneously　for　IBE.　In　this　paper,　inspired　by　Wang　et　al.’s　work　and　the　current　first　constructions　of　lattice-based　RIBE-CE　by　Zhang　et　al.　in　Inscrypt　2021,　we　propose　the　first　lattice-based　CA-RIBE-CU　scheme.　Our　scheme　is　more　efficient　and　secure　than　existing　constructions　of　lattice-based　RIBE.　At　the　heart　of　our　new　design　are　two　tools　called　＇hybrid　ciphertexts＇　and　＇hybrid　short-term　decryption　keys＇　that　enables　constant　ciphertexts　and　simplified　ciphertexts　update,　not　linear　in　the　length　of　identities　and　without　burdensome　double　encryption　mechanism,　which　serves　as　one　startlingly　solution　to　the　challenges　proposed　by　Zhang　et　al.,　and　based　on　the　hardness　of　learning　with　errors　(LWE)　problem,　we　prove　that　our　scheme　is　selectively　secure　in　the　standard　model.　©　2022,　Springer　Nature　Singapore　Pte　Ltd.