What is the ideal system for an encryption scheme? For a pseudorandom permutation the ideal one is a random permutation, for a pseudorandom function the ideal one is a random function. For an encryption scheme do we have a well known application describing an ideal system for an encryption? Maybe the one-time pad?
$\begingroup$
$\endgroup$
5
-
$\begingroup$ An OTP is a good example. Take a look at this answer, particularly the definition it contains $\endgroup$– rathJul 5, 2013 at 14:26
-
$\begingroup$ possible duplicate of definition and meaning of semantic security $\endgroup$– rathJul 5, 2013 at 14:28
-
1$\begingroup$ If you are concerned about idealization of crypto protocols (of which encryption is a special case), you could look up references about the Universal Composability framework (UC framework). $\endgroup$– minarJul 6, 2013 at 8:16
-
$\begingroup$ Thank you user7423, which references I should look ? $\endgroup$– Dingo13Jul 6, 2013 at 8:29
-
$\begingroup$ You could start with Canetti's paper: eprint.iacr.org/2000/067 $\endgroup$– minarJul 7, 2013 at 5:47
Add a comment
|