IP Library › Granted Patent US 12,248,604
Granted Patent B2
US 12,248,604 · App. 17/620,438 · Granted Mar 11, 2025

Scalable and differentially private distributed aggregation

Inventors: Badih Ghazi (San Jose, CA); Rasmus Pagh (Berkeley, CA); Ameya Velingker (San Francisco, CA)
Assignee: GOOGLE LLC
G06F21/6245
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,248,604
App. No.
17/620,438
Filed
Dec 17, 2021
Granted
Mar 11, 2025
Kind
B2
Examiner
HO, DAO Q
Art Unit
2432
USPC
726/26
Abstract

An encoding process performed by a computing device (e.g., a user's private device) can include obtaining private data that includes a private value. According to an aspect of the present disclosure, the computing device can produce a plurality of messages that respectively comprise a plurality of message values, where a total sum of the plurality of message values approximates the private value, and where at least one of the plurality of message values is randomly selected. The device can provide the plurality of messages for aggregation with a plurality of additional messages respectively generated for a plurality of additional private values. For example, the messages can be transmitted to a shuffler model configured to shuffle the plurality of messages with the plurality of additional messages.

Claims (35)

1. A computer-implemented method to enable privacy-preserving aggregation of private data, the method comprising:

obtaining, by one or more computing devices, private data comprising a private value;

producing, by the one or more computing devices based at least in part on the private value, a plurality of messages that respectively comprise a plurality of message values, wherein the plurality of message values together encode the private value for differentially private aggregation, wherein producing the plurality of messages comprises:

randomly selecting, by the one or more computing devices, a message value for each of one or more first messages of the plurality of messages;

determining, by the one or more computing devices, an intermediate sum of the message values of the one or more first messages; and

setting, by the one or more computing devices, a message value of a final message of the plurality of messages equal to the private value minus the intermediate sum modulo a first parameter value; and

transmitting, by the one or more computing devices over a communication channel, the plurality of messages, including the final message and the one or more first messages, for differentially private aggregation of the private value with a plurality of additional private values based on a plurality of additional messages respectively generated for the plurality of additional private values.

2. The computer-implemented method of claim 1 , wherein randomly selecting, by the one or more computing devices, a message value comprises:

uniformly and randomly sampling, by the one or more computing devices, one of a plurality of available values to serve as the message value for such first message.

3. The computer-implemented method of claim 2 , wherein:

the plurality of available values comprises a set of integers extending from zero to a sample control parameter value minus one; and

the first parameter value is equal to the sample control parameter value.

4. The computer-implemented method of claim 2 , wherein a number of the one or more first iterations is controlled by a message control parameter value.

5. The computer-implemented method of claim 1 , wherein:

the private value comprises a scaled private value produced by scaling an unscaled private value; and

obtaining, by one or more computing devices, the private data comprising the private value comprises scaling, by the one or more computing devices, the unscaled private value by a scaling control parameter value to obtain the scaled private value.

6. The computer-implemented method of claim 1 , wherein:

the private value comprises a normalized private value produced by normalizing a raw private value; and

obtaining, by one or more computing devices, the private data comprising the private value comprises normalizing, by the one or more computing devices, the raw private value according to an expected maximum private value.

7. The computer-implemented method of claim 6 , further comprising scaling, by the one or more computing devices, the normalized private value by a scaling control parameter value to obtain a scaled private value.

8. The computer-implemented method of claim 1 , wherein:

the private value comprises a noised private value produced by adding noise to a raw private value; and

obtaining, by one or more computing devices, the private data comprising the private value comprises pre-randomizing, by the one or more computing devices, the raw private value according to a shared noise probability to obtain the noised private value.

9. The computer-implemented method of claim 1 , wherein one or more of the sampling control parameter value, the scaling control parameter value, and the message control parameter value comprises a user-specified hyperparameter or a learned hyperparameter.

10. The computer-implemented method of claim 1 , wherein one or more of the sampling control parameter value, the scaling control parameter value, and the message control parameter value is greater than or equal to four.

11. The computer-implemented method of claim 1 wherein providing, by the one or more computing devices, the plurality of messages for aggregation comprises transmitting, by the one or more computing devices, the plurality of messages to a shuffler model configured to shuffle the plurality of messages with the plurality of additional messages.

12. The computer-implemented method of claim 1 , wherein the one or more computing devices consist of a user device.

13. The computer-implemented method of claim 1 , wherein the private value comprises one or more of:

an update value for a parameter of a machine-learned model;

a heavy hitter value;

an entropy value;

a quantization value; or

a support size value.

14. The computer-implemented method of claim 1 , further comprising:

encrypting, by the one or more computing devices, at least one of the plurality of messages with a public key associated with a shuffler model configured to shuffle the plurality of messages.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 17, 2021
From: GHAZI, BADIH; PAGH, RASMUS; VELINGKER, AMEYA
To: GOOGLE, LLC
Reel/Frame 058420/0019 →
Continuity (2)
Provisional Application 62863197 · Jun 18, 2019
Related Publication 20220374542A1 · Nov 24, 2022
References Cited (24)
US 20160182170A1 · Daoura · 2016 [cited by examiner]
US 20180039855A1 · Kecskemeti · 2018 [cited by examiner]
US 20200372061A1 · Gao · 2020 [cited by examiner]
US 20220374542A1 · Ghazi · 2022 [cited by examiner]
Abadi et al., “Deep Learning with Differential Privacy”, arXiv:1607.00133v2, 14 pages. [cited by applicant]
Balle et al., “Differentially Private Summation with Multi-Message Shuffling”, arXiv:1906.09116v1, 8 pages. [cited by applicant]
Balle et al., “Improved Summation from Shuffling”, arXiv:1909.11225v1, 13 pages. [cited by applicant]
Balle et al., “The Privacy Blanket of the Shuffle Model”, arXiv:1903.02837v1, 36 pages. [cited by applicant]
Bittau et al., “PROCHLO: Strong Privacy for Analytics in the Crowd”, arXiv:1710.00901v1, 20 pages. [cited by applicant]
Bonawitz et al., “Practical Secure Aggregation for Privacy-Preserving Machine Learning”, 2017 ACM SIGSAC Conference, Oct. 30-Nov. 3, 2017, Dallas, Texas, pp. 1175-1191. [cited by applicant]
Cheu et al., “Distributed Differential Privacy via Shuffling”, arXiv:1808.01394v3, 42 pages. [cited by applicant]
Cormode et al., “Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches”, Foundation and Trends in Databases, vol. 4, Nos. 1-3, 2011, pp. 1-294. [cited by applicant]
Erlingsson et al., “Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity”, 2019 Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 6-9, 2019, San Diego, California, pp. 2468-2479. [cited by applicant]
Ghazi et al., “Private Aggregation from Fewer Anonymous Messages”, arXiv:1909.11073v1, 31 pages. [cited by applicant]
Ghazi et al., “Scalable and Differentially Private Distributed Aggregation in the Shuf ed Model”, arXiv:1906.08320v3, 18 pages. [cited by applicant]
Google Al Blog, “Federated Learning: Collaborative Machine Learning without Centralized Training Data”, Apr. 6, 2017, https://ai.googleblog.com/2017/04/federated-learning-collaborative.html, retrieved on Jan. 19, 2022, … [cited by applicant]
Goryczka et al., “Secure Multiparty Aggregation with Differential Privacy: A Comparative Study”, Joint EDBT/ICDT 2013 Workshops, Mar. 18-22, 2013, Genoa, Italy, pp. 155-163. [cited by applicant]
He et al., “PDA: Privacy-preserving Data Aggregation in Wireless Sensor Networks”, IEEE INFOCOM 2007, 10 pages. [cited by applicant]
International Preliminary Report on Patentability for Application No. PCT/US2020/038109, mailed Dec. 30, 2021, 8 pages. [cited by applicant]
Ishai et al., “Cryptography from Anonymity”, 47 [cited by applicant]
Kearns, “Efficient Noise-Tolerant Learning From Statistical Queries”, Journal of the ACM, vol. 45(6), 1998, pp. 983-1006. [cited by applicant]
McMahan et al., “Federated Learning of Deep Networks using Model Averaging”, arXiv:1602.05629v1, 11 pages. [cited by applicant]
Shi et al., “PriSense: Privacy-Preserving Data Aggregation in People-Centric Urban Sending Systems”, IEEE INFOCOM 2010, 10 Pages. [cited by applicant]
Woodruff et al, “Sketching as a Tool for Numerical Linear Algebra”, arXiv:1411.4357v1, 141 pages. [cited by applicant]