Authorization and authentication based on an individual's social network
First Claim
Patent Images
1. A method comprising:
- accessing, by one or more computing devices, a graph structure comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising a first-user node corresponding to a first user associated with an online social network and one or more second-user nodes that each correspond to a second user associated with the online social network;
receiving, by one or more of the computing devices, a search query from the first user;
identifying, by one or more of the computing devices, one or more contents corresponding to the search query, each content relating to a second user; and
generating, by one or more of the computing devices, search results comprising a reference to each identified content relating to a second user corresponding to a second-user node that is connected to the first-user node in the graph structure by a series of nodes and edges that does not comprise a node corresponding to a user on a gray list comprising user IDs of the users who are not authorized to access the identified content relating to the second user, wherein the gray list is based on a black list.
1 Assignment
0 Petitions
Accused Products
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 search query from a first user, identifying content of one or more second users corresponding to the search query, and generating search results comprising all the identified content of second users that are connected to the first user in the graph structure through a series of edges and nodes that does not comprise an unauthorized node.
-
Citations
20 Claims
-
1. A method comprising:
-
accessing, by one or more computing devices, a graph structure comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising a first-user node corresponding to a first user associated with an online social network and one or more second-user nodes that each correspond to a second user associated with the online social network; receiving, by one or more of the computing devices, a search query from the first user; identifying, by one or more of the computing devices, one or more contents corresponding to the search query, each content relating to a second user; and generating, by one or more of the computing devices, search results comprising a reference to each identified content relating to a second user corresponding to a second-user node that is connected to the first-user node in the graph structure by a series of nodes and edges that does not comprise a node corresponding to a user on a gray list comprising user IDs of the users who are not authorized to access the identified content relating to the second user, wherein the gray list is based on a black list. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A 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 structure comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising a first-user node corresponding to a first user associated with an online social network and one or more second-user nodes that each correspond to a second user associated with the online social network; receive a search query from the first user; identify one or more contents corresponding to the search query, each content relating to a second user; and generate search results comprising a reference to each identified content relating to a second user corresponding to a second-user node that is connected to the first-user node in the graph structure by a series of nodes and edges that does not comprise a node corresponding to a user on a gray list comprising user IDs of the users who are not authorized to access the identified content relating to the second user, wherein the gray list is based on a black list. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20)
- one or more processors; and
Specification