Methods and apparatus for transmitting or exchanging anonymous information over a trusted network.

Abstract

The present invention relates to an apparatus and method for anonymous transmission of information, the transmission being point-to-multipoint or multipoint-to-multipoint communication between members of one and the same trusted network, the trusted network being predefined by a number of members and a number of independent proxies, the communication within the trusted network being carried out on an anonymizing network platform that hides the IP addresses of the members of said trusted network, the method being computer-implemented, - a member of the trusted network, including N' members and N proxies, generating a plurality of N complementary data fragments from the initial data packet to enable reconstruction of the initial data packet by recombining the N complementary fragments; - transmitting, by the sending member, via an anonymizing network platform, each of the generated complementary fragments to a respective independent proxy among the N proxies; - each of the independent proxies retransmitting, via an anonymous network platform, the complementary fragments received from said sending member to a plurality of N' members of the trusted network; - each receiving member of the trusted network recombining the received plurality of N complementary fragments to reconstruct an initial data packet; Includes.

Description

[Technical Field]

[0001] The present invention belongs to the technical field of communication protocols, and more particularly, to a method for anonymously and securely performing unidirectional anonymous transmission or bidirectional anonymous information exchange within a partner network, while maintaining the anonymity of one or more senders, without involving trusted third parties. [Background technology]

[0002] Network-level anonymization is still in its infancy. The currently known solutions—Virtual Private Networks (VPNs), Tor (The Onion Router) overlay networks, or anonymous I2P (Invisible Internet Project) networks—all rely on a "trusted third party," which, by design, allows them to see all uplink and downlink traffic exchanged between communication endpoints.

[0003] The patent application, International Publication No. 2019 / 072470A1, offers a solution to this problem by introducing two complementary concepts that eliminate the idea that any element of a platform owns all of the content: symmetry of the uplink and downlink routes at the exit of the exchange platform and channeling anonymous noise to all central nodes of a given route. However, this architecture only allows for anonymized, secure point-to-point communication and cannot perform point-to-multipoint or multipoint-to-multipoint communication (i.e., transmission or exchange).

[0004] Furthermore, there is a growing demand for the exchange of anonymous information on a trusted network between partners who share specific common needs but, for various reasons (e.g., regulations, competition, image storage, legal risks), do not wish to communicate this information directly with each other, and this demand remains unmet.

[0005] Therefore, in light of the emerging demands and existing shortcomings, communication within a reliable network framework should have the following characteristics: - It enables high-speed (or even near real-time) unidirectional or bidirectional information distribution to members of a trusted network (also called a “trust group”) or members of a subgroup of this network (also called a “trust circle”). - Only members of the trust group will receive the information, and therefore, it is guaranteed that no third party outside the group can access this information. This means that there are no trusted third parties who can (i) break the anonymity of the sender of any information, (2) access or modify this information regardless of the level of protection inherent to this information (typically by encryption), or (3) verify that the data was transmitted in a variant in which a noise generation system is implemented. - In a specific variant called "guarantee," it is possible for network members to individually exercise this guarantee, meaning that members do not need to trust other members to benefit from the guarantee. - Allow one or more recipients to evaluate the information through a degree of confidence while the sender is unknown (and must remain unknown). - To provide each member of the network with the possibility of monitoring (i.e., verifying) network members in real time and thus avoiding associations between multiple members, with the aim of excluding one or more other members from a particular transmission or exchange, or with the aim of breaking the anonymity of a particular member, or intercepting or modifying some of the transmissions or exchanges.

[0006] However, currently there is no solution that addresses all of the above requirements, including enabling each member of a network to monitor other members of that network in real time, especially with regard to low-latency communications.

[0007] The following approach proposes a partial solution:

[0008] "Freenet" is a decentralized "peer-to-peer" (P2P) platform that enables "censorship-resistant" communication. In practice, this is an information sharing service that allows an individual A to broadcast information, making it difficult to intercept and delete the information through the distribution of encrypted blocks to specific members of the Freenet network. These members will, in fact, save it at their own responsibility and retransmit it upon request. Each block is replicated by multiple users, so it is difficult to censor the information contained therein. Then, the information is accessible via links that can access and reassemble various blocks. Freenet itself is not anonymous, but by combining with Tor, it is possible to anonymously distribute information to many destinations. Freenet cannot guarantee access to data only to partners. In fact, anyone with a link can access the information. Therefore, conceptually, Freenet is more of a shared distributed persistent storage means than a low-latency transmission means.

[0009] "ZeroNet" is conceptually similar to Freenet but is a P2P information exchange network based on more modern technologies (blockchain and BitTorrent). The main difference is that copies of information are only saved by those who reference the information and not all members of the P2P network can save it. Therefore, ZeroNet has the same limitations as Freenet regarding the above requirements.

[0010] Past publications on anonymous multicast describe mechanisms (recently adopted by Botnets) that mask the network's control center from attacks, but the information transmission is only one-way because only the network administrator controls it.

[0011] The DAISY anonymization system, described in the article “DAISY: Increasing Scalability and Robustness of Anonymity Systems” by Chan, Chi-Bun, and Cristina Nita-Rotaru, is based on a three-level architecture in which the router's central core ("core delegate network") attempts to complicate the correlation between the inputs and outputs of the anonymization system. However, the DAISY description explicitly states that anonymous group communication is currently impossible with this solution.

[0012] Tor's confidentiality service may also be similar to an anonymous broadcasting service, however, this confidentiality service also provides access control. For example, the ICIJ (International Consortium of Investigative Journalists) uses SecureDrop, a Tor confidentiality service that receives information from whistleblowers and distributes it to all participating journalists. However, this confidentiality service is by design a trusted third party because it is the convergence point of information distributed among network members. It is the sole entity that controls the distribution to members of a partner's network and therefore may "choose" to restrict the distribution of information to one or more members of the partner's network. It can see the entire flow of incoming and outgoing information and therefore, theoretically, can access or modify its contents.

[0013] Furthermore, this is inherently a unidirectional system, and making it bidirectional requires management at the application layer.

[0014] Furthermore, as with the other solutions mentioned above, the Tor privacy service offers: -Even if an access control mechanism is added to this service, it cannot be guaranteed that the information will be distributed only to network members. - It is not possible to provide each member of the network with the ability to monitor (i.e., verify) the members of that network in real time (and thus avoid the association of multiple members with the aim of excluding one or more members from a particular transmission or exchange), - We cannot guarantee that information transmitted or exchanged cannot be intercepted and / or altered by a third party capable of launching more sophisticated attacks against current and future end-to-end encryption schemes. - Originally, it was not possible to build various trust circles within the member network. - It is not possible to conceal the event of sending the payload message.

[0015] This invention addresses these various requirements. [Prior art documents] [Patent Documents]

[0016] [Patent Document 1] International Publication No. 2019 / 072470A1 Pamphlet [Non-patent literature]

[0017] [Non-Patent Document 1] Chan, Chi-Bun, and Cristina Nita-Rotaru, “DAISY: Increasing Scalability and Robustness of Anonymity Systems” [Overview of the project] [Problems that the invention aims to solve]

[0018] One objective of the present invention is to propose an architecture and mechanism for low-latency point-to-multipoint or multipoint-to-multipoint anonymous transmission of information. The transmission is anonymized, secure, and free from the intervention of trusted third parties. The present invention makes it possible to establish a fully anonymous and trusted network for unidirectional anonymous transmission or bidirectional anonymous exchange of information.

[0019] One advantage of this invention is that it aims to enable the exchange of information between partners within a trusted network in a truly anonymized and secure manner, without the need for a trusted third party. [Means for solving the problem]

[0020] According to various embodiments, according to the present invention, - To guarantee to network members that no third party outside the network can access or modify the transmitted information. - To ensure that network members are not subjected to collusion by subgroups of members against one or more other members. - Establish trust groups or trust circles with different levels of confidence in order to assess the reliability of the anonymous information received by the recipient. This becomes possible.

[0021] Generally, the method of the present invention is based on an architecture comprising a network anonymization solution (which, in practice, may be an overlay network of an underlying standard communications network), a collection or group or circle of partners who wish to exchange information anonymously with one another, and a set of proxies (i.e., a "pool") operated by independent parties, where these partners are likely to be partners of their group and are responsible for relaying information from the sender of their group of partners to other partners of their group.

[0022] An advantage of this invention is that it introduces a novel communication mode, currently not in existence, called "anonymous multicast" communication mode, which enables bidirectional or bidirectional high-speed broadcasting of information within a trust group, in which none of the recipients can identify the sender of the information, nor can any other entity (typically a "trusted third party" or a third party outside of that trusted network) make such identification.

[0023] The industrial applications of this invention are diverse, including, to name a few, the energy, transportation, and banking sectors, but they cover solutions for implementing any single-layer or multi-layer trusted network for anonymous data exchange, and this includes, in particular, - A trusted network for information exchange to accelerate the detection of bank fraud through payments or insurance. - A reliable network for exchanging information on cyber attacks. - A reliable network for information exchange between national intelligence agencies, - A reliable network for information exchange among journalists, - A trusted network for the exchange of confidential business information (e.g., information about suppliers) between business partners. This includes, but is not limited to, these.

[0024] In one modified embodiment, the present invention makes it possible to create an anonymous instant messaging architecture that must always comply with the obligations regarding lawful interception.

[0025] To obtain the desired result, a method for anonymously transmitting information is proposed, which is point-to-multipoint or multipoint-to-multipoint communication between members of the same trusted network, where the trusted network is predefined by multiple members and multiple independent proxies, and communication within the trusted network takes place on an anonymized network platform that hides the IP addresses of the trusted network members. This method is computer-implemented, - A step that enables the reconstruction of the initial data packet by generating multiple N complementary data fragments from a member of a trusted network containing N' members and N proxies, and then recombining the N complementary fragments. - The transmitting member transmits each generated complementary fragment to an independent proxy among N proxies via an anonymization network platform, - Each independent proxy retransmits the complementary fragment received from the transmitting member to a plurality of N' members of the trusted network via an anonymous network platform. - Each receiving member of the trusted network recombines multiple N complementary fragments it has received to reconstruct the initial data packet. Includes.

[0026] The present invention may be carried out according to alternative or combined embodiments, in which, - The method may include an initial step of defining at least three receiving members from among a plurality of N' members of a trusted network, and / or defining at least two proxies from among a plurality of N independent proxies that relay the transmission of complementary fragments to the receiving members, - The step of generating multiple N complementary fragments may consist of applying a shared secret function F() to the initial data packet, and the step of recombining the received multiple N complementary fragments may consist of the inverse shared secret function F().-1 This may consist of applying () to the complementary fragment, - The shared secret function could be, for example, an XOR function with or without latency. - The step of generating multiple N complementary fragments may consist of generating N-1 random fragments of equal length to the initial data packet, where the last fragment N is a fragment complementary to the previous fragments. -The initial step may further include a step of defining a shared secret function F() for a small set of multiple N' members of a trusted network, - The step of the transmitting member transmitting complementary fragments may also include, simultaneously or sequentially, transmitting a shared secret function to each proxy, or directly including a function for reassembly via the complementary fragments. - The method may further include, after the reconnection step, a step in which at least one receiving member of a trusted network performs the generation, transmission, retransmission, and reconnection steps of an anonymous transmission method to send an anonymous response to the anonymous transmitting member. - The retransmission step performed by the proxy may consist of at least two proxies retransmitting the complementary fragments they receive to a small set of multiple receiving members, - The step of transmitting complementary fragments to the proxy may consist of transmitting, in addition to the complementary fragments, data or random fragments that are meaningless and perceived as noise at the application level. - The method may include the step of the proxy storing the received complementary fragment before the step of the proxy retransmitting the received complementary fragment, - The step of a proxy retransmitting a complementary fragment may further include, for each proxy, notifying a member of the trusted network responsible for accessing the anonymous network platform of the transmission of the complementary fragment, wherein the notification is likely a message containing information about the performance of the transmission, particularly the size of the data packet, the data rate, and / or information about whether it is unidirectional or bidirectional. - The method may further include, after the fragment recombination step, a step of generating a grade of the received data packet. - One, some, or all of the proxies may be hosted by one or more members of a trusted network.

[0027] The present invention also relates to an anonymous information transmission device, wherein the transmission is point-to-multipoint or multipoint-to-multipoint communication between members of the same trusted network, the trusted network being predefined by a plurality of members and a plurality of independent proxies, and the communication within the trusted network takes place on an anonymized network platform that conceals the IP addresses of the members of the trusted network, and the device includes means for performing steps of the method of the present invention.

[0028] The present invention also relates to a computer program product which includes code instructions for performing steps of the method of the present invention when the program is executed on a computer.

[0029] Other features and advantages of the present invention will become apparent from the following description and the accompanying drawings shown below. [Brief explanation of the drawing]

[0030] [Figure 1] A simplified representation of the environment for implementing the present invention is shown. [Figure 2] One embodiment of the architecture of the present invention is shown. [Figure 3]This is a flowchart of the anonymous transmission method of the present invention in a unidirectional point-to-multipoint embodiment. [Figure 4a] [Figure 4b] Figure 3 shows the steps of the unidirectional anonymous transmission method in the flowchart. [Figure 5a] [Figure 5b] Additional steps of a bidirectional anonymous exchange method according to one embodiment of the present invention are shown. [Figure 6] This describes one embodiment of the present invention called "multicircle". [Figure 7a] [Figure 7b] One embodiment of the present invention, called "guarantee," is shown. [Modes for carrying out the invention]

[0031] One implementation of the present invention, 100, is shown in a simplified form in Figure 1, which includes a communication network 102 on which a network anonymization solution 104 is placed. In one embodiment, the network anonymization solution 104 is an anonymized network covering the underlying conventional communication network 102.

[0032] An advantage is that the anonymization solution 104 does not necessarily have highly advanced anonymization properties. Nevertheless, the level of anonymity provided by the present invention depends in part on the robustness of the network anonymization solution. For this reason, a simple VPN anonymization service is not recommended, and those skilled in the art would preferably implement the present invention via an anonymization network such as Tor or I2P, or preferably using a platform based on the architecture of the aforementioned patent application, International Publication No. 2019 / 072470A1, by the applicant.

[0033] The architecture for implementing the method of the present invention also includes N' partners (M1~M) who wish to exchange information anonymously with each other. N’) network 106 and N independent proxies 108 (P1~P N This includes the pools.

[0034] A trusted network proxy and its members (i.e., partners) have the network address (e.g., IP address) of the underlying conventional network 102.

[0035] The proxy is responsible for relaying information from the transmitting member to trusted network partners or receivers. The proxy cannot verify or identify whether the data it carries is payload data or not.

[0036] Figure 2 shows one implementation example 200 of the present invention in the situation 100 of Figure 1. A conventional communication network 102 is shown, but this is not involved in the execution of the method of the present invention, where communication takes place only through an anonymized network 104.

[0037] The components involved in the implementation of the present invention include at least, - In reality, the network anonymization solution 104 is an overlay network "on top of" the conventional network 102. - Multiple N' members M who want to exchange information anonymously with each other N’ or a trusted network or trust circle (i.e., a “trust ring”) consisting of partners 106, - Multiple N proxies P, operated by independent parties, are responsible for relaying information from trusted network senders to trusted network partners. N Pool 108 That is the case.

[0038] Optionally, one or more databases (202, 204) may be constructed to function as proxies and partner registers, and may define the membership of various trust circles (i.e., subgroups of the initial trusted network) of these partners.

[0039] The databases (202, 204) are controlled by all members of the trusted network, and members can therefore access them at any time, securely or insecurely, via the anonymized network 104 or directly via the conventional network 102. In fact, both the proxy pool 108 and the members of the trusted network 106 have network addresses (e.g., IP addresses), which are visible to all elements of the underlying conventional network 102.

[0040] In one preferred embodiment of the present invention, members and proxies communicate anonymously with each other via an anonymized network 104. However, in the case of unidirectional communication, the connection between the proxy and the trusted network member may be made non-anonymously.

[0041] Trusted Network 106 partners therefore always have access to a list of proxies, as well as a list of other partners and their membership in various possible trust circles (subgroups). Since informing those skilled in the art of these databases is common practice, they will not be elaborated upon herein.

[0042] In one embodiment, the databases (202, 204) are defined as routing tables, as shown in Tables I, II, and III below.

[0043] Subgroups (or trust circles) are predefined among the members of a trust group. Each member then selects one or more trust circles to which they want to send information, according to a predefined routing table, and chooses the relevant pairs (proxy, group).

[0044] In one practical embodiment, the user communicates the identifier of the target group to each selected proxy.

[0045] Table I shows Group G iThe general configuration (by agreement among members M of a trusted network) is shown together with a list of proxies P for each group and members M of the trust circles forming part of this group. For example, members M1, M2, M4 belong to group G1, and they can relay their information through proxies P1, P2, and P4. i (by agreement among) i and members M of the trust circles forming part of this group i For example, members M1, M2, M4 belong to group G1, and they can relay their information through proxies P1, P2, and P4.

[0046] [Table 1]

[0047] Table II shows the membership within a certain group, the corresponding proxies, and the parameters of the shared secret function used by member M1 according to its membership within a certain group. Therefore, for example, during the exchange within group G1 (grouped with members M1, M2, M4 and relays P1, P2, P4 according to Table I), the shared secret function used by M1 is the XOR function. During the exchange within group G3 (grouped with members M1, M2, M4 and relays P1, P2, P4 according to Table I), the shared secret function used by M1 is the "latent XOR" function. In one embodiment of the present invention, the shared secret function is defined by the members of the group during its initial exchange and can then be changed periodically or aperiodically.

[0048] [Table 2]

[0049] Table III shows the proxy routing table indicating group parameter G i and the proxies representing the members belonging to each group. For example, proxy P4 relays the information sent by the members of group G2 to all members of this group, namely M2, M3, and M4.

[0050] <0~ [Table 3] ​

[0051] Figure 3 shows a flowchart 300 of the anonymous transmission method of the present invention in a unidirectional point-to-multipoint embodiment. The method involves trust circles {M1, M2, ..., M N It begins with a member from}, for example "M1", wanting to anonymously transmit information "data" to other members of the circle. A trusted network of partner 206 consists of at least 3 members (N'≧3).

[0052] In the following description, for the sake of brevity, the terms “member,” “partner,” and “sender” refer, in particular, to physical entities and / or hardware and software means configured to perform any function that enables these physical entities to fragment, transmit, receive, and reconstruct data over an anonymized network in accordance with the steps of the method of the present invention.

[0053] In the first step 302, the sender fragments the information to be transmitted into a number of N fragments, and then in the next step 304, the sender fragments each of the generated N fragments. i Proxy P in the proxy pool i It can be transmitted to.

[0054] Figure 4a shows steps 302 and 304 of the unidirectional anonymous transmission method of the flowchart in Figure 3 in the exemplary architecture of Figure 2.

[0055] Therefore, in step 302, from the packet "data", sender M1 generates N complementary fragments (fragment 1, fragment 2, ..., fragment N) using the shared secret function F(), so that the original packet "data" can be reconstructed by recombining these N complementary fragments, which can be written using the following equation: F -1 ({Complementary Fragments i} i=1..N)=data).

[0056] In one embodiment, the sender specifies the recipients or trust groups of the information that will be received.

[0057] In one embodiment, the shared secret function F() is XOR

number

number

[0058] In the next step 304, sender M1 transmits each fragment to a different proxy via the anonymized network platform 104. Thus, the first fragment "Fragment 1" is transmitted to the first proxy, e.g., P1, via anonymous connection M1-P1, the second fragment "Fragment 2" is transmitted to the second proxy, e.g., P2, via anonymous connection M1-P2, and so on, until finally the last fragment "Fragment N" is transmitted to the Nth proxy, e.g., P N Anonymous connection to M1-P N It continues until it is sent via [a specific method / platform].

[0059] Proxy P i Anonymous connection M1-P established for transmission i This is established only during the transmission period of that fragment from the sender to the proxy, or thereafter, the proxy P i It should be noted that this is retained if a response from it is expected.

[0060] Therefore, in step 304, each proxy P i It can receive random noise (i.e., fragments) from unknown members of a trusted network.

[0061] According to some modified embodiments, the number of proxies may be predetermined or may be determined by the sender before the information is transmitted.

[0062] The number of proxies that make up proxy pool 108 is at least 2 proxies (N≧2).

[0063] The method continues to step 306, where each proxy that has received a complementary fragment retransmits this fragment to all members of the trusted network (or all members of a subgroup of the trusted network) via the anonymized network platform, and then proceeds to step 308, where each member that has received multiple fragments uses the shared secret inverse function F -1 Reconstruct the packet "data" using ().

[0064] According to some modified embodiments, the shared secret function F() may be predefined for the trust circle and therefore known to each member of the group, it may be defined by the sender and transmitted through a proxy along with complementary fragments and relayed to the receiver in retransmission step 306, and may also be defined according to the application for which the method of the present invention is performed.

[0065] A person skilled in the art could execute any other function, in addition to the aforementioned example of the XOR function, to establish a shared secret function between partners.

[0066] Figure 4b shows steps 306 and 308 of the unidirectional anonymous transmission method of the flowchart in Figure 3 on the exemplary architecture of Figure 2.

[0067] Therefore, in step 306, each proxy P i This is a trusted network of partners {M i} i=1,...,N’ The complementary fragment that it received from receiver M1 is "fragment" i"anonymous connection M1-P established before that i It relays and retransmits the signal via this medium.

[0068] Proxy P i From recipient M i Anonymous connection P established for transmission i -M i It should be noted that this is established only during the transmission of the fragment from the proxy to this recipient, or is maintained thereafter if a response from a member of the trust circle {Mi} is expected.

[0069] When a member of the trust circle receives a fragment sent by the proxy, in step 308, each network member Mi receives all of the complementary fragments relayed by the proxy pool {Pi}, and the inverse function F is a shared secret. -1 It can be reconnected via (), and thus obtain the initial packet "data" of the information the sender wishes to share.

[0070] Several modified embodiments of the information exchange method of the present invention will be described with reference to Figures 5 to 7.

[0071] In one modified embodiment, the method of the present invention involves a sender M1 and all members {M} of the trust circle to which the sender belongs. i Between}, M i This is implemented for bidirectional transmission involving responses from each of the M i A specific database BDD hosted by i This could be a question request.

[0072] This modified method includes the aforementioned anonymous transmission steps 302-308 from sender M1. In this modified method, the fragment is sent to proxy P i Anonymous connection M1-P established for transmission i and proxy P i From recipient M jAnonymous connection P established for retransmission i -M j It will be retained.

[0073] Method 300 further allows each member of the trust circle who receives a request from a recipient unknown to them to perform the same anonymous transmission mechanism of the Method of the Invention, in turn sending a response anonymously to an anonymous sender.

[0074] Therefore, the member who transmits the "response" information becomes the sender in the sense of method 300 of the present invention.

[0075] Figures 5a and 5b show a step sequence of a bidirectional anonymous exchange method according to one embodiment of the present invention.

[0076] Partner M receives a request from a group to reconstruct the packets and then respond. j This performs an anonymous transmission method. In step 502, by applying the shared secret function F(), the “response” data packet is divided into multiple N complementary fragments corresponding to the number of proxies (fragments). Mj 1. Fragment MJ 2, ..., Fragment MJ It is divided into N), and then in step 504, each fragment of this response is sent to each proxy, proxy P i Member M j It is transmitted via the previously established and maintained anonymous connection Pi-Mj.

[0077] In the next step 506, each proxy retransmits the received fragment to the receiving member M1 via the previously established and maintained anonymous connection M1-Pi. Then, in the next step 508, which is functionally similar to step 308, the receiving member M1 receives the shared secret inverse function F -1 Apply () to multiple fragments Mj, and it still does not know the member M of the trust circle j Reconfigure the "response" bucket sent by [the specified method].

[0078] If simultaneous transmission or exchange takes place within a reliable network, sender M1 may associate a common identifier it has already generated with complementary fragment i, so that receiver Mi can correlate the correct fragments.

[0079] In one modified embodiment of the present invention, P i The retransmission of fragment i by the proxy to the recipient pool {Mi} may occur directly without passing through an anonymous network. However, in such cases, and also when the transmission includes responses from each Mi, it is necessary to instruct at the application level that the transmission of these responses be carried out in accordance with the principles of the present invention (i.e., steps 302-308) in order to guarantee the anonymity of the responses. This procedure is recommended to prevent the possibility of its contents being parsed, and to prevent the size of the response from being read, typically in cases where a "traffic flow confidentiality" scheme, such as "padding," may not be implemented.

[0080] One variation of the present invention is called the “multi-circle” type and is shown in Figure 6. In this embodiment, one, some, or all of the proxies have different retransmission rules, i.e., each receives the fragment it received from sender M1 from a member of the trust circle unique to that sender {M}. i A subset of {M} i It is sent to a subset of}. The retransmission rules may be predetermined by the members of that trust circle. These are centralized in the databases of member 204 and proxy 202.

[0081] Therefore, sender M1 may decide to send the packet "data" only to a selected subgroup of receivers, so that the receiving members of this subgroup consist only of members that are in the intersection of the selected subgroups of proxies. Members who are outside this intersection but are included in a particular subgroup may not receive the entire fragment and therefore cannot reconstruct the initial packet "data".

[0082] Therefore, an advantage is that multiple trust circles may be created, as shown in Figure 6, within which sender M1 has two proxies P2 and P N The system chooses to transmit the data packet "data" over two complementary fragments (fragment 1, fragment 2) relayed by the system (steps 602, 604).

[0083] According to the anonymous transmission method of the present invention, proxy P2 and P N Each of them retransmits the received fragment to a different subgroup of receivers. Therefore, proxy P2 retransmits fragment 1 of the fragment to receivers M1 and M2, and proxy P N Fragment 2 of the fragment is received by receivers M2 and M N The information is then retransmitted. As a result, M2 is the only one to receive the two complementary fragments (fragment 1, fragment 2), and therefore only to recombine them according to the principle of applying the inverse shared secret function, and thus only to be able to access the information "data".

[0084] One variation of the present invention is called the “guaranteed” type and is shown in Figures 7a and 7b. In this embodiment, one or more or all of the proxies may be hosted by one or more trusted network partners. Figure 7a more specifically shows step 304 of the method of the present invention in which a sender transmits complementary fragments of a data packet to all of the proxies, including one that it hosts and controls, and Figure 7b more specifically shows step 306 of the method of the present invention in which each proxy, including one hosted by sender M1, retransmits the received fragments to members of the trust circle.

[0085] In this configuration, the partner owning the proxy has an assurance that, even if there is collusion among all other members (or proxies) of the trusted network, no one other than the group of recipients identified by the sender can access (or modify) the information “data” when they send and receive information through the proxy under their control.

[0086] Another variation of the present invention, called the “external protection” type, involves one, some, or all of the Trust Circle partners generating “noise,” i.e., transmitting non-payload data or meaningless random fragments, to cancel out payload data (complementary fragments of packet “data” or “response”) in larger traffic. These useless data or fragments are recognized as noise at the application level. An advantage is that this prevents a proxy or an external observer that may analyze the network flow or the proxy from determining whether the data being carried is payload data or not.

[0087] Such noise can be generated in at least two ways. In the first approach, the noise can be generated at the application level, i.e., at the packet "data" level, and therefore before fragmentation by the shared secret function F(). This is done by generating random or non-random content marked by the protocol, and therefore before it is fragmented as non-payload content (e.g., via certain bits in the protocol header). In the other approach, the noise can be generated at the protocol level of a trusted network. This is done by a number of proxies N or a small set of trust circles under consideration (i.e., {Mi}). j This is done by randomly or non-randomly generating and sending fewer fragments than the number of proxies required. This generation may be pseudo-random in response to changes in the flow compared to both the overall and payload traffic flow, or it may be performed using a smart device based on the current exchange flow.

[0088] Another variation of the present invention, called the “mailbox” type, consists of one, some, or all of the Trust Circle partners being able to query a proxy they have access to and choose to retrieve all fragments to which they have access. In this configuration, messages are not automatically relayed by the proxy. This mode can also be used when resuming a connection.

[0089] Another variation of the present invention is called the “storage” type, in which one, some, or all of the proxies can store the fragments they relay. These fragments then remain accessible to authorized partners.

[0090] Another variation of the present invention is called the “payment” type, in which the method of the present invention is established between all trusted members of a network and a specific member responsible for accessing that network. In this configuration, with each flow transmission, a proxy relays information to all trusted members of the network (as detailed in the method of the present invention), accompanied by a specific message notifying the transmission of data to the specific member responsible for accessing the network, which may include information about the performance of this transmission, such as packet size, data rate, and whether it is unidirectional or bidirectional. This specific message may consist, for example, the header of the payload message and random noise instead of fragments, thereby preventing the proxy from sending an inappropriate specific message.

[0091] An advantage of this variant is that it allows for the definition of a method for estimating the objective cost of using an anonymization platform across the entire trusted network. Based on this, invoices may be issued to all members of the trusted network, and the trusted network is responsible for defining how these charges are distributed, for example, by dividing the total invoices by the number of members in the trusted network.

[0092] Another variation of the present invention, called the “reward” type, consists of an exchange being graded by all recipients of information based on what is defined by each of the trusted networks. An advantage of such grading is that it is possible to reward partners who provide information deemed beneficial to the platform. Rewards can be delegated to various proxies. Rewards may be based on a cryptocurrency system.

[0093] Those skilled in the art will see that the various variations of the present invention, namely "guarantee," "multi-circle," "external protection," "mailbox," "storage," "payment," and "reward," can be combined with each other to flexibly provide a variety of additional features.

[0094] Therefore, the explanation focuses on a communication method called "anonymous multicast" and its derived variations, which offer several advantages, including: - To enable partners to build a reliable network in which they can transmit (unidirectional) or exchange (two-way) information anonymously with one another. - The transmission or exchange is carried out without the intervention of any trusted third party who could break anonymity and / or access (modify) the contents of the transmission or exchange. - To build a trustworthy network consisting of one or more different trust circles. - The sender or initiator of an exchange can be the sole person who can control the level of credit used. - To provide one or more members of a network with assurances that they can verify that the information is indeed provided only to members of the network, while at the same time maintaining the anonymity of the sender. - In addition to the sender, each of the selected recipients in the trust circle will be able to independently verify that the content of the information has not been intercepted or altered by a third party, and that there could not have been any collusion against them by other members of the network. This provides assurance that other members of the network cannot construct a trustworthy third party. - During transmission, only members of the partner group will receive the information, and therefore, any third party outside the group will not be able to access this information. This means that there will be no trusted third party who can violate the anonymity of the sender of the information and access or modify this information regardless of its inherent level of protection (typically encryption). - To prevent external proxies and third parties from determining whether the payload content was transmitted or retrieved by one of the network's members. - To enable one or more recipients to evaluate information through a "degree of trust" while (and must remain) the sender is unknown. This degree of trust is estimated by the recipient by analyzing the proxy that relayed the information defining this trust circle into it. - To ensure that members of the trust circle can obtain this assurance individually, meaning that members do not need to rely on other members to benefit from this assurance.

Claims

1. In a method for anonymous transmission of information (300), the transmission is point-to-multipoint or multipoint-to-multipoint communication between members of the same trusted network, the trusted network is predefined by multiple members and multiple independent proxies, and the communication within the trusted network takes place on an anonymized network platform (104) that hides the IP addresses of the members of the trusted network, and is computer-implemented. - A step (302) that enables the reconstruction of the initial data packet by generating a plurality of N complementary data fragments from an initial data packet from a member of a trusted network including N' members and N proxies, and then recombining the N complementary fragments, - The transmitting member transmits each generated complementary fragment to an independent proxy among the N proxies via the anonymization network platform (304), - Step (306) each of the independent proxies retransmits the complementary fragment received from the transmitting member to the plurality of N' members of the trusted network via the anonymized network platform, - Step (308) in which each receiving member of the trusted network recombines the received plurality of N complementary fragments to reconstruct the initial data packet, A method that includes this.

2. The method according to claim 1, comprising the initial step of defining at least three receiving members from among the plurality of N' members of the trusted network, and / or defining at least two proxies from among the plurality of N independent proxies that relay the transmission of the complementary fragment to the receiving members.

3. The step of generating a plurality of N complementary fragments comprises applying a shared secret function F() to the initial data packet, and the step of recombining the received plurality of N complementary fragments comprises the inverse shared secret function F(). －１ The method according to claim 1 or 2, comprising applying () to the complementary fragment.

4. The method according to claim 3, wherein the shared secret function is a latency-based or latency-free XOR function.

5. The method according to claim 4, wherein the step of generating a plurality of N complementary fragments comprises generating N-1 random fragments of a length equal to the length of the initial data packet, and the last fragment N is a fragment complementary to the previous fragments.

6. The method according to claim 2, wherein the initial step further includes the step of defining a shared secret function F() for the set of the plurality of N' members of the trusted network.

7. The method according to claim 6, wherein the step of the transmitting member transmitting the complementary fragments comprises transmitting the shared secret function to each proxy simultaneously or sequentially, or directly comprising a function for reassembly via the complementary fragments.

8. The method according to any one of claims 1 to 7, further comprising the step, after the recombination step, that at least one receiving member of the trusted network performs the generation step (302), transmission step (304), retransmission step (306), and recombination step (308) according to claim 1 to transmit an anonymous response to the anonymous transmitting member.

9. The method according to any one of claims 1 to 8, wherein the retransmission step performed by the proxy comprises at least two proxies retransmitting complementary fragments received by them to a small set of the plurality of receiving members.

10. The method according to any one of claims 1 to 9, wherein the step of transmitting the complementary fragment to the proxy comprises transmitting, in addition to the complementary fragment, data or random fragments that are meaningless and recognized as noise at the application level.

11. The method according to any one of claims 1 to 10, further comprising the step of the proxy storing the received complementary fragment before the step of the proxy retransmitting the received complementary fragment.

12. The method according to any one of claims 1 to 11, wherein the step of the proxy retransmitting the complementary fragment further comprises, for each proxy, notifying a member of the trusted network responsible for accessing the anonymized network platform of the transmission of the complementary fragment, the notification being a message containing information relating to the performance of the transmission, in particular the size of the data packet, the data rate, and whether it is unidirectional or bidirectional.

13. The method according to any one of claims 1 to 12, further comprising the step of generating a grade of the received data packet after the fragment recombination step.

14. The method according to any one of claims 1 to 13, wherein one, some, or all of the proxies are hosted by one or more members of the trusted network.

15. A computer program, the computer program comprising code instructions that, when the program is executed on a computer, perform the steps of the method described in any one of claims 1 to 14.

16. An anonymous information transmission device, wherein the transmission is point-to-multipoint or multipoint-to-multipoint communication between members of the same trusted network, the trusted network is predefined by a plurality of members and a plurality of independent proxies, and the communication within the trusted network is performed on an anonymized network platform (104) that conceals the IP addresses of the members of the trusted network, the device comprising means for performing the steps of the method according to any one of claims 1 to 14.

Images