Authorization and authentication based on an individual's social network

• US 9,589,023 B2
• Filed: 05/18/2015
• Issued: 03/07/2017
• Est. Priority Date: 07/22/2004
• Status: Active Grant

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Inventors: Lunt, Christopher
• Primary Examiner(s): Smithers, Matthew
• Application Number:
  US14/715,266
• Publication Number:
  US 20150249655A1
• Time in Patent Office: 659 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24575 using context
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 21/31 User authentication
• CPC Class Codes: G06F 21/604 Tools and structures for managing or administering access control systems
• CPC Class Codes: G06Q 50/01 Social networking
• CPC Class Codes: H04L 51/04 Real-time or near real-time messaging, e.g. instant messaging [IM]
• CPC Class Codes: H04L 51/212 using filtering or selective blocking
• CPC Class Codes: H04L 51/52 for supporting social networking services
• CPC Class Codes: H04L 63/08 for authentication of entities cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32
• CPC Class Codes: H04L 63/10 for controlling access to devices or network resources
• CPC Class Codes: H04L 63/101 Access control lists [ACL]
• CPC Class Codes: H04L 63/145 the attack involving the propagation of malware through the network, e.g. viruses, trojans or worms
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/306 User profiles
• CPC Class Codes: H04L 67/60 Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources admission control or resource allocation H04L47/70

Abstract

In particular embodiments, a method includes accessing a graph data structure comprising a plurality of nodes and a plurality of edges connecting the nodes, receiving, a request to send content relating to the first user to the second user, and prohibiting sending of the content to the second user if the node corresponding to the first user and the second user are connected to each other in the graph data structure through a series of edges and nodes that comprises an unauthorized node.

Claims

1. A method comprising:

accessing, by one or more of the computing devices, a graph data structure comprising a plurality of nodes and a plurality of edges connecting the nodes, the nodes comprising a first node corresponding to a first user associated with an online social network and a second node corresponding to a second user associated with the online social network;

receiving, by one or more of the computing devices, a request to send content relating to the first user to the second user; and

prohibiting, by one or more of the computing devices, sending of the content to the second user if the first node and the second node are connected to each other in the graph data structure through a series of edges and nodes that comprises an unauthorized node.

2. The method of claim 1, wherein the unauthorized node is identified in a gray list, the gray list being based on a black list.

3. The method of claim 1, further comprising:

identifying, by one or more of the computing devices, one or more series of edges and nodes connecting the first node and the second node; and

determining, by one or more of the computing devices, for each series of edges and nodes connecting the first node and the second node, whether the series comprises an unauthorized node.

4. The method of claim 1, wherein all nodes in the graph data structure that are separated from the first node by more than a threshold degree of separation are unauthorized nodes.

5. The method of claim 1, further comprising:

accessing, by one or more of the computing devices, a black list comprising a first set of user IDs of a first set of users;

wherein each node corresponding to a user in the first set of users is an unauthorized node.

6. The method of claim 5, wherein each node separated by only one degree of separation in the graph data structure from at least one node corresponding to a user in the first set of users is an unauthorized node.

7. The method of claim 5, wherein each node separated by a threshold degree of separation in the graph data structure from at least one node corresponding to a user in the first set of users is an unauthorized node.

8. The method of claim 5, further comprising:

determining, by one or more of the computing devices, an authorized-users list comprising a second set of user IDs of a second set of users, the nodes corresponding to each of the users in the second set of users being separated in the graph data structure from at least one of the nodes corresponding to the users in the first set of users by a threshold degree of separation;

wherein each node corresponding to a user in the second set of users is an unauthorized node.

9. The method of claim 8, wherein the authorized-users list is a gray list.

10. The method of claim 8, wherein the threshold degree of separation is one, two, three, or all.

11. The method of claim 5, wherein the black list is maintained for either for first user or the second user.

12. The method of claim 1, wherein the content relating to the first user comprises an e-mail communication from the first user.

13. The method of claim 1, wherein the content relating to the first user comprises profile information of the first user.

14. The method of claim 1, wherein the content relating to the first user comprises content posted by the first user.

15. The method of claim 1, further comprising:

authorizing, by one or more of the computing devices, sending of the content to the second user if the first node and the second node are connected to each other in the graph data structure through a series of edges and nodes that comprises only authorized nodes.

16. The method of claim 15, wherein all nodes in the graph data structure that are separated from the first node by no more than a threshold degree of separation are authorized nodes.

17. The method of claim 15, further comprising:

accessing, by one or more of the computing devices, a white list comprising a third set of user IDs of a third set of users;

wherein each node corresponding to a user in the third set of users is an authorized node.

18. The method of claim 1, wherein each of the edges between two of the nodes represents a single degree of separation between them.

19. A service provider system comprising:

one or more processors; and

one or more servers having a memory storing computer-executable instructions that when executed by one or more of the processors cause the processors to;

access a graph data structure comprising a plurality of nodes and a plurality of edges connecting the nodes, the nodes comprising a first node corresponding to a first user associated with an online social network and a second node corresponding to a second user associated with the online social network;

receive a request to send content relating to the first user to the second user; and

prohibit sending of the content to the second user if the first node and the second node are connected to each other in the graph data structure through a series of edges and nodes that comprises an unauthorized node.