Abstract:
A method of authenticating an entity by a verification entity, said entities sharing a pair of secret keys X and Y which are n×m (n, m>i) binary matrices. The method may be applied to cryptographic protocols for authenticating electronic chips at a very low cost.
Abstract:
An authentication method of a prover device by a verifier device by means of cryptographic coupons is provided for, wherein a coupon comprises, on one hand, a pseudo-random number ri, where i is an index for labeling the coupon, and, on the other hand, a reduced-coupon xi such that xi=ƒ(ri), where ƒ is a predetermined one-way function, comprising at least the following steps: the verifier device sends a challenge consisting of a random value c to the prover device; the prover device sends to the verifier device a response y calculated by using a pseudo-random number ri, said challenge c, and a secret key s belonging to the prover device; and the verifier device checks the validity of said response y based on the challenge c, the reduced-coupon xi corresponding to said pseudo-random number ri, and a public key V corresponding to said secret key s. According to the invention, the verifier device receives said reduced-coupon xi from a source external to the prover device.
Abstract:
A system, method, and data structure provide for securely synchronizing passwords and/or other information between systems. The password-related information is stored in the systems in a secure manner, and a user or some other, external agent participates actively in the transmission of a new password between systems. A password update file is communicated or shared between systems to synchronize passwords.
Abstract:
A method is provided for authenticating a first entity and a second entity at a third entity. The first and third entities share a first secret key, and the second and third entities share a second secret key. The method includes steps of: dispatching by the third entity to the first entity of a challenge, calculation by the first entity, using the first secret key, of an authentication value; dispatching by the first entity to the second entity the authentication value, calculation by the second entity, using the second secret key, of an authentication response; dispatching by the second entity to the third entity of the authentication response; calculation by the third entity of an expected authentication response; and comparison of the authentication response received with the expected calculated authentication response.
Abstract:
A method is provided for authenticating a first entity and a second entity at a third entity. The first and third entities share a first secret key, and the second and third entities share a second secret key. The method includes steps of: dispatching by the third entity to the first entity of a challenge, calculation by the first entity, using the first secret key, of an authentication value; dispatching by the first entity to the second entity the authentication value, calculation by the second entity, using the second secret key, of an authentication response; dispatching by the second entity to the third entity of the authentication response; calculation by the third entity of an expected authentication response; and comparison of the authentication response received with the expected calculated authentication response.