# US 12,010,041 B1 · Dynamic resource allocator in secure computation and communication > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,010,041 B1 - Document ID: US12010041B1 - Status: Granted - Kind: B1 - Application number: 18/317,457 - Filed: 2023-05-15 - Granted: 2024-06-11 - Earliest claimed: 2023-05-15 - Assignees: Lemon Inc. - Applicants: Lemon Inc. - Inventors: Sagar Sharma; Qiang Yan - Web page: https://patentgrep.com/patent/US12010041B1 ## CPC - H04L 47/828: {Allocation of resources per group of connections, e.g. per group of users} - H04L 47/788: {Autonomous allocation of resources} - H04L 47/822: {Collecting or measuring resource availability data} - H04L 51/48: Message addressing, e.g. address format or anonymous messages, aliases - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract Dynamic allocation and/or distribution of a resource in secure computation and communication to achieve a desired level of data privacy protection is provided. A method for dynamically allocating a resource of a differentially private system in secure computation and communication includes aggregating attributes from a usage log of the differentially private system for a predetermined period of time, generating a moving aggregation based on the aggregated attributes, optimizing a first attribute of the attributes of the usage log based on the moving aggregation and a set of constraints, generating a distribution of the resource based on the optimized first attribute, and dynamically allocating the resource based on the generated distribution. The resource includes a differential privacy parameter. ## Claims ### Claim 1 A method for dynamically allocating a resource of a differentially private system in secure computation and communication, the method comprising: providing a usage log including operation information of the differentially private system, the differentially private system having a privacy budget parameter indicative of a strength of a data privacy protection and a probability parameter indicative of a data privacy loss; aggregating attributes from the usage log of the differentially private system for a predetermined period of time, the privacy budget parameter and the probability parameter forming at least a part of the attributes; generating a windowed moving aggregation based on the aggregated attributes; optimizing a first attribute of the attributes of the usage log based on the windowed moving aggregation and a set of constraints to minimize an overall error of the first attribute, the set of constraints including a number of query operations of the differentially private system; generating a distribution of the resource based on the optimized first attribute; and dynamically allocating the resource based on the generated distribution. ### Claim 2 (depends on 1) The method of claim 1, wherein the dynamically allocating of the resource includes dynamically allocating the resource amongst a plurality of users in a group. ### Claim 3 (depends on 2) The method of claim 2, wherein the optimizing of the first attribute includes optimizing the first attribute for each of the users in the group. ### Claim 4 (depends on 2) The method of claim 2, wherein the optimizing of the first attribute includes optimizing the first attribute for the group. ### Claim 5 (depends on 1) The method of claim 1, wherein the dynamically allocating of the resource includes dynamically allocating the resource amongst a plurality of queries of a user. ### Claim 6 (depends on 5) The method of claim 5, wherein the optimizing of the first attribute includes optimizing the first attribute for each of the queries. ### Claim 7 (depends on 5) The method of claim 5, wherein the optimizing of the first attribute includes optimizing the first attribute for the user. ### Claim 8 (depends on 1) The method of claim 1, further comprising: generating an alert when the optimizing of the first attribute fails. ### Claim 9 (depends on 1) The method of claim 1, further comprising: adjusting a target of the first attribute when the optimizing of the first attribute fails; and re-optimizing the first attribute based on the adjusted target. ### Claim 10 (depends on 1) The method of claim 1, wherein the first attribute includes at least one of the privacy budget parameter and the probability parameter of the differentially private system. ### Claim 11 (depends on 1) The method of claim 1, wherein the optimizing of the first attribute includes minimizing an error statistics of the first attribute for a predetermined error type, the set of constraints includes an error goal for the first attribute. ### Claim 12 (depends on 11) The method of claim 11, wherein the optimizing of the first attribute includes minimizing the error statistics based on an error term, and the set of constraints includes the error term. ### Claim 13 (depends on 12) The method of claim 12, wherein the set of constraints includes a limit of a change of the first attribute during the optimizing of the first attribute. ### Claim 14 A secure computation and communication system, the system comprising: a memory to store a usage log of a differentially private system, the usage log including operation information of the differentially private system, the differentially private system having a privacy budget parameter indicative of a strength of a data privacy protection and a probability parameter indicative of a data privacy loss, the usage log having a plurality of attributes; a processor to: aggregate the attributes of the usage log for a predetermined period of time, the privacy budget parameter and the probability parameter forming at least a part of the attributes; generate a windowed moving aggregation based on the aggregated attributes; optimize a first attribute of the attributes of the usage log based on the windowed moving aggregation and a set of constraints to minimize an overall error of the first attribute, the set of constraints including a number of query operations of the differentially private system; generate a distribution of a resource of the differentially private system based on the optimized first attribute; and dynamically allocate the resource based on the generated distribution. ### Claim 15 (depends on 14) The system of claim 14, wherein the processor is to further: dynamically allocate the resource amongst a plurality of users in a group. ### Claim 16 (depends on 14) The system of claim 14, wherein the processor is to further: dynamically allocate the resource amongst a plurality of queries of a user. ### Claim 17 (depends on 14) The system of claim 14, wherein the processor is to further: adjust a target of the first attribute when the optimizing of the first attribute fails; and re-optimize the first attribute based on the adjusted target. ### Claim 18 A non-transitory computer-readable medium having computer-executable instructions stored thereon that, upon execution, cause one or more processors to perform operations comprising: providing a usage log including operation information of a differentially private system, the differentially private system having a privacy budget parameter indicative of a strength of a data privacy protection and a probability parameter indicative of a data privacy loss; aggregating attributes from the usage log of a differentially private system for a predetermined period of time, the privacy budget parameter and the probability parameter forming at least a part of the attributes; generating a windowed moving aggregation based on the aggregated attributes; optimizing a first attribute of the attributes of the usage log based on the windowed moving aggregation and a set of constraints to minimize an overall error of the first attribute, the set of constraints including a number of query operations of the differentially private system; generating a distribution of a resource of the differentially private system based on the optimized first attribute; and dynamically allocating the resource based on the generated distribution. ### Claim 19 (depends on 18) The computer-readable medium of claim 18, wherein the dynamically allocating of the resource includes dynamically allocating the resource amongst a plurality of users in a group. ### Claim 20 (depends on 18) The computer-readable medium of claim 18, wherein the dynamically allocating of the resource includes dynamically allocating the resource amongst a plurality of queries of a user.