Abstract: A method for verifying an identity of a user includes (a) receiving a request for an identification phrase from a user associated with a user account; (b) selecting the phrase from a pool of phrases and associating the phrase with the user account; (c) sending the phrase to the user; (d) receiving a video recording showing a person reading one or more phrases aloud, and (e) verifying that a phrase read by the person in the video recording corresponds to the selected phrase. A third party may desire verification of the user's identity. The method confirms to the third party the user's identity based on whether or not the phrase read aloud in the video recording matches the randomly selected phrase associated with the user account.

Abstract: A method for verifying an identity of a user includes (a) receiving a request for an identification phrase from a user associated with a user account; (b) selecting the phrase from a pool of phrases and associating the phrase with the user account; (c) sending the phrase to the user; (d) receiving a video recording showing a person reading one or more phrases aloud, and (e) verifying that a phrase read by the person in the video recording corresponds to the selected phrase. A third party may desire verification of the user's identity. The method confirms to the third party the user's identity based on whether or not the phrase read aloud in the video recording matches the randomly selected phrase associated with the user account.

Abstract: A method and a system allow accessing several of a user's controlled access accounts by presenting the credentials of only one of the accounts. The method may include (a) storing the credentials for each of the user's accounts; (b) receiving from the user credentials corresponding to any of the user's accounts; (c) presenting the received credentials to access the corresponding account; and (d) upon successful access of the corresponding account, using the stored credentials to access one or more of the user's accounts without requiring the user to present the corresponding credentials. For each of the user's accounts, the credentials are stored encrypted, using a randomly generated key, common to all the encrypted credentials. In addition, the randomly generated key is encrypted using the credentials of each of the accounts. In that manner, plain-text copies of neither the random key nor the credentials of the accounts need to be stored.

Abstract: A method for controlling unwelcome communication among a network of users (a) maintains for each user an account to which communication units are credited by the network according to a schedule; and (b) for each user that initiates communication with a respondent user, the network (i) determines whether or not the account of the initiator user holds greater than a predetermined number of communication units; and (ii) when the account is determined to hold greater than the predetermined number of communicating units, deducts from the account of the initiator user the predetermined number of communication units, and allows the initiated communication to proceed.

Abstract: A reliable messaging channel is created using multiple independent HTTP requests. In one embodiment, a method (a) establishes a session identifier by exchanging messages with a recipient using an application layer communication protocol (e.g., HTTP); and (b) uses the application layer communication protocol to send ordered data to the recipient by assigning one or more sequence numbers according to the predetermined order in the data. The session identifier may be generated, for example, using a random number of generator. In one implementation, the session identifier is not less than 96 bits long. The sender may receive from the recipient acknowledgements each acknowledging receipt of the data bearing a corresponding sequence number. Data to be sent in the opposite direction may piggy-back on an acknowledgement by including the data in a non-zero length payload. Data received out of order are queued. The sender may limit the rate at which data is transmitted to a “window size” (i.e.

Abstract: A method automatically and efficiently propagates information using previously established social methods of communication (e.g., email, instant messaging (IM), social network message posting, and short message services). In conjunction with the method, a system collects and disseminates information on a social network. The system includes: (a) a server for providing a user interface (e.g., a user facing web site) which allows a user to exchange information with one or more external services, wherein the information exchange includes receiving a message from the user that the user intends to disseminate through the external services; (b) a message module which prepares the message received from the user for dissemination; and (c) a communication module coupled to the user interface, the message module and the external services to mediate the information exchange between the user and the external services.

Abstract: Methods and apparatus, including computer program products, for identifying Web page content with a granularity finer than individual Web pages, e.g., finer than individual HTML documents. The invention provides a computer-implemented method for identifying Web page content. The method includes receiving a string of markup language source code that includes tags. The method includes identifying sub-sequences in which tags occur in the string. Each sub-sequence is associated with the portion of the string that starts with the first tag of the sub-sequence and ends with the last tag of the sub-sequence. The sub-sequences identified are ones that satisfy criteria for being classified as associated with a portion of the string that define Web page content constituting an entire listing. The criteria includes a requirement that an identified sub-sequence be repeated in tandem, either exactly or approximately, in the string. The method includes returning the identified sub-sequences.

Abstract: A method for identifying friend relationship in one or more on-line social networks includes creating a graph representing friend relationships among multiple participants of the social networks, in which the nodes of the graph represent the participants and each edge of the graph represents an existing friend relationship in the social networks between two of the participants. The resulting graph is then analyzed using, for example, a graph-theoretical technique to identify pairs of nodes that are unconnected in the graph. A score is then assigned between each identified pair of nodes. The score represents the likelihood that the participants corresponding to the identified pair of nodes are real life friends. The score for each identified pair may be computed based on the connectedness of a subgraph of the graph that includes the identified pair of nodes. One example of such a subgraph is a 4-node subgraph.

Abstract: A method and a system allow accessing several of a user's controlled access accounts by presenting the credentials of only one of the accounts. The method may include (a) storing the credentials for each of the user's accounts; (b) receiving from the user credentials corresponding to any of the user's accounts; (c) presenting the received credentials to access the corresponding account; and (d) upon successful access of the corresponding account, using the stored credentials to access one or more of the user's accounts without requiring the user to present the corresponding credentials. For each of the user's accounts, the credentials are stored encrypted, using a randomly generated key, common to all the encrypted credentials. In addition, the randomly generated key is encrypted using the credentials of each of the accounts. In that manner, plain-text copies of neither the random key nor the credentials of the accounts need to be stored.

Abstract: A method is provided for automatically and efficiently propagating information using previously established social methods of communication (e.g., email, instant messaging (IM), social network message posting, and short message services). In conjunction with the method, a system for collecting and disseminating information on a social network is provided, which includes: (a) a server for providing a user interface (e.g., a user facing web site) which allows a user to exchange information with one or more external services, wherein the information exchange includes receiving a message from the user that the user intends to disseminate through the external services; (b) a message module which prepares the message received from the user for dissemination; and (c) a communication module coupled to the user interface, the message module and the external services to mediate the information exchange between the user and the external services.

Abstract: Methods and apparatus, including computer program products, for identifying Web page content with a granularity finer than individual Web pages, e.g., finer than individual HTML documents. The invention provides a computer-implemented method for identifying Web page content. The method includes receiving a string of markup language source code that includes tags. The method includes identifying sub-sequences in which tags occur in the string. Each sub-sequence is associated with the portion of the string that starts with the first tag of the sub-sequence and ends with the last tag of the sub-sequence. The sub-sequences identified are ones that satisfy criteria for being classified as associated with a portion of the string that define Web page content constituting an entire listing. The criteria includes a requirement that an identified sub-sequence be repeated in tandem, either exactly or approximately, in the string. The method includes returning the identified sub-sequences.