In this work, we investigate a private information retrieval (PIR) problem for secure distributed storage systems in the presence of an eavesdropper. We jointly design the secure distributed database and the corresponding PIR scheme, which protect not only user privacy (concealing the index of the desired message) from the databases, but also data security (concealing the message itself) from an eavesdropper. We consider two different assumptions on the availability of a set of indices of the data stored in other databases. In our proposed scheme, we use a secret sharing scheme in storing the messages for data security at each of the databases. The key idea in designing an efficient PIR procedure is to exploit the secret shares of undesired messages as a side information by means of storing the secret shares at multiple databases. In particular, it is shown that the rates of the proposed PIR schemes are within a constant multiplicative factor from the derived upper-bound on the capacity of the PIR problem.