(E,D) is a CPA-secure cipher defined over (K,M,C).H: C → T is collision resistant hash functions.
E(k,m):=E(k,m), H(c)), D=(k,c1,c2):=D(k,c1) if H(c1)==C2 otherwise Reject.
ps:the question is from the book <A Graduate Course in Applied Cryptography[Boneh]> exercise 9.2 can use cpa and cca to proof