DATA ALLOCATION BASED ON SECURE INFORMATION RETRIEVAL

    公开(公告)号:US20180322304A1

    公开(公告)日:2018-11-08

    申请号:US15774708

    申请日:2015-11-10

    CPC classification number: G06F21/6227 G06F16/2455 G06F16/24578 G06F21/62

    Abstract: Data allocation based on secure information retrieval is disclosed. One example is a system including an information processor communicatively linked to a query processor and a plurality of data processors respectively associated with a plurality of datasets. The information processor receives a request from the query processor for identification of a target dataset to be associated with a query term. The information processor generates a random permutation, and receives a secure version of the query term from the query processor, and receives secure versions of a collection of candidate terms from each of a plurality of data processors, each candidate term representing a cluster of similar terms in the associated dataset. The information processor determines similarity scores between the secure version of the query term and secure versions of the candidate terms, and identifies the target dataset of the plurality of datasets based on the determined similarity scores.

    Data allocation based on secure information retrieval

    公开(公告)号:US10783268B2

    公开(公告)日:2020-09-22

    申请号:US15774708

    申请日:2015-11-10

    Abstract: Data allocation based on secure information retrieval is disclosed. One example is a system including an information processor communicatively linked to a query processor and a plurality of data processors respectively associated with a plurality of datasets. The information processor receives a request from the query processor for identification of a target dataset to be associated with a query term. The information processor generates a random permutation, and receives a secure version of the query term from the query processor, and receives secure versions of a collection of candidate terms from each of a plurality of data processors, each candidate term representing a cluster of similar terms in the associated dataset. The information processor determines similarity scores between the secure version of the query term and secure versions of the candidate terms, and identifies the target dataset of the plurality of datasets based on the determined similarity scores.

    STORAGE ALLOCATION BASED ON SECURE DATA COMPARISONS VIA MULTIPLE INTERMEDIARIES

    公开(公告)号:US20180089301A1

    公开(公告)日:2018-03-29

    申请号:US15278253

    申请日:2016-09-28

    CPC classification number: G06F16/285 G06F21/602 G06F21/78

    Abstract: Storage allocation based on secure data comparisons is disclosed. One example is a system including a plurality of intermediaries, a data allocator and a plurality of storage containers. Each intermediary receives a request from the data allocator to identify a target storage container of the plurality of storage containers, for secure allocation of a data term. Each intermediary compares, for each storage container, the truncated data term with a collection of truncated candidate terms to select a representative term of the candidate terms, identifies the selected representative term to the storage container, receives a similarity profile from each storage container, where the similarity profile is representative of similarities between the truncated data term and terms in the storage container, and selects a candidate target storage container based on similarity profiles received from each storage container.

    Storage allocation based on secure data comparisons via multiple intermediaries

    公开(公告)号:US11080301B2

    公开(公告)日:2021-08-03

    申请号:US15278253

    申请日:2016-09-28

    Abstract: Storage allocation based on secure data comparisons is disclosed. One example is a system including a plurality of intermediaries, a data allocator and a plurality of storage containers. Each intermediary receives a request from the data allocator to identify a target storage container of the plurality of storage containers, for secure allocation of a data term. Each intermediary compares, for each storage container, the truncated data term with a collection of truncated candidate terms to select a representative term of the candidate terms, identifies the selected representative term to the storage container, receives a similarity profile from each storage container, where the similarity profile is representative of similarities between the truncated data term and terms in the storage container, and selects a candidate target storage container based on similarity profiles received from each storage container.

Patent Agency Ranking