TW202324966A - Verification concealment method and system with master-slave architecture capable of sending secret data back to the server end without interference so as to obtain verification from the server end - Google Patents

Abstract

The present invention discloses a verification concealment method and system with a master-slave architecture, which includes a network communication system, a first information device and a second information device. The first information device is built-in with a known random parity check matrix, and uses the Gaussian elimination method to generate a public key and a private key, wherein the public key is transmitted to the second information device through the network communication system. The second information device is built-in with a carrier vector and a secret vector with a known length. The public key is used to generate a conversion secret vector and secret sub-channels, and defines a sub-channel position set. By using the carrier vector, the sub-channel position set, a systematic parity check matrix and the conversion secret vector to perform a systematic STME matrix embedding algorithm, the conversion secret vector is embedded into the carrier vector for forming a hidden vector, and the information of the hidden vector is sent back to the first information device. The private key is used to take out the secret vector, and the random parity check matrix is used to take out the secret message of the secret vector, so that the systematic parity check matrix can be used to avoid the complicated problem of syndrome decoding when embedding the matrix thereby achieving the purpose of embedding data. Since each user has his/her own exclusive transmission channel, the secret data can be sent back to the server end without interfering with each other thereby obtaining verification from the server end.

Description

Method and system for verification concealment of master-slave architecture

The present invention relates to a verification concealment method and system of a master-slave architecture, especially a master-slave architecture that can use a systematic parity check matrix to avoid symptom decoding and complex problems when embedding the matrix and achieve the purpose of embedding data Verify stealth techniques.

By the way, with the vigorous development of information technology, related Internet applications have become an indispensable part of people's lives, so there is indeed a huge amount of data transmission between the server end and the user end. Network application requirements, and under the continuous renovation of network hacking technology, network attacks and hacker behaviors are also pervasive, causing today's network information security to cause major financial and work benefits. Therefore, network information security is like a It has become an important consideration in today's network data transmission and the focus of extreme attention of various agencies and enterprises.

According to relevant news reports, in the first half of 2017, my country's network data leakage incidents have exceeded the sum of 2016. It can be seen that data leakage incidents have become the norm today. Therefore, how to effectively reduce data leakage incidents and strengthen Network information security has indeed become a technical issue that must be challenged and solved by various industries and academia. Furthermore, generally in the encryption system of traditional information transmission, some hard-to-crack secret doors are usually used to protect the plaintext. Generally in coding, if a random parity check matrix with no fixed structure is used, the decoding that is proved to be NP-complete will have the following problems:

1. Maximum likelihood function decoding problem.

2. Symptom decoding problem.

The above two decoding problems are difficult to solve with effective algorithms without a specific code structure. The main solutions to these two problems are related to the parity check matrix H , and in the absence of the private key matrix, it is difficult to solve the above two problems to brute force the secret hidden data, thus causing inconvenience and difficulty in network information transmission. Troubled things happen. Therefore, how to develop a verification concealment technology with a master-slave architecture has become a technical issue that industry, academia and industry in related technical fields want to solve and challenge.

The reason is that, based on the urgent needs of related industries, the inventors have finally developed a master-slave technology that is different from the conventional technology through continuous efforts in research and development by virtue of years of practical experience and relevant professional knowledge. The present invention of authentication concealment technology of formula architecture.

The main purpose of the present invention is to provide a verification concealment method and system of a master-slave structure, which mainly utilizes a systematic parity check matrix to avoid the complicated problem of symptom decoding when the matrix is embedded, and achieve the purpose of embedding data. Since users have their own exclusive transmission channels, they can send secret data back to the server without interfering with each other, so as to obtain verification from the server and improve the security of network information transmission. The technical means to achieve the main purpose of the present invention include a network communication system, a first information device and a second information device. The first information device has a built-in known random parity check matrix, and uses the Gaussian elimination method to generate a public key and a private key, and the public key is transmitted to the second information device through the network communication system. second The information device has built-in carrier vectors and secret vectors with a known length of , uses the public key to generate and convert secret vectors and secret sub-channels, and defines a set of sub-channel positions. Using the carrier vector, the set of sub-channel positions, and the systematic Perform a systematic STME matrix embedding algorithm on the parity check matrix and the conversion secret vector to embed the conversion secret vector into the carrier vector to form a hidden vector, and send the hidden vector back to the information of the first information device, and use the private key to encrypt The secret vector is taken out, and the secret information of the secret vector is taken out by using the random parity check matrix.

10: Network communication system

20: The first information device

30: The second information device

40: The first network transmission module

50:Second network transmission module

FIG. 1 is a schematic diagram of a specific implementation framework of the present invention.

FIG. 2 is a schematic diagram of the implementation of the system architecture of the present invention.

In order to allow your review committee to further understand the overall technical characteristics of the present invention and the technical means to achieve the purpose of the present invention, specific embodiments and accompanying drawings are described in detail as follows:

Please cooperate and refer to shown in Fig. 1～2, in order to reach the specific embodiment of the main purpose of the present invention, system comprises a network communication system 10 (such as Internet or mobile communication network), at least one first information device 20 (such as computer , smart phone; or an information device with networking function) and a second information device 30 (such as a server) and other technical content. The first information device 20 is located at the user end, a known random parity check matrix H is built in the first information device 20, and the random parity check matrix H is divided by the Gaussian elimination method to generate a public key and a private key , the private key includes random parity check matrix H and matrix P , and the private key is kept secret by the first information device 20 itself, the public key includes matrix L and systematic parity check matrix H _s , and is transmitted through the network communication system 10 to the second information device 30 . The second information device 30 is located at the server end, the first information device 20 is connected to the second information device 30 through the network communication system 10, and a carrier with a known length n is built in the second information device 30 Vector v and a secret vector s _l with a length of m , use the matrix L to generate the converted secret vector s _l ', and use the systematic parity check matrix H _s to generate a secret sub-channel, and define a sub-channel position set S _i , use the carrier v , the sub-channel position set S _i , the systematic parity check matrix H _s and the conversion secret vector s _{l '} to carry out the operation of the systematic STME matrix embedding algorithm, so as to embed the conversion secret vector s _l ' in The vector v is used to form a hidden vector l ', and the hidden vector l ' is sent back to the first information device 20 through the network communication system 10 for information. The first information device 20 receives the hidden vector l ', and uses the random parity check matrix H and matrix P of the private key to extract the secret vector s _l , and uses the random parity check matrix H to secret the secret vector s _l The message is fetched.

Specifically, the relationship between the public key and the private key is expressed as: H = LH _S P , where H _s is an m × n systematic parity check matrix, L is an m × m matrix, and P is an n × n matrix.

。 Specifically, the conversion secret vector s _l ' is defined as:

.

{1,2,L,n}，並且該子通道長度為λ，使得|S _i |=λ且m

λ

n，使得關係式為：H _i =[I M _i ] _m×λ ，其中矩陣M _i 是一個大小為m×(λ-m)的隨機矩陣，並且矩陣M _i 的所有行向量為P _γ 矩陣中的某些λ個行向量所組成。 Specifically, the second information device 30 uses the relational expression: H _s =[ I , P _γ ] to obtain the sub-channel, assuming that the sub-channel of the i- th user is defined as a position set S _i such as the relational expression: Si _{_}

{1,2,L, n }, and the subchannel length is λ , such that | S _i |= λ and m

lambda

n , so that the relation is: H _i =[ IM _i ] _{m × λ} , where the matrix M _i is a random matrix of size m × ( λ - m ), and all the row vectors of the matrix M _i are in the P _γ matrix It consists of some λ row vectors of .

Specifically, the secret message extraction relational expression is expressed as: v' = Pl '.

Specifically, when extracting the secret vector s _l , the hidden vector l ' is converted first, and its relational expression is expressed as: v' = Pl '.

Please refer to the embodiment shown in FIG. 1, the first information device 20 is electrically connected to a first network transmission module 40, and the second information device 30 is electrically connected to a second network transmission module 50, so that the At least one first information device 20 is informationally connected with the second information device 30 via the first network transmission module 40 , the network communication system 10 and the second network transmission module 50 .

In short, the present invention mainly utilizes a matrix embedding method combined with a public key and private key authentication technology to protect and embed hidden data. In addition to the technology of embedding matrix embedding in the present invention, the server end (serve) uses the Gaussian elimination method to generate a public key from the original co-location embedding matrix and transmits the public key to the user end (client). After receiving the public key, the user end can perform matrix embedding algorithm, and use the selected sub-channel as the private key for embedding at the user end to form a stealth vector (stego) and transmit it back to the server end. In this system, the public key generated by the server can let the user know that it is sent by the server to achieve non-repudiation of information security, and the user uses the public key and the secret sub-channel to generate embedded data Conceal the vector and send it back to the server. The function of the secret sub-channel is to allow the user who embeds the data to have his own transmission channel, and to allow the server to verify the user.

The present invention is indeed a technical solution that can effectively solve the key management problem. When the user end wants to send data to the server end, the invention provides a public and private key concealment mechanism that can be verified. On the server side (serve), it will first generate a parity check matrix for data embedding, and then perform Gaussian elimination on this parity check matrix to generate the public key and private key for sending. The public key is intended to be sent to the user end. The private key is reserved for retrieval of the returned hidden vector. After the server transmits the public key to the client, the client uses the public key and the secret sub-channel to embed the secret data. The main function of the secret sub-channel allows different users to have their own transmission Channels, so that each user can return the secret data to the server and obtain verification from the server without interfering with each other. In the present invention, the public key matrix and the private key matrix are generated by performing Gaussian elimination on the co-location check matrix H. When the private key matrix cannot be known, it is difficult to perform the above two problems to brute force the secret hidden information .

The present invention proposes that the systematic matrix embedding algorithm can utilize the systematic parity checking matrix, avoid the complex problem of symptom decoding when performing matrix embedding, and achieve the method of embedding data. The flow of its algorithm is as follows:

Systematic STME algorithm: Given a random systematic linear code C and a systematic parity check matrix H _s =[IP _r ], now a secret vector s _l of length m is known to be embedded into a length for n

A hidden vector l ' of length n is formed in the carrier vector y , and the hidden vector l ' is close to the carrier vector y and has the symptom s _l , where I is an m×m identity matrix, P _r is a random matrix, T is the transpose of the vector vector y.

1. Calculate vector vector symptom s _y :

s _y = Hy ^T

2. Calculate the modified vector symptom s _x :

s _x = s _y - s _l

{1,2,...,λ},|S|=λ,m

λ

n，並獲得一個子矩陣，其行向量為j

S：H _sub =[h ₁,h ₂,...,h _j ,...,h _λ ]，其中H _sub

H _s ，最後之子通道矩陣為： 3. Generate a sub-channel matrix: a set of modification positions S is known

{1,2,..., λ },| S |= λ , m

lambda

n , and obtain a submatrix with row vectors j

S ： H _sub =[ h ₁ , h ₂ ,..., h _j ,..., h _λ ], where H _sub

H _s , the final sub-channel matrix is:

H _sub }，其中det(θ)≠0 θ ={ h _i | i =1,2,..., h _k , h _i

H _sub }, where det( θ )≠0

4. Find the modified vector x : use the sub-channel matrix θ to solve x :

x _s = θ ^-1 s _x , where x _s is a vector of length m , and the position of each element of x _s corresponding to s is returned to the corresponding position of a zero vector of length n to obtain the final modified vector x .

5. The hidden vector l ' can be subtracted from the vector vector y by the best modified vector x :

l ' = y - x

6. The secret vector extraction method is to multiply the hidden vector l ' by the parity check matrix H _s :

s _l = H _s l ' ^T

The master-slave architecture verification concealment system can be discussed from two aspects, namely (1) server side and (2) user side. Assuming that the user terminal wants to transmit a secret vector data to the server, the following will introduce the process. First, the public and private keys of the server need to be generated on the server side as follows:

1. Firstly, the server side knows an m × n random parity check matrix H , the elements in H are distributed in F _q and there is a secret vector s _l to be hidden, the length of which is m .

2. The server uses the Gaussian elimination method to divide H to form:

H = LH _S P where H _s is an m × n systematization matrix, L is an m × m matrix, and P is an n × n matrix.

3. The public key generated by the server is matrix L and H _s , and the private key is matrix H and P . After the server side generates the public and _private keys, the server side keeps the private keys H and P secret, and transmits the public keys L and Hs to the user side. The embedding process on the user side is as follows:

1. The user end receives the public keys L and H _s , and knows a vector v of length n and a secret vector s _l of length m .

2. The client uses the public key L to generate the conversion secret vector s _l ' as follows:

3. Use H _s =[ I , P _γ ] to generate a secret sub-channel as follows: Assume that the i -th user’s sub-channel is defined as a position set S _i as follows:

{1,2,L,n}並且子通道長度為λ使得|S _i |=λ且m

λ

n使得：H _i =[I M _i ] _m×λ 其中矩陣M _i 是一個大小為m×(λ-m)的隨機矩陣並且矩陣M _i 的所有行向量為P _γ 矩陣中的某些λ個行向量所組成。 Si _{_}

{1,2,L, n } and the subchannel length is λ such that | S _i |= λ and m

lambda

n such that: H _i = [ IM _i ] _{m × λ} where matrix M _i is a random matrix of size m × ( λ − m ) and all row vectors of matrix M _i are some λ rows in matrix P _γ composed of vectors.

4. Using the carrier v , the sub-channel position set s _i , the systematic parity check matrix H _s and the conversion secret vector s _{l ',} perform the above-mentioned systematic STME matrix embedding algorithm to embed the conversion secret vector s _l ' into the carrier v to form Hide the vector l ', and send the hidden vector l ' back to the server.

5. Receive the hidden vector l ' on the server side and use the keys H and P to extract the secret vector as follows: First, convert the hidden vector:

v' = Pl ', and use H to retrieve the secret message:

Hv '= s _l

The following uses an example to illustrate. Assuming a parity check matrix H whose size is m × n and whose elements are distributed in F _q , we use a random matrix with the following parameters for illustration.

q =3, n =13, m =3, k = n - m =10

The parity check matrix of the above parameters is:

Using Gaussian elimination method to get:

與

and

The server sends the public keys H _s and L to the user. The user end uses H _s to embed the secret vector s l =(1,2,0) _of length m =3 into a vector vector u =(1,1,1,1,0,0, 0,0,0,0,0,0,0), we can see from the above:

使得：

makes:

嵌入載體u=(1,1,1,1,0,0,0,0,0,0,0,0,0)。利用系統化STME嵌入演算法可得隱匿向量為： Using H _s will transform the secret vector

Embedding vector u = (1,1,1,1,0,0,0,0,0,0,0,0,0). Using the systematic STME embedding algorithm, the hidden vector can be obtained as:

v' = u - x = (1,1,1,1,0,0,0,2,0,0,0,0,0), and finally return the hidden vector to the server side, where the server When the terminal receives l ', it performs the following calculation:

v = P ^-1 v' = (0,2,0,0,0,0,0,0,1,1,0,1,1) ^T can finally get:

s _l = H _v

After the description of the above-mentioned specific embodiments, the present invention can indeed use the systematic parity check matrix to avoid the complicated problem of symptom decoding when the matrix is embedded, and achieve the purpose of embedding data, because users have their own exclusive transmission channel, so the secret data can be returned to the server without mutual interference, so as to obtain the verification of the server and improve the security of information transmission.

The above is only a feasible embodiment of the present invention, and is not intended to limit the patent scope of the present invention. Any equivalent implementation of other changes based on the content, characteristics and spirit of the following claims should be Included in the patent scope of the present invention. The structural features of the invention specifically defined in the claims are not found in similar items, and are practical and progressive, and have met the requirements of an invention patent. I file an application in accordance with the law. I would like to ask the Jun Bureau to approve the patent in accordance with the law to maintain this invention. The legitimate rights and interests of the applicant.

10: Network communication system

20: The first information device

30: The second information device

40: The first network transmission module

50:Second network transmission module

Claims (10)

A verification concealment method of a master-slave architecture, which includes: providing at least one first information device on the user side and a second information device on the server side; wherein, the at least one first information device is connected to the second information device through a network communication system; A known random parity check matrix H is built in the first information device, and the random parity check matrix H is divided by the Gaussian elimination method to generate a public key and a private key. The private key includes the random parity check matrix H and Matrix P , and the private key is kept secret by the first information device; the public key includes matrix L and systematic parity check matrix H _s , and is transmitted to the second information device through the network communication system; A carrier vector v of known length n and a secret vector s _l of length m are built in the second information device, and the matrix L is used to generate the converted secret vector s _l ', and the systematic parity check is used The matrix H _s generates a secret sub-channel, and defines a sub-channel position set S _i , using the carrier vector v , the sub-channel position set S _i , the systematic parity check matrix H _s and the conversion secret vector s _{l '} perform the operation of the systematic STME matrix embedding algorithm to embed the converted secret vector s _l 'in the carrier vector v to form a hidden vector l ', and send the hidden vector l ' back through the network communication system give information to the first information device; and The first information device receives the hidden vector l ', and uses the random parity check matrix H and the matrix P of the private key to extract the secret vector s _l , and uses the random parity check matrix H to extract the secret vector The secret message of s _l is retrieved. The verification concealment method of the master-slave architecture as described in Claim 1, wherein the relationship between the public key and the private key is expressed as: H = LH _S P , where H _s is an m × n systematic parity check Matrix, L is an m × m matrix, P is an n × n matrix. The verification concealment method of the master-slave architecture as described in Claim 2, wherein the relational expression of the conversion secret vector s _l ' is defined as:

. The verification concealment method of the master-slave architecture as described in Claim 1, wherein the second information device uses the relational formula: H _s =[ I , P _γ ] to obtain the sub-channel, assuming that the i- th user The sub-channel is defined as a set of positions S _i such as the relation: S _i

{1,2,L, n }, and the subchannel length is λ , such that | S _i |= λ and m

lambda

n , and let the relation be: H _i =[ IM _i ] _{m × λ} , where matrix M _i is a random matrix of size m × ( λ - m ), and all row vectors of matrix M _i are P _γ matrices It consists of some λ row vectors in . The authentication concealment method of the master-slave architecture as described in Claim 1, wherein, when extracting the secret vector s _l , the concealment vector l ' is converted first, and the relational expression is expressed as: v' = Pl '. In the Internet of Things dynamic theme information security method as described in claim item 5, the relational expression for extracting the secret information is expressed as: v' = Pl '. A verification concealment system of a master-slave architecture, which includes: a network communication system; At least one first information device, which is located at the user end, a known random parity check matrix H is built in the first information device, and the random parity check matrix H is divided by the Gaussian elimination method to generate a public key and a private key , the private key includes the random parity check matrix H and the matrix P , and the private key is kept secret by the first information device itself; the public key includes the matrix L and the systematic parity check matrix H _s , and is passed through the network communication system Transmission to the second information device: A second information device; it is located at the server end, the at least one first information device is connected to the second information device through the network communication system, and a carrier with a known length n is built in the second information device Vector v and a secret vector s _l with a length of m , use the matrix L to generate the conversion secret vector s _l ', and use the systematic parity check matrix H _s to generate a secret sub-channel, and define a set of sub-channel positions S _i , use the carrier v , the sub-channel position set S _i , the systematic parity check matrix H _s and the conversion secret vector s _{l '} to carry out the operation of the systematic STME matrix embedding algorithm, so that the conversion secret vector s _l ' is embedded in the carrier v to form a hidden vector l ', and the hidden vector l ' is sent back to the first information device through the network communication system; the first information device receives the hidden vector l ', And use the random parity check matrix H and the matrix P of the private key to extract the secret vector s _l , and use the random parity check matrix H to extract the secret information of the secret vector s _l . The verification concealment system of the master-slave structure as described in Claim 7, wherein the first information device is electrically connected to a first network transmission module, and the second information device is electrically connected to a second network transmission module A set of information linking the at least one first information device with the second information device through the first network transmission module, the network communication system and the second network transmission module. The verification concealment system of the master-slave architecture as described in claim item 7, wherein the relationship between the public key and the private key is expressed as: H = LH _S P , where H _s is a systematic parity check of m × n Matrix, L is an m × m matrix, P is an n × n matrix. The authentication concealment system of the master-slave architecture as described in claim item 9, wherein the relational expression of the conversion secret vector s _l ' is defined as:

.

Images