Communicating an identity of a group shared secret to a server
View Patent ↗An identity is communicated by a client device to a server without requiring the identity to be disclosed to eavesdroppers and without requiring the use of symmetric or asymmetric cryptography. In one example, the identity is an identity of the client device, where the identity has been assigned to the client device by the server through the provisioning of a unique subset of client-identifying keys. In another example, the identity is an identity of a group shared secret that has been provisioned by the server to the client device.
1. A method to be performed by a provisioning server, the method comprising:
assigning to each of L group shared secrets {gss q } its own unique subset of M q of N group shared secret identifying keys;
storing information from which it is determinable which unique subset of M q of the N group shared secret identifying keys was assigned to each group shared secret gss q ;
provisioning one or more client devices {j} by:
assigning to each client device j its own subset of P j of the L group shared secrets {gss q };
providing to each client device j the P j group shared secrets that were assigned thereto; and
for each of the P j group shared secrets assigned to each client device j, providing to the client device j the M q group shared secret identifying keys that were assigned to that group shared secret,
wherein L, P j , N, and M q are positive integers, P j is less than L, and M q is less than N.
2. The method as claimed in claim 1 , wherein the assigning of group shared secret identifying keys to group shared secrets {gss q } is performed in a random or pseudo-random or quasi-random or arbitrary fashion and the stored information comprises records of which M q of the N group shared secret identifying keys were assigned to each group shared secret gss q .
3. The method as claimed in claim 1 , wherein the assigning of group shared secret identifying keys to group shared secrets {gss q } is performed according to an algorithm and the stored information comprises the algorithm or an inverse thereof.
4. The method as claimed in claim 1 , further comprising:
making the stored information accessible to another server that is configurable to receive a message purporting to identify any of the group shared secrets {gss q }.
5. The method as claimed in claim 1 , wherein the subset of P j group shared secrets is unique to each client device j.
6. A provisioning server comprising:
a processing device; and
a computer-readable medium storing code which, when executed by the processing device, causes the provisioning server:
to assign to each of L group shared secrets {gss q } its own unique subset of M q of N group shared secret identifying keys;
to store information from which it is determinable which unique subset of M q of the N group shared secret identifying keys was assigned to each group shared secret gss q ; and
to provision one or more client devices {j} by:
assigning to each client device j its own subset of P j of the L group shared secrets {gss q };
providing to each client device j the P j group shared secrets that were assigned thereto; and
for each of the P j group shared secrets assigned to each client device j, providing to the client device j the M q group shared secret identifying keys that were assigned to that group shared secret,
wherein L, P j , N, and M q are positive integers, P j is less than L, and M q is less than N.
7. The provisioning server as claimed in claim 6 , wherein the assigning of group shared secret identifying keys to group shared secrets {gss q } is performed in a random or pseudo-random or quasi-random or arbitrary fashion and the stored information comprises records of which M q of the N group shared secret identifying keys were assigned to each group shared secret gss q .
8. The provisioning server as claimed in claim 6 , wherein the assigning of group shared secret identifying keys to group shared secrets {gss q } is performed according to an algorithm and the stored information comprises the algorithm or an inverse thereof.
9. The provisioning server as claimed in claim 6 , wherein the stored information is accessible to another server that is configurable to receive a message purporting to identify any of the client devices {j}.
10. The provisioning server as claimed in claim 6 , wherein the subset of P j group shared secrets is unique to each client device j.
11. A non-transitory computer-readable medium storing code which, when executed by a processor of a provisioning server, causes the provisioning server:
to assign to each of L group shared secrets {gss q } its own unique subset of M q of N group shared secret identifying keys;
to store information from which it is determinable which unique subset of M q of the N group shared secret identifying keys was assigned to each group shared secret gss q ; and
to provision one or more client devices {j} by:
assigning to each client device j its own subset of P j of the L group shared secrets {gss q };
providing to each client device j the P j group shared secrets that were assigned thereto; and
for each of the P j group shared secrets assigned to each client device j, providing to the client device j the M q group shared secret identifying keys that were assigned to that group shared secret,
wherein L, P j , N, and M q are positive integers, P j is less than L, and M q is less than N.