One$-$way security in a public key encryption scheme means that, given a challenge ciphertext corresponding to a random message, no efficient adversary can successfully recover the entire plaintext. Explain, using a standard reduction $($proof by contradiction$),$ why any public key encryption scheme that is secure under the IND$-$CPA model must also be one$-$way secure$.$