US5491749A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for entity authentication and key distribution secure against off-line adversarial attacks
Assignee: International Business Machines Corp
•
Filing: 1993-12-30
•
Granted: 1996-02-13
•
Expires: 2013-12-30
Abstract
Abstract A method is described for substantially concurrently performing entity authentication operations and short-lived secret key distribution operations over an insecure communication channel between communication partners, wherein authenticity of communication partners is determined by possession of the long-lived shared secret key. The method includes a number of steps. Data flows are exchanged between the communication partners to define a composite key. At least a portion of the data flows have been encrypted or otherwise masked in a manner which utilizes the long-lived shared secret key. At least one authentication tag is passed between communication partners over the communication channel. The at least one authentication tag is based at least partially upon the composite key. The authentication tag is utilized to determine the authenticity of at least one communication partner.
Inventors
- 👤 Phillip W. Rogaway
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 09:32
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/08; H04L9/0816; H04L9/0838; H04L9/0841; H04L9/0844; H04L9/32; H04L9/3271
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
166 words
A method of authenticating a communication partner in an insecure communication channel wherein authenticity of communication partners is determined by possession of a long-lived shared secret key, comprising the method steps of: (a) exchanging data flows between communication partners, to define a composite key, wherein at least a portion of said data flows has been encrypted or otherwise masked in a manner which utilizes said long-lived shared secret key; (b) passing at least one authentication tag between said communication partners, wherein said at least one authorization tag is defined by a transform taken over a plurality of parameters and at least partially based on said composite key, said transform including at least one of (i) a message authentication code which is keyed by said long-lived shared secret key; (ii) a cryptographic hash function taken over said long-lived shared secret key; and (iii) a masking operation involving said long-lived shared secret key; and (c) utilizing said authentication tag to determine authenticity of at least one communication partner.
Claim 2
Independent Claim
166 words
A method of authenticating a communication partner in an insecure communication channel wherein authenticity of communication partners is determined by possession of a long-lived shared secret key, comprising the method steps of: (a) exchanging data flows between communication partners, to define a composite key, wherein at least a portion of said data flows has been encrypted or otherwise masked in a manner which utilizes said long-lived shared secret key; (b) passing at least one authentication tag between said communication partners, wherein said at least one authorization tag is defined by a transform taken over a plurality of parameters and at least partially based on said composite key, said transform including at least one of (i) a message authentication code which is keyed by said long-lived shared secret key; (ii) a cryptographic hash function taken over said long-lived shared secret key; and (iii) a masking operation involving said long-lived shared secret key; and (c) utilizing said authentication tag to determine authenticity of at least one communication partner.
Claim 3
Dependent Claim
51 words
A method of authenticating a communication partner, according to claim 1: (d) wherein a first communication partner directs to a second communication partner a first exponential component of said composite key; (e) wherein said second communication partner directs to said first communication partner a second exponential component of said composite key.
Claim 4
Dependent Claim
39 words
A method of authenticating a communication partner, according to claim 2: (f) wherein said first exponential component includes a public base and a random and secret exponent selected by said first communication partner from a defined group of integers.
Claim 5
Dependent Claim
39 words
A method of authenticating a communication partner, according to claim 2: (f) wherein said second exponential component includes a public base and a random and secret exponent selected by said second communication partner from a defined group of integers.
Claim 6
Dependent Claim
72 words
A method of authenticating a communication partner, according to claim 2: (f) wherein said first exponential component includes a public base and a random and secret exponent selected by said first communication partner from a defined cyclic multiplicative group of integers; and (g) wherein said second exponential component includes a public base and a random and secret exponent selected by said second communication partner from a defined cyclic multiplicative group of integers.
Claim 7
Dependent Claim
68 words
A method of authenticating a communication partner, according to claim 1: (d) wherein a first communication partner directs to a second communication partner a first authentication tag which allows said second communication partner to authenticate said first communication partner; and (e) wherein said second communication partner directs to said first communication partner a second authentication tag which allows said first communication partner to authenticate said second communication partner.
Claim 8
Dependent Claim
56 words
A method of authenticating a communication partner, according to claim 6: (f) wherein at least one of said first and second authentication tags is communicated between said first and second partners concurrent with data flows which establish said composite key, in order to minimize the number of communication flows between said first and second communication partners.
Claim 9
Independent Claim
178 words
A method of authenticating a communication partner in an insecure communication channel in a distributed data processing system wherein authenticity of communication partners is determined by possession of a long-lived shared secret key, comprising the method steps of: (a) exchanging data flows between communication partners to define a composite key, in said distributed data processing system wherein at least a portion of said data flows has been encrypted or otherwise masked in a manner which utilizes said long-lived shared secret key; (b) passing at least one authentication tag between said communication partners, wherein said at least one authorization tag is defined by a transform taken over a plurality of parameters and at least partially based on said composite key, said transform including at least one of (i) a message authentication code which is keyed by said long-lived shared secret key; (ii) a cryptographic hash function taken over said long-lived shared secret key; and (iii) a masking operation involving said long-lived shared secret key; and (c) utilizing said authentication tag to determine authenticity of at least one communication partner.
Claim 10
Independent Claim
178 words
A method of authenticating a communication partner in an insecure communication channel in a distributed data processing system wherein authenticity of communication partners is determined by possession of a long-lived shared secret key, comprising the method steps of: (a) exchanging data flows between communication partners to define a composite key, in said distributed data processing system wherein at least a portion of said data flows has been encrypted or otherwise masked in a manner which utilizes said long-lived shared secret key; (b) passing at least one authentication tag between said communication partners, wherein said at least one authorization tag is defined by a transform taken over a plurality of parameters and at least partially based on said composite key, said transform including at least one of (i) a message authentication code which is keyed by said long-lived shared secret key; (ii) a cryptographic hash function taken over said long-lived shared secret key; and (iii) a masking operation involving said long-lived shared secret key; and (c) utilizing said authentication tag to determine authenticity of at least one communication partner.
Claim 11
Dependent Claim
75 words
A method of authenticating a communication partner, according to claim 8: (d) wherein a first communication partner in said distributed data processing system directs to a second communication partner in said distributed data processing system a first exponential component of said composite key; (e) wherein said second communication partner in said distributed data processing system directs to said first communication partner in said distributed data processing system a second exponential component of said composite key.
Claim 12
Dependent Claim
39 words
A method of authenticating a communication partner, according to claim 9: (f) wherein said first exponential component includes a public base and a random and secret exponent selected by said first communication partner from a defined group of integers.
Claim 13
Dependent Claim
39 words
A method of authenticating a communication partner, according to claim 9: (f) wherein said first exponential component includes a public base and a random and secret exponent selected by said first communication partner from a defined group of integers.
Claim 14
Dependent Claim
71 words
A method of authenticating a communication partner, according to claim 9: (f) wherein said first exponential component includes a public base and a random and secret exponent selected by said first communication partner from a defined cyclic multiplicative group of integers; (g) wherein said second exponential component includes a public base and a random and secret exponent selected by said second communication partner from a defined cyclic multiplicative group of integers.
Claim 15
Dependent Claim
86 words
A method of authenticating a communication partner, according to claim 8: (d) wherein a first communication partner in said distributed data processing system directs to a second communication partner in said distributed data processing system a first authentication tag which allows said second communication partner to authenticate said first communication partner; and (e) wherein said second communication partner in said distributed data processing system directs to said first communication partner a second authentication tag which allows said first communication partner to authenticate said second communication partner.
Claim 16
Dependent Claim
57 words
A method of authenticating a communication partner, according to claim 13: (f) wherein at least one of said first and second authentication tags is communicated between said first and second communications partners concurrent with data flows which establish said composite key, in order to minimize the number of communication flows between said first and second communication partners.
Claim 17
Independent Claim
145 words
A method of authenticating a communication partner over an insecure communication channel wherein authenticity of communication partners is determined by possession of a long-lived shared secret key, comprising the method steps of: (a) short-lived distributing to said communication partners a composite key in data flows between communication partners; (b) passing at least one authentication tag between said communication partners, wherein said at least one authorization tag is defined by a transform taken over a plurality of parameters and at least partially based on said composite key, said transform including at least one of (i) a message authentication code which is keyed by said long-lived shared secret key (ii) a cryptographic hash function taken over said long-lived shared secret key; and (iii) a masking operation involving said long-lived shared secret key; and (c) utilizing said authentication tag to determine authenticity of at least one communication partner.
Claim 18
Independent Claim
145 words
A method of authenticating a communication partner over an insecure communication channel wherein authenticity of communication partners is determined by possession of a long-lived shared secret key, comprising the method steps of: (a) short-lived distributing to said communication partners a composite key in data flows between communication partners; (b) passing at least one authentication tag between said communication partners, wherein said at least one authorization tag is defined by a transform taken over a plurality of parameters and at least partially based on said composite key, said transform including at least one of (i) a message authentication code which is keyed by said long-lived shared secret key (ii) a cryptographic hash function taken over said long-lived shared secret key; and (iii) a masking operation involving said long-lived shared secret key; and (c) utilizing said authentication tag to determine authenticity of at least one communication partner.
Claim 19
Dependent Claim
133 words
A method of authenticating a communication partner according to claim 15, wherein said step of distributing includes the substeps of: computing, in behalf of a first communication partner, a value for g α for a particular g and a value for α secretly selected from a predefined group; computing, on behalf of a second communication partner, a value for g β for said particular g and a value for β secretly selected from a predefined group; communicating said value for g β from said first communication partner to said second communication partner; communicating said value for g β from said second communication partner to said first communication partner; generating a short-lived shared secret key g αβ for use in securing communications between said first and second communication partners over said insecure communication channel.
Claim 20
Dependent Claim
30 words
A method of authenticating communication partners, according to claim 16, further comprising: masking said value for g α and g β during communications between said first and second communication partners.
Claim 21
Dependent Claim
60 words
A method of authenticating communication partners, according to claim 17, wherein said step of masking comprises: masking said value for g α by performing a masking operation between said value for g α and a shared secret key; masking said value for g β by performing a masking operation between said value for g β and a shared secret key.
Claim 22
Dependent Claim
18 words
A method of authenticating communication partners, according to claim 18, wherein said masking operation comprises an exclusive-or operating.
Claim 23
Dependent Claim
21 words
A method of authenticating communication partners according to claim 18, wherein said shared secret key comprises said long-lived shared secret key.
Claim 24
Dependent Claim
18 words
A method of authenticating communication partners according to claim 18, wherein said masking operation comprises an encryption operation.
Claim 25
Dependent Claim
68 words
A method of authenticating a communication partner, according to claim 15: (d) wherein a first communication partner directs to a second communication partner a first authentication tag which allows said second communication partner to authenticate said first communication partner; and (e) wherein said second communication partner directs to said first communication partner a second authentication tag which allows said first communication partner to authenticate said second communication partner.
Claim 26
Dependent Claim
57 words
A method of authenticating a communication partner, according to claim 22: (f) wherein at least one of said first and second authentication tags is communicated between said first and second partners along with at least a portion of said composite key, in order to minimize the number of communication flows between said first and second communication partners.
Claim 27
Dependent Claim
167 words
Means for authenticating a communication partner in an insecure communication channel wherein authenticity of communication partners is determined by possession of a long-lived shared secret key, comprising: (a) means for exchanging data flows between communication partners, to define a composite key, wherein at least a portion of said data flows has been encrypted or otherwise masked in a manner which utilizes said long-lived shared secret key; (b) means for passing at least one authentication tag between said communication partners, wherein said at least one authorization tag is defined by a transform taken over a plurality of parameters and at least partially based on said composite key, said transform including at least one of (i) a message authentication code which is keyed by said long-lived shared secret key; (ii) a cryptographic hash function taken over said long-lived shared secret key; and (iii) a masking operation involving said long-lived shared secret key; and (c) means for utilizing said authentication tag to determine authenticity of at least one communication partner.
Claim 28
Dependent Claim
167 words
Means for authenticating a communication partner in an insecure communication channel wherein authenticity of communication partners is determined by possession of a long-lived shared secret key, comprising: (a) means for exchanging data flows between communication partners, to define a composite key, wherein at least a portion of said data flows has been encrypted or otherwise masked in a manner which utilizes said long-lived shared secret key; (b) means for passing at least one authentication tag between said communication partners, wherein said at least one authorization tag is defined by a transform taken over a plurality of parameters and at least partially based on said composite key, said transform including at least one of (i) a message authentication code which is keyed by said long-lived shared secret key; (ii) a cryptographic hash function taken over said long-lived shared secret key; and (iii) a masking operation involving said long-lived shared secret key; and (c) means for utilizing said authentication tag to determine authenticity of at least one communication partner.
References Cited (Backward Citations)
US4193131A
Cited
US4720859A
Cited
US4438824A
Cited
US4549075A
Cited
US4723284A
Cited
US4588985A
Cited
US4799061A
Cited
US4805216A
Cited
US5148479A
Cited
US5153919A
Cited
US5241599A
Cited
US5371294A
Cited
US5299263A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-02-12 | 1999-08-14 | 2000-02-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-02-12 | 2003-08-14 | 2004-02-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-02-12 | 2007-08-14 | 2008-02-13 | $7700.00 | Window Closed / Lapsed |