Zhong et al. formulated the problem of disclosing credentials (associated with privacy) for building trust in an open environment like Internet. Thus, one form of privacy-trust problem is formulated in [17]. In [17], an entropy measure is defined to quantify privacy loss. In this research paper, by a proper formulation (modelling), the privacy-trust tradeoff is attacked from the Information Theoretic view point. It is shown that as long as privacy loss (or more accurately a measure related to privacy loss) is below a limit, through the use of properly coded credentials, it is possible to achieve arbitrarily good trust. The approach presented here will lead to several practical schemes in trading privacy for trust.