IP Library › Granted Patent US 12,541,619
Granted Patent B2
US 12,541,619 · App. 18/317,507 · Granted Feb 3, 2026

Dynamic calibration of noise parameters for data security

Inventors: Sagar Sharma (Culver City, CA); Xing Wu (Beijing, CN); Qiang Yan (Beijing, CN)
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,541,619
App. No.
18/317,507
Granted
Feb 3, 2026
Kind
B2
Abstract

Data security for a dataset in interactive query or operation from users regarding data stored in the dataset is provided. A method for providing data security for the dataset in secure data computation and communication includes generating a query result corresponding to the user query for the dataset, determining a magnitude range of the query result, and generating an amount of random noise data based on the magnitude range. The amount of random noise data is calibrated by adjusting at least one of a first tunable parameter within a first range and a second tunable parameter within a second range of a differential privacy (DP) configuration. A noise-laden query result is generated by applying the noise data to the query result to satisfy an error tolerance level.

Claims (51)

1 . A method for providing data security for a dataset in secure data computation and communication, the method comprising:

generating a query result corresponding to a user query for the dataset;

determining a magnitude range of the query result;

adjusting at least one of a first tunable parameter within a first range and a second tunable parameter within a second range of a differential privacy (DP) configuration;

calibrating an amount of random noise data based on the magnitude range and at least one of the first tunable parameter and the second tunable parameter;

generating a noise-laden query result by applying the amount of random noise data to the query result to satisfy an error tolerance level, thereby perturbing the query result before releasing the query result, and thereby providing data security for the dataset; and

caching the query result, the magnitude range of the query result, and the error tolerance level in an expandable search grid data structure.

2 . The method of claim 1 , wherein calibrating the amount of random noise data further comprises generating a plurality of random sample values within the magnitude range of the query result.

3 . The method of claim 2 , further comprising generating a random sample noise for each of the plurality of random sample values in iterations by varying the first tunable parameter within the first range or varying the second tunable parameter within the second range.

4 . The method of claim 3 , further comprising generating noise-laden sample values by applying the random sample noise to corresponding ones of the plurality of random sample values.

5 . The method of claim 4 , further comprising determining a value for at least one of the first tunable parameter and the second tunable parameter from the iterations to allow corresponding noise-laden sample values to satisfy the error tolerance level.

6 . The method of claim 1 , further comprising:

receiving a second user query for the dataset;

generating a second query result for the second user query;

determining a second magnitude range of the second query result; and

determining a second value for at least one of the first tunable parameter and the second tunable parameter by traversing through the expandable search grid data structure based on the second magnitude range of the second query result and a second error tolerance level.

7 . The method of claim 1 , wherein the amount of random noise is generated according to a noise distribution.

8 . The method of claim 7 , wherein the noise distribution comprises at least one of a Laplace distribution, an exponential distribution, or a Gaussian distribution.

9 . The method of claim 1 , further comprising receiving a user input indicative of the error tolerance level.

10 . The method of claim 1 , wherein the user query comprises an aggregate query.

11 . A system for providing data security for a dataset in secure data computation and communication, the system comprising:

a memory to store the dataset; and

a processor to:

generate a query result corresponding to a user query for the dataset;

determine a magnitude range of the query result;

adjust at least one of a first tunable parameter within a first range and a second tunable parameter within a second range of a differential privacy (DP) configuration;

calibrate an amount of random noise data based on the magnitude range and at least one of the first tunable parameter and the second tunable parameter;

generate a noise-laden query result by applying the amount of random noise data to the query result to satisfy an error tolerance level, thereby perturbing the query result before releasing the query result, and thereby providing data security for the dataset; and

cache the query result, the magnitude range of the query result, and the error tolerance level in an expandable search grid data structure.

12 . The system of claim 11 , wherein the processor is further configured to generate a plurality of random sample values within the magnitude range of the query result.

13 . The system of claim 12 , wherein the processor is further configured to:

generate a random sample noise for each of the plurality of random sample values in iterations by varying the first tunable parameter within the first range or varying the second tunable parameter within the second range; and

generate noise-laden sample values by applying the random sample noise to corresponding ones of the plurality of random sample values.

14 . The system of claim 13 , wherein the processor is further configured to determine a value for at least one of the first tunable parameter and the second tunable parameter from the iterations to allow corresponding noise-laden sample values to satisfy the error tolerance level.

15 . A non-transitory computer-readable medium having computer-executable instructions stored thereon that, upon execution, cause one or more processors to perform operations comprising:

generating a query result corresponding to a user query for a dataset;

determining a magnitude range of the query result;

adjusting at least one of a first tunable parameter within a first range and a second tunable parameter within a second range of a differential privacy (DP) configuration;

calibrating an amount of random noise data based on the magnitude range and at least one of the first tunable parameter and the second tunable parameter;

generating a noise-laden query result by applying the amount of random noise data to the query result to satisfy an error tolerance level, thereby perturbing the query result before releasing the query result, and thereby providing data security for the dataset; and

caching the query result, the magnitude range of the query result, and the error tolerance level in an expandable search grid data structure.

16 . The computer-readable medium of claim 15 , wherein the operations further comprise:

generating a plurality of random sample values within the magnitude range of the query result;

generating a random sample noise for each of the plurality of random sample values in iterations by varying the first tunable parameter within the first range or varying the second tunable parameter within the second range;

generating noise-laden sample values by applying the random sample noise to corresponding ones of the plurality of random sample values; and

determining a value for at least one of the first tunable parameter and the second tunable parameter from the iterations to allow corresponding noise-laden sample values to satisfy the error tolerance level.

17 . The computer-readable medium of claim 15 , wherein the operations further comprise:

receiving a second user query for the dataset;

generating a second query result for the second user query;

determining a second magnitude range of the second query result; and

determining a second value for at least one of the first tunable parameter and the second tunable parameter by traversing through the expandable search grid data structure based on the second magnitude range of the second query result and a second error tolerance level.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 22, 2025
From: WU, XING
To: MIYOU INTERNET TECHNOLOGY (SHANGHAI) CO., LTD.
Reel/Frame 073291/0935 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 22, 2025
From: YAN, QIANG
To: SHANGHAI SUIXUNTONG ELECTRONIC TECHNOLOGY CO., LTD.
Reel/Frame 073292/0183 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 22, 2025
From: SHARMA, SAGAR
To: TIKTOK INC.
Reel/Frame 073292/0308 →
Continuity (1)
Related Publication 20240386131A1 · Nov 21, 2024
References Cited (26)
US 20070143289A1 · Dwork et al. · 2007 [cited by applicant]
US 20180052894A1 · Eide · 2018 [cited by examiner]
US 20200311296A1 · Kim · 2020 [cited by examiner]
US 20200327252A1 · Mcfall · 2020 [cited by examiner]
US 20210089882A1 · Sun · 2021 [cited by examiner]
US 20210133590A1 · Amroabadi · 2021 [cited by examiner]
US 20210256151A1 · Damewood et al. · 2021 [cited by applicant]
US 20210319131A1 · Salomon · 2021 [cited by examiner]
US 20210357523A1 · Nerurkar et al. · 2021 [cited by applicant]
US 20220229931A1 · Damewood · 2022 [cited by examiner]
US 20230032536A1 · Tello Guijarro · 2023 [cited by examiner]
US 20230127699A1 · Liu · 2023 [cited by examiner]
US 20230130637A1 · Hosudurg et al. · 2023 [cited by applicant]
US 20240135024A1 · Du · 2024 [cited by examiner]
US 20240135025A1 · Du · 2024 [cited by examiner]
US 20240303373A1 · Bijon · 2024 [cited by examiner]
US 20240311834A1 · Perez · 2024 [cited by examiner]
US 20240362355A1 · Bijon · 2024 [cited by examiner]
US 20240373212A1 · Mohammadi · 2024 [cited by examiner]
Hsu et al., “Differential Privacy: An Economic Method for Choosing Epsilon,” CoRR, submitted on Feb. 2014, arXiv:1402.3329, 13 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/SG2024/050312, mailed on Jul. 23, 2024, 4 pages. [cited by applicant]
McSherry, Frank D. “Privacy integrated queries: an extensible platform for privacy preserving data analysis.” Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. 2009. [cited by applicant]
Johnson, Noah, et al. “Chorus: a programming framework for building scalable differential privacy mechanisms.” 2020 IEEE European Symposium on Security and Privacy (EuroS&P). IEEE, 2020, https://arxiv.org/pdf/1809.07750… [cited by applicant]
Rogers, Ryan, et al. “LinkedIn's Audience Engagements API: A privacy preserving data analytics system at scale.” arXiv preprint arXiv:2002.05839 (2020), https://arxiv.org/pdf/2002.05839.pdf. [cited by applicant]
Wilson, Royce J., et al. “Differentially private SQL with bounded user contribution.” Proceedings on privacy enhancing technologies 2020.2 (2020): 230-250, https://arxiv.org/pdf/1909.01917.pdf. [cited by applicant]
Dwork, Cynthia, and Aaron Roth. “The algorithmic foundations of differential privacy.” Foundations and Trends® in Theoretical Computer Science 9.3-4 (2014): 211-407; https://www.cis.upenn.edu/˜aaroth/Papers/privacybook.… [cited by applicant]