CN113206839B - Data hiding and complementing method in data transmission - Google Patents

Data hiding and complementing method in data transmission Download PDF

Info

Publication number
CN113206839B
CN113206839B CN202110394905.1A CN202110394905A CN113206839B CN 113206839 B CN113206839 B CN 113206839B CN 202110394905 A CN202110394905 A CN 202110394905A CN 113206839 B CN113206839 B CN 113206839B
Authority
CN
China
Prior art keywords
data
password
hmm model
observation
probability 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.)
Active
Application number
CN202110394905.1A
Other languages
Chinese (zh)
Other versions
CN113206839A (en
Inventor
吴建亮
胡鹏
王永君
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Jeeseen Network Technologies Co Ltd
Original Assignee
Guangzhou Jeeseen Network Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangzhou Jeeseen Network Technologies Co Ltd filed Critical Guangzhou Jeeseen Network Technologies Co Ltd
Priority to CN202110394905.1A priority Critical patent/CN113206839B/en
Publication of CN113206839A publication Critical patent/CN113206839A/en
Application granted granted Critical
Publication of CN113206839B publication Critical patent/CN113206839B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • 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/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/083—Network architectures or network communication protocols for network security for authentication of entities using passwords
    • H04L63/0838—Network architectures or network communication protocols for network security for authentication of entities using passwords using one-time-passwords
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3226—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using a predetermined code, e.g. password, passphrase or PIN
    • H04L9/3228—One-time or temporary data, i.e. information which is sent for every authentication or authorization, e.g. one-time-password, one-time-token or one-time-key
    • 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/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a data hiding and completing method in data transmission, and belongs to the technical field of data security transmission. After a client establishes connection with a server, a sending end carries out primary encryption on original data by using a password in the connection establishment process to obtain initial processing data; randomly giving HMM model conditions, and observing that the probability matrix B contains 2N unknowns; giving N unknowns of the observation probability matrix B by using initial processing data to obtain an observation probability matrix B containing the N unknowns; obtaining an observation probability matrix B without unknown numbers according to the password and the determined HMM model conditions in the connection establishing process; removing initial processing data from the observation probability matrix B to serve as training data; transmitting the training data to a receiving end; and the receiving end decrypts according to the training data and the password in the connection establishment process to obtain the original data. The data in the invention is randomly hidden and completed when being received, so that the data transmission is safer.

Description

Data hiding and complementing method in data transmission
Technical Field
The invention relates to the technical field of data security transmission, in particular to a data hiding and complementing method in data transmission.
Background
Data encryption is always an important part of secret data, and at present, a plurality of mature encryption modes exist. Common encryption algorithms include a reversible encryption algorithm and an irreversible encryption algorithm, and the reversible encryption algorithm is divided into a symmetric encryption algorithm and an asymmetric encryption algorithm. In most cases, both parties communicating with each other need to establish an efficient and secure encryption and decryption scheme, and trade off between security and performance consumption. Moreover, whether symmetric encryption or asymmetric encryption, the key is generated in advance and cannot be changed in the transmission process. The key is an absolutely critical ring during the communication process, and if the key is leaked in some situations, the internal personnel, etc., the key means that all established communication is unsafe.
Chinese patent application CN106533663A discloses a data encryption method, which includes the following steps: creating a hardware key, and binding the hardware key with the encryption side device; creating a sub-key of the hardware key according to the hardware key; encrypting the subkey by using the hardware key to generate a first file; creating software addEncrypting the key; encrypting target data by using the software encryption key to generate a second file; and encrypting the software encryption key by using the sub-key to generate a third file. The creating a hardware key and binding the hardware key with the encryption side device includes: and creating the hardware key by using a TPM (Trusted Platform Module) security chip installed on the encryption side device, and storing the hardware key by using the TPM security chip. The creating of the hardware key comprises: determining the length of a secret key according to a formula I; wherein, the first formula is: n is q × p; q is used for representing a first preset prime number, p is used for representing a second preset prime number, and n is used for representing the key length; determining a first number of numbers which are less than or equal to the key length and are relatively prime to the key length according to the key length and a formula II; wherein the second formula is
Figure BDA0003018224330000011
Determining a first target number which is relatively prime to the first number randomly, wherein the first target number is a positive number smaller than the first number; determining a second target number according to the first number, the first target number and a formula III; wherein the third formula is
Figure BDA0003018224330000012
Wherein e is the first target number, and d is the second target number; determining the hardware key according to the first target number, the second target number and the key length comprises: a private key and a public key, wherein the private key is (n, d) and the public key is (n, e); the encrypting the subkey by using the hardware key to generate a first file comprises: encrypting the sub-key according to a formula four and the public key to generate a first file, wherein the formula four is as follows: c ≡ M ^ emod n; wherein, C is the first file, and M is the subkey. But this solution has the problem of requiring reliance on hardware keys.
The prior art has at least the following disadvantages:
1. in the prior art, a secret key is generated in advance, cannot be changed in the transmission process, and risks of internal leakage exist.
Disclosure of Invention
In order to solve the technical problems in the prior art, the invention provides a data hiding and complementing method in data transmission, wherein after a client and a server are connected, a sending end initially encrypts original data by using a password in the connection establishing process to obtain initial processing data; randomly giving HMM model conditions, and observing that the probability matrix B contains 2N unknowns; giving N unknowns of the observation probability matrix B by using initial processing data to obtain an observation probability matrix B containing N unknowns; obtaining an observation probability matrix B without unknown numbers according to the password and the determined HMM model conditions in the connection establishing process; removing initial processing data from the observation probability matrix B to serve as training data; transmitting the training data to a receiving end; and the receiving end decrypts according to the training data and the password in the connection establishment process to obtain the original data. The data in the invention is randomly hidden and completed when being received, so that the data transmission is safer.
The hidden markov model HMM is a kind of markov chain, and is a typical algorithm in machine learning algorithms. Its state cannot be observed directly, but can be observed by a sequence of observation vectors, each of which is represented as a variety of states by some probability density distribution, each observation vector being generated by a sequence of states having a corresponding probability density distribution. This means that the hidden markov model is a double stochastic process. Hidden Markov models can be applied to a variety of machine learning scenarios, such as input recommendations, intelligent question answering, and the like.
Several matrices and parameter values of the HMM basic model, which are limited by the HMM, are for example for probability problem, so the data in the matrix is basically in the range of (0,1), and the state transition probability distribution matrix is added to 1 in each row, 1 in each column, 1 in each row of the observed state probability matrix, etc. these are all due to the HMM for probability problem. The invention utilizes the algorithm logic of the HMM model, but the data in each matrix is not limited, the sum of each row and each column can be more than 1, and integers are adopted for the convenience of calculation.
The invention provides an identity authentication method in connection establishment, which comprises the following steps:
the server randomly generates a first HMM model, and generates a password K1 according to the first HMM model;
the server side sends the first HMM model to the client side;
the client generates a password K2 according to the received first HMM model;
the client generates a second HMM model according to the password K2 and sends the second HMM model to the server;
the server side obtains a password K3 according to the received second HMM model;
the server side judges whether the password K3 is the same as the password K1, and if so, connection is established; if not, the connection is not established, and the program is exited.
Preferably, generating the password according to the HMM model specifically takes the conditional probability of the HMM model as the password;
preferably, the client generates the password K2 according to the received first HMM model, specifically, the client generates the password K2 through a forward algorithm according to the received first HMM model.
Preferably, the server obtains the password K3 according to the received second HMM model, specifically, the server obtains the password K3 through a forward algorithm according to the received second HMM model.
Preferably, generating the password according to the HMM model specifically comprises the steps of:
for HMM models λ ═ (a, B,) and observation series O ═ O { (O)1,o2,...oTCalculating forward probabilities of hidden states at the moment t-1;
calculating the forward probability of each hidden state at the moment of t + 1;
continuously iterating to finally obtain the conditional probability of the HMM model
Figure BDA0003018224330000031
And using the conditional probability of the HMM model as a password;
the above-mentionedThe observation system with hidden state i at the forward probability t is O ═ O1,o2,...oT-probability of the next step;
t is the length of the observed sequence.
Preferably, the connection establishing step specifically includes the steps of:
the client initiates a connection request;
upon receiving the connection request, the server randomly generates an observed state probability matrix B, an initial state transition probability vector ii, and an observed sequence O ═ { O } for a set NxN of state transition matrices A, NxM for the first HMM model λ 1 ═ (a, B, ii)1,o2,...oTN is the state number in the HMM model, and T is the length of an observation sequence;
the server side generates a first HMM model lambda 1 ═ (A, B, pi) and an observation sequence O ═ { O ═ according to random1,o2,...oTGet the password K1(O | λ 1) and save by αT(i) Constructed vector Pα＝{αT(i)}N；
The server side sends the first HMM model lambda 1 to the client side (A, B and II);
after receiving the first HMM model λ 1 ═ a, B, ii, the client generates a password K2(O | λ 1) by using the forward algorithm according to the received first HMM model;
the client randomly generates a second HMM model lambda 2 (A2, B2 and pi 2) according to the password K2, and sends the second HMM model to the server;
after receiving the second HMM model, the server obtains a password K3 through the forward algorithm according to the second HMM model;
if the password K3 is different from the password K1, the authentication is not passed, the connection is not established, and the IP address of the client is recorded; if the password K3 is the same as the password K1, the authentication is passed and the connection is established.
Preferably, the observation sequence O ═ { O } is randomly generated by taking values randomly in the (1, N) range1,o2,...oTAnd f, wherein N is the state number in the HMM model, and T is the observation sequence length.
Preferably, in each matrix of the HMM model, the sum of rows and the sum of columns is greater than 1.
The invention provides a communication system, which uses the method for authentication in connection establishment.
The invention also provides a data encryption transmission method, which comprises the following steps:
after the connection is established, the sender uses the password in the connection establishment process to primarily encrypt the original data needing to be encrypted and transmitted to obtain a result vector;
the sender reversely constructs a corresponding HMM model according to the result vector;
the sender sends the constructed HMM model to the receiving end;
the receiving end decrypts according to the received HMM model to obtain primary encrypted data;
the receiving end restores original data according to the password in the connection establishing process;
and when the data transmission is finished, destroying all passwords and disconnecting the passwords.
Preferably, the data encryption transmission method specifically includes the following steps:
the sending end adopts the password in the connection establishing process to process the original vector data D ═ D which needs to be encrypted and transmittedi}NObtaining a preliminary encryption vector D '═ D'i}N；
Wherein the content of the first and second substances,
Figure BDA0003018224330000041
n is the state number in the HMM model;
substituting vector P with preliminary encrypted data vectorαLet alphaT(i)＝d'i；
Wherein, PαIs made of alphaT(i) Constructed vector, Pα＝{αT(i)}NRandomly generating and storing a password for the connection establishing process;
randomly giving a state transition matrix a ═ aij]N×NAnd observation result V ═ V1,v2,...,vNThe observation sequence O ═ O }1,o2,...oT(N-1) xN data in the observation probability matrix B, wherein N is the state number in the HMM model, and T is the length of an observation sequence;
according to the random given initial state transition probability vector pi ═ (pi)i)NAnd password P randomly generated and stored in connection establishment processα＝{αT(i)}NSolving to obtain N unknown values in the observation probability matrix B, and determining an HMM model lambda as (A, B and pi);
the transmitting end transmits the HMM model to the receiving end;
after receiving the HMM model, the receiving end obtains a primary encryption vector D ' ═ D ' by using an HMM forward algorithm 'i}N；
The receiving end decrypts according to the password saved in the connection establishing process to obtain the original data D ═ Di}N；
And when the data transmission is finished, destroying all the passwords and disconnecting the passwords.
According to the method for generating the HMM model by the password, the core is the application of a forward algorithm. After assuming that the state transition matrix A and the initial state transition probability vector II have been randomly given, the conditional probability is found according to a forward algorithm
Figure BDA0003018224330000051
N accumulated values, i.e.
Figure BDA0003018224330000052
Alpha in (A)T(i) In fact, since the password P and the N accumulated values are known, that is, an equation set composed of N equations can be obtained, and the unknown number in the equation is the observation probability matrix B, before solving the equation, N × (N-1) values of the observation probability matrix B need to be randomly generated, and the remaining N values can be obtained through equation solution, so that a complete HMM model can be obtained.
The invention also provides a communication system using the data encryption transmission method.
The invention also provides a data completion and data encryption transmission method, which comprises the following steps:
the sending end carries out primary encryption on original data by using a password in the connection establishing process to obtain initial processing data;
randomly giving HMM model conditions, wherein in the given HMM model conditions, an observation probability matrix B contains 2N unknowns;
giving N unknowns of the observation probability matrix B by using initial processing data to obtain an observation probability matrix B containing N unknowns;
obtaining an observation probability matrix B without unknown numbers according to the password and the determined HMM model conditions in the connection establishing process;
removing initial processing data from the observation probability matrix B to serve as training data;
transmitting the training data to a receiving end;
the receiving end decrypts according to the received training data and the password in the connection establishing process to obtain original data;
and when the data transmission is finished, destroying all passwords and disconnecting the passwords.
Preferably, in the data completion and data encryption transmission method, when the sender is the server, the password K3 is used to obtain the initial processing data, and when the sender is the client, the password K2 is used to obtain the initial processing data.
Preferably, the data complementing and data encrypting transmission method specifically includes the following steps:
the sending end adopts the password in the connection establishing process to process the original vector data H ═ H which needs to be encrypted and transmittedi}NObtaining a preliminary encryption vector H '═ H'i}N；
Wherein the content of the first and second substances,
Figure BDA0003018224330000061
n is the state number in the HMM model;
randomly giving a state transition matrix a ═ aij]N×NAnd observation result V ═ V1,v2,...,vNThe observation sequence O ═ O }1,o2,...oTAnd (N-2) xN data in the observation probability matrix B, N being HMMThe number of states in the model, T is the length of the observation sequence;
setting the preliminary encryption vector H '{ H'i}NThe values of (a) are assigned to the values of N unknowns of the remaining 2 x N unknowns in the observation probability matrix B;
according to the random given initial state transition probability vector pi ═ (pi)i)NAnd a password randomly generated and stored in the connection establishing process is solved to obtain the values of the remaining N unknowns in the observation probability matrix B, so as to obtain the observation probability matrix B;
carrying out original data vector deletion processing on the observation probability matrix B to obtain an observation probability matrix B ', B' ═ B 'with N original data deleted'j(k)]N×N；
Determining an HMM model λ '═ (a, B', (ii);
the transmitting end transmits the HMM model lambda '(A, B',) to the receiving end;
and after receiving the HMM model lambda '═ (A, B', 'n) at the receiving end, obtaining a missing preliminary encryption vector H' ═ H 'by using an HMM forward algorithm'i}N；
The receiving end decrypts according to the password saved in the connection establishing process to obtain the original data H ═ Hi}N
And when the data transmission is finished, destroying all passwords and disconnecting the passwords.
The invention provides a communication system which uses the data completion and data encryption transmission method.
Compared with the prior art, the invention has the following beneficial effects:
1. before two parties communicate, the server randomly generates a group of HMM model probability matrixes, generates a password according to the HMM model probability matrixes, sends the HMM model to the client, generates a password according to the HMM model by the client, generates another HMM model according to the password and returns the HMM model to the server, and the server establishes a link after verifying the password to be consistent, so that the password established by the connection is randomly generated and cannot be leaked.
2. In the communication process, the original data is simply and preliminarily encrypted to obtain a group of result vectors, then the HMM model is constructed by the vectors, and a state transition matrix A in the HMM model is randomly givenij]N×NAnd observation result V ═ V1,v2,...,vNThe observation sequence O ═ O1,o2,...oTAnd (N-1) xN data in the observation probability matrix B according to a randomly given initial state transition probability vector pi ═ (pi ═ pi)i)NAnd a password vector randomly generated and stored in the connection establishing process is solved to obtain N unknown values in the observation probability matrix B, the HMM model lambda is determined to be (A, B and II), the sending end sends the determined HMM model to the receiving end, and the receiving end decrypts according to an HMM forward algorithm and the password to obtain original data.
3. The method can hide the data for the data needing to be transmitted in a hidden mode, then automatically fill the data according to the machine learning algorithm of the HMM model, and can realize the safe transmission of the hidden data.
4. The invention destroys the communication key at this time after the communication is finished, and randomly generates a group of keys again next time, thereby protecting the communication safety to a certain extent, especially for some communication with higher requirement on confidentiality.
Drawings
FIG. 1 is a flow diagram of connection establishment according to one embodiment of the present invention;
FIG. 2 is a flow diagram of encrypted transmission of data after a connection is established, in accordance with an embodiment of the present invention;
fig. 3 is a flow chart of data hiding and completion after connection establishment according to an embodiment of the present invention.
Detailed Description
The following detailed description of the embodiments of the present invention is provided in conjunction with the accompanying drawings of fig. 1-3.
The invention utilizes the algorithm logic of the HMM model, and actually has certain limitations on several matrixes and parameter values of the HMM basic model, for example, the HMM aims at the probability problem, so the data in the matrix basically takes the range of (0,1), and the state transition probability distribution matrix is added to be 1 in each row, 1 in each column, 1 in each row of the observation state probability matrix, and the like, which are all due to the probability problem aimed at by the HMM. The present invention incorporates its algorithmic logic, so its data limitations do not have to be followed, and integers may be used for ease of computation.
The basic concept of the HMM model involved in the present invention is described in detail below.
The state transition matrix a is originally a probability matrix of a thing transitioning from one state to another state in the HMM model. Assuming that a thing has n states, denoted as Z (Z1, Z2, z3.., zi,. zn), each value Aij in the matrix represents the probability that the state of the thing is zi at time t, and the state becomes zj by time t + 1. Due to its practical significance, this means that the sum of each column of the state transition matrix a in the original HMM model is 1, and each row is also 1. But the HMM algorithm is improved by the method, and the practical significance is not considered, so that the probability size constraint of each matrix does not need to be considered. The state transition matrix in the present invention can be simply regarded as a set of common matrices, and the sum of each row and/or each column is not limited to 1.
The observation state probability matrix B originally represents the probability of the observation result corresponding to a certain state at a certain time in the HMM model. Assuming that a certain object has an n-state, denoted as Z (Z1, Z2, z3..., zi.,. zn), and a possible observation result is V (V1, V2, V3.,. vi.,. vn), each value Bij in the matrix represents a probability that the observation state corresponding to the object state zi at the time t corresponds to vj. The matrix is also 1 for each row and column. Similarly, in the present invention, the observation state probability matrix can be regarded as a set of common matrices. However, it is worth noting that in data encryption and data completion, the partial observation state probability matrix is randomly generated firstly, the rest part is used as the missing amount, the solution of the missing amount depends on a forward algorithm, and then the equation set is solved to obtain the data encryption and data completion method.
The initial state transition probability vector ii is the probability of each state at the starting time t equal to 0, and the cumulative sum thereof is 1. Similarly, in the present invention, the practical significance of the vector does not need to be considered, and the vector can be randomly obtained by a group of ordinary vectors.
The invention provides an identity authentication method in connection establishment, which comprises the following steps:
the server randomly generates a first HMM model, and generates a password K1 according to the first HMM model;
the server side sends the first HMM model to the client side;
the client generates a password K2 according to the received first HMM model;
the client generates a second HMM model according to the password K2 and sends the second HMM model to the server;
the server side obtains a password K3 according to the received second HMM model;
the server side judges whether the password K3 is the same as the password K1, and if so, connection is established; if not, the connection is not established, and the program is exited.
As a preferred embodiment, the client generates the password K2 according to the received first HMM model, specifically, the client generates the password K2 through a forward algorithm according to the received first HMM model.
As a preferred embodiment, the server obtains the password K3 according to the received second HMM model, specifically, the server obtains the password K3 through a forward algorithm according to the received second HMM model.
As a preferred embodiment, generating a password according to an HMM model specifically comprises the following steps:
for HMM models λ ═ (A, B, n) and observation series O ═ O { (O) }1,o2,...oTCalculating forward probabilities of hidden states at the moment t-1;
calculating the forward probability of each hidden state at the moment of t + 1;
continuously iterating to finally obtain the conditional probability of the HMM model
Figure BDA0003018224330000081
And combines the conditional probabilities of the HMM modelsAs a password;
the observation system with the forward probability of t time hidden state i is O ═ O1,o2,...oT-probability of the next step;
t is the length of the observed sequence.
As a preferred embodiment, the connection establishing step specifically includes the following steps:
the client initiates a connection request;
upon receiving the connection request, the server randomly generates an observed state probability matrix B, an initial state transition probability vector ii, and an observed sequence O ═ { O } for a set NxN of state transition matrices A, NxM for the first HMM model λ 1 ═ (a, B, ii)1,o2,...oTN is the state number in the HMM model, and T is the length of an observation sequence;
the server side generates a first HMM model lambda 1 ═ (A, B, pi) and an observation sequence O ═ { O ═ according to random1,o2,...oTGet the password K1(O | λ 1) and save by αT(i) Constructed vector Pα＝{αT(i)}N；
The server side sends the first HMM model lambda 1 to the client side (A, B and II);
after receiving the first HMM model lambda 1 (A, B, II), the client generates a password K2(O | lambda 1) by utilizing the forward algorithm according to the received first HMM model;
the client randomly generates a second HMM model lambda 2 (A2, B2 and pi 2) according to the password K2, and sends the second HMM model to the server;
after receiving the second HMM model, the server obtains a password K3 through the forward algorithm according to the second HMM model;
if the password K3 is different from the password K1, the authentication is not passed, the connection is not established, and the IP address of the client is recorded; if the password K3 is the same as the password K1, the authentication is passed and the connection is established.
As a preferred embodiment, the observation sequence O ═ O is randomly generated by taking values randomly in the range of (1, N)1,o2,...oTN is the number of states in the HMM model, and T is the length of the observed sequence。
In a preferred embodiment, in each matrix of the HMM model, the sum of each row and the sum of each column is greater than 1.
The invention also provides a communication system and an identity authentication method in the connection establishment.
The invention also provides a data encryption transmission method, which comprises the following steps:
after the connection is established, a sender carries out primary encryption on original data needing encryption transmission by using a password in the connection establishment process to obtain a result vector which is a solving result vector of a certain HMM model;
the sender reversely constructs a corresponding HMM model according to the result vector;
the sender sends the constructed HMM model to the receiving end;
the receiving end decrypts according to the received HMM model to obtain primary encrypted data;
the receiving end restores original data according to the password in the connection establishing process;
and when the data transmission is finished, destroying all passwords and disconnecting the passwords.
As a preferred embodiment, the data encryption transmission method specifically includes the following steps:
the sending end adopts the password in the connection establishing process to process the original vector data D ═ D which needs to be encrypted and transmittedi}NObtaining a preliminary encryption vector D '═ D'i}N；
Wherein the content of the first and second substances,
Figure BDA0003018224330000101
n is the state number in the HMM model;
substitution of vector P by preliminary encrypted data vectorαLet alphaT(i)＝d'i；
Wherein, PαIs composed of alphaT(i) Constructed vector, Pα＝{αT(i)}NRandomly generating and storing a password for the connection establishing process;
random given stateTransition matrix a ═ aij]N×NAnd observation result V ═ V1,v2,...,vNThe observation sequence O ═ O }1,o2,...oT(N-1) xN data in the observation probability matrix B, wherein N is the state number in the HMM model, and T is the length of an observation sequence;
according to the random given initial state transition probability vector pi ═ (pi)i)NAnd password P randomly generated and stored in connection establishment processα＝{αT(i)}NSolving to obtain N unknown values in the observation probability matrix B, and determining an HMM model lambda as (A, B and pi);
the transmitting end transmits the HMM model to the receiving end;
after receiving the HMM model, the receiving end obtains a primary encryption vector D ' ═ D ' by using an HMM forward algorithm 'i}N；
The receiving end decrypts according to the password saved in the connection establishing process to obtain the original data D ═ Di}N；
And when the data transmission is finished, destroying all passwords and disconnecting the passwords.
The HMM model is generated according to the password, specifically, the HMM model is obtained through a forward algorithm, and in the identity verification method in connection establishment, the HMM model is generated according to the password by adopting the same method. After assuming that the state transition matrix A and the initial state transition probability vector II have been randomly given, the conditional probability is found according to a forward algorithm
Figure BDA0003018224330000102
N accumulated values, i.e.
Figure BDA0003018224330000103
Alpha in (A)T(i) In fact, since the password P and the N accumulated values are known, that is, an equation set composed of N equations can be obtained, and the unknown number in the equation is the observation probability matrix B, before solving the equation, N × (N-1) values of the observation probability matrix B need to be randomly generated, and the remaining N values can be obtained through equation solution, so that a complete HMM model can be obtained.
The invention also provides a communication system using the data encryption transmission method.
The invention provides a data completion and data encryption transmission method, which comprises the following steps:
the sending end carries out primary encryption on original data by using a password in the connection establishing process to obtain initial processing data;
randomly giving HMM model conditions, wherein in the given HMM model conditions, an observation probability matrix B contains 2N unknowns;
giving N unknowns of the observation probability matrix B by using initial processing data to obtain an observation probability matrix B containing N unknowns;
obtaining an observation probability matrix B without unknown numbers according to the password and the determined HMM model conditions in the connection establishing process;
removing initial processing data from the observation probability matrix B to serve as training data;
transmitting the training data to a receiving end;
the receiving end decrypts according to the received training data and the password in the connection establishing process to obtain original data;
and when the data transmission is finished, destroying all passwords and disconnecting the passwords.
In the data complementing and data encrypting transmission method, as a preferred embodiment, when the sender is the server, the password K3 is used to obtain the initial processing data, and when the sender is the client, the password K2 is used to obtain the initial processing data.
As a preferred embodiment, the data completion and data encryption transmission method specifically includes the following steps:
the sending end adopts the password in the connection establishing process to process the original vector data H ═ H which needs to be encrypted and transmittedi}NObtaining a preliminary encryption vector H '═ H'i}N；
Wherein the content of the first and second substances,
Figure BDA0003018224330000111
n is the state number in the HMM model;
randomly giving a state transition matrix a ═ aij]N×NAnd observation result V ═ V1,v2,...,vNH, observation sequence O ═ O1,o2,...oT(N-2) xN data in an observation probability matrix B, wherein N is the state number in the HMM model, and T is the length of an observation sequence;
setting the preliminary encryption vector H '{ H'i}NThe values of (a) are assigned to the values of N unknowns of the remaining 2 x N unknowns in the observation probability matrix B;
according to the random given initial state transition probability vector pi ═ (pi)i)NAnd a password randomly generated and stored in the connection establishing process is solved to obtain the values of the remaining N unknowns in the observation probability matrix B, so as to obtain the observation probability matrix B;
carrying out original data vector deletion processing on the observation probability matrix B to obtain an observation probability matrix B ', B' ═ B 'with N original data deleted'j(k)]N×N；
Determining an HMM model λ '═ (a, B', (ii);
the transmitting end transmits the HMM model lambda '(A, B',) to the receiving end;
after receiving HMM model λ '((A, B',), (II), the receiving end obtains the missing preliminary encryption vector H '({ H'i}N；
The receiving end decrypts according to the password saved in the connection establishing process to obtain the original data H ═ Hi}N；
And when the data transmission is finished, destroying all passwords and disconnecting the passwords.
The communication password is the foundation of communication construction in the invention, firstly used as identity verification, and secondly used as preliminary encryption and final reverse solution of ciphertext data in encryption and information supplementation (as this is also the need to determine that the command is the communication command, otherwise, the communication command under other conditions cannot finally obtain correct encrypted data and supplemented data). Communication password, i.e. resulting conditional probability in HMM model
Figure BDA0003018224330000121
After the HMM base model has been derived from randomly generated data, observation sequences can be randomly assigned. In the HMM, the observation sequence is an observation value that can be actually seen, and then the recurrence conditional probability is determined according to the observation value. In fact, the observation sequence is regressed to the calculation step of the forward algorithm, which means specifically which column of the observation state matrix is used for multiplication in the iterative calculation. So for one observation probability matrix B ═ Bj(k)]N×NIn other words, N is the number of states in the HMM model, and the observation sequence O with length T is { O ═ O {1,o2,...,oTThe values are taken within the range of (1, N) to determine which column of the observed probability matrix to multiply with the result of the last iteration. Therefore, for the present invention, the random generation of the observation sequence takes a random value in the range of (1, N).
In an original HMM forward algorithm, an HMM basic model and an observation sequence are obtained in a basic flow, and first, the hidden state forward probabilities at a time t ═ 1 are calculated, and then, iteration is performed continuously to calculate the hidden state forward probability at the next time. I.e. iterated through the following formula:
Figure BDA0003018224330000122
finally, find out
Figure BDA0003018224330000123
The invention provides a communication system which uses the data completion and data encryption transmission method.
Example 1
The connection establishment procedure provided by the present invention will be described in detail with reference to fig. 1-3, according to an embodiment of the present invention.
The invention provides an identity authentication method in a connection establishment process, which comprises the following steps:
the client initiates a connection request;
upon receiving the connection request, the server randomly generates an observed state probability matrix B, an initial state transition probability vector ii, and an observed sequence O ═ { O } for a set NxN of state transition matrices A, NxM for the first HMM model λ 1 ═ (a, B, ii)1,o2,...oT}; randomly generating an observation sequence O ═ O by randomly taking values in the range of (1, N)1,o2,...oTAnd f, wherein N is the state number in the HMM model, and T is the observation sequence length.
The server side generates a first HMM model lambda 1 ═ (A, B, pi) and an observation sequence O ═ { O ═ according to random1,o2,...oTGet the password K1(O | λ 1) and save by αT(i) Constructed vector Pα＝{αT(i)}N；
The server side sends the first HMM model lambda 1 to the client side (A, B and II);
after receiving the first HMM model λ 1 ═ a, B, ii, the client generates a password K2(O | λ 1) by using the forward algorithm according to the received first HMM model;
the client randomly generates a second HMM model lambda 2 (A2, B2 and pi 2) according to the password K2, and sends the second HMM model to the server;
after receiving the second HMM model, the server obtains a password K3 through the forward algorithm according to the second HMM model;
if the password K3 is different from the password K1, the authentication is not passed, the connection is not established, and the IP address of the client is recorded; if the password K3 is the same as the password K1, the authentication is passed and the connection is established.
In each matrix of the HMM model, the sum of rows and the sum of columns is greater than 1.
The step of generating the password by the forward algorithm specifically comprises the following steps:
for HMM models λ ═ (a, B,) and observation series O ═ O { (O)1,o2,...oTCalculating forward probabilities of hidden states at the moment t-1;
calculating the forward probability of each hidden state at the moment of t + 1;
continuously iterating to finally obtain the conditional probability of the HMM model
Figure BDA0003018224330000131
And using the conditional probability of the HMM model as a password;
the observation system with the forward probability of t time hidden state i is O ═ O1,o2,...oT-probability of the next step;
t is the length of the observed sequence.
The HMM model generated from the password is specifically obtained by a forward algorithm. After assuming that the state transition matrix A and the initial state transition probability vector II have been randomly given, the conditional probability is found according to a forward algorithm
Figure BDA0003018224330000141
N accumulated values, i.e.
Figure BDA0003018224330000142
Alpha in (A)T(i) In fact, since the password P and the N accumulated values are known, that is, an equation set composed of N equations can be obtained, and the unknown number in the equation is the observation probability matrix B, before solving the equation, N × (N-1) values of the observation probability matrix B need to be randomly generated, and the remaining N values can be obtained through equation solution, so that a complete HMM model can be obtained.
Example 2
The data encryption transmission process provided by the present invention is explained in detail according to an embodiment of the present invention with reference to fig. 1 to 3.
The invention provides a data encryption transmission method, which comprises the following steps:
the sending end adopts the password in the connection establishing process to process the original vector data D ═ D which needs to be encrypted and transmittedi}NObtaining a preliminary encryption vector D '═ D'i}N；
Wherein the content of the first and second substances,
Figure BDA0003018224330000143
n is the state number in the HMM model;
substituting vector P with preliminary encrypted data vectorαLet alphaT(i)＝d'i；
Wherein, PαIs composed of alphaT(i) Constructed vector, Pα＝{αT(i)}NRandomly generating and storing a password for the connection establishing process;
randomly giving a state transition matrix a ═ aij]N×NAnd observation result V ═ V1,v2,...,vNThe observation sequence O ═ O }1,o2,...oT(N-1) xN data in the observation probability matrix B, wherein N is the state number in the HMM model, and T is the length of an observation sequence;
according to the randomly given initial state transition probability vector pi ═ pi (pi)i)NAnd password P randomly generated and stored in connection establishment processα＝{αT(i)}NSolving to obtain N unknown values in the observation probability matrix B, and determining an HMM model lambda as (A, B and pi);
the transmitting end transmits the HMM model to the receiving end;
after receiving the HMM model, the receiving end obtains a primary encryption vector D ' ═ D ' by using an HMM forward algorithm 'i}N；
The receiving end decrypts according to the password stored in the connection establishing process to obtain the original data D ═ Di}N。
The HMM model generated from the password is specifically obtained by a forward algorithm. After assuming that the state transition matrix A and the initial state transition probability vector II have been given randomly, the conditional probability is found according to a forward algorithm
Figure BDA0003018224330000151
N accumulated values, i.e.
Figure BDA0003018224330000152
Alpha in (A)T(i) In fact, since the password P and the N accumulated values are known, tooIt means that an equation set composed of N equations can be obtained, and the unknown number in the equations is the observation probability matrix B, so before solving the equations, N × N (N-1) values of the observation probability matrix B need to be randomly generated, and the remaining N values can be obtained by solving the equations, so that a complete HMM model can be obtained.
Example 3
The data encryption transmission process provided by the present invention is explained in detail according to an embodiment of the present invention with reference to fig. 1 to 3.
The invention provides a method for hiding and complementing data in data encryption transmission, which comprises the following steps:
the sending end adopts the password in the connection establishing process to process the original vector data H ═ H which needs to be encrypted and transmittedi}NObtaining a preliminary encryption vector H '═ H'i}N；
Wherein the content of the first and second substances,
Figure BDA0003018224330000153
n is the state number in the HMM model;
randomly giving a state transition matrix a ═ aij]N×NAnd observation result V ═ V1,v2,...,vNThe observation sequence O ═ O }1,o2,...oT(N-2) xN data in an observation probability matrix B, wherein N is the state number in the HMM model, and T is the length of an observation sequence;
setting the preliminary encryption vector H '{ H'i}NThe values of (a) are assigned to the values of N unknowns of the remaining 2 x N unknowns in the observation probability matrix B;
according to the random given initial state transition probability vector pi ═ (pi)i)NAnd a password randomly generated and stored in the connection establishing process is solved to obtain the values of the remaining N unknowns in the observation probability matrix B, so as to obtain the observation probability matrix B;
original data vector deletion processing is performed on the observation probability matrix B to obtain an observation probability matrix B ', B ═ B'j(k)]N×N；
Determining an HMM model λ '═ (a, B', (ii);
the transmitting end transmits the HMM model lambda '(A, B',) to the receiving end;
and after receiving the HMM model lambda '═ (A, B', 'n) at the receiving end, obtaining a missing preliminary encryption vector H' ═ H 'by using an HMM forward algorithm'i}N；
The receiving end decrypts according to the password stored in the connection establishing process to obtain the original data H ═ Hi}N；
And when the data transmission is finished, destroying all passwords and disconnecting the passwords.
Example 4
The communication process of the present invention is described in detail below with reference to fig. 1-3, according to an embodiment of the present invention.
The invention provides an identity authentication method in a connection establishment process, which comprises the following steps:
the server randomly generates a first HMM model, and generates a password K1 according to the first HMM model;
the server side sends the first HMM model to the client side;
the client generates a password K2 according to the received first HMM model;
the client generates a second HMM model according to the password K2 and sends the second HMM model to the server;
the server side obtains a password K3 according to the received second HMM model;
the server side judges whether the password K3 is the same as the password K1, and if so, connection is established; if not, the connection is not established, and the program is exited.
The method for authenticating the identity in the connection establishment process specifically comprises the following steps:
a client initiates a connection request;
upon receiving the connection request, the server randomly generates an observed state probability matrix B, an initial state transition probability vector ii, and an observed sequence O ═ { O } for a set NxN of state transition matrices A, NxM for the first HMM model λ 1 ═ (a, B, ii)1,o2,...oTN is in HMM modelThe number of states, T is the length of the observation sequence;
the server side generates a first HMM model lambda 1 ═ (A, B, pi) and an observation sequence O ═ { O ═ according to random1,o2,...oTGet the password K1(O | λ 1) and save by αT(i) Constructed vector Pα＝{αT(i)}N；
The server side sends the first HMM model lambda 1 to the client side (A, B and II);
after receiving the first HMM model λ 1 ═ a, B, ii, the client generates a password K2(O | λ 1) by using the forward algorithm according to the received first HMM model;
the client randomly generates a second HMM model lambda 2 (A2, B2 and pi 2) according to the password K2, and sends the second HMM model to the server;
after receiving the second HMM model, the server obtains a password K3 through the forward algorithm according to the second HMM model;
if the password K3 is different from the password K1, the authentication is not passed, connection is not established, and the IP address of the client is recorded; if the password K3 is the same as the password K1, the authentication is passed and the connection is established.
After the connection is established, the following data encryption transmission method is adopted for transmission, comprising the following steps,
after the connection is established, a sender carries out primary encryption on original data needing encryption transmission by using a password in the connection establishment process to obtain a result vector which is a solving result vector of a certain HMM model;
the sender reversely constructs a corresponding HMM model according to the result vector;
the sender sends the constructed HMM model to the receiving end;
the receiving end decrypts according to the received HMM model to obtain primary encrypted data;
the receiving end restores original data according to the password in the connection establishing process;
and when the data transmission is finished, destroying all passwords and disconnecting the passwords.
The data encryption transmission method specifically comprises the following steps:
the sending end adopts the password in the connection establishing process to process the original vector data D ═ D which needs to be encrypted and transmittedi}NObtaining a preliminary encryption vector D '═ D'i}N；
Wherein the content of the first and second substances,
Figure BDA0003018224330000171
n is the state number in the HMM model;
substituting vector P with preliminary encrypted data vectorαLet alphaT(i)＝d'i；
Wherein, PαIs composed of alphaT(i) Constructed vector, Pα＝{αT(i)}NRandomly generating and storing a password for the connection establishing process;
random given state transition matrix a ═ aij]N×NAnd observation result V ═ V1,v2,...,vNThe observation sequence O ═ O }1,o2,...oT(N-1) xN data in the observation probability matrix B, wherein N is the state number in the HMM model, and T is the length of an observation sequence;
according to the random given initial state transition probability vector pi ═ (pi)i)NAnd password P randomly generated and stored in connection establishment processα＝{αT(i)}NSolving to obtain N unknown values in the observation probability matrix B, and determining an HMM model lambda as (A, B and pi);
the transmitting end transmits the HMM model to the receiving end;
after receiving the HMM model, the receiving end obtains a primary encryption vector D ' ═ D ' by using an HMM forward algorithm 'i}N；
The receiving end decrypts according to the password saved in the connection establishing process to obtain the original data D ═ Di}N。
In the data encryption transmission, the data needing to be concealed and transmitted can be encrypted and transmitted by adopting a data hiding and complementing method, and the method specifically comprises the following steps:
the sending end carries out primary encryption on original data by using a password in the connection establishing process to obtain initial processing data;
randomly giving HMM model conditions, wherein in the given HMM model conditions, an observation probability matrix B contains 2N unknowns;
giving N unknowns of the observation probability matrix B by using initial processing data to obtain an observation probability matrix B containing N unknowns;
obtaining an observation probability matrix B without unknown numbers according to the password and given HMM model conditions;
removing initial processing data from the observation probability matrix B to serve as training data;
transmitting the training data to a receiving end;
the receiving end decrypts according to the received training data and the password to obtain original data;
and when the data transmission is finished, destroying all passwords and disconnecting the passwords.
The data hiding and complementing method specifically comprises the following steps:
the sending end adopts the password in the connection establishing process to process the original vector data H ═ H which needs to be encrypted and transmittedi}NObtaining a preliminary encryption vector H '═ H'i}N；
Wherein the content of the first and second substances,
Figure BDA0003018224330000181
n is the state number in the HMM model;
randomly giving a state transition matrix a ═ aij]N×NAnd observation result V ═ V1,v2,...,vNH, observation sequence O ═ O1,o2,...oTAnd (N-2) xN data in an observation probability matrix B, wherein N is the state number in an HMM model, and T is the length of an observation sequence;
setting the preliminary encryption vector H '{ H'i}NThe values of (a) are assigned to the values of N unknowns of the remaining 2 x N unknowns in the observation probability matrix B;
according to the random given initial state transition probability vector pi ═ (pi)i)NAnd connection establishment procedures randomizeThe stored passwords are formed, and the values of the remaining N unknowns in the observation probability matrix B are obtained through solving, so that the observation probability matrix B is obtained;
carrying out original data vector deletion processing on the observation probability matrix B to obtain an observation probability matrix B ', B' ═ B 'with N original data deleted'j(k)]N×N；
Determining an HMM model λ '═ (a, B', (ii);
the transmitting end transmits the HMM model lambda '(A, B',) to the receiving end;
and after receiving the HMM model lambda '═ (A, B', 'n) at the receiving end, obtaining a missing preliminary encryption vector H' ═ H 'by using an HMM forward algorithm'i}N；
The receiving end decrypts according to the password saved in the connection establishing process to obtain the original data H ═ Hi}N；
And when the data transmission is finished, destroying all passwords and disconnecting the passwords.
Randomly generating an observation sequence O ═ O by randomly taking values in the range of (1, N)1,o2,...oTAnd f, wherein N is the state number in the HMM model, and T is the observation sequence length.
In each matrix of the HMM model, the sum of rows and the sum of columns is greater than 1.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims (7)

1. A data hiding and complementing method in data transmission is characterized by comprising the following steps:
the sending end carries out primary encryption on original data by using a password generated according to a randomly generated HMM model and stored in the connection establishing process to obtain initial processing data;
randomly giving HMM model conditions, wherein in the given HMM model conditions, an observation probability matrix B contains 2N unknowns;
giving N unknowns of the observation probability matrix B by using initial processing data to obtain an observation probability matrix B containing N unknowns;
obtaining an observation probability matrix B without unknown numbers according to the password and the determined HMM model conditions in the connection establishing process;
removing initial processing data from an observation probability matrix B without unknown numbers to serve as training data;
transmitting the training data to a receiving end;
the receiving end decrypts according to the received training data and the password in the connection establishing process to obtain original data;
and when the data transmission is finished, destroying all passwords and disconnecting the passwords.
2. The method according to claim 1, wherein the password in the connection establishment process is a conditional probability of an HMM model generated randomly.
3. The method according to claim 2, further comprising the steps of:
the sending end adopts the password in the connection establishing process to process the original vector data H ═ H which needs to be encrypted and transmittedi}NTo obtain a preliminary encryption vector H '═ H'i}N；
Wherein, the first and the second end of the pipe are connected with each other,
Figure RE-FDA0003500993570000011
n is the state number in the HMM model; k3 is a password obtained by the server side according to the received HMM model sent by the client side in the connection establishment process;
randomly giving a state transition matrix a ═ aij]N×NAnd observation result V ═ V1,v2,...,vNThe observation sequence O ═ O }1,o2,...oTAnd (N) in the observed probability matrix B-2) × N data, T being the observation sequence length;
get primary encryption vector H '═ H'i}NThe values of (a) are assigned to the values of N unknowns of the remaining 2 x N unknowns in the observation probability matrix B;
according to the random given initial state transition probability vector pi ═ (pi)i)NAnd a password randomly generated and stored in the connection establishing process is solved to obtain the values of the remaining N unknowns in the observation probability matrix B, so as to obtain the observation probability matrix B;
carrying out original data vector deletion processing on the observation probability matrix B to obtain an observation probability matrix B ', B' ═ B 'with N original data deleted'j(k)]N×N；
Determining the HMM model λ '═ (a, B', Π);
the HMM model lambda 'is (A, B', pi) sent to the receiving end by the sending end;
after receiving the HMM model lambda ' ═ (A, B ', pi), the receiving end obtains the missing preliminary encryption vector H ' ═ H ' by using an HMM forward algorithm 'i}N；
The receiving end decrypts according to the password saved in the connection establishing process to obtain the original data H ═ Hi}N；
And when the data transmission is finished, destroying all passwords and disconnecting the passwords.
4. The method according to claim 3, wherein the observation sequence O { O } is randomly generated by randomly taking values in the range of (1, N)1,o2,...oTAnd f, wherein N is the state number in the HMM model, and T is the observation sequence length.
5. The method according to claim 1, wherein when the sender is a server, the server obtains initial processing data according to a password K3 received from the HMM model sent by the client during connection establishment, and when the sender is a client, the client obtains initial processing data according to a password K2 generated from the HMM model sent by the server during connection establishment.
6. The method according to claim 1, wherein the sum of rows and the sum of columns in each matrix of the HMM model is greater than 1.
7. A communication system, comprising a transmitting end and a receiving end, wherein the transmitting end and the receiving end use the data hiding and complementing method in data transmission according to any one of claims 1 to 6 to hide and complement data in data transmission.
CN202110394905.1A 2021-04-13 2021-04-13 Data hiding and complementing method in data transmission Active CN113206839B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110394905.1A CN113206839B (en) 2021-04-13 2021-04-13 Data hiding and complementing method in data transmission

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110394905.1A CN113206839B (en) 2021-04-13 2021-04-13 Data hiding and complementing method in data transmission

Publications (2)

Publication Number Publication Date
CN113206839A CN113206839A (en) 2021-08-03
CN113206839B true CN113206839B (en) 2022-05-20

Family

ID=77026722

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110394905.1A Active CN113206839B (en) 2021-04-13 2021-04-13 Data hiding and complementing method in data transmission

Country Status (1)

Country Link
CN (1) CN113206839B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109829289A (en) * 2019-01-09 2019-05-31 中国电子科技集团公司电子科学研究院 Password guess method
CN109918939A (en) * 2019-01-25 2019-06-21 东华大学 User query risk assessment and method for secret protection based on HMM

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8433893B2 (en) * 2011-03-30 2013-04-30 Mitsubishi Electric Research Laboratories, Inc. Privacy-preserving probabilistic inference based on hidden markov models
CN108024156B (en) * 2017-12-14 2020-04-14 四川大学 Partially reliable video transmission method based on hidden Markov model
CN111865961B (en) * 2020-07-15 2023-04-07 维沃移动通信有限公司 Data processing method and device and electronic equipment

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109829289A (en) * 2019-01-09 2019-05-31 中国电子科技集团公司电子科学研究院 Password guess method
CN109918939A (en) * 2019-01-25 2019-06-21 东华大学 User query risk assessment and method for secret protection based on HMM

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"一种面向加密流量的网络应用识别方法";孙中军等;《计算机工程》;20190815;第46卷(第4期);第151-156页 *

Also Published As

Publication number Publication date
CN113206839A (en) 2021-08-03

Similar Documents

Publication Publication Date Title
Mironov Hash functions: Theory, attacks, and applications
US10972263B2 (en) Single node multi-party encryption
US6125185A (en) System and method for encryption key generation
JP4774492B2 (en) Authentication system and remote distributed storage system
CN109543434B (en) Block chain information encryption method, decryption method, storage method and device
CN112989368A (en) Method and device for processing private data by combining multiple parties
CN111277412B (en) Data security sharing system and method based on block chain key distribution
CN107294696B (en) Method for distributing full homomorphic keys for Leveled
CN107241196A (en) Digital signature method and system based on block chain technology
US6769062B1 (en) Method and system of using an insecure crypto-accelerator
KR20210139344A (en) Methods and devices for performing data-driven activities
CN111917721A (en) Attribute encryption method based on block chain
CN110750796A (en) Encrypted data duplication removing method supporting public audit
WO2014030706A1 (en) Encrypted database system, client device and server, method and program for adding encrypted data
Tahir et al. A scheme for the generation of strong icmetrics based session key pairs for secure embedded system applications
CN113297619A (en) Mysql sensitive data protection system based on extensible precision double-chaos hash and RSA
CN113271293A (en) Verifiable constrained quadratic programming security outsourcing calculation method and system
Alawatugoda On the leakage-resilient key exchange
CN113206839B (en) Data hiding and complementing method in data transmission
CN113179159B (en) Data encryption transmission method
Kwon et al. Efficient and secure password-based authentication protocols against guessing attacks
CN113067705B (en) Method for identity authentication in connection establishment
CN113965320A (en) Ciphertext strategy attribute encryption method supporting quick revocation
CN104935582A (en) Big data storage method
CN115442102B (en) Equation test method based on SM9 algorithm

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