Corpus ID: 196591794

A Reduction-Based Proof for Authentication and Session Key Security in 3-Party Kerberos

  title={A Reduction-Based Proof for Authentication and Session Key Security in 3-Party Kerberos},
  author={Jorg Schwenk and D. Stebila},
  journal={IACR Cryptol. ePrint Arch.},
Kerberos is one of the earliest network security protocols, providing authentication between clients and servers with the assistance of trusted servers. It remains widely used, notably as the default authentication protocol in Microsoft Active Directory (thus shipped with every major operating system), and is the ancestor of modern single sign-on protocols like OAuth and OpenID Connect. There have been many analyses of Kerberos in the symbolic (Dolev–Yao) model, which is more amenable to… Expand
Modular Security Analysis of OAuth 2.0 in the Three-Party Setting
This paper introduces a new primitive, the three-party authenticated secret distribution (3P-ASD for short) protocol, which plays the role of issuing the secret and captures the token issue process of OAuth 2.0, and presents a sufficiently rich three- party security model for OAuth protocols. Expand
The Enforcement of Context Aware System Security Protocols with the Aid of Multi Factor Authentication
  • S. Jose, P. Nayana, N. S. Nair
  • Computer Science
  • 2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)
  • 2020
In this paper, an attempt has been made to describe Kerberos authentication with multi factor authentication in context aware systems to make the framework increasingly secure and dependable. Expand


Nonce-based Kerberos is a Secure Delegated AKE Protocol
A variant of the Kerberos protocol is proposed, where nonces are used instead of timestamps, which requires one additional protocol message, but enables a proof in the standard Bellare-Rogaway (BR) model. Expand
Provable-Security Analysis of Authenticated Encryption in Kerberos
The authors take a close look at Kerberos' encryption, and they confirm that most of the options in the current version provably provide privacy and authenticity, although some require slight modifications which they suggest. Expand
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
A formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that allows for simple modular proofs of security is presented. Expand
Analysing the Combined Kerberos Timed Authentication Protocol and Frequent Key Renewal Using CSP and Rank Functions
This paper presents an application of rank functions approach to an authentication protocol that combines delaying the decryption process with timed authentication while keys are dynamically renewed under pseudo-secure situations. Expand
Content delivery over TLS: a cryptographic analysis of keyless SSL
This paper investigates the security guarantees provided by Keyless SSL, a CDN architecture currently deployed by CloudFlare that composes two TLS 1.2 handshakes to obtain a proxied TLS connection and presents 3(S)ACCEsecurity, a generalization of the 2-party ACCE security definition that has been used in several previous proofs for TLS. Expand
On the Security of TLS-DHE in the Standard Model
The notion of authenticated and confidential channel establishment ACCE is defined as a new security model which captures precisely the security properties expected from TLS in practice, and the combination of the TLS Handshake with data encryption in the TLS Record Layer can be proven secure in this model. Expand
Cryptographically sound security proofs for basic and public-key Kerberos
This work was the first verification at the computational level of such a complex fragment of an industrial protocol, and extends symbolic correctness results obtained in the Dolev–Yao model to cryptographically sound results in the computational model. Expand
Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem
It is suggested that key-wrap's goal is security in the sense of deterministic authenticated-encryption (DAE), and it is shown that a DAE scheme with a vector-valued header, such as SIV, directly realizes this goal. Expand
Provably secure session key distribution: the three party case
This paper provides the first treatment of session key distribution in the three-party setting of Needham and Schroeder in the complexity-theoretic framework of modern cryptography, assuming the (minimal) assumption of a pseudorandom function. Expand