Are there polynomial time reductions where the corresponding witnesses can't be translated in polynomial time?
The proof of the Cook-Levin theorem shows that any problem in NP can be reduced to SAT in such a way that witnesses to the original problem can be converted efficiently to satisfying assignments of the resulting SAT instance. The proof of the NP-completeness of 3-colorability goes via a series of reductions, each of which also has this property.