Let Π = (Gen,Enc,Dec) be a private-key encryption scheme that has indistinguishable en- cryptions in the presence of an eavesdropper. Which of the following encryption schemes are also necessarily secure against an eavesdropper? If you think a scheme is secure, sketch a proof, if not, provide a counterexample. Here, for a bit string s, parity(s) is 1 if the number of 1’s in s is odd, and 0 otherwise. The || symbol stands for concatenation. So, for strings if x = 00 and y = 11, x||y = 0011. (a) Enc1k(m) = 0||Enck(m) (b) Enc2k(m) = Enck(m)||parity(m) (c) Enc3k(m) = Enck(m)||Enck(m) (d) Enc4k(m) = Enck(m)||Enck(m + 1). Here think of m as an integer. Please type answer note write by hend.
Let Π = (Gen,Enc,Dec) be a private-key encryption scheme that has indistinguishable en- cryptions in the presence of an eavesdropper. Which of the following encryption schemes are also necessarily secure against an eavesdropper? If you think a scheme is secure, sketch a proof, if not, provide a counterexample.
Here, for a bit string s, parity(s) is 1 if the number of 1’s in s is odd, and 0 otherwise. The || symbol stands for concatenation. So, for strings if x = 00 and y = 11, x||y = 0011.
(a) Enc1k(m) = 0||Enck(m)
(b) Enc2k(m) = Enck(m)||parity(m)
(c) Enc3k(m) = Enck(m)||Enck(m)
(d) Enc4k(m) = Enck(m)||Enck(m + 1). Here think of m as an integer.
Please type answer note write by hend.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps