Secure multi-party computation and probabilistic data structures are used to protect access to information.
By using a secure multi-party computation system and probabilistic data structure, and employing distributed point functions and cuckoo filters to generate secret shares, the problem of user privacy protection and efficient digital component selection and distribution is solved, achieving a balance between information transmission efficiency and privacy protection.
Patent Information
- Application Number
- CN202180035224.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2020-12-14
- Filing Date
- 2021-12-13
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2041-12-13
AI Technical Summary
Existing technologies struggle to efficiently select and distribute digital components while protecting user privacy, resulting in wasted information transmission bandwidth, latency, and processing power.
A secure multi-party computation (MPC) system and probabilistic data structure are employed. Secret shares are generated through distributed point functions and cuckoo filters to ensure that user group membership information is not accessed in plaintext and only the secret shares of the selection results are transmitted.
It reduces the consumption of bandwidth, latency, and processing power in information transmission, protects user privacy, and lowers the potential risk of information leakage.
Smart Images

Figure CN115605895B_ABST
Abstract
Description
Technical Field
[0001] This manual covers cryptography and data security. Background Technology
[0002] Secure multi-party computation (MPC) is a set of cryptographic protocols that prevent access to data by distributing computation across multiple parties, ensuring that no single party can access another party's data. MPC computation systems use secret shares of data to perform computations. Probabilistic data structures are data structures that use hash functions to represent sets of elements and can be queried to determine whether an element is included in the set represented by the data structure. Example probabilistic data structures include Bloom filters and Cuckoo filters. Summary of the Invention
[0003] Typically, an innovative aspect of the subject matter described in this specification can be embodied in methods comprising: receiving, from a client device and by a first computing system within a plurality of multi-party computing (MPC) systems, a request for a digital component including distributed point functions, each distributed point function representing a secret share of a corresponding point function indicating whether a user of the client device is a member of a corresponding first user group identified by a corresponding first user group identifier; identifying a plurality of selection values, wherein each selection value corresponds to a corresponding digital component, a set of context signals, and a corresponding second user group identifier for a corresponding second user group, the corresponding digital component being eligible for distribution to the corresponding second user group; and, for each selection value and in conjunction with a plurality of... In a secure MPC process executed collaboratively by one or more second computing systems in an MPC system, a distributed point function is used to determine candidate parameters indicating whether a second user group identifier corresponding to a selection value matches a user group that includes the user as a member; based on the selection value and the candidate parameters, a first secret share of the selection result is generated to identify a given digital component with the highest selection value from a plurality of candidate digital components, wherein each candidate digital component is a digital component whose selection value corresponds to a candidate parameter indicating that the second user group identifier corresponding to the selection value matches a user group that includes the user as a member; and the first secret share of the selection result identifying the given digital component is transmitted to a client device. Other embodiments of this aspect include corresponding apparatus, systems, and computer programs encoded on computer storage devices and configured to perform aspects of the method.
[0004] These and other implementations may optionally include one or more of the following features. In some aspects, determining the candidate parameters for each selected value includes determining a first secret share of the candidate parameters for each selected value.
[0005] The first secret share for generating the selection result may include: generating the order of selection values based on the magnitude of each selection value; determining the first secret share of the cumulative value of each selection value based on the order of selection values and the candidate parameters for each selection value, wherein the cumulative value for each selection value indicates the position of the selection value in the ranking order of multiple candidate selection values; for each selection value, determining the first secret share of the winner parameter based on (i) the candidate parameters of the selection value and (ii) the result of an equality test indicating whether the cumulative value for the selection value is a specified value; and for each selection value, determining the first secret share of the sum of the products of the winner parameter for the selection value and the digital component information element for the selection value as the first secret share of the selection result.
[0006] Determining the first secret share of the cumulative value for each selection value can include: for each individual selection value, determining the number of candidate values between the highest selection value and the individual selection value, each candidate value having a second user group identifier corresponding to the selection value that matches at least one of one or more first user group identifiers. This specified value can be one.
[0007] In some aspects, the distributed point function is generated based on multiple user groups, including users of client devices as members. In some aspects, the digital component request includes a user group request key based on a set of context signals for the digital component slot, and identifying multiple selection values includes identifying each selection value in a data structure that has a lookup key matching the user group request key.
[0008] The subject matter described in this specification can be implemented in specific embodiments to achieve one or more of the following advantages. Using a secure MPC process executed by two or more MPC servers operated by different parties to select digital components based on a secret share of user information ensures that user information cannot be accessed in plaintext by the MPC server or another party in the absence of unauthorized collusion between the MPC servers. The user's client device is capable of generating a probabilistic data structure, such as a cuckoo filter, representing user groups that include the user as a member, and is capable of generating a distributed point function based on the probabilistic data structure. The distributed point function is a secret share cryptographically representing whether a user is a member of a user group. Using the probabilistic data structure and distributed point function in this way protects user privacy by preventing access to the user's group membership and reduces the size of information provided to the MPC cluster. This reduction in data size reduces the amount of bandwidth consumed in transmitting information, reduces latency during information transmission, and reduces the amount of processing power and associated battery power required for battery-powered devices (e.g., mobile devices) to transmit information.
[0009] MPC clusters can transmit a secret share that identifies the results of selecting digital components using a secure MPC process. By sending only the secret share of the results of selecting digital components, rather than sending information about all digital components or a large set of digital components, bandwidth, latency, processing power, and battery power consumed in transmitting and receiving results are similarly reduced. This also reduces the potential leakage of confidential information from the content platform that submits the selection values of digital components to the MPC cluster by limiting the number of digital components that provide information to client devices.
[0010] The various features and advantages of the above-described subject matter are described below with reference to the accompanying drawings. Additional features and advantages will be apparent from the subject matter described herein and the claims. Attached Figure Description
[0011] Figure 1 This is a block diagram of the environment in which the MPC cluster performs a secure MPC process to select digital components for distribution to client devices.
[0012] Figure 2 This is a swimlane diagram of an example process for selecting digital components to be displayed on the client device.
[0013] Figure 3 This is a swimlane diagram of an example process for selecting digital components to be distributed to client devices.
[0014] Figure 4 This is a flowchart illustrating an example process for selecting digital components to be distributed to client devices.
[0015] Figure 5 This is a block diagram of an example computer system.
[0016] In the various figures, the same reference numerals and names indicate the same elements. Detailed Implementation
[0017] This document typically describes systems and technologies used to secure information during content selection and distribution. An MPC cluster of server computers can perform secure MPC processes to select digital components based on user information without requiring any single MPC server to access the user information in plaintext in the absence of unauthorized collusion. Probabilistic data structures and / or distributed point functions can be used to send user information to the MPC cluster to reduce the data size of information transmitted over the network and maintain information security during transmission.
[0018] Figure 1This is a block diagram of an environment 100 in which an MPC cluster performs a secure MPC process to select digital components for distribution to client device 110. Example environment 100 includes a data communication network 105, such as a local area network (LAN), wide area network (WAN), Internet, mobile network, or a combination thereof. Network 105 connects client device 110, secure MPC cluster 130, publisher 140, website 142, content platform, such as supply-side platform (SSP) 170, and demand-side platform DSP (150). Example environment 100 may include many different client devices 110, secure MPC cluster 130, publisher 140, website 142, DSP 150, and SSP 170.
[0019] Client device 110 is an electronic device capable of communicating via network 105. Example client device 110 includes a personal computer, a mobile communication device such as a smartphone, and other devices capable of sending and receiving data via network 105. The client device may also include a digital assistant device that accepts audio input via a microphone and outputs audio via a speaker. When the digital assistant detects a “hot word” or “hot phrase” that activates the microphone to accept audio input, the digital assistant can be put into listening mode (e.g., ready to accept audio input). The digital assistant device may also include a camera and / or display to capture images and visually present information. The digital assistant can be implemented in various forms of hardware devices, including wearable devices (e.g., watches or glasses), smartphones, speaker devices, tablet devices, or other hardware devices. The client device may also include a digital media device, such as a streaming device that plugs into a television or other display to stream video to a television, gaming system, or virtual reality system.
[0020] Client device 110 typically includes applications 112, such as web browsers and / or native applications, to facilitate sending and receiving data over network 105. Native applications are applications developed for a specific platform or device (e.g., a mobile device with a specific operating system). Publisher 140 is able to develop and provide (e.g., make available for download) native applications to client device 110. For example, in response to a user of client device 110 entering the resource address of resource 145 in the address bar of a web browser or selecting a link referencing the resource address, the web browser can request resource 145 from the web server of website 142 hosting publisher 140. Similarly, native applications can request application content from the publisher's remote server.
[0021] Some resources, application pages, or other application content may include digital component slots for displaying digital components along with resource 145 or application pages. As used throughout this document, the phrase "digital component" refers to a discrete unit of digital content or digital information (e.g., a video clip, audio clip, multimedia clip, image, text, or another unit of content). Digital components may be stored electronically as a single file or as a collection of files on a physical storage device, and digital components may take the form of video files, audio files, multimedia files, image files, or text files and include advertising information, making advertising a type of digital component. For example, a digital component may be content designed to complement the content of a web page or other resource displayed by application 112. More specifically, a digital component may include digital content related to the resource content (e.g., a digital component may relate to the same topic as the web page content, or a related topic). Thus, the provision of digital components can complement and generally enhance the web page or application content.
[0022] When application 112 loads resources (or application content) that include one or more digital component slots, application 112 can request digital components for each slot. In some implementations, the digital component slots can include code (e.g., scripts) that enables application 112 to request digital components from a digital component distribution system that selects and provides the digital components to application 112 for display to a user of client device 110. As described below, application 112 can request digital components from MPC cluster 130 and / or one or more SSPs 170.
[0023] Some publishers 140 use SSP 170 to manage the process of acquiring digital components for their resources and / or applications' digital component slots. SSP 170 is a technology platform implemented in hardware and / or software that automates the process of acquiring digital components for resources and / or applications. Each publisher 140 can have one or more SSP 170s. Some publishers 140 may use the same SSP 170.
[0024] Digital component provider 160 is capable of creating (or otherwise distributing) digital components for display in digital component slots of publishers' resources and applications. Digital component provider 160 can use DSP 150 to manage the provision of its digital components for display in digital component slots. DSP 150 is a hardware and / or software-implemented technology platform that automates the process of distributing digital components for display with resources and / or applications. DSP 150 can interact on behalf of digital component provider 160 with multiple supply-side platforms (SSPs) to provide digital components for display with resources and / or applications of multiple different publishers 140. Typically, DSP 150 can (e.g., from SSPs) receive requests for digital components, generate (or select) selection values for one or more digital components created by one or more digital component providers based on those requests, and provide the SSPs with data related to the digital components (e.g., the digital components themselves) and selection parameters. The selection values can indicate the quantity that digital component provider 160 is willing to provide for display or user interaction with the digital components. Then, the SSP can select the digital component to be displayed at the client device 110 and provide the client device 110 with data that causes the client device 110 to display the digital component.
[0025] In some cases, receiving digital components related to web pages, application pages, or other electronic resources that a user has previously accessed and / or interacted with is beneficial to the user. To distribute such digital components to users, when a user accesses a specific resource or performs a specific action on that resource (e.g., interacting with a specific item displayed on a web page or adding that item to a virtual shopping cart), the user can be assigned to a user group, such as a user interest group, a group of similar users, or other group types involving similar user data. User groups can be generated by digital component providers 160. That is, when a user accesses an electronic resource provided by a digital component provider 160, each digital component provider 160 can assign the user to their user group. User groups can also be created by content platforms, such as DSP 150 and / or SSP 170.
[0026] To protect user privacy, user group memberships can be maintained at the user's client device 110, for example, by one of the applications 112 or the operating system of the client device 110, rather than by the digital component provider, content platform, or other party. In a specific example, a trusted program (e.g., a web browser or operating system) can maintain a list of user group identifiers ("user group list") for users using a web browser or another application (e.g., users logged into a browser, application, or client device 110). The user group list can include a group identifier for each user group to which the user is a member. The digital component provider 160 that creates the user groups can assign user group identifiers to their user groups. The user group identifier can describe the group (e.g., a gardening group) or represent the group using a code (e.g., a non-descriptive alphanumeric sequence). The user's user group list can be stored in secure storage at the client device 110 and / or can be encrypted at storage to prevent access to the list by others.
[0027] When application 112 displays resources or application content related to digital component provider 160 or a web page on website 142, the resource can request application 112 to add one or more user group identifiers to the user group list. In response, application 112 can add one or more user group identifiers to the user group list and securely store the user group list.
[0028] MPC cluster 130 can use a user's user group membership to select digital components or other content that the user may be interested in or that may otherwise benefit the user / user device. For example, such digital components or other content may include data that improves user experience, enhances the operation of the user device, or otherwise benefits the user or user device. However, the user group identifier of the user's user group list can be provided and used to prevent the computing systems MPC1 and MPC2 in MPC cluster 130 from accessing the user's user group identifier in plaintext when selecting digital components, thereby protecting user privacy when using user group membership data to select digital components. Plaintext is text that is not computationally marked, specially formatted, or written in code or data (including binary files) in a form that can be viewed or used without the need for keys or other decryption devices or other decryption processes.
[0029] Secure MPC cluster 130 includes two computing systems, MPC1 and MPC2 (e.g., server computers), which perform secure MPC processes to select digital components for distribution to client devices based on user group membership, but without accessing group membership information in plaintext. While the example MPC cluster 130 includes two computing systems, more computing systems can be used, as long as MPC cluster 130 includes more than one. For example, MPC cluster 130 can include three, four, or other suitable numbers of computing systems. Using more computing systems in MPC cluster 130 provides greater security, but also increases the complexity of the MPC process.
[0030] Computing systems MPC1 and MPC2 can be operated by different entities. In this way, each entity may not be able to access a user's group membership in plaintext. For example, one of the computing systems MPC1 or MPC2 can be operated by a trusted party different from the user, publisher 140, DSP 150, SSP 170, and digital component provider 160. For example, an industry group, a government group, or a browser developer can maintain and operate one of the computing systems MPC1 and MPC2. Other computing systems can be operated by a different group among these groups, such that different trusted parties operate each computing system MPC1 and MPC2. Preferably, the different parties operating the different computing systems MPC1 and MPC2 have no incentive to collude to compromise user privacy. In some implementations, computing systems MPC1 and MPC2 are architecturally separate and monitored to not communicate with each other except to perform the secure MPC processes described herein.
[0031] In addition to the descriptions throughout this document, controls (e.g., user interface elements that users can interact with) can be provided to users to allow them to choose whether and when the systems, programs, or features described herein can enable the collection of user information (e.g., information about the user's social networks, social actions or activities, occupation, user preferences, or the user's current location), and whether to send content or communications to the user from a server. Furthermore, certain data can be processed in one or more ways before being stored or used, such that personally identifiable information is removed. For example, a user's identity can be processed so that personally identifiable information about the user cannot be determined, or, if location information is available, the user's geographic location can be generalized (e.g., generalized to a city, zip code, or state level), making the user's specific location impossible to determine. Therefore, users can control what information about themselves is collected, how that information is used, and what information is provided to them.
[0032] Figure 2This is a swimlane diagram of an example process 200 for selecting a digital component to be displayed at a client device. The operation of process 200 can be implemented, for example, by client device 110, computing systems MPC1 and MPC2 in MPC cluster 130, and DSP 150. The operation of process 200 can also be implemented as instructions stored on one or more computer-readable media, which may be non-transitory, and execution of the instructions by one or more data processing devices can cause one or more data processing devices to perform the operation of process 200. Although process 200 and the following other processes are described with respect to two computing systems MPC cluster 130, MPC clusters with more than two computing systems can also be used to execute similar processes. Additionally, the operation of process 200 can be implemented by SSP 170.
[0033] DSP 150 provides selection values (202) for digital components to MPC cluster 130. In some cases, DSP 150 can provide selection values to MPC cluster 130 via SSP 170. As described above, the selection values can indicate the amount of information the digital component provider 160 is willing to provide for displaying or interacting with the user of the digital component. MPC cluster 130 can store selection values for future digital component requests received from client device 110. For each digital component, DSP 150 can also upload additional data for the digital component, such as metadata. The additional data for the digital component can include a user group identifier corresponding to the user group of the digital component. For example, DSP 150 can manage the activities of client device 110 where digital components are distributed to users who are members of the user group.
[0034] The data used for the digital component can include a context selection signal indicating the context in which the digital component is qualified, such as the location of the client device 110, the spoken language selected for application 112, and / or a generic resource locator (URL) that can be used to display resources of the digital component. This data for the digital component can also identify the digital component, for example, using a unique identifier, a domain from which the digital component can be obtained, and / or other appropriate data for the digital component.
[0035] In some implementations, the MPC cluster 130 caches or otherwise stores the selection values of digital components provided to the MPC cluster 130 for digital component requests. In this example, the context signals for digital components and selection values can include the context signals contained in the digital component request.
[0036] In some implementations, each computing system MPC1 and MPC2 uses a two-level lookup table (LUT) to store selection values for digital components. Using a two-level LUT offers some performance advantages, but other suitable data structures can also be used. The first level can be keyed by a user group request key (UG_Request_Key). UG_Request_Key can be a composite message based on a set of context signals, such as a set of context signals requested by the digital component (e.g., URL, location, language, etc.) or a set of context signals that the digital component is eligible to distribute. That is, the first-level LUT can be keyed based on the set of context signals. The key used for the first level can be a hash of UG_Request_Key, for example, using a hash function such as SHA256. This key can be truncated to a specified number of bits, for example, 16 bits, 32 bits, or other suitable number of bits. The value of each key UG_Request_Key in the first-level LUT can instruct a second-level LUT, which includes data for a digital component requesting a qualified digital component for a context signal including UG_Request_Key. For example, for each unique key UG_Request_Key, a two-level LUT can have a corresponding second-level LUT.
[0037] Example first-level LUTs are shown in Table 1 below.
[0038] Key value SHA256(UG_Request_Key) Second-level LUT … ...
[0039] Table 1
[0040] The second-level LUT can be keyed based on a user group identifier. In some implementations, for example, if the second-level LUT is a single table containing data with multiple keys UG_Request_Key, the second-level LUT can be keyed based on a combination of the key UG_Request_Key and the user group identifier. In this example, the value for each SHA256(UG_Request_Key) is a pair (beginning_row, ending_row) to specify a sub-section (i.e., consecutive rows) of the LUT corresponding to the SHA256(UG_Request_key). Each row in the second-level LUT can be used for a specific selection value for a particular digital component. For example, the DSP150 can submit different selection values for the same digital component, where each selection value is for a different set of scene signals and / or a different user group identifier. Therefore, the selection value for the digital component can vary based on the scene.
[0041] DSP 150 or digital component provider 160 can associate (e.g., link or map) digital components to user groups to which DSP 150 or digital component provider wants to display the digital components. For example, DSP 150 might want to display digital components related to men's basketball shoes to men who have shown interest in basketball and / or shoes. In this example, DSP 150 can provide MPC cluster 130 with data indicating that the digital component corresponds to a user group identifier that includes men who have shown interest in basketball and / or shoes.
[0042] In some implementations, the key for a row in the second-level LUT can be a hash or code generated based on a combination of the user group request key UG_Request_Key and the user group identifier of the row's numeric component. For example, the key could be a hash-based message authentication code (HMAC) of that combination, which could be represented as HMAC SHA256 (UG_Request_Key, ug_id). The user group identifier ug_id can be a combination of the user group's internal user group identifier and the domain of the user group's owner (e.g., the DSP, SSP, or digital component provider that owns the user group). For example, the user group identifier ug_id can be a digital digest of the owner's eTLD+1 and the user group's owner's internal user group identifier. eTLD+1 is the valid top-level domain (eTLD) plus a domain one level higher than the public suffix. An example of eTLD+1 is "example.com", where ".com" is the top-level domain. ug_id can be truncated to 16 bytes or other appropriate data size.
[0043] Continuing with the previous example of men's basketball shoes, the second-level lookup key for the row containing information about the digital components to be displayed to users in the men's basketball shoe group can be a combination of the user group request key UG_Request_Key and the user group identifier ug_id for the men's basketball shoe group. Because the digital components can be displayed in different contexts, the second-level lookup table can include multiple rows of digital components associated with different user group identifiers containing the user group identifier ug_id for the men's basketball shoe group, each row having a different user group request key UG_Request_Key and a different value.
[0044] The value of each row in a Level 2 LUT can be a selection value for a digital component and other data about the digital component, such as metadata identifying the digital component or indicating its network location from which it can be downloaded. This value can be a digital component information element (dc_information_element), which can be a byte array containing the selection value and metadata. The byte array can have a specific format that can be parsed by the trusted program of application 112 or client device 110 and computing systems MPC1 and MPC2 to obtain the selection value and metadata. An example Level 2 LUT is shown in Table 2 below.
[0045] Key value HMAC(UG_Request_Key,UG_ID) {Select Value, Metadata} … …
[0046] Table 2
[0047] The second-level LUT maps the selected value to a specific digital component, to a specific user group identifier (ug_id), and to a specific set of context signals defined by the first-level lookup key (UG_Request_Key), which can, in some cases, be present in the computation of the second-level LUT key. In doing so, the second-level LUT indicates the specific context of the digital component slot for which the selected value is expected. This allows the DSP 150 or the digital component provider 160 to specify different selected values for the same digital component for different contexts defined by the context signals and the user's group membership. When a digital component request is received indicating that the user to whom the digital component will be displayed is a member of a specific user group identified by the specific user group identifier (ug_ig) and that the digital component will be displayed in a specific context defined by the context signals of the first-level lookup key, any selected value in the second-level LUT with a matching user group identifier and a matching first-level lookup key is a candidate selected and distributed in response to that request.
[0048] Client device 110 receives content (204). For example, client device 110 is capable of receiving electronic resources (e.g., web pages) for display by a web browser or application content for display by a native application. The content may include one or more digital component slots, which include computer-readable code, such as a script, that, when executed, causes client device 110 to request digital components for each slot. Client device 110 is capable of rendering the content on its display.
[0049] Client device 110 identifies a set of user group identifiers (206). The set of user group identifiers can be user group identifiers that include user groups as members. For example, the set of user group identifiers can be user group identifiers in a list of user groups. Application 112, which renders content or is a trusted program, can identify the set of user group identifiers, for example, by accessing a list of user groups from the secure storage of client device 110.
[0050] Client device 110 generates a probabilistic data structure (208). Application 112 or a trusted program can use the set of user group identifiers to generate the probabilistic data structure. In some implementations, the probabilistic data structure is a cuckoo filter with tables using two hash functions F1 and F2. Cuckoo hashing is a hashing method that uses two (or more) tables with a total of (1 + \epsilon)N entries to store N items, such as user group identifiers, such that each entry will contain at most one item. Additionally, each item, such as a user group identifier, will appear in one of the two entries defined by one of the two hash functions F1 and F2, the output of which is the set [(1 + \epsilon)N]. The item associated with key k will appear at position F1(k) in the first table or position F2(k) in the second table. For a fairly large number of N items (e.g., N ≥ 1000), using \epsilon = 0.1 is sufficient, meaning that N items can be hashed using cuckoo hashing, where the combined table size is 1.1N. In these expressions, epsilon can be referred to as a load factor.
[0051] To construct a sparse private information retrieval data structure using the Cuckoo Filter, up to N user group identifiers are hashed into two tables using the Cuckoo Hash algorithm. These tables are combined to have a size of 1.1N or another suitable size. All empty entries can be replaced with a 0-bit string. To query the user group identifier associated with the key k, the user group identifier (if it exists in the data structure) will appear at entry F1(k) in the first table or F2(k) in the second table. Using a table size C = 1.1N, we get 1 ≤ F1(ug_id), F2(ug_ic) ≤ C.
[0052] Client device 110 generates a cuckoo filter by calculating two possible positions for each user group identifier in the set of user group identifiers using hash functions F1 and F2. If at least one of the two possible positions is empty, client device 110 inserts an element into the empty position, which can be in either table, to complete the insertion process for that user group identifier. If both positions are occupied, client device 110 randomly selects a position and swaps the item currently in that position with the item to be inserted. Client device 110 can then recalculate the two hash functions F1 and F2 and attempt the insertion again. This process is repeated for each user group identifier in the set of user group identifiers until the insertion succeeds or too many attempts fail. After the cuckoo filter is constructed, each user group identifier ug_id is stored in a specific index of the table.
[0053] Client device 110 generates a distributed point function (210). Application 112 or a trusted program can use the point function and the Cuckoo Filter table to generate the distributed point function. The distributed point function represents the secret shares of the point function. Generally, a point function is a function f i : [N]→[N], where f(x) = 0 when x! = i and f(i) = 1. Point function f i The secret sharing is between two functions g. i : [N]→[N] and h i : [N]→[N], such that for all x in the set [N], f i (x)=g i (x)+h i (x). Furthermore, given the function h... i or g i (But not both) a detailed explanation, it is impossible to recover the original function f. i .
[0054] For each ug_id, a dot function G is needed. ug_id It can be decomposed into distributed point functions g ug_id,1 and g ug_id,2 This makes for The following relations 1 and 2 are satisfied.
[0055] If i = F1(ug_id), then G ug_id (i)=g ug_id,1 (i)+g ug_id,2 (i) = ug_id (1)
[0056] Otherwise G ug_id (i)=g ug_id,1 (i)+g ug_id,2 (i)=0 (2)
[0057] Similarly, a point function H is needed. ug_id It can be decomposed into distributed point functions h ug_id,1 and h ug_id,2 This makes for The following relations 3 and 4 are satisfied.
[0058] If i = F2(ug_id), then H ug_id (i)=h ug_id,1 (i)+h ug_id,2 (i) = ug_id (3)
[0059] Otherwise H ug_id (i)=h ug_id,1 (i)+h ug_id,2 (i)=0 (4)
[0060] In other words, a distributed point function can be evaluated at multiple possible points (e.g., multiple possible user group identifiers), but the result is always zero except for the user group identifier ug_id of the user group that includes the user as a member and for which the distributed point function is generated. Distributed point functions have a very small data size, which can be transmitted over the network without using much bandwidth and with low latency compared to sending user group identifiers in other encrypted forms.
[0061] Given a user group identifier ug_id, a point function F1, and a corresponding first table of the cuckoo filter, the client device 110 generates a distributed point function g for computing system MPC1. ug_id,1 and the distributed function g used for computing system MPC2 ug_id,2 Similarly, given the user group identifier ug_id, the point function F2, and the corresponding second table of the cuckoo filter, the client device 110 generates the distributed point function h for computing system MPC1. ug_id,1 and the distributed point function h used for computing system MPC2 ug_id,2 .
[0062] Client device 110 transmits a digital component request (212) including distributed point functions to MPC cluster 130. The digital component request can include a pair of distributed point functions for each user group identifier (ugid). Client device 110 can also transmit a request to computing system MPC1 including each distributed point function g. ug_id,1 and each distributed point function h ug_id,1 The client device 110 requests a digital component. The digital component request may include a first-level lookup key, such as SHA256 (UG_Request_Key). The client device 110 can generate the first-level lookup key based on contextual signals of the digital component request. For example, the client device 110 can generate the first-level lookup key by generating a composite message that includes contextual signals such as the URL of the resource with which the selected digital component will be displayed, the location of the client device 110 submitting the digital component request, and the spoken language of the application 112 that will display the selected digital component. The client device 110 can then apply a hash function, such as SHA256, to the composite message to generate the first-level lookup key.
[0063] Similarly, client device 110 can transmit data including each distributed point function g to computing system MPC2. ug_id,2 and each distributed point function h ug_id,2The digital component request can also include a first-level lookup key, such as SHA256(UG_Request_Key). Since the context signals are the same, the first-level lookup key can be the same for digital component requests sent to the two computing systems MPC1 and MPC2 in the MPC cluster 130.
[0064] The computing system MPC1 can create additive secret shares [M1] = [m 1,1 , ...m C,1 A vector, where for 1≤i≤C, m i,1 =∑ ug_id g ug_id,1 (i). Parentheses are used in this document to denote secret shares. The subscript following the comma specifies the secret share; for example, gug_id, 1 is the first secret share, gug_id, 2 is the second secret share. Similarly, the computational system MPC2 can create additive secret shares [M2] = [m 1,2 , ...m C,2 A vector, where for 1≤i≤C, m i,2 =∑ ug_id g ug_id,2 (i). In this example, the secret share [m] i,1 ] and [m i,2 ] is G ug_id (i) are additive secret shares of M, and [M1] and [M2] are two additive secret shares of M, i.e., vectors of dimension C, where M i =G ug_id (i) The ability to generate secret shares using Shamir's secret sharing or another suitable secret sharing technique. Computational systems MPC1 and MPC2 are capable of targeting point functions h. ug_id,1 (i) and h ug_id,1 (i) Generate similar vectors.
[0065] MPC cluster 130 uses distributed point functions to execute a secure MPC process to select digital components (214) based on user groups that include the user of client device 110 as a member. This can include identifying eligible selection values for digital components in two-level lookup tables of computing systems MPC1 and MPC2 using a first-level lookup key. It can also include identifying selection values for digital components as candidates for selection based on digital components having user group identifiers that match one of the user's user group identifiers. It can also include selecting a digital component from candidate digital components based on the selection values of the digital components. This can be performed entirely even if computing systems MPC1 or MPC2 cannot access user group identifiers in plaintext. Figure 3The diagram below illustrates and describes an example process for selecting digital components using a secure MPC process.
[0066] MPC cluster 130 transmits a secret share (216) of the selection result to client device 110. The selection result can be in the form of a byte array including information about the selected digital component. For example, the selection result can be a byte array including the value of the digital component in a second LUT (e.g., the selection value of the digital component and the metadata of the digital component). Computing systems MPC1 and MPC2 can use a secure MPC process to determine the secret share of the selection result, as described in more detail below. Computing system MPC1 can transmit a first secret share of the selection result to client device 110, and computing system MPC2 can send a second secret share of the selection result to client device 110. To prevent computing systems MPC1 and MPC2 from knowing the selected digital component, computing systems MPC1 and MPC2 can prevent each other from sharing their secret shares of the selection result. For example, computing systems MPC1 and MPC2 can use the public key of an application (e.g., a browser) to independently encrypt their secret shares.
[0067] When using a cuckoo filter across two tables, the MPC cluster 130 can provide a secret share of the two selection results, one for each table. However, retrieving the selection values from the two user group lists of the two numeric components can lead to discarded selection values. To mitigate this risk, the MPC cluster 130 can use another secure MPC technique to return at most one selection result with the highest selection value, as described below.
[0068] Client device 110 determines the digital component (218) corresponding to the selection result. For each selection result for which client device 110 receives two secret shares from computing systems MPC1 and MPC2, client device 110 is able to determine the selection result from these two secret shares. For example, using an additive secret share library as described in more detail below, client device 110 is able to add the two secret shares of the selection result together to obtain the selection result in plaintext. This allows client device 110 to access the selection value of the digital component and the metadata of the digital component, such as the identity of the digital component, the location from which client device 110 can download the digital component, etc.
[0069] Client device 110 can display a digital component (220). For example, application 112 can display a digital component having the content received in step 204. In some embodiments, client device 110 can display a digital component with the selection result. If two selection results are received, client device 110 (e.g., application 112) can select the digital component with the highest selection value and display the selected digital component.
[0070] In some implementations, client device 110 can request digital components based on user group membership from MPC cluster 130. Client device 110 can also request digital components based on context signals from SSP 170. These context signals can include the same context signals described above, as well as optional additional context signals, such as the number of digital component slots for the resource, the type of digital component slots, and the type and / or format of digital components that can be displayed with the resource. SSP 170 can select one or more digital components based on the context signals and selection values for the digital components, and provide client device 110 with the selected digital components (or data identifying the digital components) and one or more selection values for the digital components. Client device 110 can then select the digital components to be displayed with the resource from a set of digital components including the selection results received from MPC cluster 130 and the digital components selected by SSP 170.
[0071] If the resource includes multiple digital component slots, the client device 110 can request the corresponding digital component for each slot from the MPC cluster 130 and from the SSP 170. To reduce bandwidth consumption and latency, the client device 110 can transmit distributed point functions for the user for all digital component slots at once.
[0072] Although the steps used to generate the cuckoo filter and the distributed point function are in Figure 2 The code is shown to be executed after receiving content, but client device 110 can generate the cuckoo filter and distributed point function before receiving content. For example, client device 110 can periodically or in response to a user's group membership being updated, generate and cache the cuckoo filter and distributed point function.
[0073] Figure 3 This is a swimlane diagram of an example process 300 for selecting digital components to be distributed to client devices. The operation of process 300 can be implemented, for example, by computing systems MPC1 and MPC2 in the MPC cluster 130. The operation of process 300 can also be implemented as instructions stored on one or more computer-readable media, which may be non-transitory, and execution of the instructions by one or more data processing devices can cause the one or more data processing devices to perform the operation of process 300.
[0074] The computing system MPC1 identifies a qualified selection value (302). The computing system MPC1 is capable of identifying a qualified selection value for a digital component request received from the client device 110, for example, as referred to above. Figure 2As stated above. For each user group that includes users of the client device as members, the digital component request can include a distributed point function g generated by the client device 110 using hash function F1 for the user group identifier ug_id. ug_id,1 The digital component request can also include a distributed point function h generated by the client device 110 using hash function F2 for the user group identifier ug_id. ug_id,1 The digital component request can also include a first-level lookup key generated based on the context signal of the digital component request, such as SHA256 (UG_Request_Key).
[0075] The computing system MPC1 is capable of identifying eligible selection values using a first-level lookup key requested by a digital component. The computing system MPC1 can access a first-level LUT and use the first-level lookup key to identify rows of a second-level LUT, which includes information about the selection values of digital components eligible for display (e.g., for which they have received selection values) based on the set of context signals represented by the first-level lookup key. For example, as described above, each row of the second-level LUT includes information about the digital component and a second-level lookup key based on the set of context signals. Therefore, the computing system MPC1 is capable of using the first-level lookup key to identify rows of a second-level LUT having a set of context signals that matches the set of context signals received in the digital component request. These rows include information about digital components eligible for display or having eligible selection values for the context defined by the first-level lookup key received in the digital component request.
[0076] The computing system MPC2 identifies a qualified selection value (304). The computing system MPC2 is capable of identifying a qualified selection value for a digital component request received from the client device 110. For each user group that includes the user of the client device as a member, the digital component request can include a distributed point function g generated by the client device 110 using the hash function F1 for the user group identifier ug_id. ug_id,2 The digital component request can also include a distributed point function h generated by the client device 110 using hash function F2 for the user group identifier ug_id. ug_id,2 The digital component request can also include a first-level lookup key generated based on the context signal of the digital component request, such as SHA256 (UG_Request_Key).
[0077] The first-level lookup key for the digital component request received by computing system MPC2 can be the same as the first-level lookup key received by computing system MPC1. Each distributed point function g ug_id,2 Able to base on the same distributed point function G as the corresponding distributed point function received by the computing system MPC1 ud_idTo generate it. That is, for a user group identifier ud_id that includes users as members, the client device 110 can use the hash function F1 to generate the distributed function g for the digital component request. ug_id,1 and g ug_id,2 Similarly, for a user group identifier ud_id that includes a user as a member, the client device 110 can use the hash function F2 to generate the distributed function h for the digital component request. ug_id,1 and h ug_id,2 .
[0078] For the sake of brevity, the remaining steps of process 300 are described in terms of selecting a digital component to be distributed to client device 110 in response to a digital component request based on the distributed point function of hash function F1. However, the same steps can be performed on the distributed point function of hash function F2. This allows for two selected digital components, and the MPC cluster 130 can perform additional operations to select one of the two digital components, as described below.
[0079] Computing system MPC2 can identify eligible selection values using the first-level lookup key requested by the digital components. Computing system MPC2 can access the first-level LUT and use the first-level lookup key to identify rows in the second-level LUT, which include information about digital components eligible to be displayed for the set of scene signals represented by the first-level lookup key (e.g., those that have received selection values). As described above, each computing system MPC1 and MPC2 can maintain corresponding two-level LUTs including the same information.
[0080] For each eligible selection value, computing systems MPC1 and MPC2, in response to a digital component request, determine whether the selection value and its digital component are candidates to be selected for distribution to client device 110 (308). A candidate selection value is an eligible selection value for a digital component that has a user group identifier that matches the user's user group identifier (e.g., a user group identifier that includes the user as a member of a user group). As described above, each digital component can be mapped to one or more user groups, including those indicated by DSP 150 or digital component provider 160 as members to whom the digital component should be displayed. As described above, this information (i.e., ug_id) is part of the second-level lookup key of the second-level LUT.
[0081] In the second-level LUT, the numeric component of a row is a candidate for selection if its group identifier ug_id, as part of the second-level lookup key for that row, matches one of the user's group identifiers. Conceptually, in order to use a two-table cuckoo filter to determine whether a numeric component is a candidate to represent a user's group membership, the computational system is able to determine whether the group identifier ug_id of the second-level lookup key matches one of the two tags in one of the two cuckoo filter positions.
[0082] Computational systems MPC1 and MPC2 can use a secure MPC technique that leverages secret shares to identify candidate selection values, ensuring that neither MPC1 nor MPC2 knows which numeric components are candidates or user groups that include the user as a member. To do this, MPC1 computes a first share of the candidate parameter `is_dc_a_candidate` for each numeric component in a row of the second-level LUT used as a candidate for selection. Similarly, MPC2 computes a second share of the candidate parameter `is_dc_a_candidate` for each numeric component in a row of the second-level LUT used as a candidate for selection. The candidate parameter `is_dc_a_candidate` can be a Boolean value (e.g., zero or one) indicating whether the selection value linked to the user group identifier `ug_id` and the corresponding numeric component is a candidate.
[0083] The first share of the candidate parameter is_dc_a_candidate for the digital component dc can be represented as [is_dc_a_candidate] dc,1 And it is possible to represent the second share of the candidate parameter is_dc_a_candidate as [is_dc_a_candidate] dc,2 The first secret share of the candidate parameter for the numeric component dc in the second-level LUT, which is used for selection and is associated with the user group identifier ug_id, is Boolean. The secret share, which is equivalent to ug_id == [g ug_id,1 (F1(ug_id))]. The second secret share of the candidate parameter, which is the numeric component dc of the row in the second-level LUT used for selection and associated with the user group identifier ug_id, is a boolean. The secret share, which is equivalent to ug_id == [g ug_id,1 (F1(ug_id))]. The symbol "==" represents an equality test, which is true (or 1) if the two values are equal or false (or 0) if the values are not equal.
[0084] Computing systems MPC1 and MPC2 can use secure MPC techniques to compute secret shares [is_dc_a_candidate] against hash function F1 in one or more round trips between computing systems MPC1 and MPC2. dc,1 ] and [is_dc_a_candidate dc,2 [to evaluate ug_id==[g] ug_id,1 (F1(ug_id))] and ug_id == [g ug_id,1 The equality expression of (F1(ug_id))]. That is, computing systems MPC1 and MPC2 can, for each user group identifier received from client device 110 as a part of the digital component request, base their equality expression on the distributed point function g. ug_id,1 and g ug_id,2 To determine the secret share of each numeric component associated with the user group identifier ug_id [is_dc_a_candidate] dc,1 ] and [is_dc_a_candidate dc,2 ].
[0085] Computing systems MPC1 and MPC2 are capable of using secret sharing techniques or secret sharing libraries that support the operations shown in Table 3 below. One example secret sharing technique that supports these operations is Security Through Private Information Aggregation (SEPIA).
[0086]
[0087] Table 3
[0088] Computing system MPC1 determines the order of the selected values (308). Similarly, computing system MPC2 determines the order of the selected values (310). Each computing system MPC1 and MPC2 is capable of determining the order of the selected values in its second-level LUT. If both-level LUTs include a second-level LUT for each user group request key UG_Request_Key, then the order can include all selected values in the second-level LUT, including candidate selected values and non-candidate selected values. The order can be from the highest selected value to the lowest selected value. In some implementations, the selected values used for the order can be values provided to the resource publisher after the selected digital components are displayed, for example, after any sharing with DSP 150 and / or SSP 170. Since the selected values are plaintext, computing systems MPC1 and MPC2 do not need to perform any round-trip computation to sort the selected values. Alternatively, each computing system MPC1 and MPC2 can independently sort the selected values in its second-level LUT. If the selection value is stored as a secret share at each computing system MPC1 and MPC2, where each computing system MPC1 and MPC2 has a corresponding secret share for each selection value, then computing systems MPC1 and MPC2 can use round-trip computation to perform a secure MPC process to sort the selection values.
[0089] The computational systems MPC1 and MPC2 determine the secret share of the cumulative value for each candidate selection value (312). Conceptually, the cumulative value of a given selection value of a digital component represents the total number of candidate selection values from the top of the order to the given selection value (including the given selection value if it is a candidate). This concept is illustrated in Table 4 below.
[0090] Sort selection value is_dc_a_candidate Cumulative value (acc) Is the cumulative value equal to 1? Highest 0 0 0 Second highest 1 1 1 Third highest 0 1 1 Fourth High 1 2 0 … … … …
[0091] Table 4
[0092] In some implementations, the cumulative value of a given selection value for a digital component represents the total number of candidate selection values from the top of the order up to the given selection value (excluding the given selection value if it is a candidate). In this example, the fourth column would indicate whether the cumulative value is equal to zero instead of one. In either case, the cumulative value of each selection value indicates the position of the selection value in the ranking order of candidate selection values, which are selected based on the association of the selection value with a user group identifier that matches the user's user group identifier.
[0093] In Table 4, for each selected value with a candidate parameter `is_dc_a_candidate` equal to one, the cumulative value (acc) increases as it progresses from the top to the bottom of the order. For example, the cumulative value `acc` for the highest selected value is zero because the candidate parameter `is_dc_a_candidate` for the highest selected value is zero. The cumulative value `acc` for the second selected value is one because the candidate parameter `is_dc_a_candidate` for the second selected value is one and there is no selected value higher than the second highest selected value with a candidate parameter `is_dc_a_candidate` equal to one. Moving down the order, the candidate parameter `is_dc_a_candidate` for the third highest selected value is zero, so the cumulative value `acc` for the third selected value does not increase from the cumulative value `acc` for the second selected value. Since the candidate parameter `is_dc_a_candidate` for the fourth highest selected value is one, the cumulative value `acc` for the fourth highest selected value increases by one from the cumulative value `acc` for the third highest selected value. Therefore, the cumulative value acc used for the fourth highest selection value is equal to two, because there are two selection values with candidate parameters is_dc_a_candidate from the highest selection value to the fourth highest selection value (inclusive).
[0094] Using this table, computing systems MPC1 and MPC2 will select the digital component corresponding to the candidate parameter is_dc_a_candidate having a value of one and the cumulative value acc having a value of one (as indicated in the fourth column of Table 4) for distribution to client device 110. This indicates the highest-ranking selection value where the candidate parameter is_dc_a_candidate has a value of one. Because the candidate parameter is_dc_a_candidate is in a secret share so that computing systems MPC1 and MPC2 can maintain user privacy and ensure that user data is not leaked, computing systems MPC1 and MPC2 determine the secret share of the cumulative value acc for each selection value and use round-trip computation to determine which selection value has a cumulative value acc equal to one and a candidate parameter is_dc_a_candidate equal to one.
[0095] Computation systems MPC1 and MPC2 can independently determine the secret share of the cumulative value acc for each of their chosen values without any round trip computation. For example, computation system MPC1 can determine the first share of the cumulative value acc[acc] for each chosen value and its corresponding digital component dc by iterating through all chosen values in descending order and summing the candidate parameter is_dc_a_candidate used for the chosen values along the way. dc,1As described in Table 4 above. Similarly, the computing system MPC2 can determine the second share of the cumulative value acc [acc] for each selected value and its corresponding digital component dc by iterating through all selected values in descending order and summing the candidate parameter is_dc_a_candidate used for the selected value along the way. dc,2 ].
[0096] For each selected value, calculation systems MPC1 and MPC2 determine a secret share (314) indicating whether the cumulative value has a specified result. The specified value can be the value one, as shown in columns 3 and 4 of Table 4. As mentioned above, the selected value where the cumulative value acc is one and the candidate parameter is_dc_a_candidate is one is the highest selected value among the candidate selected values.
[0097] Computing systems MPC1 and MPC2 can participate in multiple rounds of computation, such as multiple Remote Procedure Calls (RPCs), as part of a secure MPC process to compute equality operations (acc) based on a secret share of each selected value. dc == 1. At the end of this process, the computational system MPC1 has a result acc for each selected value. dc == 1 is a secret share, while the computational system MPC2 has a result acc for each selected value. dc Another secret share of 1.
[0098] The computing systems MPC1 and MPC2 determine the selection result (316). The computing systems MPC1 and MPC2 are capable of, for each selection value, based on accuracy... dc The secret share of ==1 and the candidate parameter is_dc_a_candidate dc The secret share is used to determine the selection outcome. To do this, computation systems MPC1 and MPC2 are able to calculate the winner parameter `is_dc_the_winner` based on the secret share. dc The winner parameter is_dc_the_winner dc It can be a Boolean value indicating whether the selected value is the winner of the selection process (e.g., whether the digital component corresponding to the selected value is selected for distribution to client device 110 in response to a digital component request).
[0099] The winner parameter for the selected value is_dc_the_winner dc The candidate parameter is_dc_a_candidate can be based on the selected value. dcAnd whether the cumulative value acc of the selected values is equal to the specified value, for example, depends on how the fourth column of Table 4 is determined to be equal to one or zero. In the example below, MPC cluster 130 is able to determine the product of these two parameters for each selected value. Other techniques can also be used to determine the candidate parameter is_dc_a_candidate. dc Whether it is true or one, and whether the cumulative value is equal to the specified value.
[0100] Each computing system, MPC1 and MPC2, is capable of independently calculating the winner parameter is_dc_the_winner based on the secret share for each selected value. dc ==(is_dc_a_candidate) dc ×(acc dc ==1). This requires an RPC between computation systems MPC1 and MPC2 to multiply the two secret shares. At the end of this MPC process, computation system MPC1 has the result is_dc_the_winner. dc A secret share, the result of which is represented as [is_dc_the_winner] dc,1 ] = [is_dc_a_candidate dc,1 ]x([acc dc,1 ]==1). Similarly, the computing system MPC2 has the result is_dc_the_winner. dc Another secret share, the result of which is represented as [is_dc_the_winner] dc,2 ] = [is_dc_a_candidate dc,2 ]x([acc dc,2 [==1]. Note that for all selected values, at most one selected value has a winner parameter is_dc_the_winner equal to one. dc This corresponds to the digital component selected for distribution to client device 110. All other selection values will be equal to zero.
[0101] The calculation systems MPC1 and MPC2 can calculate the selection result based on the winner parameter of the selected value and the digital component information element dc_information_element of the selected value, or the selected value itself. As mentioned above, the digital component information element dc_information_element of the digital component can include the selected value of the digital component and other data of the digital component.
[0102] The computing systems MPC1 and MPC2 can use the following relation 5 to calculate the selection result. F1 .
[0103]
[0104] In this example, the selection result `resultF1` will have a value of zero if no cached selection value exists that matches the user's user group identifier, or it will have a value equal to the value of the selected numeric component's information element `dc_information_element`, which has a value equal to one for `is_dc_the_winner`. dc In another example, the numeric component information element dc_information_element can be replaced in relation 5 using the selected value of the numeric component. In this example, the selection result is... F1 The selected value will have a value of zero if no cached selection value exists that matches the user's user group identifier, or it will have a value equal to the selection value of the selected numeric component that has a value equal to one for is_dc_the_winner. dc .
[0105] In order to perform the calculation in the secret share, the computation system MPC1 obtains all cached selection values and uses the dc_information_element, which can be plaintext, as the digital component information element for the selection value. dc The first secret share multiplied by the winner's parameter [is_dc_the_winner] dc,1 The computing system MPC1 is then able to determine the sum of these products and return the sum to the client device 110 that submitted the digital component request. That is, the computing system MPC1 is able to determine the first share of the result using the sum of the following relation 6.
[0106]
[0107] The computing system MPC2 is capable of performing similar calculations to determine the second share of the result using the following relation 7.
[0108]
[0109] The computing system MPC1 can select the first share of the results. Returning to client device 110. Similarly, computing system MPC2 is able to provide the second share of the selection result. Return to client device 110. Application 112 is then able to use the two secret shares. and Reconstruct the selection result from plaintext F1For example, by determining the sum of secret shares using an additive secret share algorithm. If the result is selected... F1 If the value is zero, then MPC cluster 130 does not identify the numeric component for user groups that include users as members. Otherwise, select the result. F1 Having a value equal to the digital component information element dc_information_element selected during the selection process, application 112 can parse the digital component information element dc_information_element to obtain the selected value and metadata of the digital component. As described above, application 112 can then display the digital component or use that digital component and other digital components received from SSP 170 to perform the selection process.
[0110] In a dual-table cuckoo filter implementation where elements can be inserted into one of two possible positions, application 112 can receive two selection results, one for each hash function F1 and F2. In this example, application 112 can select digital components from a set of digital components that includes both these digital components and any digital components received from SSP 170.
[0111] In some implementations, application 112 can perform final verification, i.e., matching the user group of the digital component selected by MPC cluster 130 with a user group that includes the user as a member. For example, the digital component information element dc_information_element of each digital component can include the user group identifier of that digital component. Application 112 can compare the user group identifier of the digital component information element dc_information_element with the user's list of user groups. If no match is found, application 112 can exclude the digital component from the selection process. If a match is found, application 112 can include the digital component in the selection process.
[0112] As mentioned above, receiving two selection results from MPC cluster 130 can encourage the selection value to be discarded. To mitigate this risk, MPC cluster 130 can execute a process that returns only one selection result.
[0113] In the single-table cuckoo filter implementation, each user group identifier ug_id can appear in two places with indices F1(ug_id) and F2(ug_id). Let M denote the single-table cuckoo filter and Mi denote the value of the i-th element in the table. If or The candidate parameter is_dc_a_candidate, which has the numeric component with the user group identifier ug_id, is selected. dcTrue. This MPC cluster 130 can use the following relation 8 or 9 to compute the candidate parameter is_dc_a_candidate for the selected value. dc .
[0114]
[0115]
[0116] Relation 8 requires two equality tests that can be performed in parallel. Relation 9 requires one equality test and one multiplication. When performing these operations on secret shares using a secure MPC process, the multiplication requires fewer computations and one round trip, but the equality test requires more computations and four round trips in the probabilistic solution. Therefore, Relation 8 requires one less round trip but more computations than Relation 9.
[0117] The computing system MPC1 is able to compute the candidate parameter is_dca_candidate for the selection value on the secret share using relation 8 and the following relation 10. dc .
[0118] [is_dc_a_candidate dc,1 ] = (ug_id == [g ug_id,1 (F1(ug-id))])+(ug_id==[g ug_id,1 (F2(ug_id))]) (10)
[0119] Similarly, the computation system MPC2 can compute the candidate parameter is_dc_a_candidate for the selected value on the secret share using the following relation 11 based on relation 8. dc .
[0120] [is_dc_a_candidate dc,2 ] = (ug_id == [g ug_id,2 (F1(ug_id))])+(ug_id==[g ug_id,2 (F2(ug_id))]) (11)
[0121] The computing system MPC1 can compute the candidate parameter is_dc_a_candidate for the selected value based on relation 9 using the following relation 12 on the secret share. dc .
[0122] [is_dc_a_candidate dc,1 ]=((ug_id-[g ug_id,1 (F1(ug_id))])×(ug_id-[gug_id,1 (F2(ug_id))]))==0 (12)
[0123] The computing system MPC2 can compute the candidate parameter is_dc_a_candidate for the selected value based on relation 9 using the following relation 13 on the secret share. dc .
[0124] [is_dc_a_candidate dc,2 ]=((ug_id-[g ug_id,2 (F1(ug_id))])×(ug_id-[g ug_id,2 (F2(ug_id))]))==0 (13)
[0125] MPC cluster 130 can then be used with Figure 3 The process 300 is similar to the process used to calculate the secret share of the selection result. Specifically, the computation systems MPC1 and MPC2 are capable of calculating the secret share of the cumulative value acc [acc] for each selection value, based on the order of the selection values and the candidate parameters of the selection values, respectively. dc,1 ] and [acc dc,2 ].
[0126] The computing systems MPC1 and MPC2 can calculate the secret share of the winner parameter is_dc_the_winner for each selection value, based on the candidate parameters of the selection value and whether the cumulative value of the selection value equals one. dc,1 ] and [is_dc_the_winner dc,2 ].
[0127] The computing systems MPC1 and MPC2 can use the following relations 14 and 15 to calculate the secret shares [result1] and [result2] of the selected result.
[0128] [result1]=∑ dc ([is_dc_the_winner dc,1 ×dc_information_element dc (14)
[0129] [result2]=∑ dc ([is_dc_the_winner dc,2 ×dc_information_element dc (15)
[0130] The computing system MPC1 can return the first share of the selection result [result1] to application 112, and the computing system MPC2 can return the second share of the selection result [result2] to application 112. As described above, application 112 can then use the two secret shares to reconstruct the selection result result.
[0131] The above description relates multiplication between secret shares of secret integers whose values are 0 or 1 to a logical AND operation. The above description also relates 1 minus the secret share of a secret integer whose value is 0 or 1 to a logical NOT operation. In some implementations, alternative solutions can be employed to evaluate logical expressions with respect to secret shares. For example, to compute a logical AND of additive secret shares of secret integers whose values are 0 or 1, the MPC server can compare the sum of those additive secret shares with the number of secret shares. For yet another example, to compute any logical expression with secret shares as input, the MPC server can employ a truth table approach; that is, computation system MPC1 can construct a truth table containing one row for each possible combination of input secret shares held by MPC2. Computation system MPC1 randomly selects a secret share for the result, represented as [result1]. For each row, computation system MPC1 can combine its input secret share and a speculative input secret share held by MPC2 to reconstruct the input of the logical expression in plaintext, and then evaluate the result of the logical expression. For each row, computation system MPC1 splits the result into two secret shares, one being [result1] and the other [result2]. MPC1 then writes [result2] into a row of its truth table. After MPC1 completes the construction of its truth table, MPC2 can initiate an unintentional transfer extension (OTe) to extract the row from the truth table corresponding to the input secret share held by MPC2. The extraction result is [result2]. At the end of the above process, MPC1 and MPC2 hold [result1] and [result2] respectively, which are the secret shares of the logical expression result. MPC1 does not know the value of [result2], and MPC2 does not know the value of [result1]. In some implementations, MPC1 and MPC2 can evaluate the logical expression to determine is_dc_a_candidate by constructing a scrambled circuit. dc,1 and is_dc_a_candidate dc,2 .
[0132] Figure 4This is a flowchart illustrating an example process 400 for selecting digital components to be distributed to client devices. The operation of process 400 can be implemented, for example, by computing systems MPC1 or MPC2 of the MPC cluster 130. The operation of process 400 can also be implemented as instructions stored on one or more computer-readable media that may be non-transitory, and execution of these instructions by one or more data processing devices can cause one or more data processing devices to perform the operation of process 400. For simplicity, process 400 is described as being executed by computing system MPC1.
[0133] The computing system MPC1 receives a digital component request (402) from the client device 110. The digital component request may include one or more distributed point functions. Each distributed point function may represent a secret share of a point function, indicating whether the user of the client device is a member of a corresponding first user group identified by a corresponding first user group identifier. For example, the digital component request received by the computing system MPC1 may include a distributed point function g for each user group that includes the user of the client device 110 as a member. ug_id,1 .
[0134] Digital component requests can also include lookup keys. For example, a digital component request can include a user group request key UG_Request_Key, which can be a composite message based on a set of context signals (e.g., the set of context signals for the digital component request). Similar digital component requests can be sent to one or more additional MPC systems (e.g., computing system MPC2), which will cooperate with computing system MPC1 during the secure MPC process to select the digital component to be provided to client device 110 in response to the digital component request. For each distributed point function of a digital component request, each other digital component request can include a corresponding distributed point function generated using the same point function for the same user group identifier. For example, computing system MPC2 will request a corresponding distributed point function g for each distributed point function received by computing system MPC1. ug_id,1 Receive the corresponding distributed point function g ug_id,2 .
[0135] The computing system MPC1 identifies multiple selection values (404). Each selection value can correspond to a corresponding digital component and a corresponding second user group identifier for a corresponding second user group, to which the corresponding digital component is eligible for distribution. As described above, the selection value can be stored in a second-level LUT, which has metadata identifying its corresponding digital component and a lookup key based on the user group identifier and the context signal to which the selection value is eligible.
[0136] For each selected value, computing system MPC1 uses a secure MPC process that collaborates with one or more second computing systems in a plurality of MPC systems to determine a candidate parameter (406). The candidate parameter is_dc_a_candidate indicates whether the second user group identifier corresponding to the selected value matches at least one of one or more first user group identifiers. That is, the candidate parameter is_dc_a_candidate for the selected value indicates whether the user group identifier for the selected value matches the user group identifier of a user group that includes the user of client device 110 as a member. If so, the digital component corresponding to the selected value is a candidate digital component as the selected candidate. As described above, computing system MPC1 can use a secure MPC process to collaborate with one or more additional MPC systems, including computing system MPC2, to obtain a first secret share of the candidate parameter is_dc_a_candidate for each selected value.
[0137] The computational system MPC1 generates a first secret share (408) of the selection result. The computational system MPC1 can collaborate with one or more additional MPC systems, including the computational system MPC2, to generate the selection result. Typically, the selection result identifies candidate numeric components with the highest selection value. As described above, the MPC systems can sort the selection values, determine the cumulative value for each selection value, and determine the secret share of the winner parameter is_dc_the_winner for each selection value. The MPC systems can then collaborate to determine the secret share of the sum of the products of the winner parameter of the selection value and the numeric component information elements of the selection value as the secret share of the selection result for each selection value. For example, the MPC systems can use Relation 5 shown above to determine the secret share of the sum of the products.
[0138] The computing system MPC1 provides the client device 110 with a first secret share (410) identifying the selection result of a given digital component. As described above, the selection result identifies the selected digital component and the selection value of the digital component. The client device 110 is also capable of receiving a corresponding secret share of the selection result from each of one or more additional MPC systems. As described above, the client device 110 is capable of using the secret share to reconstruct the selection result.
[0139] In some implementations, the cuckoo filter itself can be sent to the MPC cluster 130 instead of using a distributed point function. In this example, application 112 can use a pseudo-random function (PRF) parameterized by a user group identifier or an identifier from a set of blocking identifiers and either of two random variables generated by application 112. For example, suppose the three random variables generated by application 112 are rand_var1a, rand_var1b, and rand_var2. It is also assumed that each item in the bucket is a k-bit integer. In some implementations, application 112 and MPC cluster 130 pre-agree on the PRF, where k is the number of bits in each item in the bucket of the cuckoo filter. Each item in the bucket of the cuckoo filter can be occupied by a user group identifier or a blocking identifier, or it can be empty. For example, application 112 can generate a cuckoo filter table whose entries are PRF(ug_id, rand_var1a), PRF(blocked_id, rand_var1b), or 0, where ug_id is the identifier of the user group generated by applying HMAC to the tag of the user group (e.g., user group identifier) based on the content provider's domain, and 0 indicates an empty entry. This process is repeated on all user group identifiers and blocking identifiers.
[0140] Application 112 can generate vector B based on a cuckoo filter table generated for user group identifiers and blocking identifiers. Each value in vector B is Bcuckoo. i Can be represented as B i =(A i -PRF(rand_var2, i) mod p, where A is the cuckoo filter table, and i is the index of vector B and cuckoo filter table A. When application 112 initiates a request for a digital component for a digital component slot, the application transmits rand_var1a, rand_var1b, and rand_var2 as request parameters to computing system MPC1. Application 112 also transmits vector B, rand_var1a, and rand_var1b as request parameters to computing system MPC2. PRF(rand_var2, i) and B i It is A i In Z p The two additive secret shares are held by computing systems MPC1 and MPC2 respectively. Because neither computing system MPC1 nor MPC2 can access the two secret shares, neither computing system can rebuild the Cuckoo Filter table, thus protecting user privacy.
[0141] The computing system MPC1 determines whether each candidate selection value is associated with the user group specified in the request. The computing system MPC1 receives the equivalent values of the secret share array of the Cuckoo Filter table M, denoted as [M1]. Each user group identifier present in M will be located in one of N possible positions.
[0142] The computing system MPC1 calculates the candidate parameters based on user groups [is_dc_a_candidate] according to the following relation 16. x,1 ];
[0143] 0 ≠
[0144]
[0145] Where Ⅱ represents multiplication of multiple terms. Here, ug_id(x) is a function used to retrieve the user group identifier ug_id associated with the selected value x, {F1, ... F N} is the set of hash functions used to compute the possible indices of items within the Cuckoo Filter table A, and rand_val1a is the random value received in the digital component request. [M x,1 [x] is the x-th element in the sequence [M1]. == is an equality test between the plaintext integer and the secret share of the secret integer. == results in the secret share of the secret integer being 0 (not equal) or 1 (equal). Here, [M... i,1 The value of ] is [PRF(rand_val2a, i)1].
[0146] Similarly, the computing system MPC2 calculates the candidate parameters based on user groups [is_dc_a_candidate] according to the following relation 17. x,2 ]:
[0147] 0 ≠
[0148]
[0149] Here, [M i,2 The value of ] = B i .
[0150] Figure 5This is a block diagram of an example computer system 500 capable of performing the operations described above. System 500 includes a processor 510, memory 520, storage device 530, and input / output device 540. Each of components 510, 520, 530, and 540 can be interconnected, for example, using a system bus 550. Processor 510 is capable of processing instructions for execution within system 500. In some embodiments, processor 510 is a single-threaded processor. In another embodiment, processor 510 is a multi-threaded processor. Processor 510 is capable of processing instructions stored in memory 520 or storage device 530.
[0151] Memory 520 stores information within system 500. In one embodiment, memory 520 is a computer-readable medium. In some embodiments, memory 520 is a volatile memory cell. In another embodiment, memory 520 is a non-volatile memory cell.
[0152] Storage device 530 provides high-capacity storage for system 500. In some embodiments, storage device 530 is a computer-readable medium. In various embodiments, storage device 530 may include, for example, a hard disk drive, an optical disk drive, a storage device shared by multiple computing devices over a network (e.g., a cloud storage device), or some other high-capacity storage device.
[0153] Input / output device 540 provides input / output operations for system 500. In some embodiments, input / output device 540 may include one or more of the following: a network interface device, such as an Ethernet card; a serial communication device, such as an RS-232 port; and / or a wireless interface device, such as an 802.11 card. In another embodiment, input / output device may include a driver configured to receive input data and send output data to an external device 560 (e.g., a key disk, printer, and display device). However, other embodiments, such as mobile computing devices, mobile communication devices, set-top box television client devices, etc., may also be used.
[0154] Although already Figure 5 An example processing system is described herein, but implementations of the subject matter and functional operations described herein can be implemented in other types of digital electronic circuits, or in computer software, firmware, or hardware (including the structures disclosed herein and their equivalents), or in a combination of one or more of them.
[0155] The embodiments of the subject matter and operations described in this specification can be implemented in digital electronic circuits, or in computer software, firmware, or hardware (including the structures disclosed in this specification and their equivalents), or in a combination of one or more of these. Embodiments of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions encoded on a computer storage medium (or medium) for execution by or control of the operation of a data processing apparatus. Alternatively or additionally, the program instructions can be encoded on artificially generated propagated signals, such as machine-generated electrical, optical, or electromagnetic signals, generated to encode information for transmission to a suitable receiver device for execution by the data processing apparatus. The computer storage medium can be a computer-readable storage device, a computer-readable storage substrate, a random or serial access memory array or device, or a combination of one or more of these, or be included in a computer-readable storage device, a computer-readable storage substrate, a random or serial access memory array or device, or a combination of one or more of these. Furthermore, although the computer storage medium is not a propagated signal, it can be a source or destination of computer program instructions encoded in artificially generated propagated signals. Computer storage media can also be one or more separate physical components or media (e.g., multiple CDs, discs or other storage devices) or included in one or more separate physical components or media (e.g., multiple CDs, discs or other storage devices).
[0156] The operations described in this specification can be implemented as operations performed by a data processing device on data stored on one or more computer-readable storage devices or received from other sources.
[0157] The term "data processing apparatus" encompasses all kinds of devices, apparatuses, and machines used for processing data, including, for example, programmable processors, computers, systems-on-a-chip, or a combination thereof. The apparatus can include special-purpose logic circuitry, such as FPGAs (Field-Programmable Gate Arrays) or ASICs (Application-Specific Integrated Circuits). In addition to hardware, the apparatus can also include code that creates an execution environment for the computer program in question, such as code constituting processor firmware, protocol stacks, database management systems, operating systems, cross-platform runtime environments, virtual machines, or combinations thereof. The apparatus and execution environment can implement a variety of different computing model infrastructures, such as web services, distributed computing, and grid computing infrastructures.
[0158] A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, declarative or procedural languages, and can be deployed in any form, including as a standalone program or as a module, component, subroutine, object, or other unit suitable for use in a computing environment. A computer program may, but does not need to, correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple collaborative files (e.g., a file storing one or more modules, subroutines, or code portions). A computer program can be deployed to execute on a single computer or on multiple computers located at a single site or distributed across multiple sites and interconnected through a communication network.
[0159] The processes and logic flows described in this specification can be executed by one or more programmable processors that execute one or more computer programs to perform actions by manipulating input data and generating outputs. The processes and logic flows can also be executed by dedicated logic circuits, and the devices can be implemented as dedicated logic circuits, such as FPGAs (Field-Programmable Gate Arrays) or ASICs (Application-Specific Integrated Circuits).
[0160] For example, processors suitable for executing computer programs include both general-purpose microprocessors and special-purpose microprocessors. Typically, a processor receives instructions and data from read-only memory or random access memory, or both. The basic components of a computer are a processor for performing actions according to instructions and one or more memory devices for storing instructions and data. Typically, a computer will also include, or be operatively coupled to, one or more mass storage devices for storing data, such as disks, magneto-optical disks, or optical disks, to receive data from or transfer data to, or both. However, a computer does not need to have such devices. Furthermore, a computer can be embedded in another device, such as a mobile phone, a personal digital assistant (PDA), a mobile audio or video player, a game console, a global positioning system (GPS) receiver, or a portable storage device (e.g., a universal serial bus (USB) flash drive). Devices suitable for storing computer program instructions and data include all forms of non-volatile memory, media, and memory devices, including, for example, semiconductor memory devices such as EPROM, EEPROM, and flash memory devices; disks such as internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM discs. Processors and memory can be supplemented by or incorporated into dedicated logic circuits.
[0161] To provide interaction with the user, embodiments of the subject matter described in this specification can be implemented on a computer having a display device for displaying information to the user, such as a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, and a keyboard and pointing device, such as a mouse or trackball, through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback, such as visual, auditory, or tactile feedback; and input from the user can be received in any form, including sound, speech, or tactile input. Furthermore, the computer can interact with the user by sending documents to and receiving documents from the device used by the user; for example, by sending a web page to a web browser on the user's client device in response to a request received from a web browser.
[0162] Embodiments of the subject matter described in this specification can be implemented in a computing system that includes back-end components (e.g., as a data server), middleware components (e.g., an application server), or front-end components (e.g., a client computer having a graphical user interface or web browser that a user can interact with through embodiments of the subject matter described in this specification), or any combination of one or more such back-end components, middleware components, or front-end components. The components of the system can be interconnected via digital data communication (e.g., a communication network) of any form or medium. Examples of communication networks include local area networks (“LANs”) and wide area networks (“WANs”), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., self-organizing peer-to-peer networks).
[0163] A computing system can include clients and servers. Clients and servers are typically geographically separated and usually interact via a communication network. The client-server relationship arises from computer programs running on respective computers and involves a client-server relationship with each other. In some embodiments, the server sends data (e.g., HTML pages) to the client device (e.g., to display data to a user interacting with the client device and to receive user input from the user). Data generated at the client device (e.g., the result of user interaction) can be received from the client device at the server.
[0164] In addition to the above embodiments, the following embodiments are also innovative:
[0165] Example 1 is a method comprising: receiving from a client device and a first computing system in a plurality of multi-party computation (MPC) systems a request for a digital component including distributed point functions, each distributed point function representing a secret share of a corresponding point function indicating whether a user of the client device is a member of a corresponding first user group identified by a corresponding first user group identifier; identifying a plurality of selection values, wherein each selection value corresponds to a corresponding digital component, a set of context signals, and a corresponding second user group identifier for a corresponding second user group, the corresponding digital component being eligible to be distributed to the corresponding second user group; determining, for each selection value and in a secure MPC process performed in cooperation with one or more second computing systems in the plurality of MPC systems, candidate parameters indicating whether the second user group identifier corresponding to the selection value matches a user group including the user as a member, using the distributed point functions; generating a first secret share of the selection result of identifying a given digital component with the highest selection value from a plurality of candidate digital components based on the selection value and the candidate parameters, wherein each candidate digital component is a digital component whose candidate parameter of the selection value corresponding to the digital component indicates that the second user group identifier corresponding to the selection value matches a user group including the user as a member; and transmitting the first secret share of the selection result of identifying the given digital component to the client device.
[0166] Example 2 is the method of Example 1, wherein determining the candidate parameter for each selected value includes determining a first secret share of the candidate parameter for each selected value.
[0167] Example 3 is a method of Example 1 or Example 2, wherein generating a first secret share of the selection result includes: generating an order of selection values based on the magnitude of each selection value; determining a first secret share of the cumulative value for each selection value based on the order of selection values and candidate parameters for each selection value, wherein the cumulative value for each selection value indicates the position of the selection value in the ranking order of multiple candidate selection values; determining a first secret share of the winner parameter for each selection value based on (i) the candidate parameters for the selection value and (ii) an indication of whether the cumulative value for the selection value is the result of an equality test of a specified value; and determining a first secret share of the sum of the products of the winner parameter for that selection value and the digital component information element for that selection value as the first secret share of the selection result for each selection value.
[0168] Example 4 is the method of Example 3, wherein determining the first secret share of the cumulative value for each selection value includes: for each individual selection value, determining the number of candidate values between the highest selection value and the individual selection value, having a second user group identifier that indicates that the selection value matches at least one of one or more first user group identifiers.
[0169] Example 5 is a method of Example 3 or 4, wherein the specified value is one or logical true.
[0170] Example 6 is a method of any one of Examples 1 to 5, wherein the distributed point function is generated based on multiple user groups, including users of client devices as members.
[0171] Example 7 is a method of any one of Examples 1 to 6, wherein the digital component request includes a user group request key based on a set of context signals for the digital component slot; and identifying multiple selection values includes identifying each selection value in a data structure having a lookup key that matches the user group request key.
[0172] Example 8 is a system comprising: one or more processors; and one or more storage devices storing instructions that, when executed by the one or more processors, cause the one or more processors to perform the method described in any one of Examples 1 to 7.
[0173] Example 9 is a computer-readable storage medium carrying instructions that, when executed by one or more processors, cause one or more processors to perform the method described in any one of Examples 1 to 7.
[0174] Example 10 is a computer program product including instructions that, when executed by one or more processors, cause one or more processors to perform the method described in any one of Examples 1 to 7.
[0175] While this specification contains numerous specific implementation details, these should not be construed as limiting the scope of any invention or the scope that may be claimed, but rather as descriptions of features specific to particular embodiments of a particular invention. Some features described in the context of individual embodiments in this specification can also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment can also be implemented individually or in any suitable sub-combination in multiple embodiments. Furthermore, although features may be described above as functioning in certain combinations, and even initially claimed in this way, one or more features from a claimed combination can be removed from that combination in some cases, and the claimed combination may involve sub-combinations or variations thereof.
[0176] Similarly, although operations are described in a specific order in the accompanying drawings, this should not be construed as requiring such operations to be performed in the specific order or sequence shown, or requiring all illustrated operations to be performed to obtain the desired result. In some cases, multitasking and parallel processing can be advantageous. Furthermore, the separation of various system components in the above embodiments should not be construed as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
[0177] Therefore, specific embodiments of the subject matter have been described. Other embodiments are within the scope of the appended claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require the specific order or sequence shown to achieve the desired result. In some embodiments, multitasking and parallel processing can be advantageous.
Claims
1. A computer-implemented method, comprising: A request for a digital component, comprising distributed point functions, is received from a client device and from a first computing system within a multi-party computation MPC system. Each of the distributed point functions represents a secret share of a corresponding point function indicating whether the user of the client device is a member of a corresponding first user group identified by a corresponding first user group identifier. Multiple selection values are identified, wherein each selection value corresponds to a corresponding digital component, a set of scene signals, and a corresponding second user group identifier of a corresponding second user group, and the corresponding digital component is eligible to be distributed to the corresponding second user group; For each selected value and during a secure MPC process performed in cooperation with one or more second computing systems in the plurality of MPC systems, the distributed point function is used to determine candidate parameters, the candidate parameters indicating whether the second user group identifier corresponding to the selected value matches a user group that includes the user as a member; Based on the selection value and the candidate parameters, a first secret share is generated to identify a given digital component with the highest selection value from a plurality of candidate digital components, wherein each candidate digital component is a digital component whose selection value corresponds to the digital component and whose selection value matches a second user group identifier corresponding to the selection value and a user group that includes the user as a member; and The first secret share, which identifies the selection result of the given digital component, is transmitted to the client device.
2. The computer-implemented method according to claim 1, wherein, Determining the candidate parameter for each selected value includes: determining a first secret share of the candidate parameter for each selected value.
3. The computer-implemented method according to claim 1, wherein, The first secret share that generates the selection result includes: The order of the selection values is generated based on the magnitude of each selection value; Based on the order of the selected values and the candidate parameters for each selected value, a first secret share of the cumulative value for each selected value is determined, wherein the cumulative value for each selected value indicates the position of the selected value in the ranking order of a plurality of candidate selected values; For each selected value, a first secret share of the winner's parameter is determined based on: (i) the candidate parameter for said selected value; and (ii) an indication of whether the cumulative value for said selected value is the result of an equality test of the specified value; and For each selected value, a first secret share is determined as the sum of the products of the winner parameter for the selected value and the digital component information element for the selected value, which is the first secret share of the selection result.
4. The computer-implemented method according to claim 3, wherein, Determining the first secret share of the cumulative value for each selected value includes: For each individual selection value, determine the number of selection values between the highest selection value and the individual selection value that have candidate parameters that match at least one of the second user group identifier and the one or more first user group identifiers corresponding to the selection value.
5. The computer-implemented method according to claim 3, wherein, The specified value is either one or logical true.
6. The computer-implemented method according to claim 1, wherein, The distributed point function is generated based on multiple user groups, including the user of the client device as a member.
7. The computer-implemented method according to claim 1, wherein: The digital component request includes a user group request key based on a set of context signals for the digital component slot; as well as Identifying the plurality of selection values includes: identifying each selection value in a data structure that has a lookup key that matches the user group request key.
8. The computer-implemented method according to claim 1, wherein: The distributed point function is generated using the corresponding point function and the cuckoo filter table.
9. The computer-implemented method according to claim 8, wherein, The cuckoo filter table is generated by: for the first user group identifier, using a first hash function and a second hash function to calculate two possible positions of the first user group identifier, and inserting the first user group identifier into the cuckoo filter table.
10. A system comprising: A first computing system comprising one or more processors; as well as One or more computer-readable media storing instructions that, when executed by the one or more processors, cause the one or more processors to perform the method according to any one of claims 1-9.
11. A non-transitory computer-readable medium storing one or more instructions, which, when executed by one or more processors of a first computing system, cause the one or more processors to perform the method according to any one of claims 1-9.
Citation Information
Patent Citations
Computer-Implemented System And Method For Establishing Distributed Secret Shares In A Private Data Aggregation Scheme
US20150288662A1
Pacing control for online ad campaigns
US20160180373A1
Secure multi-party computation attribution
US20200336313A1
