Method and apparatus for optimizing networking potential using a secured system for an online community

• US 7,761,383 B2
• Filed: 12/13/2005
• Issued: 07/20/2010
• Est. Priority Date: 07/13/2000
• Status: Expired due to Fees

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Amit Jaipuria, Pradeep Jaipuria
• Inventors: Jaipuria, Pradeep, Jaipuria, Amit
• Primary Examiner(s): Hewitt, II; Calvin Loyd
• Assistant Examiner(s): SHERR, CRISTINA O
• Application Number:
  US11/299,959
• Publication Number:
  US 20060089913A1
• Time in Patent Office: 1,680 Days
• Field of Search: 705/1, 705 51- 59, 705/39, 705/44, 705/74, 235380-383
• US Class Current: 705/57
• CPC Class Codes: G06F 21/6218 to a system of files or objects, e.g. local or distributed file system or database
• CPC Class Codes: G06Q 20/10 specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
• CPC Class Codes: G06Q 20/383 Anonymous user system
• CPC Class Codes: G06Q 20/40 Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
• CPC Class Codes: H04L 63/105 Multiple levels of security
• CPC Class Codes: Y10S 707/99939 Privileged access

Abstract

The present invention provides a method and apparatus for users to search networks, both their own network and their peers'"'"' networks, all under the umbrella of a “multiple level access” security system. The present invention has been designed to optimize networking capabilities among users in a comprehensive online community. Networking among such a secured environment will allow users an opportunity to enhance their networking potential by expanding their networks to their peers'"'"' and beyond. A user registers with the online community and personally adds individuals that they know to their personal networking database. While adding these peers to the networking database, the user grants a specific level of access to each individual. This security measure is devised to discourage solicitation from other unwanted online users. The levels of access give the user an opportunity to control the amount of personal information, including contacts that they make, available to their individual peers. Based on the level of access granted by the user, the peer may or may not be able to access the user'"'"'s information or the user'"'"'s personal databases for potential networking. The level of access granted by two individuals need not be the same for each other.

Claims

1. A computer-implemented method of social networking with contacts of people within groups or companies comprising the steps of:

storing, on a server, a social network database comprised of different companies and/or groups to facilitate social networking;

geographically segmenting, by a server controller at the social network database, the companies and/or groups;

categorizing, by the server controller at the social network database, the companies and/or groups by industry;

categorizing, by the server controller at the social network database, the companies and/or groups by services provided;

categorizing, by the server controller at the social network database, the companies and/or groups by products made;

categorizing, by the server controller at the social network database, the companies and/or groups by expertise;

assigning, by the server controller at the social network database, one or more keywords to each category;

searching by the server controller the social network database using the one or more keywords for one or more companies and/or groups having criteria matching a specific requirement;

further searching by the server controller the social network database to identify one or more contacts, in the social network database, associated with the companies and/or groups found in a search result, wherein the one or more contacts are associated with the searcher;

creating, by the server controller, a hierarchical chain between a searcher and each contact found during the search;

assigning, by the server controller, a multibridge linking code to each link in the hierarchical chain between the server and each contact found during the search a the social network database that has criteria matching the specific data requirement;

creating, by the server controller, a key comprising all of the multibridge linking codes that have been assigned during the search;

passing, by the server controller, the key to a computing device of at least one of the contacts in the hierarchical chain;

determining, by a controller of the computing device of the at least one contact, whether to forward the key to a computing device of a next sequential contact in the hierarchical chain based on an indication to forward the key received by the controller of the computing device from the contact; and

forwarding, by the controller, the key to the computing device of the next sequential contact in the hierarchical chain based on the determination to forward the key.

3. The method of claim 1, wherein each contact in the hierarchical chain conveys or denies access to their information by not providing an indication to forward the key to contact a subsequent contact.

4. The method of claim 1, wherein the key is time-bound.

5. The method of claim 1, wherein the key is at least one of alphanumeric, symbols and icons.

6. The method of claim 1, wherein the key is randomly assigned.

2. A computer-implemented method of social networking with contacts of people within groups or companies comprising the steps of:

storing on a server a social network database comprised of at least one of different companies or groups to facilitate social networking;

geographically, by a server controller at the social network database, segmenting the at least one company or group;

categorizing, by the server controller at the social network database, the at least one company or group by industry;

categorizing, by the server controller at the social network database, the at least one company or group by services provided;

categorizing, by the server controller at the social network database, the at least one company or group by products made;

categorizing, by the server controller at the social network database, the at least one company or group by expertise;

assigning, by the server controller at the social network database, one or more keywords to each category;

searching by the server controller the social network database using the one or more keywords for one or more companies or groups having criteria matching a specific requirement;

further searching by the server controller the social network database to identify one or more contacts, in the social network database, associated with the companies or groups found in a search result, wherein the one or more contacts are associated with the searcher;

creating, by the server controller, a hierarchical chain between a searcher and each contact found during the search;

assigning, by the server controller, a multibridge linking code to each link in the hierarchical chain between the searcher and each contact found during the search that has criteria matching the specific data requirement;

creating, by the server controller, a key comprising all of the multibridge linking codes that have been assigned during the search;

passing, by the server controller, the key to a computing device of at least one of the contacts in the hierarchical chain;

determining, by a controller of the computing device of the at least one contact, whether to forward the key to a computing device of a next sequential contact in the hierarchical chain based on an indication to forward the key by the controller of the computing device from the contact; and

forwarding, by the controller, the key to the computing device of the next sequential contact in the hierarchical chain based on the determination to forward the key.

7. The method of claim 2, wherein the multibridge linking code is assigned to each contact found during the search that has criteria matching the specific data requirement.

8. The method of claim 2, wherein each contact in the hierarchical chain conveys access to the information of the subsequent contact by providing the indication to forward the key or denies access to the information by not providing an indication to forward the key to contact a subsequent contact.

9. The method of claim 2, wherein the key is time-bound.

10. The method of claim 2, wherein the key is at least one of alphanumeric, symbols and icons.

11. The method of claim 2, wherein the key is randomly assigned.