This paper addresses the problem of implementing socially efficient allocations in dynamic environments with interdependent valuations and evolving private information. In the case where the agents' information is correlated across time, we construct efficient and incentive compatible dynamic mechanisms. Unlike the mechanisms with history-independent transfers in the existing literature, these mechanisms feature history-dependent transfers. Moreover, they are reminiscent of the classical VCG mechanism, even though the latter is not incentive compatible with interdependent valuations. In settings where agents' private information evolves independently, we construct the dynamic counterpart of the generalized VCG mechanism in one-dimensional environments. We also provide sufficient conditions for implementability, which are generalizations of the single-crossing conditions in static problems.