Secure source coding provides the methods to compress data efficiently taking the risks of unauthorized access into account. However standard information-Theoretic achievability proofs only show the existence of a coding scheme without providing a concrete code design. In the paper we provide an alternative proof of achievability for the secure Wyner-Ziv source coding problem with side information at the eavesdropper using polar coding. Due to the recent algorithmic advances in the design of polar codes, our result is highly relevant for future big data applications since it provides the basis for further developments.