Methods And Devices For Authentication And Verification Of Non Revocation

Abstract: A revocation list (LR) contains at least one pair (hi, k) extracted from a signature generated by a revoked entity, where hi is an element of a mathematical group (GI) and k = hixi, where xi is a secret of said revoked entity. A first entity (100) sends (E60), to a second entity (200), with a view to being authenticated thereby: a signature (SIG) generated by said first entity (100) for the purposes of this authentication; a character string (STR); one element (Ci) of the group (GI) for each pair (hi, k) of the revocation list (LR); and a zero-knowledge proof (P) that said first entity (100) has used a secret (X100) of this first entity (100) and the character string to obtain said group element (Ci) for each of the pairs of said revocation list (LR). The second entity rejects (F70) said first entity (100) if said zero-knowledge proof (P) is invalid or if, for at least one said pair (hi, k), the group element (Ci) is such that Ci = hiA, where A is a known value.

Patent Information

Applicants

Inventors

Specification

Documents

Application Documents