Enumerative kernelization is a recent and promising area sitting at the intersection of parameterized complexity and enumeration algorithms. Its study began with the paper of Creignou et al. [Theory Comput. Syst., 2017], and development in the area has started to accelerate with the work of Golovach et al. [J. Comput. Syst. Sci., 2022]. The latter introduced polynomial-delay enumeration kernels and applied them in the study of structural parameterizations of the \textsc{Matching Cut} problem and some variants. Few other results, mostly on \textsc{Longest Path} and some generalizations of \textsc{Matching Cut}, have also been developed. However, little success has been seen in enumeration versions of \textsc{Vertex Cover} and \textsc{Feedback Vertex Set}, some of the most studied problems in kernelization. In this paper, we address this shortcoming. Our first result is a polynomial-delay enumeration kernel with $2k$ vertices for \textsc{Enum Vertex Cover}, where we wish to list all solutions with at most $k$ vertices. This is obtained by developing a non-trivial lifting algorithm for the classical crown decomposition reduction rule, and directly improves upon the kernel with $\mathcal{O}(k^2)$ vertices derived from the work of Creignou et al. Our other result is a polynomial-delay enumeration kernel with $\mathcal{O}(k^3)$ vertices and edges for \textsc{Enum Feedback Vertex Set}; the proof is inspired by some ideas of Thomassé [TALG, 2010], but with a weaker bound on the kernel size due to difficulties in applying the $q$-expansion technique.