Secure multiround authentication protocols
Gemmell and Naor proposed a new protocol for unconditionally secure authentication of long messages. However Gehrmann showed that the proof of the security of the protocol was incorrect. Here we generalize the multiround protocol model. We prove tbe security of a 3-round protocol and give for this case a new easy implementable construction which has a key size close to the fundamental lower bound for even extremely long messages. Furthermore, we give a proof of a secure multiround protocol for an arbitrary number of rounds. For the entire collection see [Zbl 0866.00067].
- Multiround unconditionally secure authentication
- Robust and efficient authentication scheme for session initiation protocol
- Multi-run Security
- Codes for interactive authentication
- Fast message authentication using efficient polynomial evaluation
- scientific article; zbMATH DE number 7300383 (Why is no real title available?)
- On the security proof of an authentication protocol from Eurocrypt 2011
This page was built for publication: Secure multiround authentication protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757240)