-
公开(公告)号：CA2277761C
公开(公告)日：2003-03-25
申请号：CA2277761
申请日：1999-07-20
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: According to the two party authentication method, a first party generates and transfers a random number to a second party as a first challenge. The second party increments a count value in response to the first challenge, generates a first challenge response by performing a keyed cryptographic function (KCF) on the first challenge and the count value using a first key, and transfers the count value, as a second challenge, and the first challenge response to the first party. The first party verifies the second party based on the first challenge, the second challenge and the first challenge response. The first party also generates a second challenge response by performing the KCF on the second challenge using the first key, and transfers the second challenge response to the second party. The second party verifies the first party based on the second challenge and the second challenge response. For instance, the first and second parties can be a network and mobile, respectively, in a wireless system. Also, based on the first and second challenges, both the first and second parties may generate another key.
-
公开(公告)号：CA2248482C
公开(公告)日：2002-03-19
申请号：CA2248482
申请日：1998-09-30
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: The present invention strengthens authentication protocols by making it more difficult for handset impersonators to gain system access using replay attacks. This goal is accomplished using challenge codes as a parameter for determining au thentication codes, whereby different challenge codes cause different authentication code s to be generated. In one embodiment, the challenge codes are functions of challenge types (e.g., global or unique challenges) and/or handset states (e.g., call origination, page response, registration, idle, and SSD-A update). This embodiment prevents handset impe rsonators from successfully utilizing replay attacks to impersonate a legitimate hands et if the legitimate handset is in a different state than the handset impersonator, or if the legitimate handset is responding to a different challenge type than the handset imperso nator.
-
公开(公告)号：CA2335172A1
公开(公告)日：2001-09-17
申请号：CA2335172
申请日：2001-02-09
Applicant: LUCENT TECHNOLOGIES INC
Inventor： GROSSE ERIC , BOYKO VICTOR VLADIMIR , MACKENZIE PHILIP DOUGLAS , PATEL SARVAR
Abstract: Secure communication protocols are disclosed in which two parties genera te a shared secret which may be used as a secure session key for communication between the parties. The protocols are based on Diffie-Hellman type key exchange in which a Diffie-Hellman value is combined with a function of at least a password using the group operation such that the Diffie-Hellman value may be extracte d by the other party using the inverse group operation and knowledge of the password. In one embodiment, each of the parties explicitly authenticates the other party, while in another embodiment, the parties utilize implicit authentication relying o n the generation of an appropriate secret session key to provide the implicit authentication. Typically, the parties will be a client computer and a serve r computer. In accordance with other embodiments of the invention, in order to protect against a security compromise at the server, the server is not in possession of the password, but instead is provided with, and stores, a so-called password verifier which is a function of the password and where the password itself cannot be determined from the value of the password verifier.
-
公开(公告)号：AU5361099A
公开(公告)日：2000-05-04
申请号：AU5361099
申请日：1999-10-12
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR , RAMZAN ZULFIKAR AMIN , SUNDARAM GANAPATHY SUBRAMANIAN
-
公开(公告)号：AU5360499A
公开(公告)日：2000-05-04
申请号：AU5360499
申请日：1999-10-12
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR , RAMZAN ZULFIKAR AMIN
Abstract: An efficient hashing technique uses w + w/2 operations to hash a string "w" words long rather than the w operations of the prior art. This efficiency is achieved by squaring the sum of the key and the string to be hashed rather than forming a product of the key and the string to be hashed.
-
Patent Agency Ranking
公开(公告)号：CA2282051A1
公开(公告)日：2000-04-20
申请号：CA2282051
申请日：1999-08-30
Applicant: LUCENT TECHNOLOGIES INC
Inventor： SUNDARAM GANAPATHY SUBRAMANIAN , PATEL SARVAR , RAMZAN ZULFIKAR AMIN
Abstract: The present invention solves the aforementioned inefficiencies by providing an encryption or cipher method that uses the same pseudorandom function twice rather than different pseudorandom functions. Additionally, the present invention uses hashing functions that are highly efficient. The hashing functions of the present invention are square hashing functions that square a sum of a key and a data string rather than using a multiplication. As a result the hashing operation only requires operations rather than the w2 operations required by the inefficient hashing functions used in the prior art.. Additionally, the present invention replaces the exclusive ORed operations of the prior art with modular "n" summing operations.
-
公开(公告)号：CA2276872A1
公开(公告)日：2000-02-28
申请号：CA2276872
申请日：1999-07-02
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: In the method for protecting mobile anonymity, the network sends a temporary mobile identifier (TID) update request to the mobile along with a challenge. In response, the mobile encrypts its permanent ID through public key encryption using the public key of the network, and sends the encryption result to the network. Also, the mobile generates a second challenge, and a first challenge response. The first challenge response is generated by performing a keyed cryptographic function (KCF) on the first and second challenges using a key. The mobile sends the second challenge and the first. challenge response to the network with the encrypted permanent ID. After decrypting the permanent ID, the network accesses the key associated with mobile using the permanent ID. Next, using the key, the network authenticates the mobile using the second challenge and the first challenge response. If authenticated, the network calculated a TID for the mobile using the first and second challenges. The network further generates and sends a second challenge response to the mobile. If the mobile authenticates the network based on the second challenge response, then the mobile calculates the TID in the same manner as did the network.
-
公开(公告)号：CA2277733A1
公开(公告)日：2000-01-31
申请号：CA2277733
申请日：1999-07-20
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: In the method for updating secret shared data (SSD) in a wireless communication system, a first party outputs a first random number as a first challenge wherein the first party is one of a network and a mobile. A second party generates a second random number in response to the first challenge. The second party is the mobile if the first party is the network, and the second party is the network if the first party is the mobile. The second party generates a first challenge response by performing a keyed cryptographic function (KCF) on the first challenge and the second random number using a secondary key, which is not the SSD and is derived from a root key. The second party then transfers the second random number, as a second challenge, and the first challenge response to the first party. The first party verifies the second party based on the first and second challenges and the first challenge response, generates a second challenge response by performing the KCF on the second challenge using the secondary key, and transfers the second challenge response to the second party. The second party, verifies the first party based on the second challenge and the second challenge response. Both parties respectively establish the SSD based on the first and second challenges.
-
公开(公告)号：BR9805701A
公开(公告)日：1999-12-21
申请号：BR9805701
申请日：1998-12-22
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: The present invention strengthens authentication protocols by making it more difficult for handset impersonators to perform call origination using replay attacks. The present invention accomplishes this goal by using the most significant digits of a telephone number being dialed as a parameter for determining authentication codes. Using the most significant digits makes it more difficult for impersonators to successfully use replay attacks on call origination, wherein the replay attacks involve the appendage of digits to a telephone number to be dialed.
-
公开(公告)号：BR9803861A
公开(公告)日：1999-12-21
申请号：BR9803861
申请日：1998-10-01
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: The present invention strengthens authentication protocols by making it more difficult for handset impersonators to gain system access using replay attacks. This goal is accomplished using challenge codes as a parameter for determining authentication codes, whereby different challenge codes cause different authentication codes to be generated. In one embodiment, the challenge codes are functions of challenge types (e.g., global or unique challenges) and/or handset states (e.g., call origination, page response, registration, idle, and SSD-A update). This embodiment prevents handset impersonators from successfully utilizing replay attacks to impersonate a legitimate handset if the legitimate handset is in a different state than the handset impersonator, or if the legitimate handset is responding to a different challenge type than the handset impersonator.
-
-
-
-
-
-
-
-
-
Search Results
99
records
(took 0.026 seconds)
