A message distribution system for delay-tolerant networks

Abstract

The present invention discloses a message distribution system for a delay-tolerant network, wherein the system includes a sending node and a receiving node; the sending node is used to send message description information to the receiving node; the receiving node is used to determine the target message summary information in all the message summary information contained in the message description information and determine the information identifier corresponding to the target information identifier, and encrypt the target information identifier to obtain identifier encryption information, and send the identifier encryption information to the sending node; the sending node is used to encrypt each message information to obtain multiple encrypted messages, and generate decryption auxiliary information based on the identifier encryption information, and send all encrypted messages and decryption auxiliary information to the receiving node; the receiving node is used to receive the encrypted message and the decryption auxiliary information, and decrypt the encrypted message corresponding to the target information identifier based on the decryption auxiliary information to obtain the message information corresponding to the target information identifier. The above system can improve the privacy of delay-tolerant network communication.

Description

Technical Field

[0001] The present invention relates to the technical field of data identification, and in particular to a message distribution system of a delay-tolerant network. Background Art

[0002] Existing Delay Tolerant Networks (DTNs) have the characteristics of extended link time, frequent interruptions, and no stable end-to-end connection. Therefore, delay-tolerant networks mostly use the "store-carry-forward" mechanism to forward messages. In the process of selfish delay-tolerant network message distribution, each mobile node is selfish. When two mobile nodes meet, the receiving node will check the messages in the sending node's cache, and then select the messages that are of interest to itself and can bring benefits to receive. Furthermore, after the receiving node pays a certain reward such as virtual currency for the message it is ready to receive, the sending node sends the message to the receiving node.

[0003] Currently, when the sending nodes and receiving nodes in a delay-tolerant network are distributing messages, the receiving node will send the information identifiers of the messages it is interested in to the sending node, so that the sending node can know which messages the receiving node has selected, thereby enabling the sending node to know the interests and hobbies of the receiving node. However, the interest information of the node is often sensitive privacy information. Therefore, the existing delay-tolerant network communication is prone to cause the privacy information of the node to be leaked, resulting in low privacy of the existing delay-tolerant network communication. Summary of the invention

[0004] In view of this, the present application provides a message distribution system for a delay-tolerant network, the main purpose of which is to solve the technical problem of low privacy of existing delay-tolerant network communications.

[0005] According to a first aspect of the present invention, there is provided a message distribution system for a delay-tolerant network, the message distribution system for a delay-tolerant network comprising a sending node and a receiving node;

[0006] The sending node is used to send message description information to the receiving node, wherein the message description information includes message summary information and information identifier of each message information possessed by the sending node;

[0007] The receiving node is used to, in response to receiving the message description information, determine the target message summary information in all the message summary information, determine the information identifier of the message information corresponding to the target message summary information as the target information identifier, encrypt the target information identifier to obtain identifier encryption information, and send the message ticket information including the identifier encryption information to the sending node;

[0008] The sending node is used to, in response to receiving the message ticket information, encrypt each of the message information respectively to obtain multiple encrypted messages, and generate decryption auxiliary information for decrypting the encrypted message corresponding to the target information identifier based on the identifier encryption information, and send all the encrypted messages and the decryption auxiliary information to the receiving node;

[0009] The receiving node is used to receive the encrypted message and the decryption auxiliary information, and decrypt the encrypted message corresponding to the target information identifier based on the decryption auxiliary information to obtain the message information corresponding to the target information identifier.

[0010] In an optional embodiment, the receiving node is used to encrypt the target information identifier by using the following first formula to obtain the identifier encryption information:

[0011]

[0012] in, encrypting information for the identification, is the target information identifier, is a first encrypted random number generated for the target information identifier, is the public key of the message distribution system of the delay-tolerant network, and H1 is the first hash algorithm;

[0013] The sending node is used to encrypt the message information by using the following second formula to obtain the encrypted message:

[0014]

[0015] in, For the encrypted message, is the message information, is a bilinear mapping of the message distribution system of the delay-tolerant network, i is the information identifier, P is a generator of the message distribution system of the delay-tolerant network, is the private key of the sending node, x is the second encrypted random number generated by the sending node for the encrypted message, H1 is the first hash algorithm, and H2 is the second hash algorithm;

[0016] The sending node is used to generate the decryption auxiliary information by the following third formula:

[0017]

[0018] in, is the decryption auxiliary information, x is a second encrypted random number generated by the sending node for the encrypted message, encrypting information for the identifier;

[0019] The receiving node is used to decrypt the encrypted message by using the following fourth formula to obtain the message information corresponding to the target information identifier:

[0020]

[0021] in, is the decryption auxiliary information, is the multiplicative inverse element of the first encrypted random number, The message information corresponding to the target information identifier is an encrypted message corresponding to the target information identifier, is the public key of the sending node, is a bilinear mapping of the message distribution system of the delay-tolerant network, and H2 is a second hash algorithm.

[0022] In an optional embodiment, the message description information also includes the first signature information of the sending node; the message ticket information also includes the second signature information of the receiving node; the receiving node is also used to verify the first signature information in the received message description information in response to receiving the message description information, and after the first signature information passes the verification, determine the target message summary information in all the message summary information, and determine the information identifier of the message information corresponding to the target message summary information as the target information identifier, and encrypt the target information identifier to obtain the identifier encryption information, and send the message ticket information containing the identifier encryption information to the sending node; the sending node is also used to verify the second signature information in the message ticket information in response to receiving the message ticket information, and after the second signature information passes the verification, encrypt each of the message information respectively to obtain multiple encrypted messages, and generate decryption auxiliary information for decrypting the encrypted message corresponding to the target information identifier based on the identifier encryption information, and send all the encrypted messages and the decryption auxiliary information to the receiving node.

[0023] In an optional embodiment, the message distribution system of the delay-tolerant network also includes a trusted institution node; the message description information also includes the message value of each of the message information; the message ticket information also includes the identification number of the target information identification and the message value; the sending node is also used to send the message ticket information to the trusted institution node after receiving the message ticket information, so that the trusted institution node determines the message amount based on the identification number and the message value, and transfers the currency corresponding to the message amount from the node account of the receiving node to the node account of the sending node.

[0024] In an optional embodiment, after sending the message ticket information to the sending node, the receiving node is also used to determine whether the encrypted message and the decryption auxiliary information are received from the sending node. When the encrypted message and the decryption auxiliary information are not received from the sending node, the message description information and the message ticket information are sent to the trusted agency node; the trusted agency node is also used to determine whether the receiving node meets the message reception condition in response to receiving the message description information and the message ticket information from the receiving node. If the receiving node meets the message reception condition, the encrypted message and the decryption auxiliary information are obtained from the sending node, and the encrypted message and the decryption auxiliary information are sent to the receiving node.

[0025] In an optional embodiment, after the trusted institution node sends the encrypted message and the decryption auxiliary information to the receiving node, it is also used to determine the sending node as a potential malicious node and send the node identifier of the potential malicious node to a remote host computer.

[0026] In an optional embodiment, the way in which the trusted agency node determines whether the receiving node meets the message reception condition includes: the trusted agency node verifies the first signature information and the second signature information, and after the first signature information and the second signature information are all verified, determines whether the message ticket information is received from the sending node; when the trusted agency node receives the message ticket information from the sending node, determines that the receiving node meets the message reception condition; when the trusted agency node does not receive the message ticket information from the sending node, determines whether the sending node stores the message ticket information, and when the sending node stores the message ticket information, determines that the receiving node meets the message reception condition.

[0027] In an optional embodiment, the trusted institution node is also used to determine the message ticket information as invalid message ticket information when it is determined that the sending node does not store the message ticket information, so that the invalid message ticket information cannot circulate in the message distribution system of the delay-tolerant network.

[0028] In an optional embodiment, after the trusted institution node determines the message ticket information as the invalid message ticket information, it is also used to determine the receiving node as a potential malicious node and send the node identifier of the potential malicious node to a remote host computer.

[0029] In an optional embodiment, the trusted institution node is also used to deduct a preset amount of the currency from the node account of the receiving node and the node account of the sending node respectively after sending the encrypted message and the decryption auxiliary information to the receiving node, or after determining the message ticket information as invalid message ticket information.

[0030] The present invention provides a message distribution system for a delay-tolerant network. After determining the message information of interest, the receiving node will encrypt the target information identifier of the message information of interest to obtain the identifier encryption information, and send the message ticket information containing the identifier encryption information to the sending node. Further, after receiving the message ticket information, the sending node will encrypt each message information cached by itself respectively to obtain multiple encrypted messages, and generate decryption auxiliary information based on the identifier encryption information, wherein the decryption auxiliary information is used to decrypt the encrypted message obtained by encrypting the message information corresponding to the target information identifier. Further, the sending node sends all encrypted messages and decryption auxiliary information to the receiving node. Further, after receiving the encrypted message and decryption auxiliary information, the receiving node will decrypt the encrypted message corresponding to the target information identifier through the decryption auxiliary information to obtain the message information corresponding to the target information identifier. The technical solution provided by the present application, because the target information identifier sent by the receiving node to the sending node exists in the form of encrypted identifier encrypted information, the sending node will not know the target information identifier, and thus the sending node will not know the message information that the receiving node is interested in; at the same time, the sending node sends to the receiving node the encrypted messages corresponding to all the message information cached by it, as well as the decryption auxiliary information used to decrypt the encrypted messages that the receiving node is interested in, so that the receiving node can only decrypt the encrypted messages corresponding to the message information that it is interested in, and obtain the message information that it is interested in, thereby significantly improving the privacy of delay-tolerant network communications.

[0031] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the specific implementation methods of the present application are listed below. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of this application. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the drawings:

[0033] Figure 1 A schematic diagram showing the structure of a message distribution system for a delay-tolerant network provided by an embodiment of the present invention is shown;

[0034] Figure 2 A schematic diagram showing a flow chart of a message information distribution process between a sending node and a receiving node in a message distribution system of a delay-tolerant network provided by an embodiment of the present invention;

[0035] Figure 3 A schematic flow chart of a fairness mechanism established by a trusted institution node provided in an embodiment of the present invention is shown. DETAILED DESCRIPTION

[0036] The present invention will be described in detail below with reference to the accompanying drawings and in combination with embodiments. It should be noted that the embodiments and features in the embodiments of the present application can be combined with each other without conflict.

[0037] Currently, when the sending nodes and receiving nodes in a delay-tolerant network are distributing messages, the receiving node will send the information identifiers of the messages it is interested in to the sending node, so that the sending node can know which messages the receiving node has selected, thereby enabling the sending node to know the interests and hobbies of the receiving node. However, the interest information of the node is often sensitive privacy information. Therefore, the existing delay-tolerant network communication is prone to cause the privacy information of the node to be leaked, resulting in low privacy of the existing delay-tolerant network communication.

[0038] In view of the above problems, in one embodiment, Figure 1 As shown, a message distribution system of a delay-tolerant network is provided. The message distribution system of the delay-tolerant network is used for data communication through the delay-tolerant network as an example for explanation. The message distribution system of the delay-tolerant network includes multiple mobile nodes, and the mobile nodes can represent wireless mobile communication devices such as portable smart phones, handheld mobile devices, and laptop computers. Specifically, the message distribution system of the delay-tolerant network can also include a trusted institution node 100 and a wireless access point 500, wherein the wireless access point 500 (Access Point, AP) is a key device in a modern wireless network, which is responsible for providing wireless signals so that wireless mobile communication devices such as mobile nodes can access the Internet 400 as a fixed network, so that wireless communication can be carried out between the trusted institution node 100 and each mobile node connected to the Internet 400.

[0039] Further, the mobile node can act as a sending node 200 in the scenario of providing message information to the outside, and the mobile node can act as a receiving node 300 in the scenario of receiving message information. Whether the mobile node acts as a sending node 200 or a receiving node 300 can be determined according to actual conditions. The embodiment of the present application is described by taking one mobile node as a sending node 200 and another mobile node as a receiving node 300 as an example. Further, the mobile node will be interested in certain types of message information such as weather, traffic, sports, etc., and then exchange message information between the mobile nodes.

[0040] Furthermore, when the existing delay-tolerant network is established, the trusted institution node 100 will disclose multiple parameters, including q, G1, G2, ,P,P pub , , H1, H2, H3, and Enc(), where q is a large prime number of the message distribution system of the delay-tolerant network, G1 is the q-order additive group of the message distribution system of the delay-tolerant network, G2 is the q-order cyclic group of the message distribution system of the delay-tolerant network, is a bilinear mapping from G1×G1→G2, P is a generator of the message distribution system of the delay-tolerant network; further, P pub =sP is the system public key of the message distribution system of the delay-tolerant network, where the random number s∈ a master key for system confidentiality of a message distribution system for a delay-tolerant network; further, is the length of the message to be encrypted, Enc() is a symmetric encryption algorithm, H1, H2, and H3 are hash algorithms, where H1 is the first hash algorithm, which is used to map a string of any length into H2 is the second hash algorithm used to map the elements in G2 to an integer of length 0-1 string; H3 is the third hash algorithm, which is used to map a string of any length into an element in G1; H1: {0, 1} ∗ → , H2 , H3:{0,1} ∗ → ,in, is the integer multiplication cyclic group, whose order is q-1.

[0041] Furthermore, when a mobile node N a When registering the system, the trusted institution node 100 first generates a pseudo-random identifier set Pid a , pseudo-random identifier set Pid a ={Pid a 1 ,Pid a 2 , …Pid a n}, pseudo-random identifier Pid in the pseudo-random identifier set a =Enc s (N a ||R), where R is a random number; then the trusted institution node 100 is based on the pseudo-random identifier Pid a Generate mobile node N aThe public key PK a and private key SK a , where the public key PK a =H3(Pid a ), private key SK a =sPK a =sH3(Pid a ).

[0042] Furthermore, the sending node 200 is used to send message description information to the receiving node 300, wherein the message description information includes message summary information and information identifier of each message information possessed by the sending node 200; wherein the sending node 200 pre-records the message summary information of each message information, and the message summary information serves as a description of the message information. The receiving node 300 can learn about the type of the message information and other related information through the message summary information to determine whether the message information corresponding to the message summary information is the message information required by the receiving node 300.

[0043] Specifically, if the message information cached in the sending node 200 is m1, m2, ...m n , message information m1, m2…m n The message digest information is Digest1, Digest2…Digest n , then the information identifier of message information m1 is "1", the information identifier of message information m2 is "2", and the information identifier of message information m n When the sending node 200 meets the receiving node 300, the sending node 200 records the message summary information of each message information cached by the sending node 200 and the information identification of each message information into the message description information, and sends the message description information to the receiving node 300.

[0044] Furthermore, the receiving node 300 is used to determine the target message summary information in all the message summary information in response to receiving the message description information, and determine the information identifier of the message information corresponding to the target message summary information as the target information identifier, and encrypt the target information identifier to obtain the identifier encryption information, and send the message ticket information containing the identifier encryption information to the sending node 200.

[0045] Specifically, after receiving the message description information, the receiving node 300 can determine whether the message information corresponding to the message digest information is the message information required by the receiving node 300 itself based on the message digest information of each message information recorded in the message description information. For example, if the message digest information is Digest1, Digest2...Digest n, the receiving node 300 determines that the message information m1 corresponding to the message digest information Digest1 is the message information it needs, then the message digest information Digest1 can be determined as the target message digest information, the information identifier of the message information m1 corresponding to the target message digest information is "1", and the information identifier "1" is determined as the target information identifier. Here, the number of target message digest information determined by the receiving node 300 can be multiple, and the number of target information identifiers can also be multiple. Further, the target information identifier is encrypted by a hash algorithm or the like to obtain the identifier encryption information of the target information identifier, and the identifier encryption information is set in the message ticket information, and the message ticket information containing the identifier encryption information is sent to the sending node 200.

[0046] Further, the sending node 200 is used to encrypt each of the message information in response to receiving the message ticket information, obtain multiple encrypted messages, and generate decryption auxiliary information for decrypting the encrypted message corresponding to the target information identifier based on the identification encryption information, and send all the encrypted messages and the decryption auxiliary information to the receiving node 300. Here, one identification encryption information is used to generate one decryption auxiliary information, and the identification encryption information corresponds to the decryption auxiliary information one by one.

[0047] Specifically, after receiving the message ticket information, the sending node 200 encrypts all the message information cached by itself respectively to obtain the encrypted message corresponding to each message information. Furthermore, the sending node 200 generates decryption auxiliary information based on the identification encryption information in the message ticket information, wherein the decryption auxiliary information is used to decrypt the encrypted message corresponding to the identification encryption information to obtain the message information of the encrypted message. As an example. If the identification encryption information is obtained by encrypting the target information identifier "1", the decryption auxiliary information generated by the identification encryption information is used to decrypt the encrypted message encrypted by the message information m1 to obtain the message information m1. Conversely, the encrypted message encrypted by other message information cannot be decrypted by the decryption auxiliary information, so that the receiving node 300 cannot obtain other message information of the sending node 200.

[0048] Furthermore, the receiving node 300 is used to receive the encrypted message and the decryption auxiliary information, and decrypt the encrypted message corresponding to the target information identifier based on the decryption auxiliary information to obtain the message information corresponding to the target information identifier.

[0049] Specifically, the receiving node 300 may decrypt each encrypted message by decrypting the auxiliary information to obtain the message information with the target information identifier.

[0050] The present embodiment provides a message distribution system for a delay-tolerant network, in which a receiving node encrypts a target information identifier to obtain identifier encryption information, and sends the identifier encryption information to a sending node, so that the sending node does not know the target information identifier, and further, the sending node does not know the message information that the receiving node is interested in; at the same time, the sending node sends to the receiving node the encrypted messages of all message information cached by it, as well as decryption auxiliary information for decrypting the encrypted messages that the receiving node is interested in, so that the receiving node can only decrypt the encrypted messages corresponding to the message information that it is interested in, and obtain the message information that it is interested in, thereby significantly improving the privacy of delay-tolerant network communications.

[0051] In an optional embodiment, the receiving node is used to encrypt the target information identifier by using the following first formula (1) to obtain the identifier encryption information:

[0052] (1)

[0053] in, encrypting information for the identification, is the target information identifier, is a first encrypted random number generated for the target information identifier, is the public key of the message distribution system of the delay-tolerant network, and H1 is the first hash algorithm. Here, the receiving node generates a first encrypted random number for each target information identifier. . Further, is the public key of the message distribution system of the delay-tolerant network, For The parameters obtained by hashing the algorithm. is the serial number identifier. If the number of identifier encrypted information is k, the identifier encrypted information generated by the receiving node is , to .

[0054] Here, the identification encryption information in the message ticket information If the sending node wants to know the target information identifier To determine the target information identifier The corresponding message information needs to be encrypted by the identifier Solution The value of , however, is encrypted by the identifier Solution The value of is a difficult elliptic curve discrete logarithm problem, so the sending node cannot calculate The value of is a random number, so the sending node cannot calculate The value of , that is, the sending node cannot calculate the target information identifier selected by the receiving node ,Therefore, the privacy of the receiving node selection message is ,effectively protected.

[0055] Furthermore, the sending node is used to encrypt the message information by using the following second formula (2) to obtain the encrypted message:

[0056] (2)

[0057] in, For the encrypted message, is the message information, is a bilinear mapping of the message distribution system of the delay-tolerant network, i is the information identifier, P is a generator of the message distribution system of the delay-tolerant network, is the private key of the sending node, x is the second encrypted random number generated by the sending node for the encrypted message, H1 is the first hash algorithm, and H2 is the second hash algorithm; here, the second encrypted random number Here, if the number of message information is n, i=1 to n, and the message information is m1, m2 to m n , then the encrypted messages obtained by the sending node are c1, c2 to c n .

[0058] Furthermore, the sending node is used to generate the decryption auxiliary information by using the following third formula (3):

[0059] (3)

[0060] in, is the decryption auxiliary information, x is a second encrypted random number generated by the sending node for the encrypted message, encrypting information for the identification, Here, if the number of the encrypted identification information is k, then = 1 to k, the decryption auxiliary information generated by the sending node is , to .

[0061] Furthermore, the receiving node is used to decrypt the encrypted message by using the following fourth formula (4) to obtain the message information corresponding to the target information identifier:

[0062] (4)

[0063] in, is the decryption auxiliary information, is the multiplicative inverse element of the first encrypted random number, , is the target information identifier, The message information corresponding to the target information identifier is an encrypted message corresponding to the target information identifier, is the public key of the sending node, is a bilinear mapping of the message distribution system of the delay-tolerant network, and H2 is a second hash algorithm.

[0064] Further, the decryption process of the encrypted message is described. From the fourth formula (4), it can be seen that in order to decrypt the encrypted message, the message information corresponding to the encrypted message needs to satisfy the following fifth formula (5):

[0065] (5)

[0066] in, is a bilinear map of the message distribution system of the delay-tolerant network, is the public key of the sending node, is the decryption auxiliary information, is the multiplicative inverse element of the first encrypted random number, equal ; Further, by deducing the fifth formula (5), we can obtain the following sixth formula (6), seventh formula (7), eighth formula (8), ninth formula (9) and tenth formula (10):

[0067] (6)

[0068] (7)

[0069] (8)

[0070] (9)

[0071] (10)

[0072] Wherein, x is a second encrypted random number generated by the sending node for the encrypted message, =sP is the public key of the message distribution system of the delay-tolerant network, is the first hash algorithm, is the target information identifier, is the public key of the sending node, is the private key of the sending node, is the multiplicative inverse element of the first encrypted random number, is a first encrypted random number generated for the target information identifier, is a bilinear map of a message distribution system of the delay-tolerant network.

[0073] From the above formulas (6) to (10), it can be seen that in order to be able to decrypt the target information identifier through the fourth formula (4): Corresponding message information , the receiving node needs to know The value of, and the decryption auxiliary information sent by the sending node is = , = Therefore, the receiving node can decrypt the target information identifier by decrypting the auxiliary information and the fourth formula (4) Corresponding message information In contrast, the information sent by the sending node to the receiving node also includes other encrypted messages besides the encrypted message corresponding to the target information identifier, such as the encrypted message (i is not equal to ), if the receiving node needs to decrypt the information identifier Corresponding message information , the receiving node needs to know The value of , and at this time because the information identifier i is not the target information identifier Therefore, the receiving node does not obtain the decryption auxiliary information corresponding to the information identifier i, and it is difficult for the receiving node to solve the value of the second encrypted random number x, so the receiving node cannot determine , so that the receiving node can only decrypt the target information identifier Corresponding message information , and other message information cannot be decrypted.

[0074] In the embodiments provided by the present application, the target information identifier sent by the receiving node to the sending node exists in the form of encrypted identifier encrypted information, so that the sending node will not know the target information identifier, and further the sending node will not know the message information that the receiving node is interested in; at the same time, since the receiving node can only decrypt the encrypted message corresponding to the message information that it is interested in, it can only obtain the message information that it is interested in, thereby significantly improving the privacy of delay-tolerant network communications.

[0075] In an optional embodiment, the message description information further includes first signature information of the sending node; wherein the first signature information is calculated as follows:

[0076] First, the sending node obtains its own pseudo-random identifier, the receiving node's pseudo-random identifier, the message summary information of each message information of the sending node, the message value of each message information, and the timestamp of the current moment. For example, the pseudo-random identifier of the sending node is Pid a , the pseudo-random identifier of the receiving node is Pid b The message digest information of each message information of the sending node is Digest1, Digest2...Digest n , the message value of the message information is Value, and the timestamp of the current moment is t1. Here, the pseudo-random identifier of the sending node, the pseudo-random identifier of the receiving node, the message summary information of each message information of the sending node, the message value of each message information, and the timestamp of the current moment can be set to the message description information and sent to the receiving node together.

[0077] Here, the first signature information It can be calculated by the following eleventh formula (11), twelfth formula (12) and thirteenth formula (13):

[0078] Here, the first signature information is calculated by the eleventh formula (11): :

[0079] (11)

[0080] Here, The first signature information is the first target point on the elliptic curve converted when the signature is encrypted. is the second target point on the elliptic curve.

[0081] Furthermore, the first target point is determined by the twelfth formula (12):

[0082] (12)

[0083] Where P is the generator of the message distribution system of the delay-tolerant network, A third random number chosen by the sending node, is the first target point, where the third random number , are the first target points in the above elliptic curve The horizontal and vertical coordinates of the corresponding points.

[0084] Furthermore, the second target point on the above elliptic curve is determined by the thirteenth formula (13):

[0085] (13)

[0086] in, is the second target point, H1 is the first hash algorithm, is the third random number selected by the sending node, P is the generator of the message distribution system of the delay-tolerant network, SK a is the private key of the sending node, is the first target point in the above elliptic curve The horizontal coordinate of the corresponding point; further, is the first encryption parameter. Here, the first encryption parameter Equal to Pid a ‖Pid b ‖Value‖Digest1, Digest2…Digest n ‖t1.

[0087] Furthermore, the receiving node is also used to verify the first signature information in the received message description information in response to receiving the message description information, and after the first signature information passes the verification, determine the target message summary information in all the message summary information, and determine the information identifier of the message information corresponding to the target message summary information as the target information identifier, encrypt the target information identifier to obtain the identifier encryption information, and send the message ticket information containing the identifier encryption information to the sending node.

[0088] Specifically, the receiving node can obtain the public key PK of the sending node in advance. a , combined with the following fourteenth formula (14), the first signature information in the received message description information is verified:

[0089] (14)

[0090] in, is the first target point, is the second target point, H1 is the first hash algorithm, P is the generator of the message distribution system of the delay-tolerant network, is the public key of the sending node, is the first target point in the above elliptic curve The horizontal coordinate of the corresponding point, is a bilinear map of the message distribution system in a delay-tolerant network, P pub The system public key of the message distribution system of the delay-tolerant network, is the first encryption parameter. Here, as long as the receiving node passes the public key PK of the sending node a And the first signature information , so that the fourteenth formula (14) can be established, the first signature information can be verified efficient.

[0091] Specifically, the first signature information The verification process is as follows: the fifteenth formula (15) can be obtained from the twelfth formula (12) and the thirteenth formula (13), and the fifteenth formula (15) can be deduced to obtain the sixteenth formula (16). Further, the sixteenth formula (16) can be deduced to obtain the seventeenth formula (17). Further, at this time = , the fourteenth formula (14) can be derived from the seventeenth formula (17), and the first signature information can be verified at this time efficient:

[0092] (15)

[0093] (16)

[0094] (17)

[0095] in, A third random number chosen by the sending node, is the first target point, is the second target point, H1 is the first hash algorithm, P is the generator of the message distribution system of the delay-tolerant network, SK is the public key of the sending node. a is the private key of the sending node, is the first target point in the above elliptic curve The horizontal coordinate of the corresponding point, is a bilinear map of the message distribution system in a delay-tolerant network, P pub= sP is the system public key of the message distribution system of the delay-tolerant network, is the first encryption parameter.

[0096] On the contrary, if we cannot use the fifteenth formula (15) and the public key PK of the sending node a And the first signature information The fourteenth formula (14) is derived, then the first signature information Invalid, at this time, the receiving node stops executing the message information receiving process.

[0097] Further, the message ticket information includes the second signature information of the receiving node; wherein the second signature information is determined as follows:

[0098] First, the receiving node obtains its own pseudo-random identifier and the sending node's pseudo-random identifier, each identifier encryption information, the message value of each message information, and the timestamp when the receiving node receives the message description information. For example, the sending node's pseudo-random identifier is Pida , the pseudo-random identifier of the receiving node is Pid b , each identifier encryption information is V1, V2…V k , the message value of the message information is Value, and the timestamp when the receiving node receives the message description information is t2.

[0099] Here, the second signature information It is calculated by the following twelfth formula (12), eighteenth formula (18) and nineteenth formula (19).

[0100] Here, the second signature information is calculated by the eighteenth formula (18): :

[0101] (18)

[0102] Here, The second signature information is the first target point on the elliptic curve converted when the signature is encrypted. is the second target point on the above elliptic curve.

[0103] Furthermore, the first target point is determined by the twelfth formula (12):

[0104] (12)

[0105] Where P is the generator of the message distribution system of the delay-tolerant network, A third random number chosen by the sending node, is the first target point, where the third random number , are the first target points in the above elliptic curve The horizontal and vertical coordinates of the corresponding points.

[0106] Furthermore, the second target point on the elliptic curve is determined by the nineteenth formula (19):

[0107] (19)

[0108] in, is the second target point on the elliptic curve, H1 is the first hash algorithm, is the third random number selected by the sending node, P is the generator of the message distribution system of the delay-tolerant network, is the private key of the receiving node; further, is the second encryption parameter, is the first target point in the above elliptic curve The horizontal coordinate of the corresponding point, here, the second encryption parameter Equal to Pida ‖Pid b ‖Value‖V1, V2…V k ‖t2.

[0109] Furthermore, the sending node is also used to verify the second signature information in the message ticket information in response to receiving the message ticket information, and after the second signature information passes the verification, encrypt each of the message information separately to obtain multiple encrypted messages, and generate decryption auxiliary information for decrypting the encrypted message corresponding to the target information identifier based on the identification encryption information, and send all the encrypted messages and the decryption auxiliary information to the receiving node.

[0110] Specifically, the sending node can obtain the public key PK of the receiving node in advance. b , combined with the following twentieth formula (20), the second signature information in the received message ticket information is verified:

[0111] (20)

[0112] in, is the first target point, is the second target point, H1 is the first hash algorithm, P is the generator of the message distribution system of the delay-tolerant network, P pub The system public key of the message distribution system of the delay-tolerant network, is the first target point in the above elliptic curve The horizontal coordinate of the corresponding point, PK b is the public key of the receiving node, is a bilinear map for message distribution systems in delay-tolerant networks, is the second encryption parameter. Here, the second signature information The verification method can refer to the first signature information The verification method is not described here.

[0113] Here, if the second signature information If invalid, the sending node stops executing the message information interaction process.

[0114] In the embodiments provided by the present application, the sending node and the receiving node can respectively verify each other, and only when the verification is passed will the subsequent message information interaction process be executed, thereby ensuring the security of the message distribution system of the delay-tolerant network.

[0115] In an optional embodiment, if Figure 1 As shown, the message distribution system of the delay-tolerant network further includes a trusted institution node 100 .

[0116] Further, the message description information also includes a message value of each of the message information; here, each message information cached in the sending node 200 has a preset message value, and the value of the message value can be determined according to actual conditions. When the sending node 200 sends the message description information to the receiving node 300, the message value of each message information can be set in the message description information and sent to the receiving node 300.

[0117] Furthermore, the message ticket information also includes the identification number of the target information identifier and the message value; here, after the receiving node 300 obtains the message value from the sending node 200, it can set the message value and the identification number in the message ticket information so that the message ticket information sent to the sending node 200 has the message value and the identification number.

[0118] Furthermore, the sending node 200 is also used to send the message ticket information to the trusted institution node 100 after receiving the message ticket information, so that the trusted institution node 100 determines the message amount based on the identification quantity and the message value, and transfers the currency corresponding to the message amount from the node account of the receiving node 300 to the node account of the sending node 200.

[0119] Here, the receiving node 300 and the sending node 200 respectively have node accounts, and the node accounts may contain currency for settling message information. When the receiving node 300 obtains message information from the sending node 200, it needs to pay currency equivalent to the message value of the message information.

[0120] Specifically, after obtaining the message ticket information from the sending node 200, the trusted institution node 100 can extract the message value and the identification quantity from the message ticket information. The trusted institution node 100 can determine the message amount by multiplying the message value by the identification quantity, and transfer the currency corresponding to the message amount from the node account of the receiving node 300 to the node account of the sending node 200.

[0121] The embodiments provided in the present application enable each mobile node of the message distribution system of the delay-tolerant network to have the function of monetary settlement, so as to realize the normal flow of message information and improve the functionality of the message distribution system of the delay-tolerant network.

[0122] Further, combined with Figure 2 The message distribution process between the sending node and the receiving node in the message distribution system of the delay-tolerant network is described as follows:

[0123] S201. After the sending node meets the receiving node, the sending node uses the first timestamp, the message summary information and information identifier of each message information cached by the sending node, the message value of each message information, the first signature information of the sending node, the pseudo-random identifier of the sending node and the pseudo-random identifier of the receiving node as message description information.

[0124] The first timestamp is the timestamp when the sending node generates the message description information.

[0125] S202: The sending node sends the message description information to the receiving node.

[0126] S203: The receiving node verifies the first signature information in the received message description information.

[0127] S204. After verifying the first signature information, the receiving node determines the target message summary information in all the message summary information, and determines the information identifier of the message information corresponding to the target message summary information as the target information identifier, and encrypts the target information identifier to obtain the identifier encrypted information, and uses the second signature information of the receiving node, the second timestamp, each identifier encrypted information, the message value, the pseudo-random identifier of the sending node, and the pseudo-random identifier of the receiving node as the message ticket information.

[0128] The second timestamp is the timestamp when the receiving node receives the message description information.

[0129] S205: The receiving node sends the message ticket information to the sending node.

[0130] S206. The sending node verifies the second signature information in the received message ticket information.

[0131] S207. After the sending node verifies the second signature information, it encrypts each message information respectively to obtain multiple encrypted messages, and generates decryption auxiliary information for decrypting the encrypted message corresponding to the target information identifier based on the identifier encryption information.

[0132] S208: The sending node sends each encrypted message and decryption auxiliary information to the receiving node.

[0133] S209: The receiving node receives the encrypted message and the decryption auxiliary information, and decrypts the encrypted message corresponding to the target information identifier based on the decryption auxiliary information to obtain the message information corresponding to the target information identifier.

[0134] Furthermore, there may be malicious nodes in the message distribution system of the delay-tolerant network, which may perform some malicious behaviors to obtain their own interests, such as not sending the message information required by the receiving node, thereby causing unfair message transactions.

[0135] In view of the above problem, in an optional embodiment, after the receiving node sends the message ticket information to the sending node, it is also used to determine whether the encrypted message and the decryption auxiliary information are received from the sending node. Here, after the receiving node sends the message ticket information to the sending node, it can be determined in real time whether the sending node provides the encrypted message and the decryption auxiliary information to the receiving node.

[0136] Furthermore, when the receiving node determines that it has not received the encrypted message and decryption auxiliary information from the sending node, the message description information and the message ticket information are sent to the trusted agency node; here, if the receiving node has not received the encrypted message and decryption auxiliary information from the sending node within a preset time interval after sending the message ticket information to the sending node, the message ticket information and the message description information obtained from the sending node can be sent to the trusted agency node.

[0137] Furthermore, the trusted institution node is also used to determine whether the receiving node meets the message reception condition in response to receiving the message description information and the message ticket information from the receiving node.

[0138] Here, the step of the trusted institution node determining whether the receiving node meets the message receiving condition includes:

[0139] First, the trusted agency node verifies the first signature information and the second signature information, and after the first signature information and the second signature information are all verified, determines whether the message ticket information is received from the sending node; here, the way in which the trusted agency node verifies the first signature information is the same as the way in which the receiving node verifies the first signature information, which is not repeated here. Similarly, the way in which the trusted agency node verifies the second signature information is the same as the way in which the sending node verifies the second signature information, which is not repeated here.

[0140] Further, after the trusted institution node verifies the first signature information and the second signature information, it determines whether the trusted institution node itself receives message ticket information from the sending node, and the message ticket information is the same as the message ticket information sent by the receiving node to the sending node. Conversely, if the first signature information or the second signature information is not verified, the subsequent steps are not executed.

[0141] Furthermore, when the trusted institution node receives the message ticket information from the sending node, it is determined that the sending node has redeemed the message ticket information, and further determines that the receiving node meets the message receiving condition.

[0142] In addition, when the trusted institution node does not receive the message ticket information from the sending node, it is determined whether the sending node stores the message ticket information, that is, whether the sending node obtains the message ticket information from the receiving node. Further, when the sending node stores the message ticket information, it is determined that the receiving node meets the message reception condition.

[0143] Furthermore, if the receiving node meets the message receiving condition, the trusted institution node obtains the encrypted message and the decryption auxiliary information from the sending node, and sends the encrypted message and the decryption auxiliary information to the receiving node. Specifically, the trusted institution node can control the sending node to encrypt each message information separately to obtain multiple encrypted messages, and generate decryption auxiliary information for decrypting the encrypted message corresponding to the target information identifier based on the identifier encryption information, and send all encrypted messages and the decryption auxiliary information to the trusted institution node. Subsequently, the trusted institution node can exchange currency for the sending node.

[0144] The embodiments provided in the present application can prevent the situation where the receiving node cannot obtain the message information it needs from the sending node after paying the corresponding fee for the message, thereby establishing a fair mechanism for the exchange of message information.

[0145] In an optional embodiment, after the trusted institution node sends the encrypted message and the decryption auxiliary information to the receiving node, it is also used to determine the sending node as a potential malicious node, and send the node identification of the potential malicious node to a remote host computer. Specifically, after the trusted institution node obtains the encrypted message and the decryption auxiliary information from the sending node and forwards the encrypted message and the decryption auxiliary information to the receiving node, it also determines the sending node as a potential malicious node and sends the node identification of the potential malicious node to a remote host computer, wherein the node identification of the potential malicious node is information for identifying the identity of the mobile node, and the host computer can be a remote server for managing the message distribution system of the delay-tolerant network. Relevant staff can learn from the host computer that nodes with potential malicious behavior may appear in the system, and pay special attention to the node during the subsequent operation of the system.

[0146] The embodiments provided by the present application can monitor behaviors that undermine fairness in the system. When a node that may have performed malicious behavior is detected in the system, the node can be recorded and examined in subsequent processes to determine whether the node is a malicious node, thereby ensuring the fairness of the message distribution system of the delay-tolerant network.

[0147] Furthermore, malicious behaviors that may exist in the message distribution system of the delay-tolerant network also include the behavior of the receiving node maliciously requesting message information from the trusted institution node when it is not qualified to obtain the message information from the sending node. The specific behavior includes the receiving node forging message description information and message ticket information without sending message ticket information to the sending node, and sending the forged message description information and message ticket information to the trusted institution node, so that the trusted institution node mistakenly obtains the encrypted message and decryption auxiliary information from the sending node, and sends the encrypted message and decryption auxiliary information to the receiving node, so that the receiving node illegally obtains the message information.

[0148] In view of the above problem, in an optional embodiment, the trusted institution node is also used to determine whether the receiving node can legally obtain the message information by determining whether the trusted institution node has obtained the message ticket information from the sending node when judging whether the receiving node meets the message receiving condition. In this case, it can be determined whether the sending node has the message ticket information by determining whether the sending node stores the message ticket information.

[0149] Furthermore, when the trusted institution node determines that the sending node does not store the message ticket information, it determines the message ticket information as invalid message ticket information, so that the invalid message ticket information cannot be circulated in the message distribution system of the delay-tolerant network, and the invalid message ticket information cannot be redeemed.

[0150] Furthermore, after the trusted institution node determines the message ticket information as the invalidated message ticket information, it is also used to determine the receiving node as a potential malicious node, and send the node identification of the potential malicious node to a remote host computer. Specifically, the trusted institution node can determine the receiving node that sends the invalidated message ticket information to the trusted institution node as a potential malicious node, and send the node identification of the potential malicious node to a remote host computer.

[0151] The embodiments provided in the present application can identify receiving nodes that may have performed malicious behavior, record the node, and focus on the node in the subsequent process to determine whether the node is a malicious node, so as to ensure the transaction security and fairness of the message distribution system of the delay-tolerant network.

[0152] In an optional embodiment, the trusted institution node is further configured to deduct a preset amount of the currency from the node account of the receiving node and the node account of the sending node respectively after sending the encrypted message and the decryption auxiliary information to the receiving node, or after determining the message ticket information as invalid message ticket information. The amount of the preset amount can be determined according to actual conditions.

[0153] Specifically, when the trusted institution node judges whether the receiving node meets the message receiving conditions, after determining that the receiving node meets the message receiving conditions and sending the message information to the receiving node, a preset amount of currency is deducted from the node account of the receiving node and the node account of the sending node as an arbitration fee; at the same time, when the trusted institution node judges whether the receiving node meets the message receiving conditions, after determining that the sending node denies having the message ticket information, a preset amount of currency is deducted from the node account of the receiving node and the node account of the sending node as an arbitration fee.

[0154] The embodiment provided by the present application, through the fairness mechanism established by the trusted institution node, can ensure that any malicious behavior of any node will lead to a reduction in the node's own revenue, so that the fairness mechanism can prevent the sending node from refusing to send messages and the receiving node from illegally obtaining messages, thereby ensuring the fairness of transactions between the two nodes.

[0155] Further, based on Figure 3 The process of establishing a fair mechanism for trusted institution nodes is described below:

[0156] S301. In response to receiving message description information and message ticket information from a receiving node, the trusted institution node verifies the first signature information in the message description information and the second signature information in the message ticket information, and determines whether the first signature information and the second signature information are all verified.

[0157] Here, the trusted institution node can verify the first signature information and the second signature information respectively. If the first signature information or the second signature information fails to pass the verification, the execution of this security mechanism is stopped.

[0158] S302: After the first signature information and the second signature information are all verified by the trusted institution node, the trusted institution node determines whether the message ticket information is received from the sending node.

[0159] Here, when the trusted institution node receives the message ticket information from the sending node, it can determine that the sending node has redeemed the message ticket information.

[0160] S303. When the trusted institution node receives the message ticket information from the sending node, it obtains the encrypted message and decryption auxiliary information from the sending node.

[0161] S304: After receiving the encrypted message and the decryption auxiliary information from the sending node, the trusted institution node sends the encrypted message and the decryption auxiliary information to the receiving node, and deducts a preset amount of currency from the node account of the receiving node and the node account of the sending node, respectively. Here, the currency can be virtual currency, digital currency or electronic currency.

[0162] S305: When the trusted institution node does not receive the message ticket information from the sending node, the trusted institution node determines whether the sending node has the message ticket information.

[0163] S306. When the sending node has the message ticket information, the trusted institution node obtains the encrypted message and decryption auxiliary information from the sending node, and sends the encrypted message and decryption auxiliary information to the receiving node, and transfers a specific amount of currency from the node account of the receiving node to the node account of the sending node.

[0164] Here, the trusted institution node can determine a specific amount that the receiving node should pay to the sending node based on the identification number in the message ticket information and the message value.

[0165] S307. The trusted institution node deducts a preset amount of currency from the node account of the receiving node and the node account of the sending node respectively.

[0166] S308. When the sending node does not have the message ticket information, the trusted institution node determines the message ticket information obtained from the receiving node as invalid message ticket information, and deducts a preset amount of currency from the node account of the receiving node and the node account of the sending node respectively.

[0167] Here, the trusted institution node stops executing this security mechanism.

[0168] The message distribution system of a delay-tolerant network provided by the present invention can prevent the sending node from knowing the message information specifically selected by the receiving node, so as to protect the privacy of the receiving node, and by setting a fairness mechanism, prevent the sending node from refusing to send message information and the receiving node from illegally obtaining message information, thereby ensuring the privacy and fairness of the message distribution system of the delay-tolerant network at the same time.

[0169] The above serial numbers of this application are only for description and do not represent the advantages and disadvantages of the implementation scenarios. The above disclosure is only a few specific implementation scenarios of this application, but this application is not limited to them, and any changes that can be thought of by technicians in this field should fall within the scope of protection of this application.

Claims

1. A message distribution system for a delay-tolerant network, characterized in that: The message distribution system of the delay-tolerant network includes a sending node and a receiving node; The sending node is used to send message description information to the receiving node, wherein the message description information includes message summary information and information identifier of each message information possessed by the sending node; The receiving node is used to, in response to receiving the message description information, determine the target message summary information in all the message summary information, determine the information identifier of the message information corresponding to the target message summary information as the target information identifier, encrypt the target information identifier to obtain identifier encryption information, and send the message ticket information including the identifier encryption information to the sending node; The sending node is used to, in response to receiving the message ticket information, encrypt each of the message information respectively to obtain multiple encrypted messages, and generate decryption auxiliary information for decrypting the encrypted message corresponding to the target information identifier based on the identifier encryption information, and send all the encrypted messages and the decryption auxiliary information to the receiving node; The receiving node is used to receive the encrypted message and the decryption auxiliary information, and decrypt the encrypted message corresponding to the target information identifier based on the decryption auxiliary information to obtain the message information corresponding to the target information identifier.

2. The message distribution system for a delay-tolerant network according to claim 1, characterized in that: The receiving node is used to encrypt the target information identifier by using the following first formula (1) to obtain the identifier encryption information: （1） in, encrypting information for the identification, is the target information identifier, is a first encrypted random number generated for the target information identifier, is the public key of the message distribution system of the delay-tolerant network, and H1 is the first hash algorithm; The sending node is used to encrypt the message information by using the following second formula (2) to obtain the encrypted message: （2） in, For the encrypted message, is the message information, is a bilinear mapping of the message distribution system of the delay-tolerant network, i is the information identifier, P is a generator of the message distribution system of the delay-tolerant network, is the private key of the sending node, x is the second encrypted random number generated by the sending node for the encrypted message, H1 is the first hash algorithm, and H2 is the second hash algorithm; The sending node is used to generate the decryption auxiliary information by using the following third formula (3): （3） in, is the decryption auxiliary information, x is a second encrypted random number generated by the sending node for the encrypted message, encrypting information for the identifier; The receiving node is used to decrypt the encrypted message by using the following fourth formula (4) to obtain the message information corresponding to the target information identifier: （4） in, is the decryption auxiliary information, is the multiplicative inverse element of the first encrypted random number, The message information corresponding to the target information identifier is an encrypted message corresponding to the target information identifier, is the public key of the sending node, is a bilinear mapping of the message distribution system of the delay-tolerant network, and H2 is a second hash algorithm.

3. The message distribution system for a delay-tolerant network according to claim 1, characterized in that: The message description information also includes the first signature information of the sending node; the message ticket information also includes the second signature information of the receiving node; The receiving node is further configured to verify the first signature information in the received message description information in response to receiving the message description information, determine the target message digest information in all the message digest information after the first signature information passes the verification, determine the information identifier of the message information corresponding to the target message digest information as the target information identifier, encrypt the target information identifier to obtain identifier encryption information, and send the message ticket information including the identifier encryption information to the sending node; The sending node is also used to verify the second signature information in the message ticket information in response to receiving the message ticket information, and after the second signature information passes the verification, encrypt each of the message information separately to obtain multiple encrypted messages, and generate decryption auxiliary information for decrypting the encrypted message corresponding to the target information identifier based on the identification encryption information, and send all the encrypted messages and the decryption auxiliary information to the receiving node.

4. The message distribution system for a delay-tolerant network according to claim 3, characterized in that: The message distribution system of the delay-tolerant network also includes a trusted institution node; The message description information also includes the message value of each message information; The message ticket information also includes the identification number of the target information identification and the message value; The sending node is also used to send the message ticket information to the trusted institution node after receiving the message ticket information, so that the trusted institution node determines the message amount based on the identification quantity and the message value, and transfers the currency corresponding to the message amount from the node account of the receiving node to the node account of the sending node.

5. The message distribution system for a delay-tolerant network according to claim 4, characterized in that: After sending the message ticket information to the sending node, the receiving node is further used to determine whether the encrypted message and the decryption auxiliary information are received from the sending node, and when the encrypted message and the decryption auxiliary information are not received from the sending node, send the message description information and the message ticket information to the trusted institution node; The trusted agency node is also used to determine whether the receiving node meets the message reception conditions in response to receiving the message description information and the message ticket information from the receiving node. If the receiving node meets the message reception conditions, the encrypted message and the decryption auxiliary information are obtained from the sending node, and the encrypted message and the decryption auxiliary information are sent to the receiving node.

6. The message distribution system for a delay-tolerant network according to claim 5, characterized in that: After the trusted institution node sends the encrypted message and the decryption auxiliary information to the receiving node, the trusted institution node is further used to determine the sending node as a potential malicious node and send the node identification of the potential malicious node to a remote host computer.

7. The message distribution system for a delay-tolerant network according to claim 5, characterized in that: The manner in which the trusted institution node determines whether the receiving node meets the message receiving condition includes: The trusted institution node verifies the first signature information and the second signature information, and after the first signature information and the second signature information are all verified, determines whether the message ticket information is received from the sending node; When the trusted institution node receives the message ticket information from the sending node, determining that the receiving node satisfies the message receiving condition; When the trusted institution node does not receive the message ticket information from the sending node, it determines whether the sending node stores the message ticket information. When the sending node stores the message ticket information, it determines that the receiving node meets the message reception condition.

8. The message distribution system for a delay-tolerant network according to claim 7, characterized in that: The trusted institution node is further configured to determine the message ticket information as invalid message ticket information when it is determined that the sending node does not store the message ticket information, so that the invalid message ticket information cannot circulate in the message distribution system of the delay-tolerant network.

9. The message distribution system for a delay-tolerant network according to claim 8, characterized in that: After the trusted institution node determines the message ticket information as the invalidated message ticket information, it is further used to determine the receiving node as a potential malicious node and send the node identifier of the potential malicious node to a remote host computer.

10. The message distribution system of delay-tolerant network according to claim 8, characterized in that: The trusted institution node is also used to deduct a preset amount of the currency from the node account of the receiving node and the node account of the sending node respectively after sending the encrypted message and the decryption auxiliary information to the receiving node, or after determining the message ticket information as invalid message ticket information.

Images