CN111970246B - Network forwarding method and device for two-factor anonymous message - Google Patents
Network forwarding method and device for two-factor anonymous message Download PDFInfo
- Publication number
- CN111970246B CN111970246B CN202010700730.8A CN202010700730A CN111970246B CN 111970246 B CN111970246 B CN 111970246B CN 202010700730 A CN202010700730 A CN 202010700730A CN 111970246 B CN111970246 B CN 111970246B
- Authority
- CN
- China
- Prior art keywords
- forwarding
- forwarded
- probability
- message
- adjusting
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
- H04L63/0421—Anonymous communication, i.e. the party's identifiers are hidden from the other party or parties, e.g. using an anonymizer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/045—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply hybrid encryption, i.e. combination of symmetric and asymmetric encryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Transfer Between Computers (AREA)
Abstract
One or more embodiments of the present disclosure provide a method and an apparatus for network forwarding of a two-factor anonymous message, where a forwarding policy combining direct forwarding and delayed forwarding is adopted, so as to avoid an attacker from attacking through a corresponding relationship of forwarding time, and thus, a lower delay can be ensured while effectively resisting time attack, and meanwhile, a user can adjust forwarding efficiency by adjusting two factors, thereby ensuring security and efficiency.
Description
Technical Field
One or more embodiments of the present disclosure relate to the field of internet and communication security technologies, and in particular, to a method and an apparatus for network forwarding of a two-factor anonymous message.
Background
The network anonymous communication is a privacy protection technology for hiding communication contents and communication relations by adopting measures of message forwarding, data encryption, traffic confusion and the like. The network anonymous communication technology is mainly applied to the fields of anonymous electronic mail systems, anonymous network storage systems, anonymous release systems, anonymous Web browsing systems and the like.
The network anonymous communication scheme based on the virtual circuit network structure improves the difficulty of an attacker in controlling an entrance and an exit simultaneously by using a large network scale and adopting various protection mechanisms such as a Guard mechanism, a routing algorithm and the like, but in the scheme, all messages are directly forwarded without considering a delay strategy, so that the risk of time attack is increased.
The scheme for anonymous communication of the network based on the message source routing forwarding path network structure has the advantages that by adopting a Mix mechanism, all messages are forwarded after being delayed, and the corresponding relation between input messages and output messages is confused, so that the protection effect is achieved.
In summary, in a network communication environment, an attacker tries to associate messages by observing part of nodes and using input and output time of the messages, so as to track input, transmission and output of the nodes and damage network communication. The existing network anonymous communication scheme cannot effectively balance security and efficiency, so that the problems of low security and low efficiency are caused.
Disclosure of Invention
In view of this, one or more embodiments of the present disclosure aim to provide a two-factor anonymous message network forwarding method and apparatus, so as to solve the problem that the existing network anonymous communication scheme cannot effectively balance security and efficiency, resulting in lower security and efficiency
In view of the above, one or more embodiments of the present specification provide a two-factor anonymous message network forwarding method, including:
acquiring a forwarding node and a message to be forwarded;
forwarding the message to be forwarded through the forwarding node according to a preset forwarding strategy;
determining the actual probability of the message to be forwarded being forwarded within the preset time according to the forwarding strategy;
and if the actual probability is lower than the target probability, adjusting the forwarding strategy until the actual probability is not lower than the target probability.
Optionally, the forwarding policy includes:
for any message to be forwarded, directly forwarding the message on any forwarding node with a preset probability p, and delaying forwarding with the probability 1-p;
the actual probability that the message to be forwarded which is delayed and forwarded is forwarded in the preset time on any forwarding node is subjected to exponential distribution.
Optionally, the actual probability that the message to be forwarded is forwarded within the preset time includes:
wherein, Fn(t) the actual probability that the message to be forwarded is forwarded within the preset time;
n is the number of the forwarding sublinks; two forwarding nodes form a forwarding sublink;
t is a preset time;
i sequentially taking integers from 0 to n;
λ is an exponential distribution parameter;
gamma is a Gamma distribution.
Optionally, adjusting the forwarding policy includes:
the probability p of direct forwarding is adjusted.
Optionally, adjusting the forwarding policy includes:
the parameter λ of the exponential distribution is adjusted.
Based on the same inventive concept, one or more embodiments of the present specification provide a two-factor anonymous message network forwarding device, which is characterized by comprising:
the obtaining module is used for obtaining the forwarding node and the message to be forwarded;
the forwarding module is used for forwarding the message to be forwarded through the forwarding node according to a preset forwarding strategy;
the operation module is used for determining the actual probability of the message to be forwarded being forwarded within the preset time according to the forwarding strategy;
and the adjusting module is used for adjusting the forwarding strategy if the actual probability is lower than the target probability until the actual probability is not lower than the target probability.
Optionally, the forwarding module is specifically configured to:
for any message to be forwarded, directly forwarding the message on any forwarding node with a preset probability p, and delaying forwarding with the probability 1-p;
the actual probability that the message to be forwarded which is delayed and forwarded is forwarded in the preset time on any forwarding node is subjected to exponential distribution.
Optionally, the adjusting module is specifically configured to:
adjusting the probability of direct forwarding;
and/or the presence of a gas in the gas,
parameters of the exponential distribution are adjusted.
Based on the same inventive concept, one or more embodiments of the present specification provide an electronic device, which includes a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processor implements the method when executing the program.
Based on the same inventive concept, one or more embodiments of the present specification provide a non-transitory computer-readable storage medium, characterized in that the non-transitory computer-readable storage medium stores computer instructions for causing a computer to execute the above method.
As can be seen from the foregoing, in the network forwarding method and device for two-factor anonymous messages provided in one or more embodiments of the present disclosure, a forwarding policy combining direct forwarding and delayed forwarding is adopted, so that an attacker is prevented from attacking through a corresponding relationship of forwarding time, a lower delay can be ensured while effectively resisting time attack, and meanwhile, a user can adjust forwarding efficiency by adjusting two factors, thereby ensuring security and efficiency.
Drawings
In order to more clearly illustrate one or more embodiments or prior art solutions of the present specification, the drawings that are needed in the description of the embodiments or prior art will be briefly described below, and it is obvious that the drawings in the following description are only one or more embodiments of the present specification, and that other drawings may be obtained by those skilled in the art without inventive effort from these drawings.
Fig. 1 is a schematic flow diagram of a two-factor anonymous message network forwarding method according to one or more embodiments of the present disclosure;
FIG. 2 is a schematic diagram of a two-factor anonymous message network forwarding device according to one or more embodiments of the present disclosure;
fig. 3 is a schematic structural diagram of hardware of an electronic device according to one or more embodiments of the present disclosure.
Detailed Description
For the purpose of promoting a better understanding of the objects, aspects and advantages of the present disclosure, reference is made to the following detailed description taken in conjunction with the accompanying drawings.
It is to be noted that unless otherwise defined, technical or scientific terms used in one or more embodiments of the present specification should have the ordinary meaning as understood by those of ordinary skill in the art to which this disclosure belongs. The use of "first," "second," and similar terms in one or more embodiments of the specification is not intended to indicate any order, quantity, or importance, but rather is used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that the element or item listed before the word covers the element or item listed after the word and its equivalents, but does not exclude other elements or items. The terms "connected" or "coupled" and the like are not restricted to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", and the like are used merely to indicate relative positional relationships, and when the absolute position of the object being described is changed, the relative positional relationships may also be changed accordingly.
To achieve the above object, one or more embodiments of the present specification provide a two-factor anonymous message network forwarding method and apparatus, which may be applied to various electronic devices, including a memory, a processor, and a computer program stored in and run on the memory, and a non-transitory computer-readable storage medium, which are not specifically limited by the present disclosure.
Fig. 1 is a schematic flow chart of a two-factor anonymous message network forwarding method according to one or more embodiments of the present disclosure, where the two-factor anonymous message network forwarding method includes:
s101, acquiring a forwarding node and a message to be forwarded.
When a user forwards a message, a forwarding link needs to be established, a plurality of forwarding nodes are selected from a network, and the forwarding link is finally established. The two forwarding nodes are connected to form a forwarding sublink, and the forwarding sublink comprises a plurality of forwarding sublinks.
And S102, forwarding the message to be forwarded through the forwarding node according to a preset forwarding strategy.
The advantage of the message forwarding strategy without delay is that the delay of message transmission is small, the disadvantage is that the risk of time attack is increased, the advantage of the message forwarding strategy with delay is that the time attack can be resisted to a certain degree, and the disadvantage is that the delay of message transmission is large.
The present disclosure adopts a forwarding policy combining a non-delayed message forwarding policy and a delayed message forwarding policy, and in some embodiments, the forwarding policy of the present disclosure is:
and for any message to be forwarded, directly forwarding the message to be forwarded at any forwarding node with a probability p, and delaying the forwarding with a probability 1-p, wherein the probability that the message to be forwarded after delaying the forwarding is forwarded within a preset time at any forwarding node is subjected to exponential distribution.
The probability p is preset by the user. The probability p has different values and can adapt to different application scenarios, for example, if p is 1, all messages to be forwarded are directly forwarded, and if p is 0, all messages to be forwarded are delayed for forwarding. Then, different values of the probability p are set, so that different forwarding efficiencies can be realized, and different forwarding safety can be realized. Specifically, the larger the value of the probability p is, the higher the efficiency is, but the lower the safety is; conversely, the smaller the value of the probability p, the lower the efficiency, but the higher the safety.
The exponential distribution is formulated as:
f(t)＝1-e-λt
wherein t is a preset time, and λ is an exponential distribution parameter. In this case, the average delay time is represented by 1/λ.
Specifically, for example, after a message to be forwarded enters a forwarding node, when the message is transmitted from the forwarding node to another forwarding node through a forwarding sublink where the forwarding node is located, there are two forwarding situations:
the first situation is that the message to be forwarded is directly forwarded, and the probability of the situation is p; the second case is that the message to be forwarded is delayed and forwarded, and the probability of this case is 1-p, wherein the actual probability that the message to be forwarded delayed and forwarded is forwarded within the preset time follows an exponential distribution.
For a forwarding sublink, the above two situations are combined, and the actual probability that the message to be forwarded is forwarded within the preset time is:
F1(t)＝p+(1-p)(1-e-λt)＝1-(1-p)e-λt
and all the messages to be forwarded which are delayed to be forwarded are put into a queue to be forwarded to wait. The to-be-forwarded queue comprises a plurality of to-be-forwarded messages which are delayed and forwarded, the stay time of the to-be-forwarded messages which are delayed and forwarded in the forwarding queue is subjected to exponential distribution, namely the probability of being forwarded in a preset time on any forwarding node is subjected to the following steps:
f(t)＝1-e-λt
all forwarding nodes forward all messages to be forwarded according to the same forwarding strategy, and the forwarding probabilities are independent and step-by-step, i.e. obey the same distribution and are independent.
S103, determining the actual probability of the message to be forwarded being forwarded within the preset time according to the forwarding strategy.
The forwarding links comprise a plurality of forwarding sublinks, all the forwarding sublinks forward all the messages to be forwarded according to the same forwarding strategy, the forwarding probabilities obey the same distribution and are independent to each other, and then the actual probability of the messages to be forwarded being forwarded within the preset time is calculated by the following formula:
wherein, Fn(t) the actual probability that the message to be forwarded is forwarded within the preset time;
n is the number of the forwarding sublinks; two forwarding nodes form a forwarding sublink;
t is a preset time;
i sequentially taking integers from 0 to n;
p is the probability of direct forwarding; for any message to be forwarded, directly forwarding the message on any forwarding node with a preset probability p, and delaying forwarding with the probability 1-p; the actual probability of the message to be forwarded which is delayed and forwarded in the preset time on any forwarding node is subjected to exponential distribution;
λ is an exponential distribution parameter;
gamma is Gamma distribution; the sum of the exponential distributions conforms to the Gamma distribution Γ.
For example,
for example, when the number of forwarding sub-links constituting a forwarding link is 1, that is, when a message to be forwarded is transmitted from one forwarding node to another forwarding node, forwarding is performed only once, there are two cases:
the first case is direct forwarding of a message to be forwarded, where the probability is p, and the probability p is set and adjusted by a user to adapt to different application scenarios, for example, p ═ 1 is all direct forwarding, and correspondingly, p ═ 0 is all delayed forwarding. Then, different values of the probability p are set, so that different forwarding efficiencies can be realized, and different forwarding safety can be realized. Specifically, the larger the value of the probability p is, the higher the efficiency is, but the lower the safety is; conversely, the smaller the value of the probability p, the lower the efficiency, but the higher the safety.
The second case is that the message to be forwarded is delayed and forwarded, and the probability of this case is 1-p, wherein the actual probability that the message delayed and forwarded is forwarded within the preset time obeys the exponential distribution f (t) 1-e-λt。
Combining the above two situations, the actual probability that the message to be forwarded is forwarded within the preset time is:
F1(t)＝p+(1-p)(1-e-λt)＝1-(1-p)e-λt
wherein, 1 is the number of the forwarding sublinks forming the forwarding link;
t is a preset time;
p is the probability of direct forwarding;
1-p is the probability of delayed forwarding;
1-e-λtthe actual probability of the message which is delayed to be forwarded being forwarded within the preset time is obtained;
λ is a parameter of the exponential distribution.
For example, when the number of forwarding sub-links constituting a forwarding link is 2, that is, a message to be forwarded is transmitted from a first forwarding node to a second forwarding node, and then transmitted from the second forwarding node to a third forwarding node, and forwarding is performed twice, there are four cases:
the first case is where both the first forwarding node and the second forwarding node forward directly.
The second case is that the first forwarding node forwards directly and the second forwarding node delays forwarding.
The third situation is that the first forwarding node delays forwarding and the second forwarding node forwards directly.
The fourth case is that both the first forwarding node and the second forwarding node delay forwarding.
For each forwarding node, the probability of direct forwarding is p, and the probability p is set and adjusted by a user to adapt to different application scenarios, for example, p ═ 1 is all direct forwarding, and p ═ 0 is all delayed forwarding.
For each forwarding node, the delayed forwarding probability is 1-p, wherein the actual probability that the delayed forwarded message is forwarded within a preset time obeys an exponential distribution f (t) -1-e-λt。
Combining the above four situations, the actual probability that the message to be forwarded is forwarded within the preset time is:
wherein 2 is the number of forwarding sublinks forming the forwarding link;
t is a preset time;
i sequentially taking integers from 0 to 2;
p is the probability of direct forwarding;
1-p is the probability of delayed forwarding;
1-e-λtthe actual probability of the message which is delayed to be forwarded being forwarded within the preset time is obtained;
λ is an exponential distribution parameter;
gamma is Gamma distribution; the sum of the exponential distributions conforms to the Gamma distribution Γ.
For example, when the number of forwarding sub-links constituting a forwarding link is 3, that is, a message to be forwarded is transmitted from a first forwarding node to a second forwarding node, then from the second forwarding node to a third forwarding node, and then from the third forwarding node to a fourth forwarding node, and forwarding is performed three times, there are the following eight cases:
the first case is that the first forwarding node, the second forwarding node and the third forwarding node all forward directly.
The second case is that the first forwarding node delays forwarding, the second forwarding node forwards directly, and the third forwarding node forwards directly.
The third situation is that the first forwarding node forwards directly, the second forwarding node delays forwarding, and the third forwarding node forwards directly.
The fourth case is that the first forwarding node forwards directly, the second forwarding node forwards directly, and the third forwarding node delays forwarding.
The fifth case is that the first forwarding node delays forwarding, the second forwarding node delays forwarding, and the third forwarding node directly forwards.
The sixth situation is that the first forwarding node delays forwarding, the second forwarding node directly forwards, and the third forwarding node delays forwarding.
The seventh situation is that the first forwarding node forwards directly, the second forwarding node delays forwarding, and the third forwarding node delays forwarding.
An eighth case is where the first forwarding node, the second forwarding node, and the third forwarding node all delay forwarding.
For each forwarding node, the probability of direct forwarding is p, and the probability p is set and adjusted by a user to adapt to different application scenarios, for example, p ═ 1 is all direct forwarding, and p ═ 0 is all delayed forwarding.
For each forwarding node, the probability of delayed forwarding is 1-p, wherein the actual probability that the message delayed forwarding is forwarded within a preset time obeys an exponential distribution f (t) -1-e-λt。
Combining the above eight situations, the actual probability that the message to be forwarded is forwarded within the preset time is:
wherein 3 is the number of forwarding sublinks forming the forwarding link;
t is a preset time;
i sequentially taking integers from 0 to 3;
p is the probability of direct forwarding;
1-p is the probability of delayed forwarding;
1-e-λtthe actual probability of the message which is delayed to be forwarded being forwarded within the preset time is obtained;
λ is an exponential distribution parameter;
gamma is Gamma distribution; the sum of the exponential distributions conforms to the Gamma distribution Γ.
And S104, if the actual probability is lower than the target probability, adjusting the forwarding strategy until the actual probability is not lower than the target probability.
The actual probability is lower than the target probability, for example, the preset time is 3 seconds, the actual probability that the message to be forwarded is forwarded within 3 seconds of the preset time is 0.7, and the target probability is 0.8, so that the actual probability is lower than the target probability, the requirement of the user cannot be met, and the forwarding strategy needs to be adjusted.
In some embodiments, adjusting the forwarding policy comprises:
the probability p of direct forwarding is adjusted. The probability p is set and adjusted by a user to adapt to different application scenarios, for example, p ═ 1 is that all messages to be forwarded are directly forwarded, and p ═ 0 is that all messages to be forwarded are delayed and forwarded. Then the actual probability of forwarding becomes larger as the value of the probability p becomes larger.
In some embodiments, adjusting the forwarding policy comprises:
the parameter λ of the exponential distribution is adjusted. And the parameter lambda of the exponential distribution is a system setting parameter and is adjusted by the system. For an exponential distribution, 1/λ is the expected value of the exponential distribution, i.e. the average delay time is 1/λ. Then the actual probability of forwarding becomes larger as the value of the parameter lambda becomes larger.
One or more embodiments of the present disclosure provide a method and an apparatus for network forwarding of a two-factor anonymous message, where a forwarding policy combining direct forwarding and delayed forwarding is adopted, so as to avoid an attacker from attacking through a corresponding relationship of forwarding time, and thus, a lower delay can be ensured while effectively resisting time attack, and meanwhile, a user can adjust forwarding efficiency by adjusting two factors, thereby ensuring security and efficiency.
It is to be appreciated that the method can be performed by any apparatus, device, platform, cluster of devices having computing and processing capabilities.
It should be noted that the method of one or more embodiments of the present disclosure may be performed by a single device, such as a computer or server. The method of the embodiment can also be applied to a distributed scene and completed by the mutual cooperation of a plurality of devices. In such a distributed scenario, one of the devices may perform only one or more steps of the method of one or more embodiments of the present disclosure, and the devices may interact with each other to complete the method.
The foregoing description has been directed to specific embodiments of this disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
Fig. 2 is a schematic structural diagram of a two-factor anonymous message network forwarding device according to one or more embodiments of the present disclosure.
An obtaining module 201, configured to obtain a forwarding node and a message to be forwarded.
The forwarding module 202 is configured to forward the message to be forwarded through the forwarding node according to a preset forwarding policy.
The forwarding module 202 is specifically configured to:
for any message to be forwarded, directly forwarding the message on any forwarding node with a preset probability p, and delaying forwarding with the probability 1-p;
the actual probability that the message to be forwarded which is delayed and forwarded is forwarded in the preset time on any forwarding node is subjected to exponential distribution.
And the operation module 203 is configured to determine an actual probability that the message to be forwarded is forwarded within a preset time according to the forwarding policy.
An adjusting module 204, configured to adjust the forwarding policy until the actual probability is not lower than the target probability if the actual probability is lower than the target probability.
The adjusting module 204 is specifically configured to:
adjusting the probability of direct forwarding;
and/or the presence of a gas in the gas,
parameters of the exponential distribution are adjusted.
For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. Of course, the functionality of the modules may be implemented in the same one or more software and/or hardware implementations in implementing one or more embodiments of the present description.
The apparatus of the foregoing embodiment is used to implement the corresponding method in the foregoing embodiment, and has the beneficial effects of the corresponding method embodiment, which are not described herein again.
Fig. 3 is a schematic structural diagram of hardware of an electronic device according to one or more embodiments of the present disclosure, where the electronic device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein the processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 are communicatively coupled to each other within the device via bus 1050.
The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solutions provided in the embodiments of the present disclosure.
The Memory 1020 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, or the like. The memory 1020 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 1020 and called to be executed by the processor 1010.
The input/output interface 1030 is used for connecting an input/output module to input and output information. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The communication interface 1040 is used for connecting a communication module (not shown in the drawings) to implement communication interaction between the present apparatus and other apparatuses. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
It should be noted that although the above-mentioned device only shows the processor 1010, the memory 1020, the input/output interface 1030, the communication interface 1040 and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only those components necessary to implement the embodiments of the present description, and not necessarily all of the components shown in the figures.
Computer-readable media of the present embodiments, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, is limited to these examples; within the spirit of the present disclosure, features from the above embodiments or from different embodiments may also be combined, steps may be implemented in any order, and there are many other variations of different aspects of one or more embodiments of the present description as described above, which are not provided in detail for the sake of brevity.
In addition, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown in the provided figures, for simplicity of illustration and discussion, and so as not to obscure one or more embodiments of the disclosure. Furthermore, devices may be shown in block diagram form in order to avoid obscuring the understanding of one or more embodiments of the present description, and this also takes into account the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform within which the one or more embodiments of the present description are to be implemented (i.e., specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that one or more embodiments of the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative instead of restrictive.
While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those of ordinary skill in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic ram (dram)) may use the discussed embodiments.
It is intended that the one or more embodiments of the present specification embrace all such alternatives, modifications and variations as fall within the broad scope of the appended claims. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of one or more embodiments of the present disclosure are intended to be included within the scope of the present disclosure.
Claims (7)
1. A two-factor anonymous message network forwarding method is characterized by comprising the following steps:
acquiring a forwarding node and a message to be forwarded;
forwarding the message to be forwarded through the forwarding node according to a preset forwarding strategy; the forwarding policy includes: for any message to be forwarded, directly forwarding the message on any forwarding node with a preset probability p, and delaying forwarding with the probability 1-p; wherein, the actual probability of the message to be forwarded which is delayed and forwarded in a preset time on any forwarding node obeys exponential distribution;
determining the actual probability of the message to be forwarded being forwarded within the preset time according to the forwarding strategy; the actual probabilities include:
wherein, Fn(t) is the actual probability that the message to be forwarded is forwarded within a preset time; n is the number of the forwarding sublinks; two forwarding nodes form one forwarding sublink; t is the preset time; i sequentially taking integers from 0 to n; λ is an exponential distribution parameter; gamma is Gamma distribution;
and if the actual probability is lower than the target probability, adjusting the forwarding strategy until the actual probability is not lower than the target probability.
2. The forwarding method of claim 1, wherein the adjusting the forwarding policy comprises:
adjusting the probability p of the direct forwarding.
3. The forwarding method of claim 1, wherein the adjusting the forwarding policy comprises:
adjusting a parameter λ of the exponential distribution.
4. A two-factor anonymous message network forwarding device, comprising:
the obtaining module is used for obtaining the forwarding node and the message to be forwarded;
the forwarding module is used for forwarding the message to be forwarded through the forwarding node according to a preset forwarding strategy; the forwarding policy includes: for any message to be forwarded, directly forwarding the message on any forwarding node with a preset probability p, and delaying forwarding with the probability 1-p; wherein, the actual probability of the message to be forwarded which is delayed and forwarded in a preset time on any forwarding node obeys exponential distribution;
the operation module is used for determining the actual probability of the message to be forwarded being forwarded within the preset time according to the forwarding strategy; the actual probabilities include:
wherein, Fn(t) is the actual probability that the message to be forwarded is forwarded within a preset time; n is the number of the forwarding sublinks; two forwarding nodes form one forwarding sublink; t is the preset time; i sequentially taking integers from 0 to n; λ is an exponential distribution parameter; gamma is Gamma distribution;
and the adjusting module is used for adjusting the forwarding strategy if the actual probability is lower than the target probability until the actual probability is not lower than the target probability.
5. The forwarding device of claim 4, wherein the adjusting module is specifically configured to:
adjusting the probability of the direct forwarding;
and/or the presence of a gas in the gas,
adjusting a parameter of the exponential distribution.
6. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1 to 3 when executing the program.
7. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010700730.8A CN111970246B (en) | 2020-07-20 | 2020-07-20 | Network forwarding method and device for two-factor anonymous message |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010700730.8A CN111970246B (en) | 2020-07-20 | 2020-07-20 | Network forwarding method and device for two-factor anonymous message |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111970246A CN111970246A (en) | 2020-11-20 |
| CN111970246B true CN111970246B (en) | 2021-08-03 |
Family
ID=73360834
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010700730.8A Active CN111970246B (en) | 2020-07-20 | 2020-07-20 | Network forwarding method and device for two-factor anonymous message |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111970246B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104125142A (en) * | 2014-06-20 | 2014-10-29 | 西安电子科技大学 | Anonymity level optional anonymous message exchange system and realization method thereof |
| CN105553827A (en) * | 2015-12-10 | 2016-05-04 | 北京理工大学 | Message forwarding method for giving consideration to both anonymity and communication delay in anonymous network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8533465B2 (en) * | 2008-03-05 | 2013-09-10 | The Johns Hopkins University | System and method of encrypting network address for anonymity and preventing data exfiltration |
-
2020
- 2020-07-20 CN CN202010700730.8A patent/CN111970246B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104125142A (en) * | 2014-06-20 | 2014-10-29 | 西安电子科技大学 | Anonymity level optional anonymous message exchange system and realization method thereof |
| CN105553827A (en) * | 2015-12-10 | 2016-05-04 | 北京理工大学 | Message forwarding method for giving consideration to both anonymity and communication delay in anonymous network |
Non-Patent Citations (2)
| Title |
|---|
| 《Toward a Comprehensive Insight Into the Eclipse Attacks of Tor Hidden Services》;Qingfeng Tan等;《IEEE INTERNET OF THINGS JOURNAL》;20190430;第6卷(第2期);1584-1593 * |
| 《匿名通信***中时间攻击模型研究》;吴艳辉等;《计算机工程与应用》;20051231(第23期);25，26,101 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111970246A (en) | 2020-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11626972B2 (en) | Data processing method and apparatus | |
| JP6675518B1 (en) | Method and device for processing a service request | |
| EP2998848B1 (en) | Method, device, and apparatus for controlling screen rotation | |
| US20200026691A1 (en) | Blockchain-based data processing method and device | |
| US9349000B2 (en) | Web service sandbox system | |
| US20210157799A1 (en) | Blockchain smart contract-based encoding/decoding methods and systems | |
| US11258586B2 (en) | Blockchain smart contract-based transaction hash acquisition methods and systems | |
| US20210152369A1 (en) | Blockchain smart contract-based signature verification methods and systems | |
| KR102010712B1 (en) | Distortion Correction Method and Terminal | |
| US10456688B2 (en) | Method of synchronizing online game, and server device | |
| CN111899097B (en) | Method and system for accepting blockchain certification transaction | |
| TW201643763A (en) | Authenticated control stacks | |
| CN114095427A (en) | Method and network card for processing data message | |
| JP5965464B2 (en) | NOC data processing method having no buffer and NOC electronic device | |
| US20210158344A1 (en) | Blockchain smart contract-based data processing | |
| US9641616B2 (en) | Self-steering point-to-point storage protocol | |
| CN111970246B (en) | Network forwarding method and device for two-factor anonymous message | |
| US10990444B2 (en) | Device and method for controlling data request | |
| KR102089629B1 (en) | Method for processing data and an electronic device thereof | |
| CN116933886A (en) | Quantum computing execution method, quantum computing execution system, electronic equipment and storage medium | |
| CN110020264B (en) | Method and device for determining invalid hyperlinks | |
| CN115454576B (en) | Virtual machine process management method and system and electronic equipment | |
| EP3872662A1 (en) | Methods and devices for executing trusted applications on processor with support for protected execution environments | |
| CN111585784B (en) | Network slice deployment method and device | |
| CN115361284B (en) | Deployment adjustment method of virtual network function based on SDN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |