Invoking mutual anonymity by electing to become head of a return path

• US 7,167,979 B2
• Filed: 04/03/2002
• Issued: 01/23/2007
• Est. Priority Date: 04/03/2002
• Status: Expired due to Fees

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Xu, Zhichen, Xiao, Li
• Primary Examiner(s): Barron, Jr.; Gilberto
• Assistant Examiner(s): Tran; Tongoc
• Application Number:
  US10/114,071
• Publication Number:
  US 20030191933A1
• Time in Patent Office: 1,756 Days
• Field of Search: 713/163, 713/171, 713/153, 709/203, 709238-242, 709204-205, 709/209, 709/230, 709/201
• US Class Current: 713/153
• CPC Class Codes: H04L 63/0421 Anonymous communication, i.e. the party's identifiers are hidden from the other party or parties, e.g. using an anonymizer
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1068 Discovery involving direct consultation or announcement among potential requesting and potential source peers
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

In a method of invoking mutual anonymity, electing to become a head of a return path in response to receiving a request for information. The information is received at the head of the return path. The information is then forwarded to a peer that transmitted the request.

Claims

1. A method of invoking mutual anonymity, said method comprising:

determining whether to become a head of return path in response to receiving a request for information and based on a shortcut probability used to control a length of the return path;

electing to become the head of the return path;

receiving said information at said head of said return path; and

forwarding said information to a peer that transmitted said request.

2. The method according to claim 1, further comprising:

encrypting said request.

3. The method according to claim 1, further comprising:

reformatting said request message to include an indication of being said head of said return path.

4. The method according to claim 3, further comprising:

selecting a next peer from a plurality of peers; and

transmitting said reformatted request message to said next peer.

5. The method according to claim 3, further comprising:

marking said reformatted request message; and

transmitting said reformatted request message, wherein said marking prevents retransmission of said reformatted request message.

6. The method according to claim 1, further comprising:

receiving an incoming message;

determining a message type for said incoming message; and

comparing said incoming message with previously stored request messages in response to said message type being a retrieval message type.

7. The method according to claim 6, further comprising:

discarding said incoming message in response to said incoming message not matching with any one of said previously stored request messages.

8. The method according to claim 6, further comprising:

matching said incoming message with one of said previously stored request messages;

identifying a returning peer from said one of said previously stored request messages; and

forwarding said incoming message to said returning peer.

9. The method according to claim 1, further comprising:

receiving an incoming message;

determining a message type for said incoming message; and

searching for said information in response to said message typo being a request message type.

10. The method according to claim 9, further comprising:

transmitting said information to a requestor peer, said requestor peer configured to transmit said request message, in response to said information being located.

11. The method according to claim 9, further comprising:

storing said request message in response to said information not being located.

45. The method of claim 1, wherein the shortcut probability is varied based on whether an earlier peer has elected itself to become a head of the return path.

12. A method of increasing privacy, said method comprising:

forwarding a request for information among a plurality of peers;

selecting multiple peers from said plurality of peers as heads of a return path based on a shortcut probability used to control a length of the return path, whereby the shortcut probability is varied based on whether an earlier peer has elected itself to become head of the return path; and

forwarding said information to said multiple peers from another peer containing said information.

13. The method according to claim 12, further comprising:

receiving an incoming message;

determining a message type for said message; and

comparing said incoming message with previously stored requests in response to said message type being a retrieval message type.

14. The method according to claim 13, further comprising:

discarding said incoming message in response to said incoming message not matching with any of said previously stored requests.

15. The method according to claim 13, further comprising:

determining an identified peer from one of said previously stored requests in response to said incoming message matching a previously stored request; and

forwarding said incoming message to said identified peer.

16. The method according to claim 13, further comprising:

storing said incoming message in response to said incoming message not matching any one of said previously stored requests.

17. The method according to claim 13, further comprising:

reformatting said request to include an indication of a status of a peer being one of said heads of said return path.

18. The method according to claim 17, further comprising:

marking said reformatted request; and

broadcasting said reformatted request to said plurality of peers.

19. The method according to claim 17 further comprising:

selecting a next peer, and

transmitting said reformatted request to said next peer.

20. The method according to claim 15, further comprising:

determining a message format of said request; and

reformatting said request to indicate a change in status of a requesting peer.

21. The method according to claim 20, further comprising:

marking said reformatted request; and

broadcasting said reformatted request to said plurality of peers.

22. The method according to claim 20, further comprising:

selecting a next peer; and

transmitting said reformatted request to said next peer.

23. An apparatus for increasing privacy, said apparatus comprising:

means for forwarding a request for information among a plurality of peers;

means for selecting multiple peers from said plurality of peers as heads of a return path based on a shortcut probability used to control a length of the return path,

whereby the shortcut probability is varied based on whether an earlier peer has elected itself to become head of the return path; and

means for forwarding said information to said multiple peers from another peer containing said information.

24. The apparatus according to claim 23, further comprising:

means for receiving an incoming message;

means for determining a message type for said message; and

means for comparing said incoming message with previously stored requests in response to said message type being a retrieval message type.

25. The apparatus according to claim 24, further comprising:

means for discarding said incoming message in response to said incoming message not matching with previously stored requests.

26. The apparatus according to claim 24, further comprising:

means for determining an identified peer from one of said previously stored requests; and

means for forwarding said incoming message to said identified peer.

27. The apparatus according to claim 24, further comprising:

means for storing said incoming message in response to said incoming message not matching any one of said previously stored requests.

28. The apparatus according to claim 23, further comprising:

means for reformatting said request to include an indication of a status of being one of said heads of said return path.

29. The apparatus according to claim 28, further comprising:

means for marking said reformatted request; and

means for broadcasting said reformatted request to said plurality of peers.

30. The apparatus according to claim 28, further comprising:

means for selecting a next peer; and

means for transmitting said reformatted request to said next peer.

31. The apparatus according to claim 26, further comprising:

means for determining a message format of said request; and

means for reformatting said request to indicate a change in status of a requesting peer.

32. The apparatus according to claim 31, further comprising:

means for marking said reformatted request; and

means for broadcasting said reformatted request to said plurality of peers.

33. The apparatus according to claim 31, further comprising:

means for selecting a next peer; and

means for transmitting said reformatted request to said next peer.

34. A system for invoicing mutual anonymity, said system comprising:

a network;

a plurality of peers; and

a peer privacy module configured to be stared and executed on each peer of said plurality of peers, wherein said peer privacy module is configured to forward a request for information among a plurality of peers through said network, to select multiple peer from said plurality of peers as heads of a return path based on a shortcut probability used to control a length of the return path, whereby the shortcut probability is varied based on whether an earlier peer has elected itself to become head of the return path, and to forward said information to said peer from another peer containing said information.

35. The system according to claim 34, further comprising:

a network interface configured to interface with said network on each peer of said plurality of peers, wherein said peer privacy module is configured to receive an incoming message from said network though said network interface, to determine a message type for said message, and to compare said incoming message with previously stored requests in response to said message type being a retrieval message type.

36. The system according to claim 35, wherein said peer privacy module is configured to discard said incoming message in response to said incoming message not matching with previously stored requests.

37. The system according to claim 35, wherein said peer privacy module is further configured to determine an identified peer from one of said previously stored requests and to forward said incoming message to said identified peer.

38. The system according to claim 35, further comprising:

a memory configured to store and access data and to interface with said peer privacy module on each peer of said plurality of peers, wherein said peer privacy module is further configured to store said incoming message in said memory in response to said incoming message not matching any said previously stored requests.

39. The system according to claim 38, wherein said peer privacy module is further configured to elect to become one of the heads of the return path for said information and to reformat said request to indicate the one of the heads of the return path.

40. The system according to claim 39, wherein said peer privacy module is further configured to mark said reformatted request and to broadcast said reformatted request through said network interface to said plurality of peers over said network.

41. The system according to claim 40, wherein said peer privacy module is further configured to select a next peer and to transmit said reformatted request through said network interface to said next peer over said network and the next peer is configured to determine whether the received reformatted request was forwarded from an intermediary node and configured to discard the request if the request was not forwarded from an intermediary node.

42. The system according to claim 37, wherein said peer privacy module is further configured to determine a message format of said request and to reformat said request to indicate a change in status of a requesting peer.

43. The system according to claim 42, wherein said peer privacy module is further configured to mark said reformatted request and to broadcast said reformatted request through said network interface to said plurality of peers over said network.

44. The system according to claim 42, wherein said peer privacy module is further configured to select a next peer and to transmit said reformatted request through said network interface to said next peer over said network.