Abstract: In one embodiment, it is proposed a method for providing information to determine a graph associated with a data item, said graph being representative of a history of said data item in a network, and said graph comprising a set of vertices and a set of edges, each vertex being associated with an electronic device of said network, and each edge linked at least two vertices being representative of a dataflow between said at least two vertices.

Abstract: A method includes: receiving a set of records from a source, wherein each record in the set of records includes a set of tokens, and wherein each record is kept secret from parties other than the source, and evaluating the set of records with a garbled circuit, wherein the output of the garbled circuit is a count based on the set of tokens. An apparatus includes: a processor, that communicates with at least one input/output interface and at least one memory in signal communication with the processor, and wherein the processor is configured to: receive a set of records from a source, wherein each record includes a set of tokens, and wherein each record is kept secret from parties other than the source and evaluate the set of records with a garbled circuit, wherein the output of the garbled circuit is a count based on the set of tokens.

Abstract: A method includes: receiving a first set of records, each record received from a respective user in a first set of users, and including a set of tokens and a set of items, and kept secret from parties other than the respective user, evaluating the first set of records by a recommender system using a first garbled circuit based on matrix factorization to obtain a masked item profile for each of a plurality of items in the first set of records, receiving a recommendation request from a requesting user for a particular item, and transferring the masked item profiles to the requesting user, wherein the requesting user evaluates a second record and the masked item profiles by using a second garbled circuit based on ridge regression to obtain the recommendation about the particular item and only known by the requesting user. An equivalent apparatus is configured to perform the method.

Abstract: A method includes: receiving a set of records, wherein each record in the set of records is received from a respective user and includes a set of tokens and a set of items, and wherein each record is kept secret from parties other than the respective user, receiving a recommendation request from a requesting user for a particular item, evaluating the set of records by using a garbled circuit based on matrix factorization, wherein the output of the garbled circuit includes a masked item profile for a particular item and a masked user profile for the requesting user, receiving an encrypted user profile from the requesting user, generating an encrypted recommendation for the particular item based on the encrypted user profile, and providing the encrypted recommendation to the requesting user, wherein the requesting user decrypts it to obtain the recommendation. An equivalent apparatus is configured to perform the method.

Abstract: A method includes: receiving a set of records from a source, wherein each record in the set of records includes a set of tokens and a set of items, and wherein each record is kept secret from parties other than the source, receiving at least one separate item, and evaluating the set of records and the at least one separate item by using a garbled circuit based on matrix factorization, wherein the output of the garbled circuit includes an item profile for each at least one separate item. An apparatus includes: a processor that communicates with at least one input/output interface, and at least one memory in signal communication with the processor, wherein the processor is configured to perform the method.

Abstract: A methodology to protect private data when a user wishes to publicly release some data about himself, which is can be correlated with his private data. Specifically, the method and apparatus teach comparing public data with survey data having public data and associated private data. A joint probability distribution is performed to predict a private data wherein said prediction has a certain probability. At least one of said public data is altered or deleted in response to said probability exceeding a predetermined threshold.

Abstract: A methodology to protect private data when a user wishes to publicly release some data about himself, which is correlated with his private data. Specifically, the method and apparatus teach combining a plurality of public data into a plurality of data clusters in response to the combined public data having similar attributes. The generated clusters are then processed to predict a private data wherein said prediction has a certain probability. At least one of said public data is altered or deleted in response to said probability exceeding a predetermined threshold.

Abstract: A method and apparatus for protecting user privacy in a recommender system are described including determining what information to release to a user for a movie, transmitting the information to the user, accepting obfuscated input from the user and estimating the user's non-private feature vector. Also described are a method and apparatus for protecting user privacy in a recommender system including receiving movie information, accepting a user's movie feedback, accepting user's private information, calculating an obfuscation value and transmitting the obfuscation value.

Abstract: Methods for determining at least two pre-computed paths to a destination in a communications network are provided. The two paths are maximally disjoint. Maximally disjoint paths are paths where the number of links or nodes common to the two paths is minimized. This minimization is given a priority over other path considerations, such as bandwidth or cost metrics. By pre-computing a maximally disjoint pair of paths, the probability that an inoperable link or node is in both paths is minimized. The probability that the inoperable link or node blocks a transfer of data is minimized. Additionally, a pair of maximally disjoint paths is determined even if absolutely disjoint paths are not possible. The communications network may include at least four nodes, and maximally disjoint pairs of paths are pre-computed from each node to each other node. A third path from each node to each other node may also be computed as a function of bandwidth or a cost metric.

Abstract: Methods for determining at least two pre-computed paths to a destination in a communications network are provided. The two paths are maximally disjoint. Maximally disjoint paths are paths where the number of links or nodes common to the two paths is minimized. This minimization is given a priority over other path considerations, such as bandwidth or cost metrics. By pre-computing a maximally disjoint pair of paths, the probability that an inoperable link or node is in both paths is minimized. The probability that the inoperable link or node blocks a transfer of data is minimized. Additionally, a pair of maximally disjoint paths is determined even if absolutely disjoint paths are not possible. The communications network may include at least four nodes, and maximally disjoint pairs of paths are pre-computed from each node to each other node. A third path from each node to each other node may also be computed as a function of bandwidth or a cost metric.