Patents by Inventor Benjamin R. KREUTER

Benjamin R. KREUTER has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11962687
    Abstract: A method including at each of a number of client devices receiving a data item, receiving a public key from a second computing system, encrypting the data item using the public key to produce a singly encrypted data item, engaging in an oblivious pseudorandom function protocol with a first computing system using the singly encrypted data item to produce a seed, generating an encrypted secret share using a threshold secret sharing function under which the encrypted secret share cannot be decrypted until a threshold number of encrypted secret shares associated with the same singly encrypted data item are received, and transmitting the encrypted secret share to the first computing system and at the first computing system receiving a number of encrypted secret shares from the number of client devices, processing the number of encrypted secret shares to produce processed data, and transmitting the processed data to a second computing system.
    Type: Grant
    Filed: December 4, 2019
    Date of Patent: April 16, 2024
    Assignee: Google LLC
    Inventors: Sarvar Patel, Marcel M. M. Yung, Gang Wang, Karn Seth, Mariana Raykova, Benjamin R. Kreuter, Ananth Raghunathan
  • Patent number: 11909864
    Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.
    Type: Grant
    Filed: July 28, 2020
    Date of Patent: February 20, 2024
    Assignee: GOOGLE LLC
    Inventors: Craig Wright, Benjamin R. Kreuter, James Robert Koehler, Evgeny Skvortsov, Arthur Asuncion, Laura Grace Book, Sheng Ma, Jiayu Peng, Xichen Huang
  • Publication number: 20230421365
    Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.
    Type: Application
    Filed: June 13, 2023
    Publication date: December 28, 2023
    Inventors: Craig Wright, Laura Grace Book, Sheng Ma, Jiayu Peng, Xichen Huang, Benjamin R. Kreuter, Evgeny Skvortsov, Arthur Asuncion, James Robert Koehler
  • Publication number: 20230177172
    Abstract: A method comprising receiving, at a first computing system, encrypted identifiers, performing, by the first computing system, a concealing operation on the encrypted identifiers to produce concealed encrypted identifiers, wherein the concealing operation conceals the encrypted identifiers from the first computing system and a second computing system but enables matching between the concealed encrypted identifiers, decrypting, by the second computing system, the concealed encrypted identifiers to produce concealed identifiers, analyzing, by the second computing system using one or more match rules, the concealed identifiers to generate one or more associations between the concealed identifiers, and generating, by the second computing system, one or more universal identifiers based on the one or more associations.
    Type: Application
    Filed: July 9, 2021
    Publication date: June 8, 2023
    Inventors: Karn Seth, Benjamin R. Kreuter, John Mark Richter, Raimundo Mirisola, Evgeny Skvortsov, Craig William Wright, Mariana Petrova Raykova
  • Publication number: 20220060319
    Abstract: A method including at each of a number of client devices receiving a data item, receiving a public key from a second computing system, encrypting the data item using the public key to produce a singly encrypted data item, engaging in an oblivious pseudorandom function protocol with a first computing system using the singly encrypted data item to produce a seed, generating an encrypted secret share using a threshold secret sharing function under which the encrypted secret share cannot be decrypted until a threshold number of encrypted secret shares associated with the same singly encrypted data item are received, and transmitting the encrypted secret share to the first computing system and at the first computing system receiving a number of encrypted secret shares from the number of client devices, processing the number of encrypted secret shares to produce processed data, and transmitting the processed data to a second computing system.
    Type: Application
    Filed: December 4, 2019
    Publication date: February 24, 2022
    Applicant: Google LLC
    Inventors: SARVAR PATEL, Marcel M.M. Yung, Gang Wang, Kam Seth, Mariana Raykova, Benjamin R. Kreuter
  • Publication number: 20210359846
    Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.
    Type: Application
    Filed: July 28, 2020
    Publication date: November 18, 2021
    Applicant: GOOGLE LLC
    Inventors: Craig WRIGHT, Benjamin R. KREUTER, James Robert KOEHLER, Evgeny SKVORTSOV, Arthur ASUNCION, Laura Grace BOOK, Sheng MA, Jiayu PENG, Xichen HUANG