One-way channel transmission method based on threshold secret sharing mechanism

Abstract

The invention provides a one-way channel transmission method based on a threshold secret sharing mechanism, and the method comprises the steps: carrying out the preprocessing of to-be-transmitted original data, and obtaining the preprocessing data; determining a threshold parameter of secret sharing according to the current channel quality parameter; performing data division on the preprocessed data through a threshold secret sharing algorithm to obtain data fragments; independently sending the data fragments, and determining receiving stopping conditions of the data fragments according to the threshold parameters; and performing data recombination on the data fragments through a Lagrange interpolation method to obtain output data. According to the method, a threshold secret sharing mechanism is applied to data transmission of the one-way channel, and redundant parameters are dynamically adjusted, so that the problems of data recovery, packet loss tolerance and data security in the one-way channel are solved, the reliability and the security of data transmission are improved, the transmission delay and the bandwidth consumption are reduced, and the data transmission efficiency is improved. The method is especially suitable for a complex network environment with high packet loss and high time delay in modern communication.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of channel transmission, in particular to a one-way channel transmission method based on a threshold secret sharing mechanism. BACKGROUND

[0002] In current Internet of Things, satellite communication and other scenarios, the communication channel is usually one-way and unreliable, with problems such as data packet loss, high delay, unstable bandwidth, etc. However, the existing mainstream solutions have obvious defects: (1) TCP protocol has high reliability, but frequent retransmission in high packet loss or high delay channel will cause delay to soar; (2) traditional UDP protocol is simple and fast, but does not guarantee the reliability of data transmission, and the receiving end may receive incomplete data or some data may not arrive at all. (3) Forward error correction (FEC) tolerates a small amount of packet loss by adding redundant data, but its redundancy is fixed and cannot flexibly respond to dynamically changing network environments. When the packet loss rate exceeds the design threshold, the entire data block cannot be recovered. FEC only solves reliability and does not provide any data confidentiality protection; (4) traditional encryption transmission first encrypts the data and then transmits it using the above mechanisms. Although this solves the security problem, it does not improve the transmission efficiency. Security and reliability are two separate and superimposed processes, and the system overhead is large. SUMMARY

[0003] The purpose of the present application is to provide a one-way channel transmission method based on a threshold secret sharing mechanism, which applies the threshold secret sharing mechanism to data transmission in a one-way channel and combines dynamic adjustment of redundancy parameters to solve data recovery, packet loss tolerance and data security problems in a one-way channel.

[0004] To achieve the above purpose, the present application provides the following solutions: A one-way channel transmission method based on a threshold secret sharing mechanism, comprising the following steps: Preprocessing the original data to be transmitted to obtain preprocessed data; Determining the threshold parameter of secret sharing according to the current channel quality parameter; Dividing and processing the preprocessed data by a threshold secret sharing algorithm to obtain data fragments; Independently sending the data fragments and determining the stop receiving condition of the data fragments according to the threshold parameter; Recombining the data fragments by Lagrange interpolation method to obtain output data.

[0005] Optionally, preprocessing the original data to be transmitted to obtain preprocessed data, comprising: Dividing the original data into data blocks of a fixed size; Numbering the data blocks to obtain preprocessed data.

[0006] Optionally, the threshold parameter of the secret sharing is determined according to the current channel quality parameter, comprising: determining the current channel quality parameter; the current channel quality parameter comprises: a historical packet loss rate, a normalized jitter and a normalized bandwidth; unifying mapping the current channel quality parameter to obtain a channel quality evaluation function; obtaining the channel quality according to the channel quality evaluation function, and determining the redundancy ratio according to the interval of the channel quality; jointly constraining the redundancy ratio to obtain the threshold parameter.

[0007] Optionally, the expression of the channel quality evaluation function is: ; wherein, the historical packet loss rate is, the normalized jitter is, the normalized bandwidth is, , and are weighting coefficients.

[0008] Optionally, the channel quality is obtained according to the channel quality evaluation function, and the redundancy ratio is determined according to the interval of the channel quality, comprising: when the channel quality is <0.25, the redundancy ratio is ≥40%; when 0.25<channel quality<0.50, the redundancy ratio ranges from 20% to 30%; when 0.50<channel quality<0.75, the redundancy ratio ranges from 10% to 20%; when 0.75<channel quality, the redundancy ratio ranges from 5% to 10%.

[0009] Optionally, the constraint condition of the joint constraint comprises: the total number of data fragments < the minimum number of fragments required to recover the original data; the total number of data fragments does not exceed the maximum number of fragments allowed by the bandwidth and the time delay window; the minimum number of fragments required to recover the original data is not less than the minimum number of fragments required for data security recovery; the fragment size of the data fragment is kept within the protocol allowed range.

[0010] Optionally, the preprocessed data is processed by a threshold secret sharing algorithm to obtain data fragments, comprising: constructing a random polynomial in a finite field by taking the preprocessed data as a "secret value"; the expression of the random polynomial is: ; obtaining mutually independent data fragments by evaluating the random polynomial at different points; the data fragments comprise a fragment number and a fragment data value.

[0011] Optionally, the expression of the Lagrange interpolation method comprises: , ; wherein, is a data shard, is an argument of the received data shard, is a Lagrange polynomial, is an argument of other data shards.

[0012] According to the specific embodiments provided by the present application, the following technical effects are disclosed: the one-way channel transmission method based on the threshold secret sharing mechanism provided by the present application, the method comprises: preprocessing the original data to be transmitted to obtain preprocessed data; determining the threshold parameter of secret sharing according to the current channel quality parameter; performing data division processing on the preprocessed data through a threshold secret sharing algorithm to obtain data shards; independently sending the data shards, and determining the stop receiving condition of the data shards according to the threshold parameter; and performing data recombination on the data shards through a Lagrange interpolation method to obtain output data. The method applies the threshold secret sharing mechanism to the data transmission of the one-way channel, and combines the dynamic adjustment of the redundancy parameter, effectively solves the problems of data recovery, packet tolerance and data security in the one-way channel, not only improves the reliability and security of data transmission, but also reduces the delay and bandwidth consumption of transmission, and is especially suitable for the complex network environment of high packet loss and high delay faced in modern communication. BRIEF DESCRIPTION OF DRAWINGS

[0013] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the drawings needed in the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0014] Figure 1 The flowchart of the one-way channel transmission method based on the threshold secret sharing mechanism of the embodiments of the present application. DETAILED DESCRIPTION

[0015] The technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only some embodiments of the present application, not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor are within the scope of protection of the present application.

[0016] In order to make the above-mentioned purposes, features and advantages of the present application more apparent and easy to understand, the present application will be further described in detail below with reference to the drawings and specific embodiments.

[0017] As Figure 1As shown, this invention provides a one-way channel transmission method based on a threshold secret sharing mechanism, comprising the following steps: Step 100: Preprocess the raw data to be transmitted to obtain preprocessed data; Step 200: Determine the threshold parameters for secret sharing based on the current channel quality parameters; Step 300: Perform data partitioning on the preprocessed data using a threshold secret sharing algorithm to obtain data fragments; Step 400: Send the data fragments independently and determine the stop receiving conditions for each data fragment based on the threshold parameters; Step 500: Reassemble the data fragments using Lagrange interpolation to obtain the output data.

[0018] Specifically, in step 100, when the sending end receives the raw data to be transmitted, it first preprocesses the data. The raw data can be a file, a data packet, or a continuous data stream. During preprocessing, the raw data is divided into fixed-size data blocks (e.g., 512KB or 1MB). Each data block is numbered to ensure accurate reconstruction during transmission and reception. This data partitioning ensures that delays caused by large data blocks are avoided during transmission.

[0019] Preferably, the threshold parameter for secret sharing is determined based on the current channel quality parameters, including: Determine the current channel quality parameters; the current channel quality parameters include: historical packet loss rate, normalized jitter, and normalized bandwidth. The current channel quality parameters are mapped uniformly to obtain the channel quality evaluation function; The channel quality is obtained based on the channel quality assessment function, and the redundancy ratio is determined based on the channel quality range. By applying joint constraints to the redundancy ratio, the threshold parameter is obtained.

[0020] In the specific implementation process, the sender in step 200 determines the threshold parameters (N, K) of secret sharing according to the current channel quality parameters (including but not limited to historical packet loss rate, delay jitter, bandwidth situation, etc.). Here, N represents the total number of generated data shards, K represents the minimum number of shards required to recover the original data, and K < N is satisfied. When the channel quality is poor, the redundancy (N - K) between N and K is increased to improve the packet loss resistance ability; when the channel quality is good, the redundancy is reduced to lower the system overhead. Specifically, in the scenario of a one-way channel, the sender cannot rely on real-time confirmation and feedback, so the channel quality is evaluated by using the locally available information of the sender or historical statistics. Among them, the historical packet loss rate: Based on the statistics of data shards arriving within the historical sending window, the results of offline link tests, or the statistical information periodically sent back by the receiver, it is expressed as a probability value between 0 and 1. Normalized jitter: Equals the difference between the maximum delay and the minimum delay divided by the maximum jitter, reflecting the channel stability and used to judge whether the shard arrival time is highly discrete. Normalized bandwidth: Equals the available bandwidth divided by the maximum bandwidth, representing the amount of data allowed to be sent per unit time and determining the upper limit of N to prevent link congestion caused by excessive redundancy. And the above parameters are uniformly mapped to the channel quality evaluation function, and the expression is: ; where, is the historical packet loss rate, is the normalized jitter, is the normalized bandwidth, , and are the weighting coefficients of the three parameters. The specific values should be designed according to the actual situation to ensure that + + = 1. is the weight of the packet loss rate, reflecting the impact degree of packet loss on the channel quality. Usually, the packet loss rate has a greater impact on the channel quality and may have a higher weight; is the weight of the delay jitter, reflecting the impact of delay fluctuation on the transmission quality, and is adjusted according to the requirements of the actual scenario; is the weight of the bandwidth, reflecting the impact degree of bandwidth on the channel quality. Bandwidth is very important in a high-bandwidth network, so the weight may be higher.

[0021] Then, according to the interval of Q, the redundancy ratio α = (N - K) / N is directly set, and the specific setting rules are shown in Table 1.

[0022] Table 1 Setting Rules Table

[0023] Among them, the channel quality Q represents the quality of the current network channel, and its value range is from 0 to 1. 0 represents the worst channel quality, and 1 represents the best channel quality. The redundancy ratio α = (N - K) / N improves the packet loss resistance by increasing the number of data shards. When Q is low, more redundant shards are needed to ensure reliable data transmission. When the channel quality is good, the redundancy ratio can be lower to reduce unnecessary overhead. The relationship between the redundancy ratio and the channel quality assessment is set based on typical values of historical packet loss rate, normalized jitter, and normalized bandwidth. The specific redundancy ratio may change according to real-time network conditions. Therefore, corresponding adjustments need to be made according to the current network environment (such as real-time packet loss rate, delay fluctuation, and bandwidth situation) during actual use.

[0024] Meanwhile, to ensure system stability and feasibility, joint constraints are imposed on N and K. The rules of the constraint conditions include: K < N; N does not exceed the maximum number of shards allowed by the bandwidth and delay window; K is not lower than the data security threshold, that is, not lower than the minimum number of shards required for data security recovery; the shard size remains within the range allowed by the protocol.

[0025] Preferably, in step 300, the sender adopts the Shamir threshold secret sharing algorithm. That is, the data block in step 100 is used as the "secret value", a random polynomial of degree K - 1 is constructed within a finite field, and the original data block is used as the constant term of the polynomial. Subsequently, by evaluating the polynomial, N independent data shards are generated, and each shard contains the shard number i and the shard data value respectively. Each shard data value should only contain the results of the polynomial at different independent variable values. Any fewer than K data shards cannot recover or deduce the original data, which ensures data confidentiality at the algorithm level.

[0026] It should be noted that the Shamir threshold secret sharing algorithm is a cryptographic algorithm based on polynomial interpolation. Its core idea is to associate the original data "secret" with multiple data shards within a finite field. The specific steps are as follows: Let the original data be S, and a random polynomial of degree K - 1 is generated , where P(0) is the original data S. Then, the polynomial P(x) is evaluated at different points to obtain N data shards, and each data shard is , where are different independent variable values.

[0027] More importantly, in existing technologies, secret sharing is mainly used in distributed storage and key management, and is generally regarded as a secure storage tool. However, traditional secret sharing mechanisms have not been widely applied to data transmission over one-way channels, especially in unreliable channels with high packet loss or in one-way channel scenarios. Furthermore, secret sharing and communication protocols in existing technologies are separate, failing to effectively combine the reliability and security requirements of the channel. This invention transforms the secret sharing mechanism from a storage tool into a one-way channel transmission encoding mechanism, achieving transmission optimization by integrating three functions: data encoding, packet loss redundancy, and data security. Data encoding: Data is segmented and encoded into multiple fragments, ensuring data recovery even in unreliable channel conditions; Packet loss redundancy: By adjusting the redundancy ratio, the original data can still be recovered even when some data fragments are lost; Data security: Each data fragment carries a limited amount of information, insufficient to recover the original data. That is, single or multiple data fragments do not reveal any information about the original data. Even if a data fragment is eavesdropped on, an attacker cannot recover the original data, achieving zero-knowledge transmission and ensuring data security. Confidential transmission can be achieved without additional encryption steps.

[0028] In the specific implementation process, the sending end in step 400 sends the N data fragments generated in step 300 to the receiving end through a one-way transmission channel. Each data fragment is sent independently, without requiring sequential arrival or transmission along the same path, thus avoiding the latency and overhead introduced by retransmission and order control in traditional reliable transmission protocols. Simultaneously, the receiving end continuously listens to the channel and receives data fragments from the sending end. When the number of received data fragments reaches or exceeds a threshold K, it stops receiving the remaining fragments, thereby reducing unnecessary resource consumption.

[0029] In the specific implementation process, the receiving end in step 500 uses at least K received data fragments to reconstruct the original polynomial in a finite field using Lagrange interpolation, thereby recovering the complete original data block. The recovery process does not depend on the receiving order of the fragments and is insensitive to lost fragments. Finally, the receiving end reassembles the recovered original data block according to the numbering order in step 100, and finally outputs the complete original data.

[0030] Specifically, the expression for calculating the original data using Lagrange interpolation is as follows: ; in, For Lagrange polynomials, it is expressed as: ,in, The independent variable for the received data fragments, These are the independent variables for other data fragments. Once the receiver receives K or more fragments, it can reconstruct the original data block using Lagrange interpolation, based on the independent variables and values ​​corresponding to each fragment. It's worth noting that this process is independent of the fragment receiving order, thus possessing high fault tolerance. Furthermore, the reconstructed data blocks are combined sequentially to ultimately output the complete original data. Because each data block can be reconstructed independently, multiple data blocks can be processed in parallel, further improving system throughput.

[0031] The beneficial effects of this invention are as follows: 1) By integrating three functions—data encoding, packet loss redundancy, and data security—it achieves physical layer fusion of reliability and security, simplifies the security implementation of one-way communication, and not only provides highly reliable data recovery but also ensures the confidentiality and integrity of data, which has significant advantages, especially in one-way channels. 2) The number of fragments and recovery threshold are automatically adjusted according to the real-time quality parameters of the channel (such as packet loss rate, latency jitter and bandwidth). When the network conditions are poor, N can be increased to improve robustness, and when the network conditions are good, N can be decreased to reduce overhead, thus ensuring a balance between the reliability of data recovery and the transmission efficiency of the system. 3) Since one-way channels cannot rely on traditional retransmission mechanisms or feedback control, this invention does not rely on traditional TCP / ARQ / FEC (forward error correction) and other methods. It is fully adaptable to one-way communication scenarios, avoids the retransmission overhead and latency problems in traditional protocols, and can provide higher transmission efficiency and lower latency. It significantly improves the data transmission efficiency and reliability in one-way channel environments, and is especially suitable for application scenarios with high packet loss and high latency such as satellite communication, broadcasting, and the Internet of Things. 4) The receiving end only needs to receive at least K fragments to recover the original data through the threshold secret sharing mechanism. It only depends on the number of received fragments K, completely avoiding the efficiency reduction problem caused by frequent retransmission. 5) It has a high-efficiency packet loss tolerance capability. Even if there is a certain proportion of packet loss in the channel, the system can still guarantee reliable data delivery. As long as the number of lost fragments does not exceed NK, the receiver can recover the original data and avoid the impact of packet loss.

[0032] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other.

[0033] Specific examples have been used to illustrate the principles and implementation methods of this invention. The descriptions of the above embodiments are only for the purpose of helping to understand the method and core ideas of this invention. Furthermore, those skilled in the art will recognize that, based on the ideas of this invention, there will be changes in the specific implementation methods and application scope. Therefore, the content of this specification should not be construed as a limitation of this invention.

Claims

1. A one-way channel transmission method based on a threshold secret sharing mechanism, characterized in that, Includes the following steps: The raw data to be transmitted is preprocessed to obtain preprocessed data; Determine the threshold parameters for secret sharing based on the current channel quality parameters; The preprocessed data is partitioned using a threshold secret sharing algorithm to obtain data fragments; The data fragments are sent independently, and the stopping condition for receiving the data fragments is determined according to the threshold parameter; The data fragments are reassembled using Lagrange interpolation to obtain the output data.

2. The one-way channel transmission method based on a threshold secret sharing mechanism according to claim 1, characterized in that, The raw data to be transmitted is preprocessed to obtain preprocessed data, including: The original data is divided into data blocks of fixed size; The data blocks are numbered to obtain the preprocessed data.

3. The one-way channel transmission method based on a threshold secret sharing mechanism according to claim 1, characterized in that, The threshold parameters for secret sharing are determined based on the current channel quality parameters, including: Determine the current channel quality parameters; the current channel quality parameters include: historical packet loss rate, normalized jitter, and normalized bandwidth; The current channel quality parameters are mapped uniformly to obtain the channel quality evaluation function; The channel quality is obtained based on the channel quality evaluation function, and the redundancy ratio is determined based on the range of the channel quality. The threshold parameter is obtained by applying joint constraints to the redundancy ratio.

4. The one-way channel transmission method based on a threshold secret sharing mechanism according to claim 3, characterized in that, The expression for the channel quality assessment function is: ;in, For historical packet loss rate, To standardize jitter, To standardize bandwidth, , and All are weighted coefficients.

5. The one-way channel transmission method based on a threshold secret sharing mechanism according to claim 3, characterized in that, The channel quality is obtained based on the channel quality evaluation function, and the redundancy ratio is determined based on the range of the channel quality, including: When the channel quality is less than 0.25, the redundancy ratio is greater than or equal to 40%. When 0.25 < the channel quality < 0.50, the redundancy ratio ranges from 20% to 30%. When 0.50 < the channel quality < 0.75, the redundancy ratio ranges from 10% to 20%. When 0.75 < the channel quality, the redundancy ratio ranges from 5% to 10%.

6. The one-way channel transmission method based on a threshold secret sharing mechanism according to claim 3, characterized in that, The constraints of the joint constraint include: the total number of data fragments is less than the minimum number of fragments required to recover the original data; the total number of data fragments does not exceed the maximum number of fragments allowed by the bandwidth and latency window; the minimum number of fragments required to recover the original data is not less than the minimum number of fragments required for secure data recovery; and the fragment size of the data fragments remains within the range allowed by the protocol.

7. The one-way channel transmission method based on a threshold secret sharing mechanism according to claim 1, characterized in that, The preprocessed data is partitioned using a threshold secret sharing algorithm to obtain data fragments, including: The preprocessed data is used as a "secret value" to construct a random polynomial within a finite field; the expression of the random polynomial is: ; The data slices are obtained by evaluating the random polynomial at different points; each data slice includes a slice number and a slice data value.

8. The one-way channel transmission method based on a threshold secret sharing mechanism according to claim 1, characterized in that, The expression for the Lagrange interpolation method includes: , ;in, To shard the data, The independent variable for the received data fragments, For Lagrange polynomials, The independent variable for other data shards.

Images