Hiding a secret is needed in many situations. One might need to hide a password, an encryption key, a secret recipe and etc. Information can be secured with encryption, but the need to secure the secret key used for such encryption is also important. Imagine you encrypt your important files with are secret key and if such a key is lost, then all the important files will be inaccessible. Thus, secure and efficient key management mechanisms are required. One of them is secret sharing scheme that lets you split your secret into several parts and distribute them among selected parties. The secret can be recovered once these parties collaborate in some way. In this paper we propose a new approach to construct Blakley's scheme by using the finite fields.