Polynomial configurations in difference sets

We prove a quantitative result on the existence of linearly independent polynomial configurations in the difference set of sparse subsets of the integers. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sárközy and then applying a simple lifting argument.