Let 1 = (Enc1, Dec1) and 2 = (Enc2, Dec2) be two encryption schemes for which it is known that at least one is CPA-secure (but you dont know which one). Show how to construct an encryption scheme that is guaranteed to be CPA-secure as long as at least one of 1 or 2 is CPA-secure.

********PROVIDE A FULL PROOF OF YOUR SOLUTION********

Hint: Generate two plaintext messages from the original plaintext so that knowledge of either one reveals nothing about the original plaintext, but knowledge of both enables the original plaintext to be computed.

Introduction to Modern Cryptography