Google Inc.

Joseph Sean Cahill Goodknight Knightbrook

Sheng Ma

Scott D Schneider

Laura Grace Book

Michael Daub

Shanmugasundaram Ravikumar

Evgeny Skvortsov

Craig Wright

Matthew Tran Clegg

Pasin Manurangsi

Preston Wooju Lee

Badih Ghazi

Methods, systems, and apparatus, including medium-encoded computer program products, for adaptive privacy-preserving information retrieval. An information server can accept from a user a request for privacy sensitive information accessible to the information server. The information server can determine a remaining privacy allocation for the user of the information server and can determine a noise parameter for a response to the request, where application of the noise parameter to the response can decrease a privacy loss associated with the response. The information server can determine a privacy modifier for the response. In response to the information server determining that the remaining privacy allocation satisfies the privacy modifier, the information server can: (i) determining the response to the request; (ii) apply the noise parameter to the response to produce a noised response; (iii) provide the noised response to the user; and (iv) adjust the remaining privacy allocation according to the privacy modifier.

Adaptive privacy-preserving information retrieval

Systems and methods for the meta-estimation of data structures representing identifiers are disclosed. The system maintain one or more data records comprising one or more identifiers and one or more attributes. Using the data records, the system can generate a first data structure, such as a probabilistic data structure, that represents the plurality of data records. The first data structure can have a plurality of registers. The system can identify a subset of the plurality of registers that are equal to a predetermined value, and generate a second data structure that represents the subset of the plurality of registers. The system can then store the second data structure as a meta-estimation of the first, and can utilize the second data structure in further processing operations.

Meta-estimation of bloom filters with vectors of counts

At least one aspect is directed to determining an estimate of an intersection of user identifiers in a first set of user identifiers and a second set of user identifiers. The first and second sets of user identifiers can be populated with user identifiers that have interacted with the same content item or content item campaign. Estimates of intersections of the first and the second sets can be determined based on a binomial vector approach, a vector of counts approach, or a hybrid approach. The binomial vector approach generates vectors based on k hashes of each user identifier in the first set and summing the vectors to generate a first vector. The intersection can be determined based on a dot product of the first vector and a second vector similarly generated from the second set of user identifiers.

Systems and methods for privacy preserving determination of intersections of sets of user identifiers

Growing community of inventors

Mountain View, CA, United States of America

Joseph Sean Cahill Goodknight Knightbrook