Secret　sharing　schemes　are　used　as　a　tool　in　many　cryptographic　protocols　including　revocable　electronic　cash,　electronic　voting,　cloud　computing　and　key　management　in　sensor　networks.　But　the　existing　post-quantum　secret　sharing　schemes　are　all　based　on　Shamir＇s　(t,　n)　threshold　scheme,　there　is　currently　no　post-quantum　secret　sharing　scheme　based　on　the　Chinese　Remainder　Theorem　(CRT),　so　we　construct　a　verifiable　lattice-based　secret　sharing　scheme　using　some　number　theory　methods　and　interaction　methods.　Furthermore,　we　prove　our　scheme　is　safe　in　the　post-quantum　era.　Finally,　we　compare　our　scheme　with　other　schemes.　And　the　comparison　shows　that　our　scheme　is　more　efficient　and　occupies　less　memory.