CN115361151A - Anonymous multi-path communication method based on redundant coding - Google Patents
Anonymous multi-path communication method based on redundant coding Download PDFInfo
- Publication number
- CN115361151A CN115361151A CN202210656702.XA CN202210656702A CN115361151A CN 115361151 A CN115361151 A CN 115361151A CN 202210656702 A CN202210656702 A CN 202210656702A CN 115361151 A CN115361151 A CN 115361151A
- Authority
- CN
- China
- Prior art keywords
- data
- matrix
- coding
- control center
- coefficient matrix
- 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.)
- Granted
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Signal Processing (AREA)
- General Engineering & Computer Science (AREA)
- Computational Mathematics (AREA)
- Computing Systems (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computer Security & Cryptography (AREA)
- Pure & Applied Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to the technical field of network security communication, in particular to an anonymous multi-path communication method based on redundant coding, which comprises the steps that a control center initializes communication participants; the control center randomly generates integers within 256, combines the integers into a coding coefficient matrix, sends the coding coefficient matrix to a sender/communicator, and sends the fragments out along different anonymous channels after the communicator segments all data; after receiving, the receiver converges the fragments, requests the control center for the coding matrix, and recovers the original data after decoding. The anonymous multi-path communication method based on the redundant coding solves the safety problem of data transmission and can improve the reliability of information transmission at the same time.
Description
Technical Field
The invention relates to the technical field of network security communication, in particular to an anonymous multi-path communication method based on redundant coding.
Background
Nowadays, anti-anonymity technologies such as network monitoring, traffic identification and the like are mature, which brings a serious threat to anonymous communication. For the transmission of sensitive data, the correspondent not only wants to make the two parties anonymous, but also wants to make the data transmitted securely and efficiently. In existing mature anonymous communication systems, such as I2P and Tor, although anonymous protection on correspondents and communication relationships is achieved on the basis of content encryption-based communication technologies.
But communication information/content is still threatened by security when transmitted in a special network formed by specially-built nodes. For example, the communication information is intercepted and intercepted by an attacker in the communication process, so that the communication content falls into the attacker, and sensitive information is stolen.
Disclosure of Invention
The present invention is directed to an anonymous multi-path communication method based on redundant coding to solve the above-mentioned problems of the background art.
In order to achieve the purpose, the invention provides the following technical scheme: the anonymous multi-path communication method based on the redundant coding comprises the following steps:
s1: when a communication participant joins a communication network and initiates communication, the identity of the communication participant needs to be registered with a control center, and the control center carries out initialization processing on the communication participant.
S2: the control center randomly generates a string (K) of integers within 256, combines the integers into a coding coefficient matrix, and sends the coding coefficient matrix to a sender/communicator, the sender/communicator generates redundant data by coding communication content through redundancy, packages the redundant data, segments all data (including original data and redundant data), generates N fragments, generates a fragment set to be sent, and sends the fragments out along different anonymous channels after a series of processing.
S3: the receiving party receives the fragments from each channel, performs the convergence and check of the fragments, requests the coding matrix from the control center, and recovers the original data after decoding.
Preferably, the control center in S1 is a server, and the initialization processing in S1 includes:
1): the sender reads all binary data.
2): each binary data is converted to a corresponding decimal identifier, each decimal being less than 256.
3): the number of data identified in decimal notation is calculated and is denoted as K.
4): the number K is transmitted to the control center to inform the coding coefficient matrix size.
Preferably, the step S2 of generating the coding coefficient matrix by the control center includes:
1): and the control center randomly generates an integer with K smaller than 256 according to the number K transmitted by the sender.
2): firstly, the coding coefficient matrix is composed of 2 x K rows and K columns, the first K rows of the matrix are composed of unit matrixes, and the last K rows of the matrix are composed of cyclic matrixes.
3): and (3) definition of a circulant matrix: all elements are determined by the first row of elements, each row of elements being followed by a shift of one bit backwards from the last element of the previous row.
4): in order to make any sub-square of the final circulant matrix reversible, the maximum number of rows of the circulant matrix is equal to the number of columns, i.e., the maximum number of rows is K rows.
5): the final coding coefficient matrix is composed of an identity matrix and a self-defined cyclic matrix and then is transmitted to a transmitting side for data redundancy coding.
Preferably, the data coding redundancy performed by the sender in S2 includes:
1): and the sender receives the coding coefficient matrix and multiplies the original data by the coding coefficient matrix.
2): the raw data is a matrix of K rows and 1 column, noted as: m K，1 。
3): the coding coefficient matrix is a matrix of 2 x K rows and K columns, denoted as: EM 2K，K 。
4): redundancy algorithm: e 2K，1 ＝EM 2K，K *M K，1 。
5): after the redundancy is performed, data which is twice as much as the original data is generated, and the data comprises the original data and the redundant data.
Preferably, the data slicing performed by the sender in S2 includes:
1): after data redundancy is performed, a list with 2 × k integers is generated, and then fragmentation is performed as required according to current network requirements.
2): after fragmentation, data is sent through different anonymous channels, and in the transmission process, due to monitoring and interception of an attacker and the state of a network, a certain number of data packets are lost, and when the data packets finally reach a receiving party, the number of the data packets may be less than 2 x K.
Preferably, the receiving side in S3 receives and decodes the data packet, and the decoding includes:
1): and the data packets are transmitted from different anonymous channels and finally converged to a receiver.
2): when all data is received, the receiver checks to see if there are enough packets to decode.
3): if the number of the received data packets is less than K, decoding cannot be carried out, wherein the decoding condition is that the lower limit of the number of the received data packets is K; at this moment, the receiver will tell the control center that "the data loss is serious, not enough to recover the original data"; after receiving the information sent by the receiver, the control center informs the sender of 'retransmitting data', redefines the coding coefficient, and simultaneously adjusts the redundancy of a transmission channel and data coding, thereby increasing the safety and reliability of transmission.
4): if the number of the received data packets is more than K, the control center requests the coding coefficient matrix to the control center, and the control center can judge whether the user is a legal user of the network according to the request of the receiving party, namely whether identity registration and authentication are carried out, and if the user is the legal user of the network, the corresponding coding coefficient matrix is found out and sent to the receiving party.
5): after receiving the coding coefficient matrix, the receiving side extracts the corresponding coding coefficient (row vector) from the coding coefficient matrix according to the serial number mark (the serial number mark is equivalent to the array subscript) of the received data packet and according to the serial number mark.
6): the receiver forms a matrix with the extracted coding coefficients, then calculates the inverse matrix of the matrix, namely the decoding matrix, forms a matrix with the received data packets, performs matrix multiplication operation with the decoding matrix, finally converts the obtained matrix into a list, and converts the decimal data in the list into binary data, namely the original data sent by the sender.
Preferably, when the communication is ended, the method comprises the following steps:
1): when the original data is successfully decoded, the receiver informs the control center that the decoding is successful, the original data of the communication is obtained, and the communication can be ended.
2): at this time, the control center receives the request of 'communication success and communication end' from the receiver, and the control center deletes the coding coefficient and the registration identity data of the sender and the receiver.
3): after the data deletion is completed, the sender and the receiver are notified of "communication is successful, session is ended".
Compared with the prior art, the invention has the beneficial effects that:
the anonymous multi-path communication method based on the redundant coding can well solve the safety problem of data transmission and improve the reliability of information transmission at the same time.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a schematic overall flow diagram of the present invention;
FIG. 2 is a schematic diagram of an embodiment of the present invention;
FIG. 3 is a schematic diagram of a redundant coding matrix algorithm of the present invention;
FIG. 4 is a schematic diagram of a decoding operation matrix algorithm according to the present invention;
fig. 5 is a schematic diagram of data fragmentation according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the present invention, unless otherwise explicitly stated or limited, the terms "mounted," "connected," "fixed," and the like are to be construed broadly, e.g., as being permanently connected, detachably connected, or integral; can be mechanically or electrically connected; either directly or indirectly through intervening media, either internally or in any other relationship. The specific meanings of the above terms in the present invention can be understood according to specific situations by those of ordinary skill in the art.
Referring to fig. 1-5, the present invention provides a technical solution: the anonymous multi-path communication method based on the redundant coding comprises the following steps:
s1: when a communication participant joins a communication network and initiates communication, the communication participant needs to register identity with a control center, and the control center carries out initialization processing on the communication participant.
S2: the control center randomly generates a string (K) of integers within 256, combines the integers into a coding coefficient matrix, and sends the coding coefficient matrix to a sender/communicator, the sender/communicator generates redundant data by coding and redundancy communication content, packages the redundant data, divides all data (including original data and redundant data), generates N fragments, generates a series of processing fragments to be sent, and sends the fragments out along different anonymous channels.
The control center is a server, and the initialization processing in S1 comprises the following steps:
1): a sender reads all binary data; 2): converting each binary data into a corresponding decimal identifier, each decimal being less than 256; 3): calculating the quantity of data taking decimal system as identification, and recording the quantity as K; 4): the number K is transmitted to the control center to inform the coding coefficient matrix size.
The step S2 of producing the coding coefficient matrix by the control center comprises the following steps:
1): the control center randomly generates an integer with K less than 256 according to the number K transmitted by the sender; 2): firstly, a coding coefficient matrix consists of 2 x K rows and K columns, the first K rows of the matrix consist of unit matrixes, and the last K rows of the matrix consist of cyclic matrixes; 3): and (3) definition of a circulant matrix: determining all elements from the first row of elements, each row of elements being immediately followed by a shift of one bit backwards from the last element of the previous row; 4): in order to make any sub square matrix of the final circulation matrix reversible, the maximum row number of the circulation matrix is equal to the column number, namely the maximum row number is K rows; 5): the final coding coefficient matrix is composed of an identity matrix and a self-defined cyclic matrix and then is transmitted to a transmitting side for data redundancy coding.
In S2, the transmitting side performs data coding redundancy, including:
1): the sender receives the coding coefficient matrix and multiplies the original data by the coding coefficient matrix; 2): the raw data is a matrix of K rows and 1 column, noted as: m is a group of K，1 (ii) a 3): the coding coefficient matrix is a matrix of 2 × K rows and K columns, and is denoted as: EM 2K，K (ii) a 4): redundancy algorithm: e 2K，1 ＝EM 2K，K *M K，1 (ii) a 5): after the redundancy is performed, data which is twice as much as the original data is generated, and the data comprises the original data and the redundant data.
S2, the data slicing is carried out by the sender, and the method comprises the following steps:
1): after data redundancy is carried out, a list with 2 x K integers is generated, and then fragmentation is carried out according to the current network requirement and needs; 2): after the data is fragmented, the data is sent through different anonymous channels, in the transmission process, due to monitoring and interception of an attacker and the state of a network, a certain number of data packets are lost, and when the data packets finally reach a receiving party, the number of the data packets may be less than 2 x K.
And S3, the receiving party receives and decodes the data packet, and the decoding comprises the following steps:
1): the data packets are transmitted from different anonymous channels and finally converged to a receiver; 2): when receiving all data, the receiver checks whether enough data packets can be decoded; 3): if the number of the received data packets is less than K, decoding cannot be carried out, wherein the decoding condition is that the lower limit of the number of the received data packets is K; at this time, the receiver will inform the control center that "data loss is serious and not enough to recover the original data"; after receiving the information sent by the receiver, the control center informs the sender of 'retransmitting data', redefines the coding coefficient, and simultaneously adjusts the redundancy of a transmission channel and data coding, thereby increasing the safety and reliability of transmission; 4): if the number of the received data packets is more than K, the control center requests the coding coefficient matrix to the control center, and the control center can judge whether the user is a legal user of the network according to the request of the receiving party, namely whether identity registration and authentication are carried out, and if the user is the legal user of the network, the corresponding coding coefficient matrix is found out and sent to the receiving party; 5): after receiving the coding coefficient matrix, the receiving party extracts the corresponding coding coefficient (row vector) in the coding coefficient matrix according to the serial number mark (the serial number mark is equivalent to the array subscript) of the received data packet and the serial number mark; 6): the receiver forms a matrix by the extracted coding coefficients, then calculates the inverse matrix of the matrix, namely a decoding matrix, forms a matrix by the received data packets, performs matrix multiplication operation with the decoding matrix, converts the obtained matrix into a list, and converts the decimal data in the list into binary data, namely the original data sent by the sender.
When the communication is finished, the method comprises the following steps:
1): when the original data is successfully decoded, the receiver informs the control center that the decoding is successful, the original data of communication is obtained, and the communication can be finished; 2): at the moment, the control center receives a request of 'successful communication and end of communication' sent by a receiver, and the control center deletes the coding coefficient and the registration identity data of the sender and the receiver; 3): after the data deletion is completed, the sender and the receiver are notified of "communication is successful, session is ended".
The overall implementation process of the method according to the embodiment of the present invention is described in detail below by taking the flowchart shown in fig. 1 as an example, and as shown in fig. 1, the method includes the following steps:
step S101: the two communication parties register, and before the two parties establish communication, an identity registration request needs to be submitted to the control center.
Step S102: and (3) feeding back registration information, after checking the uniqueness of the mailbox, the control center distributes an Identity (ID) consisting of 8 decimal numbers, authority to the requesting user, generates an RSA public key/private key pair and an access node ID, simultaneously sends a notification message to the e-mail of the requester, notifies the user ID and downloads a public key file, a private key file and the ID of the access node from a specified URL.
Step S103, S104: and packing communication contents, and packing original data into a file of binary data by a sender of information.
Step S105: and data type conversion, namely packaging the communication content, and converting each binary data into a corresponding decimal identifier to form a string of decimal data. In the following redundancy fragmentation is performed using this string of decimal identities.
Step S106: and receiving the coding coefficient matrix, and after the control center determines that the identities of the two communication parties are registered, receiving the original quantity K sent by the sender, and then generating a matrix with 2 x K rows and K columns. The first K rows of the matrix are identity matrices and the last K rows are formed by circulant matrices. And after the coding coefficient matrix is generated, the matrix is sent to a sending party for redundancy operation.
Step S107: and data redundancy, wherein after receiving the coding coefficient matrix sent by the control center, the sender performs redundancy operation on the data, and according to a redundancy operation rule: e 2K，1 ＝EM 2K，K *M K，1 Finally, 2 × k data are generated.
Step S108: and (2) data fragmentation, namely, after data redundancy is carried out by a sender, fragmenting according to the current transmission requirement, for example, if the data is transmitted through five anonymous channels, randomly dividing the data into 5 pieces, then respectively transmitting in the five channels, and finally summarizing at a receiver.
Step S109: and checking the data packets, wherein the data is transmitted through different anonymous channels after being subjected to redundancy and fragmentation and then being encrypted by a data file, and finally reaches a receiver, the receiver checks the data packets from different anonymous channels after receiving the data packets, and whether the data packets come from the communicated data packets is confirmed according to the identification (namely the fragment identification CID) of each data packet.
The receiver then continuously retrieves and verifies the received packet identification CID and counts the number of packets from the communication.
Finally, whether the number of the received data packets is enough to decode and restore the original data packets is checked. If the number of the received data packets is not enough to restore the original data packets, the control center is informed to consider to reselect the anonymous channel and inform the sender that the data needs to be retransmitted; (after receiving the information sent by the receiver, the control center informs the sender of 'retransmitting data', redefining the coding coefficient, adjusting the redundancy of the transmission channel and the data coding and increasing the safety and reliability of transmission.)
Step S110: and requesting the coding coefficient matrix, and requesting the control center to transmit the coding coefficient matrix after the receiver checks the data packets and confirms that the number of the received data packets can be enough to restore the original data. The receiving side selects K (K is recorded as the number of original data) data according to the received data, and then selects the corresponding coding coefficient row vectors of the K data in the coding coefficient matrix to form a square matrix.
Step S111: restoring data, and according to a decoding operation rule: m K，1 ＝DM K，K *R K，1 . And DM represents a decoding matrix, wherein the decoding matrix is an inverse matrix of a square matrix formed by encoding coefficient row vectors corresponding to K data packets in the received data packets. And decoding and restoring the original data packet according to the decoding operation rule.
Step S112: and informing the control center that: after the receiver decodes and restores the original data packet, the receiver informs the control center that: the control center informs the sender after receiving the information sent by the receiver.
Step S113: deleting the communication data: and after the communication is finished, the control center clears the communication sub-streams and deletes the communication data, including the identity information, the coding coefficient, the data exchange file, the communication sub-stream information and the like of the two communication parties.
The meaning of each formula parameter in the specification is shown in the following table:
| K | number of original packets |
| M K，1 | Original data packet matrix |
| EM 2K，K | Coding coefficient matrix |
| E 2K，1 | Redundant data matrix |
| R K，1 | Square matrix formed by K data packets in received data packets |
| DM K，K | Decoding matrix |
The meaning of each parameter in the attached figure 3 of the specification is as follows: the first K rows are an identity matrix. The elements in the last K rows are all determined according to the elements in the K +1 th row (specifically, the elements are introduced in the generation of coding coefficients in the control center), the elements in the K +1 th row are randomly generated positive integers, so Ek +1,1 is a positive integer, mk is a data packet marked by decimal manufacture, and Ek is all data packets marked by decimal manufacture and subjected to redundant coding.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. The term "comprising", without further limitation, means that the element so defined is not excluded from the group consisting of additional identical elements in the process, method, article, or apparatus that comprises the element.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (6)
1. The anonymous multi-path communication method based on redundant coding is characterized by comprising the following steps:
s1: when a communication participant joins a communication network and initiates communication, the communication participant needs to register identity with a control center, and the control center carries out initialization processing on the communication participant;
s2: the control center randomly generates a string of K integers within 256, combines the K integers into a coding coefficient matrix, and sends the coding coefficient matrix to a sender/communicator, the sender/communicator generates redundant data by coding and redundantly the communication content, packages the redundant data, segments all the original data and the redundant data, generates N fragments, generates a fragment set to be sent, processes the fragment set to be sent in a series, and sends the fragments out along different anonymous channels;
s3: the receiving party receives the fragments from each channel, performs the convergence and check of the fragments, requests the coding matrix from the control center, and recovers the original data after decoding.
2. The anonymous multi-path communication method based on redundant coding as set forth in claim 1, wherein: the control center in S1 is a server, and the initialization processing in S1 includes:
1): a sender reads all binary data;
2): converting each binary data into a corresponding decimal identifier, each decimal being less than 256;
3): calculating the quantity of data taking decimal system as identification, and recording the quantity as K;
4): the number K is transmitted to the control center to inform the coding coefficient matrix size.
3. The anonymous multi-path communication method based on redundant coding as set forth in claim 1, wherein: the step of producing the coding coefficient matrix by the control center in the step S2 comprises the following steps:
1): the control center randomly generates an integer with K less than 256 according to the number K transmitted by the sender;
2): firstly, a coding coefficient matrix is composed of 2 x K rows and K columns, the front K rows of the matrix are composed of unit matrixes, and the rear K rows of the matrix are composed of cyclic matrixes;
3): and (3) definition of a circulant matrix: determining all elements from the first row of elements, each row of elements being immediately followed by a shift of one bit backwards from the last element of the previous row;
4): in order to make any sub square matrix of the final circulation matrix reversible, the maximum row number of the circulation matrix is equal to the column number, namely the maximum row number is K rows;
5): the final coding coefficient matrix is composed of an identity matrix and a self-defined cyclic matrix and then is transmitted to a transmitting side for data redundancy coding.
4. The anonymous multi-path communication method based on redundant coding as set forth in claim 1, wherein: the transmitting side performs data coding redundancy in the S2, including:
1): the sender receives the coding coefficient matrix and multiplies the original data by the coding coefficient matrix;
2): the original data is a matrix with K rows and 1 column;
3): the coding coefficient matrix is a matrix of 2 x K rows and K columns;
4): after the redundancy is performed, data which is twice as much as the original data is generated, and the data comprises the original data and the redundant data.
5. The anonymous multi-path communication method based on redundant coding of claim 1, wherein: the data slicing performed by the sender in S2 includes:
1): after data redundancy is carried out, a list with 2 x K integers is generated, and then fragmentation is carried out according to the current network requirement and needs;
2): after fragmentation, data is sent through different anonymous channels, and in the transmission process, due to monitoring and interception of an attacker and the state of a network, a certain number of data packets are lost, and when the data packets finally reach a receiving party, the number of the data packets may be less than 2 x K.
6. The anonymous multi-path communication method based on redundant coding of claim 1, wherein: the receiving side in S3 receives and decodes the data packet, including:
1): the data packets are transmitted from different anonymous channels and finally converged to a receiver;
2): when receiving all data, the receiver checks whether enough data packets can be decoded;
3): if the number of the received data packets is less than K, decoding cannot be carried out;
4): if the number of the received data packets is more than K, requesting a coding coefficient matrix from the control center, finding out a corresponding coding coefficient matrix by the control center, and sending the coding coefficient matrix to a receiving party;
5): and after receiving the coding coefficient matrix, the receiving party extracts a corresponding coding coefficient row vector from the coding coefficient matrix according to the serial number mark.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210656702.XA CN115361151B (en) | 2022-06-11 | 2022-06-11 | Anonymous multi-path communication method based on redundant coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210656702.XA CN115361151B (en) | 2022-06-11 | 2022-06-11 | Anonymous multi-path communication method based on redundant coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115361151A true CN115361151A (en) | 2022-11-18 |
| CN115361151B CN115361151B (en) | 2023-08-04 |
Family
ID=84030090
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210656702.XA Active CN115361151B (en) | 2022-06-11 | 2022-06-11 | Anonymous multi-path communication method based on redundant coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115361151B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118075289A (en) * | 2024-02-20 | 2024-05-24 | 北京冀银科技有限公司 | Financial information transmission method and financial information transmission system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103810061A (en) * | 2014-01-28 | 2014-05-21 | 河南科技大学 | High-availability cloud storage method |
| US10491329B1 (en) * | 2016-12-08 | 2019-11-26 | Amazon Technologies, Inc. | Transfer of data-redundancy encoded data via unreliable, connectionless protocol |
| CN110649989A (en) * | 2019-08-16 | 2020-01-03 | 中科边缘智慧信息科技（苏州）有限公司 | Stable and reliable data transmission method under maneuvering edge network environment |
| CN112468599A (en) * | 2021-01-25 | 2021-03-09 | 广州大学 | Anonymous communication method, system and equipment based on Internet file storage service |
| CN113364559A (en) * | 2021-06-30 | 2021-09-07 | 清华大学 | Multipath-oriented data secure transmission method, device and system |
-
2022
- 2022-06-11 CN CN202210656702.XA patent/CN115361151B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103810061A (en) * | 2014-01-28 | 2014-05-21 | 河南科技大学 | High-availability cloud storage method |
| US10491329B1 (en) * | 2016-12-08 | 2019-11-26 | Amazon Technologies, Inc. | Transfer of data-redundancy encoded data via unreliable, connectionless protocol |
| CN110649989A (en) * | 2019-08-16 | 2020-01-03 | 中科边缘智慧信息科技（苏州）有限公司 | Stable and reliable data transmission method under maneuvering edge network environment |
| CN112468599A (en) * | 2021-01-25 | 2021-03-09 | 广州大学 | Anonymous communication method, system and equipment based on Internet file storage service |
| CN113364559A (en) * | 2021-06-30 | 2021-09-07 | 清华大学 | Multipath-oriented data secure transmission method, device and system |
Non-Patent Citations (3)
| Title |
|---|
| YUYANG ZHANG ET AL.: "《BNNC: Improving Performance of Multipath Transmission in Heterogeneous Vehicular Networks》", 《IEEE ACCESS》 * |
| ZHIHAN TAN ET AL.: "《A Data Encoding Method for Multipath Anonymous Transmission》", 《2022 7TH IEEE INTERNATIONAL CONFERENCE ON DATA SCIENCE IN CYBERSPACE(DSC)》 * |
| 杨康等: "基于改进网络编码的匿名通信机制研究", 《计算机应用研究》, no. 01 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118075289A (en) * | 2024-02-20 | 2024-05-24 | 北京冀银科技有限公司 | Financial information transmission method and financial information transmission system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115361151B (en) | 2023-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7382762B2 (en) | Method and system for distributed certificate management in ad-hoc networks | |
| US5161244A (en) | Cryptographic system based on information difference | |
| Park et al. | Efficient multicast stream authentication using erasure codes | |
| Aumann et al. | Authentication, enhanced security and error correcting codes | |
| US20030063751A1 (en) | Key agreement protocol based on network dynamics | |
| Oggier et al. | An authentication code against pollution attacks in network coding | |
| JP5877623B2 (en) | Transmission terminal, reception terminal, and information distribution system | |
| Hussain et al. | Security enhancement for video transmission via noise aggregation in immersive systems | |
| Jeon et al. | Cross-layer encryption of CFB-AES-TURBO for advanced satellite data transmission security | |
| CN115361151A (en) | Anonymous multi-path communication method based on redundant coding | |
| Safavi-Naini et al. | Error-correcting codes for authentication and subliminal channels | |
| RU2295199C1 (en) | Method for generation of encryption/decryption key | |
| CN114465733A (en) | Secure network coding method based on improved RSA | |
| JP4231926B2 (en) | Quantum key distribution method and communication apparatus | |
| Chen et al. | Identity-based conference key broadcast schemes with user authentication | |
| CN116634421B (en) | High-security mobile phone communication method | |
| Deng et al. | Novel approach to secure broadcast in distributed systems | |
| WO2003026197A2 (en) | A key agreement protocol based on network dynamics | |
| Wang et al. | Achieving secure transmission using feedback-based LT code with degree distribution updated | |
| Buttyán et al. | Pollution attack defense for coding based sensor storage | |
| Deng et al. | Lightweight One-Time Signature for multicast authentication | |
| Hemenway et al. | Public key encryption which is simultaneously a locally-decodable error-correcting code | |
| Yang et al. | RFC 9426: BATched Sparse (BATS) Coding Scheme for Multi-hop Data Transport | |
| MaoJane et al. | Anonymous and dynamic conference-key distribution system | |
| Zhang et al. | Homomorphic mac-based scheme against pollution attacks in network coding |
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 |