Showing papers on "Data Authentication Algorithm published in 1986"
07 Apr 1986
TL;DR: A UID scheme that gives clients control over the time at which a name gets bound to a principal, thus controlling the effects of mutability of the name space is provided.
Abstract: This paper describes a design for an authentication service for a very large scale, very long lifetime, distributed system. The paper introduces a methodology for describing authentication protocols that makes explicit the trust relationships amongst the participants. The authentication protocol is based on the primitive notion of composition of secure channels. The authentication model offered provides for the authentication of "roles", where a principal might exercise differing roles at differing times, whilst having only a single "identity". Roles are suitable for inclusion in access control lists. The naming of a role implies what entities are being trusted to authenticate the role. We provide a UID scheme that gives clients control over the time at which a name gets bound to a principal, thus controlling the effects of mutability of the name space.
115 citations
TL;DR: Girling's strategy for one-time keywords for authentication forwarding is combined with a proxy login mechanism to obtain a reliable method for network authentication that does not depend on the transmission of passwords.
23 citations
TL;DR: In this paper, the authors apply state machine modeling and analysis techniques to determine important properties of encryption-based protocols including completeness, deadlock freeness, livelock or tempo-blocking freenness, termination, boundedness, and absence of non-executable interactions.
10 citations
01 Jan 1986
TL;DR: Recently, Seberry proposed a method for subliminal message transmission over an insecure channel in the case where authentication but not secrecy is required, which is examined in some detail, and certain changes to the method that would be necessary for implementation are proposed.
Abstract: Recently, Seberry proposed a method for subliminal message transmission over an insecure channel in the case where authentication but not secrecy is required. Here we examine her ideas in some detail, and propose certain changes to the method that would be necessary for implementation. Disciplines Physical Sciences and Mathematics Publication Details Jones, TC and Seberry, J, Authentication without secrecy, Ars Combinatoria, 21A, 1986, 115-121. This journal article is available at Research Online: http://ro.uow.edu.au/infopapers/1021 AUTHENTICATION WITHOUT SECRECY TERRY C. JONES AND JENNIFER SEBERRY ABSTRACT. Re~eDtly, ~berry proposed a method for Bubliminal meB~ tran~missioll over an insecure channel in the ease where a.uthentication but not secrecy is required. Here we examine her ide8.11 in some detail, and propose certain changes to the method that would be necessary for implementation. Re~eDtly, ~berry proposed a method for Bubliminal meB~ tran~missioll over an insecure channel in the ease where a.uthentication but not secrecy is required. Here we examine her ide8.11 in some detail, and propose certain changes to the method that would be necessary for implementation.
7 citations
Patent•
IBM1
TL;DR: In this paper, a method of offline personal identification in and to a multinomial data processing system using an authentication tree with a one-way authentication tree function, a stored global secret key, stored global verification value of reference, a personal identification number entered directly by the potential user and a personal key and an index position number entered via a card previously issued to a potential user, the index position numbers representing the tree path for the user to whom the card was issued, by calculating an authentication parameter as a function of the personal key, mapping the parameter to a verification value using
Abstract: A method of offline personal identification in and to a muftiterminal data processing system, the method using an authentication tree with a one-way authentication tree function, a stored global secret key, a stored global verification value of reference, a personal identification number entered directly by the potential user and a personal key and an index position number entered via a card previously issued to the potential user, the index position number representing the tree path for the user to whom the card was issued, by calculating an authentication parameter as a function of the personal key and the personal identification number; mapping the parameter to a verification value using the index position number in the one way function to the root of the tree; comparing the verification value obtained by the mapping with the stored global verification value of reference; and enabling the system in respect of transaction execution if the comparison meets predetermined criteria.
6 citations
TL;DR: A generalized model of logical authentication, the user learns an encryption algorithm whose functional description is secret that includes new tests of secret knowledge which induce larger forgery costs in certain environments than methods currently in wide-spread use.
Abstract: A logical authentication test requires no special hardware. As a proof of identity, the accessor is required to know or to use secret information. In a generalized model of logical authentication, the user learns an encryption algorithm whose functional description is secret. This model includes new tests of secret knowledge which induce larger forgery costs in certain environments than methods currently in wide-spread use.
6 citations