IP Library Granted Patent US 12,430,458
Granted Patent B2
US 12,430,458 · App. 18/502,673 · Granted Sep 30, 2025

Transformed partial convolution algorithm for composition determination

Inventors: Bo Jiang (Culver City, CA); Jian Du (Culver City, CA); Sagar Sharma (Culver City, CA); Qiang Yan (Beijing, CN)
Assignee: Lemon Inc.
G06F21/6218G06F21/604
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,430,458
App. No.
18/502,673
Granted
Sep 30, 2025
Kind
B2
Abstract

Differential privacy composition determination in a secure communication is provided. A method for determining differential privacy composition includes determining a differential privacy configuration including a first privacy parameter and a second privacy parameter, determining a privacy loss distribution, and performing a partial convolution operation of the privacy loss distribution by transforming the privacy loss distribution based on a predetermined parameter, determining an integral range based on the first privacy parameter and the privacy loss distribution, transforming the privacy loss distribution based on the integral range, and performing the partial convolution operation based on the integral range. The method also includes determining the second privacy parameter based on a result of the partial convolution operation, and controlling a dataset based on the differential privacy configuration to limit access to the dataset.

Claims (55)

1. A method for determining differential privacy composition in a secure communication, the method comprising:

determining a differential privacy configuration including a first privacy parameter and a second privacy parameter;

determining a privacy loss distribution;

performing a partial convolution operation of the privacy loss distribution by:

transforming the privacy loss distribution based on a predetermined parameter;

determining an integral range based on the first privacy parameter and the privacy loss distribution;

transforming the privacy loss distribution based on the integral range; and

performing the partial convolution operation based on the integral range;

determining the second privacy parameter based on a result of the partial convolution operation; and

controlling a dataset based on the differential privacy configuration to limit access to the dataset.

2. The method of claim 1 , wherein the transforming of the privacy loss distribution based on the predetermined parameter includes translating the privacy loss distribution.

3. The method of claim 2 , wherein the transforming of the privacy loss distribution based on the predetermined parameter further includes after the translating of the privacy loss distribution, reflecting the privacy loss distribution.

4. The method of claim 1 , wherein the transforming of the privacy loss distribution based on the integral range includes truncating the privacy loss distribution based on the integral range.

5. The method of claim 1 , wherein K is a number of convolution operations, K is greater than two, the performing of the partial convolution operation of the privacy loss distribution includes performing a K-fold partial convolution operation of the privacy loss distribution.

6. The method of claim 5 , wherein the determining of the integral range includes determining the integral range based on the first privacy parameter, the number of convolution operations K, and the privacy loss distribution.

7. The method of claim 1 , further comprising:

adjusting a number of composition operations based on the first privacy parameter and the second privacy parameter.

8. The method of claim 7 , wherein the adjusting of the number of composition operations includes:

decreasing the number of composition operations when the first or second privacy parameter is greater than a first predetermined threshold; and

increasing the number of composition operations when the first or second privacy parameter is less than a second predetermined threshold.

9. A differential privacy composition determination system comprising:

a memory to store a dataset; and

a processor to:

determine a differential privacy configuration including a first privacy parameter and a second privacy parameter;

determine a privacy loss distribution;

perform a partial convolution operation of the privacy loss distribution by:

transforming the privacy loss distribution based on a predetermined parameter;

determining an integral range based on the first privacy parameter and the privacy loss distribution;

transforming the privacy loss distribution based on the integral range; and

performing the partial convolution operation based on the integral range;

determine the second privacy parameter based on a result of the partial convolution operation; and

control the dataset based on the differential privacy configuration to limit access to the dataset.

10. The system of claim 9 , wherein the transforming of the privacy loss distribution based on the predetermined parameter includes translating the privacy loss distribution.

11. The system of claim 10 , wherein the transforming of the privacy loss distribution based on the predetermined parameter further includes after the translating of the privacy loss distribution, reflecting the privacy loss distribution.

12. The system of claim 9 , wherein the transforming of the privacy loss distribution based on the integral range includes truncating the privacy loss distribution based on the integral range.

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

determining a differential privacy configuration including a first privacy parameter and a second privacy parameter;

determining a privacy loss distribution;

performing a partial convolution operation of the privacy loss distribution by:

transforming the privacy loss distribution based on a predetermined parameter;

determining an integral range based on the first privacy parameter and the privacy loss distribution;

transforming the privacy loss distribution based on the integral range; and

performing the partial convolution operation based on the integral range;

determining the second privacy parameter based on a result of the partial convolution operation; and

controlling a dataset based on the differential privacy configuration to limit access to the dataset.

14. The computer-readable medium of claim 13 , wherein the transforming of the privacy loss distribution based on the predetermined parameter includes translating the privacy loss distribution.

15. The computer-readable medium of claim 14 , wherein the transforming of the privacy loss distribution based on the predetermined parameter further includes after the translating of the privacy loss distribution, reflecting the privacy loss distribution.

16. The computer-readable medium of claim 13 , wherein the transforming of the privacy loss distribution based on the integral range includes truncating the privacy loss distribution based on the integral range.

17. The computer-readable medium of claim 13 , wherein K is a number of convolution operations, K is greater than two, the performing of the partial convolution operation of the privacy loss distribution includes performing a K-fold partial convolution operation of the privacy loss distribution.

18. The computer-readable medium of claim 17 , wherein the determining of the integral range includes determining the integral range based on the first privacy parameter, the number of convolution operations K, and the privacy loss distribution.

19. The computer-readable medium of claim 13 , the operations further comprise:

adjusting a number of composition operations based on the first privacy parameter and the second privacy parameter.

20. The computer-readable medium of claim 19 , wherein the adjusting of the number of composition operations includes:

decreasing the number of composition operations when the first or second privacy parameter is greater than a first predetermined threshold; and

increasing the number of composition operations when the first or second privacy parameter is less than a second predetermined threshold.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 27, 2025
From: DU, JIAN; SHARMA, SAGAR
To: TIKTOK INC.
Reel/Frame 072631/0088 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 27, 2025
From: YAN, QIANG
To: MIYOU INTERNET TECHNOLOGY (SHANGHAI) CO., LTD.
Reel/Frame 072646/0065 →
Continuity (1)
Related Publication 20250148108A1 · May 8, 2025
References Cited (72)
US 7058603B1 · Rhiando · 2006 [cited by applicant]
US 9652622B2 · Garfinkle et al. · 2017 [cited by applicant]
US 10289816B1 · Malassenet · 2019 [cited by applicant]
US 11522688B2 · Goodsitt et al. · 2022 [cited by applicant]
US 11593510B1 · Knox et al. · 2023 [cited by applicant]
US 11704431B2 · Kraus et al. · 2023 [cited by applicant]
US 11868497B1 · Jiang et al. · 2024 [cited by applicant]
US 20040179686A1 · Matsumura et al. · 2004 [cited by applicant]
US 20100131764A1 · Goh · 2010 [cited by applicant]
US 20110202764A1 · Furukawa · 2011 [cited by applicant]
US 20120143922A1 · Rane et al. · 2012 [cited by applicant]
US 20130212690A1 · Fawaz et al. · 2013 [cited by applicant]
US 20160150047A1 · O'Hare et al. · 2016 [cited by applicant]
US 20180101697A1 · Rane et al. · 2018 [cited by applicant]
US 20190065775A1 · Klucar, Jr. et al. · 2019 [cited by applicant]
US 20190244138A1 · Bhowmick et al. · 2019 [cited by applicant]
US 20190361794A1 · Maksyutov et al. · 2019 [cited by applicant]
US 20200250335A1 · Hockenbrocht et al. · 2020 [cited by applicant]
US 20200358599A1 · Baracaldo Angel · 2020 [cited by examiner]
US 20200401726A1 · Lim et al. · 2020 [cited by applicant]
US 20210073677A1 · Peterson et al. · 2021 [cited by applicant]
US 20210173856A1 · Chitnis et al. · 2021 [cited by applicant]
US 20210336771A1 · Mukherjee · 2021 [cited by applicant]
US 20210356258A1 · Chen · 2021 [cited by examiner]
US 20210360010A1 · Zaccak et al. · 2021 [cited by applicant]
US 20210399874A1 · Polyakov et al. · 2021 [cited by applicant]
US 20220100899A1 · Saillet et al. · 2022 [cited by applicant]
US 20220138348A1 · Bernau et al. · 2022 [cited by applicant]
US 20220244988A1 · Zhang et al. · 2022 [cited by applicant]
US 20220277097A1 · Cabot et al. · 2022 [cited by applicant]
US 20220335450A1 · Fenton et al. · 2022 [cited by applicant]
US 20220405800A1 · Walcott et al. · 2022 [cited by applicant]
US 20230017374A1 · Boehler · 2023 [cited by applicant]
US 20230045553A1 · Deshpande · 2023 [cited by applicant]
US 20230125887A1 · Habite et al. · 2023 [cited by applicant]
US 20230146259A1 · Liktor et al. · 2023 [cited by applicant]
US 20230214684A1 · Wang et al. · 2023 [cited by applicant]
US 20240273932A1 · Tao · 2024 [cited by examiner]
US 20240281226A1 · Zheng · 2024 [cited by examiner]
US 20240314197A1 · Qu · 2024 [cited by examiner]
CN 114662133A · 2022 [cited by applicant]
CN 116049626A · 2023 [cited by applicant]
Office Action dated Jul. 12, 2023 issued in U.S. Appl. No. 18/297,447. [cited by applicant]
Notice of Allowance dated Jul. 25, 2023 issued in U.S. Appl. No. 18/297,530. [cited by applicant]
Notice of Allowance dated Aug. 2, 2023 issued in U.S. Appl. No. 18/297,545. [cited by applicant]
Office Action dated Aug. 3, 2023 issued in U.S. Appl. No. 18/297,339. [cited by applicant]
Office Action dated Jun. 12, 2023 issued in U.S. Appl. No. 18/297,376. [cited by applicant]
Notice of Allowance dated Aug. 30, 2023 issued in U.S. Appl. No. 18/297,376. [cited by applicant]
Office Action dated Jul. 11, 2023 issued in U.S. Appl. No. 18/297,389. [cited by applicant]
Notice of Allowance dated Aug. 19, 2023 issue in U.S. Appl. No. 18/297,389. [cited by applicant]
Office Action dated Jun. 20, 2023 in U.S. Appl. No. 18/297,424. [cited by applicant]
Notice of Allowance dated Aug. 2, 2023 in U.S. Appl. No. 18/297,424. [cited by applicant]
Notice of Allowanced dated Aug. 30, 2023 in U.S. Appl. No. 18/297,405. [cited by applicant]
Du et al, DP-PSI: Private and secure set intersection, Aug. 28, 2022, Cornel University, https://doi .org/10.48550/arXiv.2208.13249V1, p. 1-9. (Year: 2022). [cited by applicant]
Case, Benjamin et al. “The Privacy-preserving Padding Problem: Non-negative Mechanisms for Conservative Answers with Differential Privacy.” 20 pages. Oct. 15, 2021. https://arxiv.org/abs/2110.08177. [cited by applicant]
Buddhavarapu et al., “Private matching for compute”, Cryptology ePrint Archive, 2020, https://eprint.iacr.org/2020/599. [cited by applicant]
Guo et al., “Birds of a Feather Flock Together: How Set Bias Helps to Deanonymize You via Revealed Intersection Sizes”, 31st USENIX Security Symposium, Aug. 10-12, 2022, Boston, MA, USA, https://www.usenix.org/conferenc… [cited by applicant]
Ion et al., “On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality”, 2020 IEEE European Symposium on Security and Privacy (EuroS&P), Date of Conference: Sep. 7-11, 2020, Date added to IEEE Xplore: Nov… [cited by applicant]
Chandran et al., “Circuit-PSI with Linear Complexity via Relaxed Batch OPPRF”, Cryptology ePrint Archive, received Jan. 12, 2021, https://eprint.iacr.org/2021/034. [cited by applicant]
Pinkas et al., “SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension”, Cryptology ePrint Archive, received Jun. 3, 2019, https://eprint.iacr.org/2019/634. [cited by applicant]
Chase et al., “Secret Shared Shuffle”, Cryptology ePrint Archive, received Nov. 22, 2019, https://eprint.iacr.org/2019/1340. [cited by applicant]
Mohassel et al., “ How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation”, Cryptology ePrint Archive, received Mar. 9, 2013, https://eprint.iacr.org/2013/137. [cited by applicant]
Garimella et al., “Private Set Operations from Oblivious Switching”, Cryptology ePrint Archive, received Mar. 2, 2021, https://eprint.iacr.org/2021/243. [cited by applicant]
Dwork et al., “Differential Privacy and Robust Statistics”, Association for Computing Machinery, May 31, 2009, pp. 371-380, https://dl.acm.org/doi/10.1145/1536414.1536466. [cited by applicant]
Dwork et al., “Differential Privacy Under Continual Observation”, Association for Computing Machinery, Jun. 5, 2010, pp. 715-724, https://dl.acm.org/doi/10.1145/1806689.1806787. [cited by applicant]
Dwork et al. “Our Data, Ourselves: Privacy via Distributed Noise Generation”, Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. P… [cited by applicant]
Kairouz et al., “The composition theorem for differential privacy.” International conference on machine learning. PMLR, 2015. (Year: 2015). [cited by applicant]
Office Action dated Jun. 14, 2023 in U.S. Appl. No. 18/297,405. [cited by applicant]
Gopi S. et al., “Numerical Compostion of Differentail Privacy. Advances in Neural Information Processing Systems,”Nov. 10, 2021, vol. 34, pp. 11631-11642 [Retrieved on Jan. 9, 2025] DOI: None Section 1 Definition 1.4, P… [cited by applicant]
International Search Report and Written Opinion for Internaitional Application No. PCT/SG2024/050712 , mailed Jan. 13, 2025, 12 Pages. [cited by applicant]
Koskela A., et al., “Computing Differential Privacy Guarantees for Heterogeneous Compositions Using FFT,” arXiv:2102.12412v2, Jun. 21, 2021 [Retrieved on Jan. 9, 2025] DOI: 10.48550/ARXIV.2102.12412 Section D.6 Lemma D.… [cited by applicant]
Sommer D., et al., “Privacy Loss Classes: the Central Limit Theorem in Differential Privacy,” Cryptology, Aug. 2020, 41 pages. [cited by applicant]