Privacy Amplification from Non-malleable Codes

Bhavana Kanukurthi
Bhavana Kanukurthi
Sai Lakshmi Bhavana Obbattu
Sai Lakshmi Bhavana Obbattu
Sruthi Sekar
Sruthi Sekar

IACR Cryptology ePrint Archive, Volume 2018, 2019, Pages 318-337.

Cited by: 4|Bibtex|Views12|Links
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments