Let $G$ be a graph of order $n$ with an edge-coloring $c$, and let $δ^c(G)$ denote the minimum color degree of $G$. A subgraph $F$ of $G$ is called rainbow if all edges of $F$ have pairwise distinct colors. There have been a lot results on rainbow cycles of edge-colored graphs. In this paper, we show that (i) if $δ^c(G)>\frac{3n-3}{4}$, then every vertex of $G$ is contained in a rainbow triangle; (ii) $δ^c(G)>\frac{3n}{4}$, then every vertex of $G$ is contained in a rainbow $C_4$; and (iii) if $G$ is complete, $n\geq 8k-18$ and $δ^c(G)>\frac{n-1}{2}+k$, then $G$ contains a rainbow cycle of length at least $k$. Some gaps in previous publications are also found and corrected.