Peer to peer identifiers

• US 9,838,365 B2
• Filed: 06/27/2008
• Issued: 12/05/2017
• Est. Priority Date: 07/10/2007
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Park, Vincent D., Laroia, Rajiv, Li, Junyi
• Primary Examiner(s): Davis, Zachary A
• Application Number:
  US12/147,967
• Publication Number:
  US 20090016524A1
• Time in Patent Office: 3,448 Days
• Field of Search: 380 44, 380277, 380278, 380283, 713168, 713171, 709223, 709225, 709227, 709228, 370310, 370312
• 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 by a user equipment (UE), comprising:

generating, by the UE, a plurality of different keys associated with a first identifier;

communicating, by the UE, the first identifier and at least one key of the plurality of different keys to a first peer device of a plurality of peer devices, the at least one key facilitating the first peer device to determine an association between the first identifier and a second identifier used for peer discovery, wherein the at least one key is derived as a function of the first identifier and information that is related to at least one of a time period or a geographical location;

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

advertising, by the UE, the second identifier to the plurality of peer devices for peer discovery after communicating the first identifier.

2. The method of claim 1, wherein each of the plurality of different keys including the at least one key is associated with a parameter that comprises a validity period or a geographic region.

3. The method of claim 1, wherein the plurality of different 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 comprising communicating, by the UE, the first identifier and at least a second key of the plurality of different keys to a second peer device, wherein the second key is different than the at least one key.

6. The method of claim 1, wherein the second identifier is derived as a function of the first identifier and at least two different keys of the plurality of different 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, by the UE, a third identifier as a function of the first identifier and at least a second key of the plurality of different keys; and

invalidating, by the UE, the second identifier.

9. An apparatus, comprising:

a memory retaining instructions for generating a plurality of different keys associated with a first identifier;

communicating the first identifier and at least one key of the plurality of different keys to a first peer node of a plurality of peer nodes, the at least one key facilitating the first peer node to determine an association between the first identifier and a second identifier used for peer discovery, wherein the at least one key is a function of the first identifier and information that is related to at least one of a time period or a geographical location;

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

advertising the second identifier to the plurality of peer nodes for peer discovery after communicating the first identifier; and

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

10. The apparatus of claim 9, wherein each of the plurality of different keys including the at least one key is associated with a parameter that comprises a validity period or a geographic region.

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

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

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

14. The apparatus of claim 9, wherein 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 different keys and invalidating the second identifier.

15. The 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 different keys associated with a first identifier;

means for conveying the first identifier and at least one key of the plurality of different keys to a first peer node of a plurality of peer nodes, the at least one key facilitating the first peer node to determine an association between the first identifier and a second identifier used for peer discovery, wherein the at least one key is derived as a function of the first identifier and information that is related to at least one of a time period or a geographical location;

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

means for advertising the second identifier to the plurality of peer nodes for peer discovery after conveying the first identifier.

17. The apparatus of claim 16, wherein each of the plurality of different keys including the at least one key is associated with a parameter that comprises a validity period or a geographic region.

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

19. A computer program product, comprising a non-transitory computer readable medium for storing instructions that, when executed by a processor, cause the processor to:

generate a plurality of different keys associated with a first identifier;

communicate the first identifier and at least one key of the plurality of different keys to a first peer node of a plurality of peer nodes, the at least one key facilitating the first peer node to determine an association between the first identifier and a second identifier used for peer discovery, wherein the at least one key is derived as a function of the first identifier and information that is related to at least one of a time period or a geographical location;

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

advertise the second identifier to the plurality of peer nodes for peer discovery after communicating the first identifier, wherein the at least one key of the plurality of different keys is associated with a parameter that comprises a validity period or a geographic region.

20. The computer program product of claim 19, wherein the non-transitory computer readable medium further stores instructions that cause the processor to:

communicate the first identifier and at least a second key of the plurality of different keys to a second peer node,

wherein the second key is different than the at least one key.

21. An apparatus for use in transmitting peer discovery information, comprising:

a memory; and

at least one processor coupled to the memory and configured to;

create a plurality of different keys associated with a first identifier;

communicate the first identifier and at least one key of the plurality of different keys to a first peer node of a plurality of peer nodes, the at least one key facilitating the first peer node to determine an association between the first identifier and a second identifier used for peer discovery, wherein the at least one key is derived as a function of the first identifier and information that is related to at least one of a time period or a geographical location;

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

advertise the second identifier to the plurality of peer nodes for peer discovery after communicating the first identifier.