The use of the well known provably secure public-key cryptoscheme by Rabin is extended for the case of the deniable encryption. In the proposed new sender-deniable encryption scheme the cryptogram is computed as coeficients of the quadratic congruence, roots of which are two simultaneously encrypted texts. One of the texts is a fake message and the other one is the ciphertext produced by the public-key encryption of the secret message. The proposed deniable encryption method produces the ciphertext that is computationally indistinguishable from the ciphertext produced by some probabilistic public-key encryption algorithm applied to the fake message.