Authorization and authentication based on an individual's social network

• US 9,100,400 B2
• Filed: 08/02/2012
• Issued: 08/04/2015
• Est. Priority Date: 07/22/2004
• Status: Expired due to Term

• 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): Shiferaw, Eleni
• Assistant Examiner(s): BROWN, DE'MARIS R
• Application Number:
  US13/565,500
• Publication Number:
  US 20120311680A1
• Time in Patent Office: 1,097 Days
• Field of Search: None
• 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 structure comprising a plurality of nodes and edges where each node represents a user, receiving a request to transmit content related to a first user to a second user, and prohibiting transmission of the content to the second user if the first user and the second user are connected in the graph structure through a series of edges and nodes that comprises an unauthorized node.

Claims

1. A method comprising:

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

accessing, by the one or more computing devices, a graph structure comprising a plurality of nodes and a plurality of edges connecting the nodes, wherein;

each edge connects two nodes and represents a single degree of separation between them;

a first node corresponds to the first user; and

a second node corresponds to the second user;

determining, by the one or more computing devices, whether the first and second nodes are connected to each other in the graph structure through a path that comprises one or more unauthorized nodes identified in a gray list, the gray list being based on a black list; and

prohibiting, by the one or more computing devices, the content from being sent to the first user if the first and second user nodes are connected to each other in the graph structure through a path that comprises at least one unauthorized node identified in the gray list.

2. The method of claim 1 wherein:

the first and second nodes are connected to each other through a plurality of paths; and

the content is prohibited from being sent if any of the paths comprises an unauthorized node.

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

4. The method of claim 1, wherein determining whether the first and second nodes are connected to each other in the graph structure through a path that comprises an unauthorized node comprises accessing the 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.

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

6. The method of claim 4, wherein each node separated by a threshold degree of separation in the graph 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 4, wherein:

determining whether the first and second nodes are connected to each other in the graph structure through a path that comprises an unauthorized node further comprises accessing the gray 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 are separated in the graph structure from at least one of the nodes corresponding to the users in the first set of users by a threshold degree of separation;

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

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

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

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

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

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

13. The method of claim 1, further comprising:

determining, by one or more computing devices, whether the first and second nodes are connected to each other in the graph structure through a path that comprises only authorized nodes; and

authorizing, by one or more computing devices, the content to be sent to the first user instead of prohibiting it if the first and second nodes are connected to each other in the graph structure through a path that comprises only authorized nodes.

14. The method of claim 13, wherein all nodes in the graph structure that are separated from the second node by no more than a threshold degree of separation are authorized nodes.

15. The method of claim 13, wherein determining whether the first and second nodes are connected to each other in the graph structure through a path that comprises only authorized nodes comprises accessing 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.

16. A system comprising:

one or more processors; and

one or more computer-readable non-transitory storage media embodying software that is executed by one or more of the processors to;

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

access a graph structure comprising a plurality of nodes and a plurality of edges connecting the nodes, wherein;

each edge connects two nodes and represents a single degree of separation between them;

a first node corresponds to the first user; and

a second node corresponds to the second user;

determine whether the first and second nodes are connected to each other in the graph structure through a path that comprises one or more unauthorized nodes identified in a gray list, the gray list being based on a black list; and

prohibit the content from being sent to the first user if the first and second user nodes are connected to each other in the graph structure through a path that comprises at least one unauthorized node identified in the gray list.