Authorization and authentication based on an individual's social network
First Claim
1. A method comprising:
- receiving, by one or more computing devices, a request to transmit to a first user content relating to a second user, each of the users having a user identifier (ID);
retrieving, by one or more of the computing devices, a black list maintained for the second user, the black list comprising a first set of user IDs of a first set users;
accessing, by one or more of the computing devices, a graph structure defining relationships among a plurality of users, the graph structure comprising a plurality of nodes and connections between the nodes, each node corresponding to one of the users, each connection between two nodes being a single degree of separation between the two users corresponding to the two nodes;
determining, by one or more of the computing devices, a gray list comprising a second set of user IDs of a second set of users based on the relationships defined by the graph structure, each of the users in the second set of users being separated in the graph structure from at least one of the users in the first set of users of the black list by only one degree of separation; and
authorizing, by one or more of the computing devices, the transmission of the content to the first user if the nodes corresponding to the first and second users are connected to each other in the graph structure by a series of connections and nodes that does not comprise a node corresponding to a user in the second set of users of the gray list.
3 Assignments
0 Petitions
Accused Products
Abstract
An individual'"'"'s social network is used to authorize information flow to the individual and to authenticate the individual for access to certain information or services. Information flow to the individual is authorized if the source of the information is a member of the individual'"'"'s social network who is connected to the individual along a path that does not traverse through anyone on a gray list of the individual. The black list identifies those members who previously sent unwanted communication to the individual or posted content that was deemed offensive by the individual. The gray list identifies those members who are one degree separated from any black list member. The individual is authenticated for access to certain information or services if a member of the individual'"'"'s social network already has access and this member is connected to the individual along a path that does not traverse through anyone on a gray list of the individual, or if members of the individual'"'"'s social network who are connected to the individual along a path that does not traverse through anyone on a gray list of the individual have an average authentication rating that is at least a minimum value.
-
Citations
20 Claims
-
1. A method comprising:
-
receiving, by one or more computing devices, a request to transmit to a first user content relating to a second user, each of the users having a user identifier (ID); retrieving, by one or more of the computing devices, a black list maintained for the second user, the black list comprising a first set of user IDs of a first set users; accessing, by one or more of the computing devices, a graph structure defining relationships among a plurality of users, the graph structure comprising a plurality of nodes and connections between the nodes, each node corresponding to one of the users, each connection between two nodes being a single degree of separation between the two users corresponding to the two nodes; determining, by one or more of the computing devices, a gray list comprising a second set of user IDs of a second set of users based on the relationships defined by the graph structure, each of the users in the second set of users being separated in the graph structure from at least one of the users in the first set of users of the black list by only one degree of separation; and authorizing, by one or more of the computing devices, the transmission of the content to the first user if the nodes corresponding to the first and second users are connected to each other in the graph structure by a series of connections and nodes that does not comprise a node corresponding to a user in the second set of users of the gray list. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A system comprising:
-
one or more processors; and a memory storing instructions that when executed by one or more of the processors cause the processors to; receive a request to transmit to a first user content relating to a second user, each of the users having a user identifier (ID); retrieve a black list maintained for the second user, the black list comprising a first set of user IDs of a first set of users; access a graph structure defining relationships among a plurality of users, the graph structure comprising a plurality of nodes and connections between the nodes, each node corresponding to one of the users, each connection between two nodes being a single degree of separation between the two users corresponding to the two nodes; determine a gray list comprising a second set of user IDs of a second set of users based on the relationships defined by the graph structure, each of the users in the second set of users being separated in the graph structure from at least one of the users in the first set of users of the black list by only one degree of separation; and authorize the transmission of the content to the first user if the nodes corresponding to the first and second users are connected to each other in the graph structure by a series of connections and nodes that does not comprise a node corresponding to one of the users in the second set of users of the gray list. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification