) One student claims to have invented a new security protocol. Given a hash function 𝐻, a symmetric encryption k

[answerhappygod]

) One student claims to have invented a new security protocol.
Given a hash function 𝐻, a symmetric encryption key algorithm 𝐸,
and two secret keys 𝐾1 and 𝐾2 known only to the sender and
receiver, the sender converts a message 𝑚 into the message 𝑐 = 𝐸𝐾1
(𝑚 ∗ 𝐻(𝐾2 ∗ 𝑚)), where ∗ denotes concatenation. Can this protocol
guarantee
i) confidentiality?
ii) non-repudiation?
iii) data integrity