In: Computer Science
Topic: Encrypt-then-authenticate scheme, Cryptography
Let ΠE = (GenE, EncE, DecE) be an encryption scheme and ΠM = (GenM, MacM, VrfyM) be a MAC scheme.
(b) Prove that Π is unforgeable for any encryption scheme ΠE (even if not CPA-secure) and any secure MAC scheme ΠM (even if not strongly secure).
SOLUTION-
(b) If ENC is a
symmetric encryption scheme secure in the sense
of IND-CPA and MAC is a secure MAC family then method EtA(ENC,
MAC)
implements secure channels.
The function snd represents the
operations and transformations applied
to a message by its sender in order to protect it from adversarial
action over
the communication links. Namely, when a message m is to be
transmitted from
party P to party Q under a session s established between these
parties, the
function snd is applied to m and, possibly, to additional
information such as a
message identifier. The definition of snd typically consists of the
application of
some combination of a MAC and symmetric encryption keyed via the
session
key. The function rcv describes the action at the receiving end for
“decoding”
and verifying incoming messages, and it typically involves the
verification of a
MAC and/or the decryption of an incoming ciphertext.
IF YOU HAVE ANY DOUBT
PLEASE COMMENT DOWN BELOW I WILL SOLVE IT FOR YOU:)
----------------PLEASE RATE THE ANSWER-----------THANK
YOU!!!!!!!!----------