An Optimal Non-Interactive Message Authentication Protocol

Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SAS-based non-interactive message authentication protocols (NIMAP). We start by the analysis of two popular non-interactive message authentication protocols. The first one is based on a collision-resistant hash function and was presented by Balfanz et al. The second protocol is based on a universal hash function family and was proposed by Gehrmann, Mitchell, and Nyberg. It uses much less authenticated bits but requires a stronger authenticated channel. We propose a protocol which can achieve the same security as the first protocol but using less authenticated bits, without any stronger communication model, and without requiring a hash function to be collision-resistant.


Published in:
Topics in Cryptology -- CT-RSA '06, The Cryptographers' Track at the RSA Conference, 3860, 280-294
Presented at:
Topics in Cryptology -- CT-RSA '06: The Cryptographers' Track at the RSA Conference, San Jose, CA, USA, February 13-17, 2006
Year:
2006
Publisher:
Springer
Keywords:
Other identifiers:
Laboratories:




 Record created 2007-01-19, last modified 2018-03-17

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)