A reduction-based proof for authentication and session key security in three-party Kerberos (Q6096687)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A reduction-based proof for authentication and session key security in three-party Kerberos |
scientific article; zbMATH DE number 7737963
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reduction-based proof for authentication and session key security in three-party Kerberos |
scientific article; zbMATH DE number 7737963 |
Statements
A reduction-based proof for authentication and session key security in three-party Kerberos (English)
0 references
15 September 2023
0 references
Summary: The Kerberos network security protocol provides authentication between clients and servers with the assistance of trusted servers and remains widely used. We give a reduction-based security showing that the mandatory three-party mode of Kerberos authentication and key establishment is a secure authentication protocol under standard assumptions on its encryption scheme; our results can be lifted to apply to quantum adversaries as well. As for many other real-world key exchange protocols, session key indistinguishability cannot be proven for Kerberos since the session key is used in the protocol itself, breaking indistinguishability. We can however show that Kerberos' optional sub-session mode yields secure session keys, and that the hash of the main session key is secure in Krawczyk's generalization of the authenticated and confidential channel establishment model.
0 references
key exchange
0 references
authentication
0 references
Kerberos
0 references