Problem $1$: On leaking, or hiding, the message length

Consider encryption scheme Gen, Enc, Dec$)$ that is EAV$-$secure w$.$r$.$t$.$ the definition in Figure $1.$

Figure $1$: Indistinguishability of encryptions in the presence of an eavesdropper.

$(3)$ Show that EAV$2-$security can be achieved by encryption schemes defined over messages up to

a given maximum length, i$.$e$.,$ by schemes ${}^{\text{'}}$ such that for kin$\{0,1{\}}^n,$ algorithm Enc ${?}_k^{\text{'}}$ is defined

over message space $M^{\text{'}}=\{m$:$|m|l\},$ where $ll(n)$ for some given polynomial $l(*).$

Hint: Construct a scheme ${}^{\text{'}}=(Ge{n}^{\text{'}},En{c}^{\text{'}},De{c}^{\text{'}})$ that encrypts messages in $M^{\text{'}}$ by

employing a EAV$-$secure scheme Gen, Enc, Dec$)$ with message space $M.$ Consider

an algorithm Enc ${?}^{\text{'}}$ that on input message $m^{\text{'}}in{M}^{\text{'}},$ merely applies Enc on a unique

and inversible encoding $m=E(m^{\text{'}})inM$ of $m^{\text{'}}$ in a way that "compensates" for the

absence of the restriction $|m_0|=|m_1|$ in game $Priv{K}^{-\text{E}\text{A}\text{V}}{2}_{A,{}^{\text{'}}}(n).$ Then, prove that ${}^{\text{'}}$

is EAV$2-$secure via a proof by reduction.