PEER TO PEER IDENTIFIERS

• US 20090016524A1
• Filed: 06/27/2008
• Published: 01/15/2009
• Est. Priority Date: 07/10/2007
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Loroia, Rajiv, Park, Vincent D., Li, Junyi
• Granted Patent: US 9,838,365 B2
• Time in Patent Office: Days
• US Class Current: 380/44
• CPC Class Codes: H04L 63/061 for key exchange, e.g. in peer-to-peer networks cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838
• CPC Class Codes: H04L 63/0846 using time-dependent-passwords, e.g. periodically changing passwords
• CPC Class Codes: H04L 63/0876 based on the identity of the terminal or configuration, e.g. MAC address, hardware or software configuration or device fingerprint
• CPC Class Codes: H04L 9/0866 involving user or device identifiers, e.g. serial number, physical or biometrical information, DNA, hand-signature or measurable physical characteristics
• CPC Class Codes: H04L 9/0872 using geo-location information, e.g. location data, time, relative position or proximity to other entities
• CPC Class Codes: H04W 12/041 Key generation or derivation
• CPC Class Codes: H04W 12/0431 Key distribution or pre-distribution; Key agreement
• CPC Class Codes: H04W 12/0433 Key management protocols
• CPC Class Codes: H04W 48/08 Access restriction or access information delivery, e.g. discovery data delivery signalling during connection H04W76/00
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support
• CPC Class Codes: H04W 92/18 between terminal devices

Abstract

In an ad hoc peer-to-peer type network during peer discovery, information relating to users of various devices is broadcast to other devices in the network, which can compromise privacy of the users. Instead of announcing a public identifier that might be known by a multitude of individuals, the user device announces a private identifier that might be known to, or determined by, a select few individuals. The individuals selected can be given a key to determine the private identifier associated with a public identifier, or vice versa, wherein that key can have a validity range or a period of time, after which the key expires. Prior to the expiration of the key, the selected individuals, through their respective devices, can detect a corresponding user and/or device by the current private identifier being announced, thus mitigating the number of people that are aware of the user'"'"'s presence.

Claims

1. A method for transmitting peer discovery information, comprising:

generating a plurality of keys associated with a first identifier;

communicating the first identifier and at least one key of the plurality of keys to a first peer node;

deriving a second identifier as a function of the first identifier and the at least one key of the plurality of keys; and

advertising the second identifier to a plurality of peer nodes.

2. The method of claim 1, wherein the at least one key of the plurality of keys is associated with a validity period, a geographic region, or combinations thereof.

3. The method of claim 1, wherein the plurality of keys comprises a hierarchy.

4. The method of claim 1, wherein the first identifier and the at least one key are communicated in a secure manner.

5. The method of claim 1, further comprises communicating the first identifier and at least a second key of the plurality of keys to a second peer node.

6. The method of claim 1, wherein the second identifier is derived as a function of the first identifier and at least two keys of the plurality of keys.

7. The method of claim 1, wherein the first identifier is a public identifier and the second identifier is a private identifier.

8. The method of claim 1, further comprising:

generating a third identifier as a function of the first identifier and at least a second key of the plurality of keys; and

invalidating the second identifier.

9. A wireless communications apparatus, comprising:

a memory that retains instructions related to generating a plurality of keys associated with a first identifier, communicating the first identifier and at least one key of the plurality of keys to a first peer node, deriving a second identifier as a function of the first identifier and the at least one key of the plurality of keys, and advertising the second identifier to a plurality of peer nodes; and

a processor, coupled to the memory, configured to execute the instructions retained in the memory.

10. The wireless communications apparatus of claim 9, wherein the at least one key of the plurality of keys is associated with a validity period, a geographic region, or combinations thereof.

11. The wireless communications apparatus of claim 9, wherein the plurality of keys comprises a hierarchy.

12. The wireless communications apparatus of claim 9, the memory further retains instructions related to communicating the first identifier and at least a second key of the plurality of keys to a second peer node.

13. The wireless communications apparatus of claim 9, wherein the second identifier is derived as a function of the first identifier and at least two keys of the plurality of keys.

14. The wireless communications apparatus of claim 9, the memory further retains instructions related to generating a third identifier as a function of the first identifier and at least a second key of the plurality of keys and invalidating the second identifier.

15. The wireless communications apparatus of claim 9, wherein the first identifier is a public identifier and the second identifier is a private identifier.

16. An apparatus, comprising:

means for creating a plurality of keys associated with a first identifier;

means for conveying the first identifier and at least one key of the plurality of keys to a first peer node;

means for deriving a second identifier as a function of the first identifier and the at least one key of the plurality of keys; and

means for advertising the second identifier to a plurality of peer nodes.

17. The apparatus of claim 16, wherein the at least one key of the plurality of keys is associated with a validity period, a geographic region, or combinations thereof.

18. The apparatus of claim 16, wherein the second identifier is derived as a function of the first identifier and at least two keys of the plurality of keys.

19. A computer program product, comprising:

a computer-readable medium comprising;

a first set of codes for causing a computer to generate a plurality of keys associated with a first identifier;

a second set of codes for causing the computer to communicate the first identifier and at least one key of the plurality of keys to a first peer node;

a third set of codes for causing the computer to derive a second identifier as a function of the first identifier and the at least one key of the plurality of keys; and

a fourth set of codes for causing the computer to advertise the second identifier to a plurality of peer nodes, wherein the at least one key of the plurality of keys is associated with a validity period, a geographic region, or combinations thereof.

20. The computer program product of claim 19, further comprising:

a fifth set of codes for causing the computer to communicate the first identifier and at least a second key of the plurality of keys to a second peer node.

21. At least one processor configured to transmit peer discovery information, comprising:

a first module for creating a plurality of keys associated with a first identifier;

a second module for communicating the first identifier and at least one key of the plurality of keys to a first peer node;

a third module for deriving a second identifier as a function of the first identifier and the at least one key of the plurality of keys; and

a fourth module for advertising the second identifier to a plurality of peer nodes.

22. A method for receiving peer discovery information, comprising:

receiving a first identifier and at least one key associated with a peer node;

determining a second identifier based at least in part on the first identifier and the at least one key; and

monitoring for receipt of the second identifier.

23. The method of claim 22, wherein the second identifier is determined based at least in part on time, in part on location, or combinations thereof.

24. The method of claim 22, wherein determining the second identifier comprises generating at least one additional key that is associated with a specific validity period, geographic region, or combinations thereof.

25. The method of claim 24, wherein the at least one additional key forms a hierarchy.

26. The method of claim 22, further comprising:

invaliding the second identifier; and

deriving a third identifier as a function of the first identifier and at least a second key of the plurality of keys.

27. The method of claim 22, wherein the monitoring for receipt of the second identifier comprises:

receiving an identifier advertised by a nearby node; and

ascertaining if the received identifier is the determined second identifier.

28. The method of claim 22, wherein the first identifier is a public identifier and the second identifier is a private identifier.

29. A wireless communications apparatus, comprising:

a memory that retains instructions related to receiving a first identifier and at least one key associated with a peer node, determining a second identifier based at least in part on the first identifier and the at least one key, and monitoring for receipt of the second identifier; and

a processor, coupled to the memory, configured to execute the instructions retained in the memory

30. The wireless communications apparatus of claim 29, wherein the second identifier is determined based at least in part on time, in part on location, or combinations thereof.

31. The wireless communications apparatus of claim 29, wherein determining the second identifier comprises generating at least one additional key that is associated with a specific validity period, geographic region, or combinations thereof.

32. The wireless communications apparatus of claim 29, the memory further retains instructions related to invaliding the second identifier and deriving a third identifier as a function of the first identifier and at least a second key of the plurality of keys.

33. The wireless communications apparatus of claim 29, wherein the memory further retains instructions related to receiving an identifier advertised by a nearby node and ascertaining if the received identifier is the determined second identifier.

34. The wireless communications apparatus of claim 29, wherein the first identifier is a public identifier and the second identifier is a private identifier.

35. An apparatus, comprising:

means for receiving a first identifier and at least one key associated with a peer node;

means for determining a second identifier based at least in part on the first identifier and the at least one key; and

means for monitoring for receipt of the second identifier.

36. The apparatus of claim 35, wherein the second identifier is determined based at least in part on time, in part on location, or combinations thereof.

37. The apparatus of claim 35, wherein determining the second identifier comprises generating at least one additional key that is associated with a specific validity period, geographic region, or combinations thereof.

38. A computer program product, comprising:

a computer-readable medium comprising;

a first set of codes for causing a computer to receive a first identifier and at least one key associated with a peer node;

a second set of codes for causing the computer to determine a second identifier based at least in part on the first identifier and the at least one key; and

a third set of codes for causing the computer to monitor for receipt of the second identifier.

39. The computer program product of claim 38, the computer-readable medium further comprising:

a fourth set of codes for causing the computer to receive an identifier advertised by a nearby node; and

a fifth set of codes for causing the computer to determine if the received identifier is the determined second identifier.

40. At least one processor configured to transmit peer discovery information, comprising:

a first module for receiving a first identifier and at least one key associated with a peer node;

a second module for determining a second identifier based at least in part on the first identifier and the at least one key;

a third module for monitoring for receipt of the second identifier;

a fourth module for receiving an identifier advertised by a nearby node; and

a fifth module for ascertaining if the received identifier is the determined second identifier.