0
$\begingroup$

Let $F$ be a strong pseudo random permutation and define a fixed-length encryption scheme $(\operatorname{Enc,Dec})$ as follows:

On input $m \in \{0,1\}^{\frac{n}{2}}$ and key $k\in \{0,1\}^{n}$, algorithm $\operatorname{Enc}$ chooses a uniform string $r \in \{0,1\}^{\frac{n}{2}}$ of length $r/2$ and computes $c:=\operatorname{F}(k,r\mathbin\|m)$. Prove that this scheme is $\text{CCA}$-secure.

How can I show that strong Pseudorandom permutation implies $\text{CCA}$ security? I don't know how to do the reduction.

Improve this question
$\endgroup$
4

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.