Verification method for cloud cluster scheduling storage information based on block chainTechnical Field
The invention relates to a verification method of cloud cluster scheduling storage information based on a block chain, and belongs to the technical field of block chains.
Background
In recent years, with the development of network technology, the scale and the number of concurrent tasks of the internet have proliferated. The centralized resource management mode and the distributed task execution mode also bring new security problems. The actions of stealing user privacy, tampering data information and even disturbing the scheduling of cloud cluster resources frequently happen, the traditional recording cluster system of cloud computing is very easy and tampered, and once a central server is attacked, the reliability and the safety of the system face crisis. Therefore, how to improve the security and reliability of blockchain information storage and skip is a great issue in the current blockchain development.
Disclosure of Invention
The invention aims to overcome the problems in the prior art and provide a verification method of cloud cluster scheduling storage information based on a block chain, which can improve the safety and reliability of a system and provide durable availability data.
The invention discloses a verification method of cloud cluster scheduling storage information based on a block chain, which comprises the following steps:
The scheduling information storage method specifically comprises the following steps:
A1: judging whether a blockchain network exists, if so, directly entering A2, and if not, entering A2 after compiling and creating the blockchain network;
A2: acquiring scheduling log data from a control center;
a3: carrying out hash processing on the dispatching log data to obtain a hash value;
A4: packaging and sending the scheduling log data to an endorsing node for endorsing;
A5: verifying whether the transaction is legal or not, if so, broadcasting the transaction to the whole network, and storing the transaction into a block chain to obtain a block hash value and transaction time; if not, directly ending the flow;
b: the tracing verification of the scheduling information specifically comprises the following steps:
b1: acquiring original log data from a local database;
B2: carrying out hash processing on the original log data, wherein the hash processing is the same as that of the step A3;
b3: tracing to a corresponding block in a block chain through a block hash value and transaction time obtained when the log data are stored, and obtaining block data;
b4: comparing the block data with the data hash value in the local database, if the data is consistent, the information in the database is not tampered, and if the data is inconsistent, the data is tampered.
Further, the step A1 specifically includes the following steps:
A1.1: creating an creation module;
a1.2: creating a blockchain network;
A1.3: the blockchain network is joined by authentication.
Further, the method for storing the scheduling information is distributed storage; the original log data in the local database comprises original data acquired from a cloud cluster and data access information of the local database.
Further, the step A3 specifically includes the following steps:
A3.1: transaction fragmentation:
1) Digitizing the log data T and converting the log data T into decimal numbers X;
2) Constructing trapdoor parameters (k, t) according to the block chain link point information, wherein t is the total number of transaction fragments, and k is the total number t of k fragments required to be obtained during verification, so that the original transaction can be recovered; i.e.
3) Fragmenting the message by using trapdoor hash algorithm: constructing a t-1 polynomial:
f (x) =x+a1x1+a2x2+…+a(t-1)x(t-1) mod (p), where p is a prime number and satisfies p > max (xmax,t),xmax＝max(xi), 1.ltoreq.i.ltoreq.k-1;
Randomly selecting t numbers to be brought into the polynomial to obtain fragment information (xi,yi) of t groups of transactions;
A3.2: the method comprises the steps of combining transaction fragment information (xi,yi) and converting the combined fragment information into a hash value formed by four tuples;
A3.3: and obtaining the common abstract of the t groups of transaction fragments.
Further, the endorsement node is a Peer node.
Further, the transaction information in step A5 is a summary of log data.
The beneficial effects of the invention are as follows:
By means of the slicing preprocessing of the data and the on-chain storage of the message digest obtained through the hash collision, the storage pressure of the block chain can be reduced, and the credibility and verifiability of the log message are ensured. Through the storage of the trapdoor hash function result by the block chain, the non-tamperable and auditable characteristics of the result can be ensured.
Drawings
FIG. 1 is a flow chart of scheduling information storage in a blockchain-based verification method of cloud cluster scheduling storage information;
FIG. 2 is a flow chart of scheduling information verification in a blockchain-based verification method of cloud cluster scheduling storage information.
Detailed Description
The invention will now be described in further detail with reference to the accompanying drawings. The drawings are simplified schematic representations which merely illustrate the basic structure of the invention and therefore show only the structures which are relevant to the invention.
The invention discloses a verification method of cloud cluster scheduling storage information based on a block chain, which comprises the following steps:
As shown in fig. 1, the a scheduling information storage specifically includes the following steps:
A1: judging whether a blockchain network exists, if so, directly entering A2, and if not, entering A2 after compiling and creating the blockchain network; the method for storing the scheduling information is distributed storage; the original log data in the local database comprises original data acquired from a cloud cluster and data access information of the local database.
When there is no blockchain network, step A1 specifically includes the following steps:
A1.1: creating an creation module;
a1.2: creating a blockchain network;
A1.3: the blockchain network is joined by authentication.
A2: acquiring scheduling log data from a control center;
a3: carrying out hash processing on the dispatching log data to obtain a hash value;
the step A3 specifically comprises the following steps:
A3.1: transaction fragmentation:
1) Digitizing the log data T and converting the log data T into decimal numbers X;
2) Constructing trapdoor parameters (k, t) according to the block chain link point information, wherein t is the total number of transaction fragments, and k is the total number t of k fragments required to be obtained during verification, so that the original transaction can be recovered; i.e.
3) Fragmenting the message by using trapdoor hash algorithm: constructing a t-1 polynomial:
F (X) =X+a1x1+a2x2+…+a(t-1)x(t-1) mod (p), where p is a prime number and satisfies p > max (Xmax,t),xmax＝max(xi), 1.ltoreq.i.ltoreq.k-1;
Randomly selecting t numbers to be brought into the polynomial to obtain fragment information (xi,yi) of t groups of transactions;
A3.2: the method comprises the steps of combining transaction fragment information (xi,yi) and converting the combined fragment information into a hash value formed by four tuples;
A3.3: and obtaining the common abstract of the t groups of transaction fragments.
A4: packaging and sending the scheduling log data to an endorsing node for endorsing; the endorsement node is a Peer node.
A5: verifying whether the transaction is legal or not, if so, broadcasting the transaction to the whole network, and storing the transaction into a block chain to obtain a block hash value and transaction time; if not, directly ending the flow; the transaction information described in step A5 is only a summary of the log data.
As shown in fig. 2, B: the tracing verification of the scheduling information specifically comprises the following steps:
b1: acquiring original log data from a local database;
B2: carrying out hash processing on the original log data, wherein the hash processing is the same as that of the step A3;
b3: tracing to a corresponding block in a block chain through a block hash value and transaction time obtained when the log data are stored, and obtaining block data;
b4: comparing the block data with the data hash value in the local database, if the data is consistent, the information in the database is not tampered, and if the data is inconsistent, the data is tampered.
By means of the slicing preprocessing of the data and the on-chain storage of the message digest obtained through the hash collision, the storage pressure of the block chain can be reduced, and the credibility and verifiability of the log message are ensured. Through the storage of the trapdoor hash function result by the block chain, the non-tamperable and auditable characteristics of the result can be ensured.
The data storage of the blockchain is public and transparent in the blockchain network, the uplink transaction of the invention is only the abstract of the log information, and the algorithm meets the characteristic of semantic security. The privacy of the log data is improved.
Compared with the traditional data storage, the on-chain storage space is less than 1/k of the original data storage space, and the storage and consensus process of the block chain is convenient. In actual operation, node calculation and communication cost can be reduced, and the model can be better applied to a large-scale data service scene mainly comprising sensitive data.
With the above-described preferred embodiments according to the present invention as an illustration, the above-described descriptions can be used by persons skilled in the relevant art to make various changes and modifications without departing from the scope of the technical idea of the present invention. The technical scope of the present invention is not limited to the description, but must be determined according to the scope of claims.