Privacy Amplification from Non-malleable Codes

This article presents universal forgery and multiple forgeries against MergeMAC that has been recently proposed to fit scenarios where bandwidth is limited and where strict time constraints apply. MergeMAC divides an input message into two parts, (mVert tilde{m}), and its tag is computed by (mathcal {F}( mathcal {P}_1(m) oplus mathcal {P}...More