Blakley proposed a method to share a secret among a number of participants in 1979. His method uses the fact that a point (secret) in k-dimensional space is the intersection point of k hyperplanes. The secret is revealed if any k of the n hyperplane equations is known. Any number of hyperplanes less than k is not sufficient to reveal the secret. This method is also called (k, n) threshold secret sharing scheme in the literature. Researchers use secret sharing schemes to transmit a secret image over insecure networks recently. In 2008, Tso used Blakley's concept to transmit military information over an insecure network. However, his method cannot reconstruct distortion free secret image due to quantization errors caused by sharing. His results emphasize that reconstructed secret images have approximately 45 dB PSNR. Some applications such as military or medical imaging do not tolerate distortion at all. A secret image sharing method based on Blakley's geometric approach is proposed in this article. The method can reconstruct secret images by encoding not only secret but also quantization errors encountered during sharing making a distortion free reconstruction of the secret possible unlike Tso's work. Experimental results indicate that the proposed method is distortion free considering the PSNR of the secret images. (C) 2010 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of the Guest Editor.