US5369705A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multi-party secure session/conference
Assignee: International Business Machines Corp
•
Filing: 1992-06-03
•
Granted: 1994-11-29
•
Expires: 2012-06-03
Abstract
Abstract A method and apparatus for providing authentication among a dynamically selected group of users in a communication system with a dynamically changing network topology. With this invention, freshness information and alleged identity information are transmitted from each of the users in the group using available paths in the network. A group key is then generated, and coded information, derived from the group key and the above transmitted information, is sent to each of the users. Each unit of coded information is accompanied by an identifying tag so as to identify which of the users is to use the appropriate unit of coded information. Each alleged user will then extract the group key from a corresponding coded information unit only if it shares an appropriate secret with a server. Without knowledge of the group key, a user cannot be authenticated.
Inventors
- 👤 Raymond F. Bird
- 👤 Amir Herzberg
- 👤 Philippe A. Janson
- 👤 Shay Kutten
- 👤 Refik A. Molva
- 👤 Marcel M. Yung
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 11:51
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/08; H04L9/0816; H04L9/0819; H04L9/083; H04L9/0833
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
344 words
A method of providing secure communications between terminals of a communications network, said method comprising: (a) storing in a server of said network an initial user key for each of said terminals, each corresponding said user key being known only to said server and a corresponding one of said terminals; (b) transmitting, upon the event of a group of said terminals indicating a desire to communicate with each other, corresponding alleged identity and corresponding freshness information from each terminal of said group of terminals, said freshness information indicating the happening of said event and the time elapsed since said event occurred and being associated with said group and said event, each said alleged identity information and each said freshness information being transmitted to said server, each said alleged identity and freshness information being dynamically routed to said server on current available paths of said network; (c) generating a group key which is held in a secure fashion and is usable only by said group of terminals for only a predetermined time interval following said event; (d) computing coded information for each terminal of said group of terminals, said coded information being dependent upon said group key, corresponding said freshness information, corresponding said user key, and upon an alleged identification of a user; (e) transmitting to each of said terminals of said group corresponding said coded information along with an attached clear text tag representing said each terminal on said current available paths of said network; and (f) extracting said group key, by each of said terminals, based upon corresponding said coded information, by employing said user key of said each terminal, said corresponding coded information being identified by a corresponding said attached tag, said extracting in step (f) being successful only if an alleged user is actually the user it alleges to be in step (b), said users communicating securely with each other using said group key, repeating steps (b) through (f) when another group of said terminals indicate that they desire to communicate with each other, wherein a new group key is generated.
Claim 2
Independent Claim
344 words
A method of providing secure communications between terminals of a communications network, said method comprising: (a) storing in a server of said network an initial user key for each of said terminals, each corresponding said user key being known only to said server and a corresponding one of said terminals; (b) transmitting, upon the event of a group of said terminals indicating a desire to communicate with each other, corresponding alleged identity and corresponding freshness information from each terminal of said group of terminals, said freshness information indicating the happening of said event and the time elapsed since said event occurred and being associated with said group and said event, each said alleged identity information and each said freshness information being transmitted to said server, each said alleged identity and freshness information being dynamically routed to said server on current available paths of said network; (c) generating a group key which is held in a secure fashion and is usable only by said group of terminals for only a predetermined time interval following said event; (d) computing coded information for each terminal of said group of terminals, said coded information being dependent upon said group key, corresponding said freshness information, corresponding said user key, and upon an alleged identification of a user; (e) transmitting to each of said terminals of said group corresponding said coded information along with an attached clear text tag representing said each terminal on said current available paths of said network; and (f) extracting said group key, by each of said terminals, based upon corresponding said coded information, by employing said user key of said each terminal, said corresponding coded information being identified by a corresponding said attached tag, said extracting in step (f) being successful only if an alleged user is actually the user it alleges to be in step (b), said users communicating securely with each other using said group key, repeating steps (b) through (f) when another group of said terminals indicate that they desire to communicate with each other, wherein a new group key is generated.
Claim 3
Dependent Claim
60 words
A method as recited in claim 1, wherein said alleged identity information and said corresponding freshness information transmitted from said users is collected by one of said terminals of said group and then transmitted from said one terminal to said server, said one terminal being selected only if there is an available path from said one terminal to said server.
Claim 4
Dependent Claim
83 words
A method as recited in claim 1 wherein units of said freshness information and said alleged identity information are transmitted starting from an initiating terminal A of said group to/from an ordered sequence B1, B2, . . . , BN, B of said group, where said freshness information and said alleged identity information are collected at terminal B and transmitted directly to said server without passing through any other of said group, said sequence being established based upon available paths in said system.
Claim 5
Independent Claim
348 words
An apparatus for providing secure communications between terminals of a communications network, said method comprising: (a) means for in a server of said network an initial user key for each of said terminals, each corresponding said user key being known only to said server and a corresponding one of said terminals; (b) means for transmitting, upon the event of a group of said terminals indicating a desire to communicate with each other, corresponding alleged identity and corresponding freshness information from each terminal of said group of terminals, said freshness information indicating the happening of said event and the time elapsed since said event occurred and being associated with said group and said event, each said alleged identity information and each said freshness information being transmitted to said server, each said alleged identity and freshness information being dynamically routed to said server on current available paths of said network; (c) means for generating a group key which is held in a secure fashion and is usable only by said group of terminals for only a predetermined time interval following said event; (d) means for computing coded information for each terminal of said group of terminals, said coded information being dependent upon said group key, corresponding said freshness information, corresponding said user key, and upon an alleged identification of a user; (e) means for transmitting to each of said terminals of said group corresponding said coded information along with an attached clear text tag representing said each terminal on said current available paths of said network; and (f) means for extracting said group key, by each of said terminals, based upon corresponding said coded information, by employing said user key of said each terminal, said corresponding coded information being identified by a corresponding said attached tag, said extracting in step (f) being successful only if an alleged user is actually the user it alleges to be in step (b), said users communicating securely with each other using said group key, repeating steps (b) through (f) when another group of said terminals indicate that they desire to communicate with each other.
Claim 6
Independent Claim
348 words
An apparatus for providing secure communications between terminals of a communications network, said method comprising: (a) means for in a server of said network an initial user key for each of said terminals, each corresponding said user key being known only to said server and a corresponding one of said terminals; (b) means for transmitting, upon the event of a group of said terminals indicating a desire to communicate with each other, corresponding alleged identity and corresponding freshness information from each terminal of said group of terminals, said freshness information indicating the happening of said event and the time elapsed since said event occurred and being associated with said group and said event, each said alleged identity information and each said freshness information being transmitted to said server, each said alleged identity and freshness information being dynamically routed to said server on current available paths of said network; (c) means for generating a group key which is held in a secure fashion and is usable only by said group of terminals for only a predetermined time interval following said event; (d) means for computing coded information for each terminal of said group of terminals, said coded information being dependent upon said group key, corresponding said freshness information, corresponding said user key, and upon an alleged identification of a user; (e) means for transmitting to each of said terminals of said group corresponding said coded information along with an attached clear text tag representing said each terminal on said current available paths of said network; and (f) means for extracting said group key, by each of said terminals, based upon corresponding said coded information, by employing said user key of said each terminal, said corresponding coded information being identified by a corresponding said attached tag, said extracting in step (f) being successful only if an alleged user is actually the user it alleges to be in step (b), said users communicating securely with each other using said group key, repeating steps (b) through (f) when another group of said terminals indicate that they desire to communicate with each other.
Claim 7
Dependent Claim
333 words
In a communications network having N interconnected terminals, a method of authenticating any selected group of n of said N terminals to each other, said method comprising: (a) storing an initial user key K i for each of said N terminals, where i≦1≦N, where K i is a secret shared only between terminal U i and a server; (b) transmitting, upon the event of a group of said terminals indicating a desire to communicate with each other, freshness information N i from each of said selected terminals of said group U i to said server terminals, said group key K g being held in a secure fashion and being usable only by said group of terminals for only a predetermined time following said event off; (c) generating a group key K g by said server for said selected group of n, said freshness information indicating the happening of said event and the time elapsed since said event occurred and being associated with said group and said event; (d) transmitting a unit of coded information C i from said server to each terminal U i of said group of n terminals, each coded information C i being information F i exclusively OR'd with said group key and identified by a clear text tag T i corresponding to terminal U i , said C i 's being transmitted in an arbitrary order, where said C is can be dynamically routed on current available paths of said network; and (e) extracting said group key by each user U i from said corresponding unit of coded information C i by exclusive-OR-ing C i with information I i where I i can only be determined with knowledge of K i , each terminal U i authenticating itself to other users of said selected group of n users by encryption of information with said group key K g , repeating steps (b) through (f) when another group of said terminals indicate that they desire to communicate with each other.
Claim 8
Dependent Claim
333 words
In a communications network having N interconnected terminals, a method of authenticating any selected group of n of said N terminals to each other, said method comprising: (a) storing an initial user key K i for each of said N terminals, where i≦1≦N, where K i is a secret shared only between terminal U i and a server; (b) transmitting, upon the event of a group of said terminals indicating a desire to communicate with each other, freshness information N i from each of said selected terminals of said group U i to said server terminals, said group key K g being held in a secure fashion and being usable only by said group of terminals for only a predetermined time following said event off; (c) generating a group key K g by said server for said selected group of n, said freshness information indicating the happening of said event and the time elapsed since said event occurred and being associated with said group and said event; (d) transmitting a unit of coded information C i from said server to each terminal U i of said group of n terminals, each coded information C i being information F i exclusively OR'd with said group key and identified by a clear text tag T i corresponding to terminal U i , said C i 's being transmitted in an arbitrary order, where said C is can be dynamically routed on current available paths of said network; and (e) extracting said group key by each user U i from said corresponding unit of coded information C i by exclusive-OR-ing C i with information I i where I i can only be determined with knowledge of K i , each terminal U i authenticating itself to other users of said selected group of n users by encryption of information with said group key K g , repeating steps (b) through (f) when another group of said terminals indicate that they desire to communicate with each other.
Claim 9
Dependent Claim
344 words
In a communications network having N interconnected terminals, a method of authenticating any selected group of n of said N terminals to each other, said method comprising: (a) means for storing an initial user key K i for each of said N terminals, where i≦1≦N, where K i is a secret shared only between terminal U i and a server; (b) means for transmitting, upon the event of a group of said terminals indicating a desire to communicate with each other, freshness information N i from each of said selected terminals of said group U i to said server terminals, said group key K g being held in a secure fashion and being usable only by said group of terminals for only a predetermined time following said event off; (c) means for generating a group key K g by said server for said selected group of n, said freshness information indicating the happening of said event and the time elapsed since said event occurred and being associated with said group and said event; (d) means for transmitting a unit of coded information C i from said server to each terminal U i of said group of n terminals, each coded information C i being information F i exclusively OR'd with said group key and identified by a clear text tag T i corresponding to terminal U i , said C i 's being transmitted in an arbitrary order, where said C i 's can be dynamically routed on current available paths of said network; and (e) means for extracting said group key by each user U i from said corresponding unit of coded information C i by exclusive-OR-ing C i with information I i where I i can only be determined with knowledge of K i , each terminal U i authenticating itself to other users of said selected group of n users by encryption of information with said group key K g , repeating steps (b) through (f) when another group of said terminals indicate that they desire to communicate with each other.
Claim 10
Dependent Claim
344 words
In a communications network having N interconnected terminals, a method of authenticating any selected group of n of said N terminals to each other, said method comprising: (a) means for storing an initial user key K i for each of said N terminals, where i≦1≦N, where K i is a secret shared only between terminal U i and a server; (b) means for transmitting, upon the event of a group of said terminals indicating a desire to communicate with each other, freshness information N i from each of said selected terminals of said group U i to said server terminals, said group key K g being held in a secure fashion and being usable only by said group of terminals for only a predetermined time following said event off; (c) means for generating a group key K g by said server for said selected group of n, said freshness information indicating the happening of said event and the time elapsed since said event occurred and being associated with said group and said event; (d) means for transmitting a unit of coded information C i from said server to each terminal U i of said group of n terminals, each coded information C i being information F i exclusively OR'd with said group key and identified by a clear text tag T i corresponding to terminal U i , said C i 's being transmitted in an arbitrary order, where said C i 's can be dynamically routed on current available paths of said network; and (e) means for extracting said group key by each user U i from said corresponding unit of coded information C i by exclusive-OR-ing C i with information I i where I i can only be determined with knowledge of K i , each terminal U i authenticating itself to other users of said selected group of n users by encryption of information with said group key K g , repeating steps (b) through (f) when another group of said terminals indicate that they desire to communicate with each other.
References Cited (Backward Citations)
US4458109A
Cited
US4677434A
Cited
US5005200A
Cited
US5146499A
Cited
US5136647A
Cited
US5148479A
Cited
US5202921A
Cited
US5241594A
Cited
US5235642A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-11-28 | 1998-05-30 | 1998-11-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-11-28 | 2002-05-30 | 2002-11-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-11-28 | 2006-05-30 | 2006-11-29 | $7700.00 | Window Closed / Lapsed |