Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. An Optimal Non-Interactive Message Authentication Protocol
 
conference paper

An Optimal Non-Interactive Message Authentication Protocol

Pasini, Sylvain  
•
Vaudenay, Serge  
2006
Topics in Cryptology -- CT-RSA '06, The Cryptographers' Track at the RSA Conference
Topics in Cryptology -- CT-RSA '06: The Cryptographers' Track at the RSA Conference

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.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

PasiniVaudenay06-NonInteractiveMessageAuthenticationProtocol.pdf

Access type

openaccess

Size

196.54 KB

Format

Adobe PDF

Checksum (MD5)

5d8825f30ae7d77193497b340449202b

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés