Controls the combination of information submitted to a computing system

By verifying the compliance of information combination and sharing rules in the computing system, and controlling the distribution of information, the privacy and security risks brought about by sharing personal information among third parties are solved, and stricter control of personal information is achieved to prevent Unauthorized combinations of information are accessed.

CN112433985BActive Publication Date: 2024-12-03INTERNATIONAL BUSINESS MACHINE CORPORATION
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202010715849.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2019-08-26
Filing Date
2020-07-23
Publication Date
2024-12-03
Estimated Expiration
2040-07-23

AI Technical Summary

Technical Problem

The sharing of personal information among third parties may lead to unexpected and undesirable effects, especially when this information is used to identify an individual, which may cause privacy threats and security risks, and existing privacy regulations are difficult to effectively control information. Distribute and use.

Method used

By verifying the compliance of the combination of new information items and available information items with sharing rules in the target computing system, the reception and distribution of information are controlled, ensuring that the information items are only transmitted when complying with preset rules, and preventing unauthorized information combinations Visited.

Benefits of technology

It effectively prevents third parties from accessing unacceptable compound personal information, reduces the unexpected impact of information sharing, and enhances control over personal information, especially when third parties are not individually identified.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112433985B_ABST
    Figure CN112433985B_ABST
Patent Text Reader

Abstract

Embodiments of the present disclosure relate to controlling the combination of information submitted to a computing system. The present disclosure proposes a method and system for controlling the distribution of information items of an object. The method and system include: verifying the compliance of a combination of a new information item (to be received by a target computing system) and an available information item (already available to the target computing system) with one or more sharing rules; and controlling the reception of the new information item by the target computing system according to the result of the verification.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of information technology, and more particularly to the control of information in a computing system. Background Art

[0002] In the following, the background of the present disclosure is introduced by discussing technologies related to the context of the present disclosure. However, even when the discussion involves documents, actions, artifacts, etc., it is not implied or represented that the technology discussed is part of the prior art or is common knowledge in the field related to the present disclosure.

[0003] Control of information (stored in computing systems) is a critical issue in a variety of contexts. In particular, whenever the information is of particular relevance to the subject, it is important to control its distribution to third parties. A typical example is personal information, i.e. information relating to an identifiable person. In practice, the distribution of personal information to third parties may involve a threat to the privacy of the subject; for example, the personal information may be used for purposes that are annoying (e.g., transmitting spam) or even dangerous (e.g., stalking).

[0004] Therefore, most countries have privacy laws that govern the protection of personal information; for example, in the European Union, this is provided for by the General Data Protection Regulation (GDPR). In general, privacy laws give any person the right to control how and to what extent the corresponding personal information is used. For example, this requires that explicit consent be given by the person to authorize each use of this personal information by a third party; in particular, there must be specific consent to authorize a third party (to whom the person has submitted personal information) to share this personal information with other third parties.

[0005] People often submit their personal information to a large number of third parties. This is especially true on the Internet. Indeed, today, most people use the Internet to routinely perform many activities (e.g., purchase goods, utilize functionality, find information, etc.). For this purpose, people constantly submit personal information to corresponding service providers, such as when they need to register with them.

[0006] Furthermore, people often authorize third parties to share personal information submitted to them with other third parties. In particular, this is often due to the fact that, especially on the Internet, most people almost automatically accept privacy clauses without really paying attention to the authorization being granted. In fact, the need to accept privacy clauses is so frequent that people usually do not read them, let alone read them carefully (because the operation is quite annoying); moreover, when privacy clauses are accepted online (such as on the Internet), almost no awareness of legally binding behavior is given.

[0007] This results in a large amount of dissemination of personal information. In particular, the inventors have realized that sharing personal information between third parties may bring unexpected and usually undesirable effects. This may happen even if people are completely acceptable to the use of the corresponding personal information by different third parties. In fact, different pieces of personal information of a person may be submitted to third parties because the use of different pieces of personal information by each of the third parties does not cause any problems. However, since personal information is shared between third parties, each third party may also receive other pieces of personal information of the same person from other third parties. As a result, third parties may access complex personal information that is unacceptable to the person.

[0008] Indeed, specific pieces of personal information that are not critical by themselves may become critical when combined with each other. For example, a person submits their name to a first third party, and their town to a second third party; usually, this does not cause any problems, because the name alone and the town alone do not allow the person to be identified. However, personal information may be shared between two third parties, for example, because the first third party has been authorized to do so. In this case, the second third party may receive the person's name from the first third party. As a result, the second third party may access the person's town (directly from the person) and the person's name (indirectly from the first third party). On the contrary, this may be dangerous, because now the personal information (name and town) allows the person to be identified.

[0009] The above situation is exacerbated by the fact that people often authorize third parties to share personal information submitted to them with other third parties who are simply so indicated (and not individually identified). Therefore, it is difficult, if not impossible, for people to imagine possible problems that may arise from the sharing of information. Summary of the invention

[0010] A simplified overview of the disclosure is presented here in order to provide a basic understanding of the disclosure; however, the sole purpose of this overview is to introduce some concepts of the disclosure in a simplified form as a prelude to the more detailed description that follows, and this overview should not be interpreted as identifying key elements of the disclosure or defining its scope.

[0011] In summary, the present disclosure is based on the idea of ​​possible combinations of control information.

[0012] In particular, one embodiment provides a method for controlling the distribution of information items of an object. The method includes: verifying the compliance of a combination of a new information item (to be received by a target computing system) and an available information item (already available to the target computing system) with one or more sharing rules; and controlling the reception of the new information item by the target computing system according to the result of the verification.

[0013] Another aspect provides a computer program for implementing the method.

[0014] Another aspect provides a corresponding computer program product.

[0015] Another aspect provides a corresponding computing system.

[0016] In one aspect of an embodiment according to the invention, a method for controlling the distribution of a plurality of information items of an object includes: receiving, by a target computing system, an indication of one or more new information items in the information items, the information items being submitted to a target entity associated with the target computing system. The method includes receiving, by the target computing system, one or more sharing rules for the object, the sharing rules being based on one or more combinations of the information items. The method includes retrieving, by the target computing system, an indication of any available information item in the information items available to the target computing system. The method includes: verifying, by the target computing system, compliance of the combination of the new information item and the available information item with the sharing rules; and controlling, by the target computing system, the receipt of the new information item based on the result of the verification of compliance.

[0017] In another aspect of an embodiment of the present invention, a computer program product for controlling the distribution of a plurality of information items of an object includes a computer-readable storage medium having program instructions embodied therewith. The program instructions are readable by a computing system to cause the computing system to perform a method, the method comprising: receiving an indication of one or more new information items in the information items, the one or more new information items to be submitted to a target entity associated with the computing system; receiving one or more sharing rules for the object, the sharing rules being based on one or more combinations of the information items; retrieving an indication of any available information item in the information items available to the computing system; verifying compliance of the combination of the new information item and the available information item with the sharing rules; and controlling the receipt of the new information item based on the result of the verification of compliance.

[0018] In another aspect of an embodiment of the invention, a computing system for controlling the distribution of a plurality of information items of an object includes circuit means for receiving an indication of one or more new information items of the information items to be submitted to a target entity associated with the computing system. The system includes circuit means for receiving one or more sharing rules for the object, wherein the sharing rules are based on one or more combinations of the information items. The circuit means is for retrieving an indication of any available information item among the information items available to the computing system. The system includes circuit means for verifying compliance of the combination of the new information item and the available information item with the sharing rules. The system includes circuit means for controlling the receipt of the new information item based on the result of said verifying compliance.

[0019] More specifically, one or more aspects of the present disclosure are set out in the independent claims and advantageous features thereof are set out in the dependent claims, and the wording of all claims is hereby incorporated verbatim by reference (with reference to any advantageous features provided by any particular aspect applying mutatis mutandis to all other aspects). BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The solutions of the present disclosure and other features and advantages of the present disclosure will be best understood with reference to the following detailed description of the present disclosure, which is given by way of non-limiting indication only and is to be read in conjunction with the accompanying drawings (in the drawings, for simplicity, corresponding elements are denoted by the same or similar reference numerals, and explanations thereof are not repeated, and the name of each entity is generally used to indicate its type and attributes, such as value, content, and representation). In particular:

[0021] Figure 1A , Figure 1B , Figure 1C and Figure 1D An example of application of the solution according to an embodiment of the present disclosure is shown,

[0022] Figure 2 shows a schematic block diagram of an information technology infrastructure in which a solution according to an embodiment of the present disclosure can be implemented,

[0023] Figure 3 shows the main software components that can be used to implement the solution according to an embodiment of the present disclosure, and

[0024] Figure 4A , Figure 4B , Figure 4C and Figure 4D An activity diagram is shown, which describes the flow of activities related to the implementation of a solution according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0025] Special reference Figure 1A-Figure 1D , showing an example of application of the solution according to an embodiment of the present disclosure.

[0026] from Figure 1AInitially, a user (i.e., a person) 105 uses a client computing system, or simply uses a client 110 to access a server computing system, or simply uses a server 115x that provides a corresponding service, for example, in the Internet. The user 105 may be required to submit personal information to the server 115x for utilizing the service, and authorize a third party associated with the server 115x to use the personal information. The authorization is granted by the user 105 accepting the corresponding privacy terms (e.g., by checking an option on a web page); at this stage, the user 105 may also authorize the third party to share the personal information with other third parties.

[0027] In a solution according to an embodiment of the present disclosure, user 105 creates one or more sharing rules for his / her personal information. The sharing rules are based on one or more combinations of information items (defining corresponding multiple pieces of personal information); for example, each sharing rule indicates that two or more information items may not be available together to any third party, that is, their combination is not allowed. Once user 105 requires client 110 to submit one or more (new) information items to server 115x, the corresponding verification packet is transmitted to server 115x. The verification packet includes an indication of the new information items (such as their hash values); in addition, the verification packet includes one or more sharing rules (such as sharing rules related to the new information items). For example, the verification packet indicates that new information items Ia and Ib will be submitted to server 115x, and the verification packet includes a sharing rule indicating that the combination of information items Ib and Id is not allowed (NOT (Ib+Id)). When server 115x receives the verification packet, an indication of any (available) information items that are already available to server 115x (e.g., from a corresponding database) is retrieved. The compliance of the combination of new / available information items with the sharing rules is verified. Then, the reception of the new information item by the server 115x is controlled according to the result of the conformity verification. For example, assuming that the information item Id of the user 105 is not available to the server 115x, the result of the conformity verification is positive, and therefore the server 115x is allowed to receive the new information items Ia and Ib (stored therein) from the client 110 (e.g., by returning corresponding acceptances thereof).

[0028] Go to Figure 1B, user 105 also uses client 110 to access another server computing system, or simply accesses server 115y that provides another corresponding service. In this case as well, user 105 may be required to submit personal information to server 115y for utilizing the service, while authorizing a third party associated with server 115y to use the personal information (by accepting the corresponding privacy terms). As described above, once user 105 requires client 110 to submit one or more (new) information items to server 115y, the corresponding verification packet is transmitted to server 115y. For example, the verification packet indicates that new information items Ia and Id will be submitted to server 115y, and the verification packet includes the same sharing rule indicating that the combination of information items Ib and Id is not allowed. When server 115y receives the verification packet, the indication of any available information item is retrieved and the compliance of the combination of new / available information items with the sharing rules is verified, so as to control the reception of new information items by server 115y. For example, assuming that information item Ib of user 105 is not available to server 115y, the result of the compliance verification is positive, and server 115y is allowed to receive new information items Ia and Id from client 110 (stored therein).

[0029] Go to Figure 1C , user 105 may be required to submit other personal information to server 115x for utilizing the service, while authorizing third parties associated with server 115x to use and share the personal information (by accepting corresponding privacy terms). As described above, once user 105 requires client 110 to submit one or more (new) information items to server 115x, the corresponding verification packet is transmitted to server 115x. For example, the verification packet indicates that a new information item Ic will be submitted to server 115x, and the verification packet includes a sharing rule (NOT (Ic+Id)) indicating that the combination of information items Ic and Id is not allowed. When server 115x receives the verification packet, an indication of available information items is retrieved; in this case, the available information items include information items Ia and Ib that have been previously received by client 110. Then, the compliance of the combination of new / available information items with the sharing rules is verified. In this case as well, the result of the compliance verification is positive, and therefore server 115x is allowed to receive (stored therein) new information item Ic from client 110.

[0030] Go to Figure 1D, later on server 115x it may be necessary to submit information item Ib to server 115y (having previously been authorized to do so by user 105). As described above, server 115x transmits a corresponding verification packet to server 115y. The verification packet indicates that the (new) information item Ib is to be submitted to server 115y, and the verification packet includes a corresponding sharing rule indicating that the combination of information item Ib and Id is not permitted. When server 115y receives the verification packet, an indication of available information items is retrieved; in this case, the available information items include information items Ia and Id that have previously been received from client 110. The compliance of the combination of the new / available information items with the sharing rule is then verified. Therefore, since the combination of the new information item Ib and the available information item Id is not permitted, the result of the compliance verification is now negative. In this case, server 115y is prevented from receiving the new information item Ib from server 115x (e.g., by returning a corresponding rejection to server 115x). Furthermore, a corresponding notification (rejection of the server 115y from receiving the new information item Ib due to the availability of the information item Id on the server 115y) is transmitted to the client 110 in order to inform the user 105 accordingly.

[0031] For example, a user does not want to be identified by any third party via his / her name and town. To this end, the user creates a sharing rule indicating that the combination of name and town is not allowed. The user can then submit the name to a review website (for posting reviews about products / services tagged with their name). In addition, the user can submit the town to a market research website (for participating in town-based surveys). In both cases, submitting different pieces of information (name and town) to corresponding third parties (respectively, the review company and the market research company) complies with the sharing rules (because using the name and town alone does not cause any problems). However, even if the user has authorized any of the third parties to share the corresponding information items, they cannot access both the name and town. For example, if the review website attempts to submit the name to the market research website, the corresponding compliance verification result is negative. Therefore, the market research website is prevented from receiving the name (thereby avoiding the combination of the name with the already available town).

[0032] The above solutions significantly improve the control over personal information, especially the distribution of personal information to third parties.

[0033] In particular, in this way, it is possible to avoid or at least substantially reduce any unexpected (and undesirable) effects resulting from the sharing of personal information between third parties (to whom the user has submitted personal information). More specifically, the proposed solution prevents third parties from accessing any composite personal information that is unacceptable to the user; this result can also be achieved even if the composite personal information is due to the combination of specific pieces of personal information that are not critical in themselves and that may have then been submitted individually by the user to different third parties.

[0034] The above solution has general applicability because it does not require knowledge of third parties with whom personal information may be shared. Therefore, the same solution is particularly advantageous when the user authorizes a third party to share personal information submitted to it with other third parties who are simply indicated as such (and not individually identified).

[0035] Reference now Figure 2 , showing a schematic block diagram of an information technology infrastructure 200, in which solutions according to embodiments of the present disclosure may be practiced.

[0036] The information technology infrastructure 200 comprises any number of the above-mentioned clients 110 and servers (collectively referred to as computers 110-115), generally indicated by reference numeral 115. The computers 110-115 communicate via a (telecommunication) network 205. For example, the information technology infrastructure 200 is based on the Internet. In this case, the servers 115 are web servers connected to each other via a global type of network 205; the clients 110 (through corresponding access providers, not shown in the figure) access the Internet in order to utilize the services provided by the servers 115. For example, the servers 115 allow access to corresponding websites providing services such as banking, insurance, booking, social networking, travel, etc.

[0037] Each of the computers 110-115 comprises several units connected between them by a bus structure 210 having one or more levels (having an architecture appropriately scaled according to the type of computer 110-115). In particular, one or more microprocessors (μP) 215 control the operation of the computer 110-115; a non-volatile memory (ROM) 220 stores basic codes for the booting of the computer 110-115, and a volatile memory (RAM) 225 is used as a working memory by the microprocessor 215. The computer 110-115 is provided with a mass storage 230 for storing programs and data (e.g., a hard disk for the client 110 and a storage device of a corresponding data center in which the server 115 is implemented). In addition, the computers 110-115 include multiple controllers for peripheral devices, or input / output (I / O) units 235; for example, the peripheral devices 235 of each client 110 include a keyboard, a mouse, a monitor, a network adapter (NIC) for connecting to the network 205, and a drive for reading / writing removable storage units (optical disks such as DVDs), while the peripheral devices 235 of each server 115 include a network card that is used to insert the server 115 into the corresponding data center and then connect the server to a console in the data center (e.g., a personal computer, also equipped with a drive for reading / writing removable storage units as described above) and to a switch / router subsystem in the data center (for its communication with the network 205).

[0038] Reference now Figure 3 , showing the main software components that can be used to implement the solution according to an embodiment of the present disclosure.

[0039] In particular, all software components (programs and data) are represented as a whole using reference numeral 300. Software components 300 are typically stored in a mass storage device and are (at least partially) loaded into the working memory of computers 110-115 when the program is run. For example, the program is initially installed into the mass storage device from a removable storage unit or from a network (not shown in the figure). In this regard, each program can be a module, segment or portion of code that includes one or more executable instructions for implementing a specified logical function.

[0040] Starting from each of the clients 110 (only one is shown in the figure), it includes the following components. The browser 305 is used to surf the Internet; for the purposes of the present disclosure, the browser 305 is used to access the server 115 for utilizing the corresponding service. In the solution according to the embodiment of the present disclosure, the verification client 310 controls the submission of personal information of the user of the client 110 to the server 115 (not shown in the figure). To this end, the verification client 310 interacts with the browser 305 (for example, implemented as a corresponding plug-in) to intercept communications with the server 115. The verification client 310 utilizes a hash engine 315. The hash engine 315 is used to map input values ​​of arbitrary size to hash values ​​of fixed size (the risk of obtaining the same hash value from different input values ​​is small). To this end, the hash engine 315 applies a hash function; a hash function is a deterministic function (that is, the same hash value is always produced for the same input value) of a one-way type (that is, reversal is actually not feasible). The authentication client 310 accesses (in read mode) an information item repository 320 defining information items and a sharing rule repository 325 defining sharing rules for a user; the information item repository 320 and the sharing rule repository 325 are synchronized between all clients 110 of the user, for example, accessed by a corresponding pair of user identifiers and passwords. The information item repository 320 stores one or more entries for corresponding information items defining the user's personal information. Each entry includes an (information) identifier of the information item (for example, its type such as "name", "town", "fiscal code", "telephone number", "email address", "credit card number", etc.) and a hash value of the information item. The sharing rule repository 325 stores one or more entries for corresponding sharing rules for the user. Each entry defines a sharing rule in terms of an information identifier (for example, listing information identifiers of two or more information items whose combination is not allowed (for example, NOT "name" + "town")). An editor 330 is available to the user for editing information items and sharing rules. The editor 330 accesses (in read / write mode) the information item repository 320 and the sharing rule repository 325.

[0041] Turning to each server 115 (only one is shown in the figure), it includes the following components. Web server 335 manages any communication with server 115, in particular by processing any request submitted to server 115 by browser 305 of client 110. Web application 340 implements the services provided by server 115. Web application 340 accesses personal information repository 345 (in read / write mode) to obtain personal information that has been submitted to server 115 by all users authorized for the corresponding purpose. Personal information repository 345 stores an entry for each user. The entry includes a user identifier, an information item of the corresponding personal information, and an indication of the authorization (with or without the possibility of sharing the personal information with other third parties) that has been granted by the user to a third party associated with server 115 for the use of the personal information. In the solution according to an embodiment of the present disclosure, verification server 350 controls the reception of personal information submitted to server 115 by client 110 or other servers 115. To this end, verification server 350 is trusted by verification client 310 of client 110 and by verification server 350 of other servers 115. This means that the verification server 350 can be relied upon to implement the required control of receiving personal information. For example, the result is guaranteed by the distributor of the corresponding software solution; in particular, the distributor ensures the authenticity and integrity of the verification server 350 by means of a corresponding digital signature based on a pair of public / private keys and a digital certificate in a public key infrastructure (PKI). The verification server 350 is interposed between the web server 335 and the web application 340 for intercepting their communication. The verification server 350 utilizes a hash engine 355 (same as above). The verification server 350 accesses (in read mode) a user repository 360 for the users of the server. The user repository 360 stores entries for each user. The entry includes a user identifier, a hash value of the user's (available) information items stored in the corresponding repository 345, and sharing rules related to these available information items.

[0042] Reference now Figure 4A-4D , shows an activity diagram that describes the flow of activities related to the implementation of a solution according to an embodiment of the present disclosure.

[0043] In particular, the activity diagram represents an exemplary process that may be used to control the distribution of personal information using the method 400. In this regard, each block may correspond to one or more executable instructions for implementing the specified logical functions on the above-described computer.

[0044] Starting from the swim lane of the general client, whenever its user submits any information to the general server via a browser, the process enters box 401. For example, the user has accessed the server to download a web page from it. The web page defines an (online) form, which includes one or more input fields for entering input information. The user fills in the form with the required input information and then clicks the submit button. In response to this, the browser transmits the corresponding submission command to the server (including the input information). In the solution according to an embodiment of the present disclosure, the verification client intercepts the submission command at box 402 (for example, using hooking technology). Then enter a loop for analyzing the input information contained in the submission command. The loop starts at box 403, where the verification client considers the information identifier and hash value of the (current) information item in the corresponding repository (starting from the first in any order). At box 404, the verification client searches for the hash value in the input information. To this end, the verification client commands the hash engine to calculate the hash value of each input information (e.g., entered into the corresponding input field) (this operation is only performed once at the beginning of the loop); then, the verification client verifies whether the hash value of the information item matches any of the hash values ​​of the input information. According to the result of this search, the flow of activities branches at box 405. If the hash value is found in the input information, it means that the input information contains the information item, and the verification client adds the hash value and the information identifier to the information item list (initially empty) at box 406, which indicates the user's personal information to be submitted to the server. Then, the process enters box 407. If the hash value is not found in the input information, it means that the input information does not contain the corresponding information item, and the same point is also reached directly from box 405. At this point, the verification client verifies whether the last information item has been processed. If not, the flow of activities returns to box 403 to repeat the same operation for the next information item. On the contrary (once all information items have been processed), the loop is exited by descending to box 408.

[0045] Now, the flow of activities branches according to the content of the information item list. If the information item list is not empty, meaning that the input information contains the user's personal information, the verification client retrieves any (relevant) sharing rules from the corresponding repository at box 409, which is related to the (new) information item to be submitted to the server. In particular, the relevant sharing rules are rules that contain at least one of the information identifiers of the information item list. At box 410, the verification client restores each of the relevant sharing rules by replacing the information identifier of the information item list with the corresponding hash value (retrieved from the information item list). At box 411, the verification client builds the corresponding verification group by adding the user identifier (e.g., retrieved from the configuration parameters), the hash value of the new information item (in the information item list), and the relevant sharing rules. At box 412, the verification client encrypts the verification group using the public key of the verification server of the server (e.g., retrieved from the distributor of the software solution). At block 413, the authentication client transmits the (encrypted) authentication packet to the server (possibly after verifying the authenticity and integrity of the authentication server).

[0046] Going to the server's swim lane, the verification server receives a verification packet from the client at box 414; when the verification server receives a similar verification packet from another server, the flow of activities will also reach the same point (as described below). The verification server decrypts the verification packet using its private key at box 415 (and it extracts the user identifier, the hash value of the new information item, and the relevant sharing rules). The encryption of the verification packet allows to ensure that the verification packet can only be processed by the verification server (in particular, it cannot be processed by the web application, and the submission of the new information item will be controlled for the web application). The verification server retrieves the hash value of the user's available information item at box 416 (from the corresponding repository). Then enter a loop for verifying the compliance of the combination of new / available information items with the relevant sharing rules. The loop starts at box 417, where the verification server considers the (current) relevant sharing rules (starting from the first one in any order). At box 418, the verification server searches for the hash value of the relevant sharing rules in the new / available information item. According to the result of this search, the flow of activities branches at box 419. If all hash values ​​of the relevant sharing rules are found in the new / available information item (meaning that the combination of the new / available information items is not allowed), the loop is exited by descending into block 420, where the verification server sets the verification result (verifying compliance with the sharing rules) to negative. Conversely, if one or more hash values ​​of the relevant sharing rules are not found in the new / available information item, the process proceeds to block 421, where the verification server verifies whether the last relevant sharing rule has been processed. If not, the flow of activity returns to block 417 to repeat the same operation for the next relevant sharing rule. Conversely (once all relevant sharing rules have been processed), the loop is exited by descending into block 422, where the verification server sets the verification result to positive (because the combination of the new / available information items is allowed). Additionally, at block 423, the verification server adds the hash value of the new information item and the associated sharing rules to the user's entry in the corresponding repository; this may be done indiscriminately (simpler implementation) or only if (as detected by the verification client and notified in a corresponding flag added to the verification packet) the user has authorized third parties associated with the server to share the new information item (lower storage usage). The use of the hash value allows the verification server to verify compliance of the new / available information item with the associated sharing rules without providing the actual new information item to the server. The flow of activity then continues from block 420 or block 423 to block 424. At this point, the verification server builds the result packet.The result packet contains the verification result; in addition, when the verification result is negative, the result packet may also contain non-compliance information indicating why the combination of the new / available information items is not allowed (e.g., indicating (non-compliant) related sharing rules whose hash values ​​are all included in the hash values ​​of the new / available information items). At box 425, the verification server encrypts the result packet using its private key. The flow of activities branches at box 426 according to the source of the verification packet. If the verification packet has been received from the client, the verification server returns the (encrypted) result packet to the client at box 427. The process then returns to box 414 to wait for the next verification packet from any client / server.

[0047] Referring again to the swim lane of the client, at box 428, the verification client receives the result packet from the server (the server is in a waiting state for it). At box 429, the verification client decrypts the result packet (and extracts the verification result and possible non-compliance information) by using the public key of the verification server. The encryption of the result packet allows to ensure that the verification result has actually been provided by the (trusted) verification server. The flow of activities branches at box 430 according to the verification result. If the verification result is negative, the verification client displays a corresponding alarm on the monitor of the client at box 431. For example, the verification client determines that the hash value in the sharing rule is different from the hash value in the information item list (of the server's available information items) and retrieves its information identifier (from the corresponding repository); then, the alarm indicates that the combination of the new information item (indicated by their information identifier from the information item list) and the available information item (indicated by their information identifier so determined) is not allowed on the server. On the contrary, if the verification result is positive, the process passes from box 430 to box 432; if the list of information items is empty, meaning that the input information does not contain the user's personal information, the same point is reached directly from box 408. In both cases, the verification client will transmit the submission command (including personal information that may be submitted to the server or not including any personal information) to the server as usual. Then, the process returns from box 431 or box 432 to box 401, waiting for the next submission of information to any server.

[0048] Turning to the server's swim lane, at box 433, the Web server receives a submit command from the client; when the server receives a similar submit command from another server, the process will also reach the same point (as described below). The Web server passes the submit command to the Web application, which processes the submit command at box 434 as usual. In particular, if the submit command contains the user's personal information (in the case of accepting the corresponding privacy terms, the acceptance is provided at the same time or accompanied by another submit command), the Web application updates the personal information repository accordingly. Then, the process returns to box 433 to wait for the next submit command from any client / server.

[0049] Referring back to box 426, if the verification packet has been received from another server, then at box 435, the verification server returns the (encrypted) result packet to the other server (described below). The flow of activities branches at box 436 according to the verification result. If the verification result is negative, the verification server sets up a notification packet for the client at box 437. The notification packet includes the corresponding identifiers of the (target) server and the other (source) server (e.g., their domain names) and the same non-compliance information as described above. At box 437, the verification server transmits the notification packet to the client (possibly encrypted using its private key). The process then returns to box 414 to wait for the next verification packet from any client / server.

[0050] Referring again to the client's swim lane, at box 439, the verification client receives a notification packet from the server (and, if necessary, extracts the identifier of the source server, the identifier of the target server, and the non-compliance information after decrypting the notification packet). At box 440, the verification client displays a corresponding notification on the client's monitor. For example, the verification client retrieves (from the corresponding repository) the information identifier of the hash value in the non-compliant sharing rule; then, the notification indicates that the combination of information items (indicated by their information identifiers) is not allowed from the source server to the target server. The process then returns to box 439, waiting for the next notification packet from any server.

[0051] In a completely independent manner, whenever a web application transmits a submit command containing (output) information to be submitted to another (target) server (via a web server), the process enters box 441. In a solution according to an embodiment of the present disclosure, the verification server intercepts the submit command at box 442 (for example, using hook technology). As described above, a loop is then entered for analyzing the output information contained in the submit command. The loop starts at box 443, in which the verification server considers the hash value of the (current) information item in the entry of the (current) user in the corresponding repository (starting from the first in any order). The verification server searches for the hash value in the output information as described above at box 444 by calculating the hash value of each output information provided in the corresponding parameter, for example (this operation is only performed once at the beginning of the loop), and verifies whether the hash value of the information item matches any hash value in the hash value of the output information. According to the result of this search, the flow of activities branches at box 446. If the hash value is found in the output information, meaning that the output information contains the corresponding information item, the verification server adds the user identifier and the hash value to the information item list (initially empty) at box 445, which indicates the user's personal information to be submitted to the target server. The process then descends to box 447. If the hash value is not found in the output information, meaning that it does not contain the corresponding information item, the same point is also reached from box 445. At this point, the verification server verifies whether the last information item of the last user has been processed. If not, the flow of activities returns to box 443 to repeat the same operation for the next information item (of the same user or the next user). Conversely (once all information items of all users have been processed), the loop is exited by descending to box 448.

[0052] Now, the flow of activities branches according to the content of the information item list. If the information item list is not empty, meaning that the output information contains personal information of one or more users, the verification server retrieves any (relevant) sharing rules from the corresponding repository at box 449, which are related to the (new) information item to be submitted to the target server. In particular, the relevant sharing rules are relevant sharing rules for each user identifier of the information item list, and these relevant sharing rules contain at least one hash value of the hash values ​​of the same user in the information item list. The verification server builds the corresponding verification group at box 450 by adding the user identifiers of the information item list and the corresponding hash values ​​and relevant sharing rules of the information item list for each of them. At box 451, the verification server encrypts the verification group using the public key of the verification server of the target server. The verification server transmits the (encrypted) verification group to the target server at box 452 (possibly after verifying the authenticity and integrity of its verification server) for its processing as described above.

[0053] The verification server receives the corresponding result packet from the target server at box 453 (the target server is in a waiting state for it). As mentioned above, the verification server decrypts the result packet (and extracts the verification result and possible non-conformity information) by using the public key of the verification server of the target server at box 454. The active process branches at box 455 according to the verification result. If the verification result is negative, then at box 456, the verification server enters an error condition (may send a corresponding alarm to the administrator of the server via e-mail, for example). On the contrary, if the verification result is positive, the process continues to box 457; if the list of information items is empty, it means that the output information does not contain any user's personal information, then the same point can also be reached directly from box 448. In both cases, the verification server transmits the submission command (including personal information that may be shared with the target server or not including any personal information) to the target server according to routine. Then, the process returns to box 441 from box 456 or box 457, waiting for the next submission command from the Web application.

[0054] Naturally, in order to meet local and specific requirements, those skilled in the art may apply many logical and / or physical modifications and changes to the present disclosure. More specifically, although the present disclosure has been described with a certain degree of specificity with reference to one or more embodiments of the present disclosure, it should be understood that various omissions, substitutions and changes in form and details and other embodiments are possible. In particular, different embodiments of the present disclosure may be practiced even without the specific details (such as numerical values) set forth in the foregoing description to provide a deeper understanding thereof; on the contrary, well-known features may have been omitted or simplified in order to avoid unnecessary details that make the description unclear. Moreover, it is clearly intended that the specific elements and / or method steps described in conjunction with any embodiment of the present disclosure may be incorporated into any other embodiment as a matter of general design choice. Moreover, the items presented in the same group, different embodiments, examples or alternatives should not be interpreted as being actually equivalent to each other (but should be interpreted as being separate autonomous entities). In any case, each numerical value should be understood to be modified according to the applicable tolerance; in particular, the terms "substantially", "about", "approximately" and the like should be understood as "within 10%". In addition, each range of numerical values ​​should be intended to explicitly specify any possible number along the continuum within the range (including its endpoints). Ordinal qualifiers or other qualifiers are used only as markers to distinguish elements with the same name, but they do not themselves indicate any priority, precedence or order. The terms "include", "comprise", "have", "includes", "involving", etc. should be intended to have an open, non-exhaustive meaning (i.e., not limited to the listed items), these terms based on, depending on, according to, based on, etc. should be regarded as non-exclusive relationships (i.e., other possible variables may be involved), the term "one / an" should be regarded as one or more items (unless otherwise explicitly indicated), and the term "component for..." (or any component plus function expression)" should be regarded as any structure adapted or configured to perform the relevant function.

[0055] For example, an embodiment provides a method for controlling the distribution of multiple information items of an object. However, the information items may be of any number, of any type (e.g., personal information, sensitive information, commercial and / or technical information, etc.), in any form (e.g., text, audio, image, video, etc.), and they may be related to any object (e.g., an individual, a company, an organization, etc.).

[0056] In one embodiment, the method comprises the following steps performed by a target computing system. However, the target computing system may be of any type (see below).

[0057] In one embodiment, the method includes receiving (by a target computing system) an indication of one or more new information items in the information items. However, the new information items may be in any number, they may be indicated in any manner (e.g., by their hash values, their information identifiers, or even directly by the information items themselves), and they may be received in any manner (e.g., alone or together with sharing rules, in encrypted or plain text form, etc.).

[0058] In one embodiment, the new information item is submitted to a target entity associated with the target computing system. However, the target entity may be of any type (e.g., a company, an organization, etc.), and may be associated with the target computing system in any manner (e.g., associated with a target computing system that belongs to the organization and runs a software module dedicated to controlling the distribution of information items, associated with a target computing system that is separate from the organization and dedicated to controlling the distribution of information items as a whole, etc.).

[0059] In one embodiment, the method includes receiving (by the target computing system) one or more sharing rules for an object. However, there may be any number of sharing rules, and they may be received in any manner (e.g., alone or with an indication of new information, in encrypted or plain text form, directly received or downloaded in response to an indication of a new information item, etc.).

[0060] In one embodiment, the sharing rules are based on one or more combinations of information items. However, the sharing rules may be based on any number and type of combinations of information items in any manner (e.g., indicating (in any manner, such as indicated by their hash values, information identifiers, actual values, etc.) that a combination of two or more information items is generally not allowed, is only not allowed, such as on a specific target computing system having one or more characteristics, is only not allowed in specific circumstances such as time, location, etc., etc.).

[0061] In one embodiment, the method includes retrieving (by the target computing system) an indication of any of the available information items among the information items available to the target computing system. However, the available information items may be retrieved in any manner (e.g., directly from a dedicated memory structure, indirectly via other software applications from a general purpose memory structure storing personal information, locally or remotely, etc.), and they may be indicated in any manner (the same or different relative to the new information item).

[0062] In one embodiment, the method includes verifying (by the target computing system) compliance of the combination of the new information item and the available information item with the sharing rule. However, compliance may be verified in any manner (e.g., by matching hash values, information identifiers, actual values, etc. of the information items).

[0063] In one embodiment, the method includes controlling (by the target computing system) the receipt of the new information item in dependence on the result of said verifying compliance. However, the receipt of the new information item may be controlled in any manner in dependence on the result of the compliance verification (e.g., by accepting the new information items in any manner such as directly accepting or forwarding them in case of a positive result, by rejecting the new information items or requiring confirmation from the target for the acceptance of the new information items in case of a negative result, etc.).

[0064] In one embodiment, the receiving of the indication of the new information item, the receiving of the sharing rules, the retrieving of the indication of the available information item, the verification of compliance, and the controlling of the receiving of the new information item are performed by a trusted entity of the target computing system. However, the trusted entity may be of any type (e.g., a software module running on the target computing system, the entire target computing system, etc.).

[0065] In one embodiment, the trusted entity is trusted by the source computing system of the object. However, the trusted entity can be trusted by any source computing system in any manner (eg, by means of digital certificates, secure communication tunnels, etc.) (see below).

[0066] In one embodiment, the method includes controlling (by the target computing system) forwarding of the new information item to the target entity in accordance with the result of said verifying compliance. However, the forwarding may be of any type (e.g., forwarding to a software module running on the same target computing system, forwarding to another computing system, etc.), and the forwarding may be controlled in any manner (e.g., enabling transfer, preventing transfer, requiring confirmation to the object for enabling transfer, etc.) in accordance with the result of the verification.

[0067] In one embodiment, the method includes accepting receipt of the new information item (by the target computing system) in response to a positive result of said verifying compliance. However, receipt of the new information item may be accepted in any manner (eg, enabling its actual transmission, directly receiving it, etc.).

[0068] In one embodiment, the method includes, in response to a negative result of said verifying compliance, denying receipt of the new information item (by the target computing system). However, receipt of the new information item may be denied in any manner (e.g., preventing its actual transmission, ignoring it, with or without notification to the computing system (from which an indication of the new information item has been received) and / or to the source computing system of the object, etc.).

[0069] In one embodiment, the method includes notifying (by the target computing system) the object's source computing system of the denial of receipt of the new information item. However, the notification may be of any type (e.g., simply indicating the denial, adding any non-compliant information, such as the first non-compliant sharing rule or all non-compliant sharing rules, etc.), and may be used in any manner (e.g., outputting any corresponding notification, such as a visual message, an audio message, etc., by sending an instant message, an email, etc., and any combination thereof).

[0070] In one embodiment, the method includes receiving (by the target computing system) an indication of a new information item in association with a sharing rule. However, this information may be received in any manner (e.g., in the form of a single message or two or more messages linked together, each in the form of an authentication packet, a remote command, etc.).

[0071] In one embodiment, the method includes receiving (by a target computing system) an indication of a new information item from another target computing system (to which the source computing system of the object has submitted the new information item). However, the indication of the new information item may be received from the other target computing system in any manner (which may be the same or different than when the information is received directly from the source computing system).

[0072] In one embodiment, the method includes storing (by the target computing system) the sharing rules in response to receiving the new information item. However, the sharing rules may be stored in any manner (e.g., in a database, a file, etc.) in response to receiving the new information item (e.g., indiscriminately, only when the new information item can be shared, etc.).

[0073] In one embodiment, the method includes transmitting (by a target computing system) an indication of a new information item in association with a sharing rule to another target computing system (to which the new information item is to be submitted). However, the information may be transmitted in any manner (which may be the same or different than its receipt as described above).

[0074] In one embodiment, a method includes receiving (by a target computing system) an indication of a new information item in association with an identifier of an object. However, the identifier of the object may be of any type (e.g., a user ID, an email address, an identifier of a source computing system, etc.), and it may be associated with the indication of the new information item in any manner (e.g., specified in the same message or in a separate message linked to the message for receiving the indication of the new information item, returned from a message for receiving the indication of the new information item (such as from its source address), etc.).

[0075] In one embodiment, the method includes retrieving (by the target computing system) an indication of an available information item associated with an identifier of the object. However, the available information item associated with the identifier of the object may be retrieved in any manner (e.g., by querying a common memory structure, by reading a memory structure specific to the object, etc.).

[0076] In one embodiment, the method includes storing (by the target computing system) in response to receiving the new information item in association with the identifier of the object. However, the identifier of the object may be associated with the new information item in any manner (e.g., by writing the identifier of the object in a corresponding record of a common memory structure, by writing the new information item in a memory structure dedicated to the object, etc.).

[0077] In one embodiment, a method includes receiving (by a target computing system) a verification packet including an indication of a new information item and / or a sharing rule in encrypted form. However, the verification packet may be of any type (e.g., a message, an indication of the new information item only, a command with the sharing rule only or both, with or without additional information, etc.) and the verification packet may be encrypted in any manner (e.g., using a public key or a secret key of a trusted entity of the target computing system, etc.).

[0078] In one embodiment, the method includes decrypting (by the target computing system) the verification packet. However, the verification packet may be decrypted in any manner (e.g., using a corresponding private key, using the same secret key, using a private key / secret key known to the trusted entity but unknown to the target entity, etc.).

[0079] In one embodiment, the method includes receiving (by the target computing system) an indication of a new information item including a corresponding hash value of the new information item. However, the hash value may be of any type (e.g., based on a cryptographic hash, a list hash, a universal hash, a rolling hash, etc.).

[0080] In one embodiment, the method includes receiving (by the target computing system) a sharing rule based on a combination of corresponding hash values ​​of the information items. However, the sharing rule can be based on the hash values ​​of the information items in any manner (e.g., directly by including the hash values, indirectly by including an information identifier for retrieving the hash values, etc.).

[0081] In one embodiment, the method includes retrieving (by the target computing system) an indication of the available information item including a corresponding hash value of the available information item. However, the hash values ​​of the available information item may be retrieved in any manner (e.g., by reading them from a dedicated device storage structure, by calculating them from information available to the target computing system, etc.).

[0082] In one embodiment, the information item is personal information of a person. However, the personal information can be of any type (e.g., any piece of information that can be used to identify or track a person, such as a name, social security number, date and place of birth, photograph, biometric record, any piece of information that can be linked to the person, such as medical, educational, financial or employment status, customer network addresses, social accounts, etc.).

[0083] Another embodiment provides a method for controlling distribution of a plurality of information items of an object, wherein the method comprises: transmitting, by a source computing system of the object, an indication of one or more new ones of the information items to a target computing system associated with a target entity to which the new information items are to be submitted, transmitting, by the source computing system, one or more sharing rules for the object to the target computing system, the sharing rules being based on one or more combinations of the information items, receiving, by the source computing system, from the target computing system a result of verifying compliance of a combination of the new information item and any available ones of the information items available to the target computing system with the sharing rules, and controlling, by the source computing system, the transmission of the new information item to the target computing system based on the result of the verification. The same considerations noted above also apply to this embodiment.

[0084] Generally, similar considerations apply if the same solution is achieved using equivalent methods (by using more steps or parts of steps with similar steps having the same function, removing some unnecessary steps or adding other optional steps); moreover, the steps may be performed (at least partially) in a different order, simultaneously or in an interleaved manner.

[0085] An embodiment provides a computer program configured to cause a computing system to perform each of the above methods. One embodiment provides a computer program product for controlling the distribution of multiple information items of an object. The computer program product includes a computer-readable storage medium having program instructions embodied therewith. The program instructions are executable by a computing system to cause the computing system to perform each of the above methods. However, the computer program can be implemented as an independent module, or as a plug-in for a pre-existing software program (e.g., a Web server for a target computing system or a browser for a source computing system), or directly implemented therein. In addition, the computer program can be executed on any target / source computing system (see below). In any case, the solution according to the embodiment of the present disclosure can even be implemented using a hardware structure (e.g., by an electronic circuit integrated in one or more semiconductor material chips), or a combination of software and hardware that is appropriately programmed or otherwise configured.

[0086] An embodiment provides a computing system including components configured to perform the steps of each of the above methods. One embodiment provides a computing system including a circuit, which (i.e., any hardware appropriately configured by software, for example) is used to perform the steps of each of the same methods. However, the computing system can be of any type (e.g., a target computing system, a source computing system, a combination of one or more source computing systems and one or more target computing systems, etc.). Moreover, the target computing system can be of any type (e.g., a physical machine, a virtual machine, a cloud service, etc.), the source computing system can be of any type (e.g., a desktop, a laptop, a tablet computer, a smartphone, etc.), and they can communicate through any network (e.g., a global network, a wide area network, a local area network, etc.) using any type of connection (e.g., a wired or wireless connection, a telephone connection, a satellite connection, etc.).

[0087] In general, similar considerations apply if the computing system has a different structure or includes equivalent components or has other operating characteristics. In any case, each of its components can be divided into more elements, or two or more components can be combined into one element; in addition, each component can be replicated to support parallel execution of corresponding operations. In addition, unless otherwise specified, any interaction between different components generally does not need to be continuous, and the interaction can be direct or indirect through one or more intermediaries.

[0088] At any possible technical detail combination level, the present invention may be a system, method and / or computer program product. The computer program product may include a computer-readable storage medium carrying computer-readable program instructions for causing a processor to implement various aspects of the present invention.

[0089] A computer-readable storage medium may be a tangible device that can hold and store instructions used by an instruction execution device. A computer-readable storage medium may be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples of computer-readable storage media (a non-exhaustive list) include: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disk read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device, such as a punch card or a raised structure in a groove on which instructions are stored, and any suitable combination of the foregoing. As used herein, a computer-readable storage medium is not to be interpreted as a transient signal per se, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (e.g., a light pulse through a fiber optic cable), or an electrical signal transmitted through a wire.

[0090] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to each computing / processing device, or downloaded to an external computer or external storage device via a network, such as the Internet, a local area network, a wide area network, and / or a wireless network. The network can include copper transmission cables, optical fiber transmissions, wireless transmissions, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in the computer-readable storage medium in each computing / processing device.

[0091] The computer-readable program instructions for implementing the operation of the present disclosure may be assembler instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages ​​(including object-oriented programming languages, such as Smalltalk, C++, etc.) and conventional process programming languages ​​(such as "C" programming language or similar programming languages). The computer-readable program instructions may be executed entirely on the user's computer, partially on the user's computer, executed as an independent software package, partially on the user's computer and partially on a remote computer, or executed entirely on a remote computer or server. In the latter case, the remote computer may be connected to the user's computer via any type of network (including a local area network (LAN) or a wide area network (WAN)), or may be connected to an external computer (e.g., via the Internet using an Internet service provider). In some embodiments, an electronic circuit including, for example, a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA) may execute computer-readable program instructions to personalize the electronic circuit by utilizing the state information of the computer-readable program instructions, so as to perform aspects of the present disclosure.

[0092] Various aspects of the present invention are described herein with reference to the flow charts and / or block diagrams of the methods, devices (systems) and computer program products according to embodiments of the present invention. It should be understood that each box of the flow chart and / or block diagram and the combination of each box in the flow chart and / or block diagram can be implemented by computer-readable program instructions.

[0093] These computer-readable program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, thereby producing a machine, so that when these instructions are executed by the processor of the computer or other programmable data processing device, a device that implements the functions / actions specified in one or more boxes in the flowchart and / or block diagram is generated. These computer-readable program instructions can also be stored in a computer-readable storage medium, and these instructions cause the computer, programmable data processing device, and / or other equipment to work in a specific manner, so that the computer-readable medium storing the instructions includes a manufactured product, which includes instructions for implementing various aspects of the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0094] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device so that a series of operating steps are performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions executed on the computer, other programmable data processing apparatus, or other device to implement the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0095] The flow chart and block diagram in the accompanying drawings show the possible architecture, function and operation of the system, method and computer program product according to multiple embodiments of the present invention. In this regard, each square box in the flow chart or block diagram can represent a part of a module, program segment or instruction, and a part of the module, program segment or instruction includes one or more executable instructions for realizing the specified logical function. In some alternative implementations, the function marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two continuous square boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the function involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or action, or can be implemented with a combination of special hardware and computer instructions.

Claims

1. A method for controlling the distribution of a plurality of information items of an object, wherein the method include: receiving, by a target computing system, an indication of one or more new information items in the plurality of information items, the one or more new information items to be submitted to a target entity associated with the target computing system, receiving, by the target computing system, one or more sharing rules for the object, the sharing rules being based on one or more combinations of the plurality of information items, retrieving, by the target computing system, an indication of any available information item of the plurality of information items that is already available to the target computing system, verifying, by the target computing system, compliance of the combination of the new information item and the available information item with the sharing rule, and Receipt of the new information item is controlled by the target computing system in accordance with a result of the verifying the compliance.

2. The method of claim 1 , wherein said receiving said indication of said new information item, receiving said sharing rules, retrieving said indication of said available information items, verifying said compliance, and controlling said receiving of said new information item are performed by a trusted entity of said target computing system, said trusted entity being trusted by said source computing system of said object.

3. The method according to claim 1, in, The method comprises: The forwarding of the new information item to the target entity is controlled by the target computing system according to the result of verifying the compliance.

4. The method according to claim 1, wherein the method include: The receipt of the new information item is accepted by the target computing system in response to a positive result of said verifying said compliance.

5. The method according to claim 1, wherein the method include: Receiving said new information item is rejected by said target computing system in response to a negative result of said verifying said compliance.

6. The method according to claim 5, wherein the method include: A source computing system of the object is notified, by the target computing system, of the denial of the receipt of the new information item.

7. The method according to claim 1, wherein the method include: The indication of the new information item is received by the target computing system in association with the sharing rule.

8. The method according to claim 1, wherein the method include: The indication of the new information item is received by the target computing system from another target computing system to which the new information item has been submitted by the source computing system of the object.

9. The method according to claim 1, wherein the method include: storing, by the target computing system in response to the receiving of the new information item, the sharing rule, and The indication of the new information item is transmitted by the target computing system in association with the sharing rule to another target computing system to which the new information item is to be submitted.

10. The method according to claim 1, wherein the method include: receiving, by the target computing system, the indication of the new information item in association with an identifier of the object, retrieving, by the target computing system, the indication of the available information item associated with the identifier of the object, and The new information item is stored, by the target computing system in response to the receiving, in association with the identifier of the object.

11. The method according to claim 1, wherein the method include: receiving, by the target computing system, a verification packet including the indication of the new information item and / or the sharing rule in encrypted form, and The authentication packet is decrypted by the target computing system.

12. The method according to claim 1, wherein the method include: receiving, by the target computing system, the indication of the new information item, the indication comprising a corresponding hash value of the new information item, receiving, by the target computing system, the sharing rule based on a combination of corresponding hash values ​​of the plurality of information items, and The indication of the available information is retrieved by the target computing system, the indication comprising a corresponding hash value of the available information item.

13. The method according to claim 1, wherein the plurality of information items are personal information of persons.

14. A computer program product for controlling the distribution of a plurality of information items of an object, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions being readable by a computing system to cause the computing system to perform the steps of the method according to any one of claims 1 to 13.

15. A computing system for controlling the distribution of a plurality of information items of an object, the computing system comprising circuitry individually configured to perform each step of the method according to any one of claims 1 to 13.

16. A system comprising modules individually configured to perform each step of the method according to any one of claims 1 to 13.