Deniable authentication protocol is a new cryptographic authentication protocol that enables a specified receiver to identify the source of a given message, but not prove the identity of the sender to a third party. In recent years, many deniable authentication protocols have been proposed. However, most of these proposed schemes are interactive and less efficient. To our knowledge, only Shao has proposed an efficient non-interactive deniable authentication protocol based on generalized ElGamal signature scheme. Therefore, in this paper, we would like to propose another non-interactive deniable authentication protocol based on factoring. What's more, we also prove it is secure in the random oracle model.