CN115828328A - Method, device, processor and storage medium for managing full life cycle of confidential unstructured data based on block chain in trusted environment - Google Patents
Method, device, processor and storage medium for managing full life cycle of confidential unstructured data based on block chain in trusted environment Download PDFInfo
- Publication number
- CN115828328A CN115828328A CN202211661698.2A CN202211661698A CN115828328A CN 115828328 A CN115828328 A CN 115828328A CN 202211661698 A CN202211661698 A CN 202211661698A CN 115828328 A CN115828328 A CN 115828328A
- Authority
- CN
- China
- Prior art keywords
- node
- consensus
- chain
- nodes
- life cycle
- 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.)
- Pending
Links
Images
Landscapes
- Storage Device Security (AREA)
Abstract
The invention relates to a block chain-based secret-related unstructured data full-life cycle management method in a trusted environment, wherein the method comprises the following steps: executing a full life cycle management process of applying, auditing, integrating and distributing the confidential documents through a document full life cycle management system; and through the consensus process and the strongly associated data structure of the whole file life cycle management chain participating in node maintenance and group cooperation, the data on the node chain is ensured to be consistent and cannot be repeatedly changed, and through the data hash stored on the verification chain, the data authenticity and the integrity of the file life cycle management system are ensured. The invention also relates to a corresponding device, a processor and a computer readable storage medium thereof. By adopting the block chain-based secret-related unstructured data full-life cycle management method, the device, the processor and the computer-readable storage medium thereof in the trusted environment, the stability and the safety of a block chain system can be improved on the premise of not reducing the fault tolerance of the system.
Description
Technical Field
The invention relates to the technical field of computer software, in particular to the technical field of unstructured data management and artificial intelligence, and specifically relates to a block chain-based secret-related unstructured data full-life-cycle management method, a block chain-based secret-related unstructured data full-life-cycle management device, a processor and a computer-readable storage medium thereof in a trusted environment.
Background
In a trusted environment, government departments, national enterprises and public institutions and even private enterprises pay more attention to the safety management of data. However, in the process of enterprise data storage and transmission, a plurality of data leakage phenomena exist, such as company data leakage caused by copying and taking away when personnel leave the job; some employees like to write some important matters on notepaper or a notebook so as to remind themselves, and the paper data are randomly placed on the workstation and are easy to see by others; data leakage may result if the computer device is taken for maintenance or lost; the insufficient recognition of the unit personnel on the importance of information safety can cause the data leakage of the security-related personnel in an unintentional way; key documents, confidential reports and the like in the enterprise do not have any encryption protection measures, so that employees can freely copy, store and copy file data.
Inside an enterprise, confidential information is often classified into different levels of secrecy, confidentiality, and privacy. At present, the authority division of the confidential information of most units is quite extensive and is difficult to be subdivided into corresponding individuals. Therefore, the uncontrolled control of the internal data and the document in the aspect of authority control can cause personnel without authority to obtain confidential information or personnel with low authority to obtain high confidential information. Enterprises have poor control on information release, and departments or staff individuals can release information to the outside at will; or between two or more cooperation units, because of frequent information interaction, the confidential information can also be leaked, so that personnel without authority of the cooperation party can obtain the confidential information. Even the confidential information flows out to a third party in a competitive relationship.
Therefore, it is necessary to adopt a reliable means to manage the full life cycle of the confidential unstructured data (hereinafter referred to as "file"), improve the file security protection policy, and prevent the leakage of important files inside enterprises.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a method, a device, a processor and a computer readable storage medium for managing a full life cycle of confidential unstructured data based on a block chain in a trusted environment.
In order to achieve the above object, the method, device, processor and computer readable storage medium for managing the full life cycle of the confidential unstructured data based on the block chain in the trusted environment of the present invention are as follows:
the method for managing the full life cycle of the confidential unstructured data based on the block chain in the trusted environment is mainly characterized by comprising the following steps: executing a full life cycle management process of applying, auditing, integrating and distributing the confidential documents through a document full life cycle management system; and through the consensus process of the whole participation node maintenance and group cooperation of the file full-life-cycle management chain and the strongly-associated data structure, the data on the node chain is ensured to be consistent and cannot be repeatedly changed, and meanwhile, the data authenticity and the integrity of the file full-life-cycle management system are ensured through the data hash stored on the verification chain.
Preferably, the file full life cycle management chain includes identity management design processing, specifically:
the method comprises the steps of adopting an open-source framework HyperLegend Fabric of a alliance chain, wherein a user obtains a digital identity through a public key infrastructure in the HyperLegend Fabric, converting a verifiable identity into a member of the Fabric network through a member management service module MSP, and verifying and authorizing an end user through the member management service module MSP to use the function of the Fabric network.
Preferably, the file full life cycle management chain includes an organization design process, specifically:
each service participant in the file full-life-cycle management system is regarded as an organization in the file full-life-cycle management chain, and the basic flow of the file full-life-cycle management mainly comprises four roles of a service system, a data processing center, a data maintenance center and a data exchange center and is responsible for maintaining the whole network and completing the work of application, verification, integration and distribution of confidential files.
Preferably, the file full-life-cycle management chain includes intelligent contract design processing, specifically:
the intelligent contract of the file full life cycle management chain is coded according to the business rules of the confidential files in the processes of application, approval, integration and distribution, the coded file is deployed in a Fabric network, and the programs which are agreed and operated by all nodes execute data inquiry or uplink storage operation by calling an Invoke method in the instantiation process after the intelligent contract is successfully installed.
Preferably, the intelligent contract includes performing on-chain data structure definition processing on the file full-life-cycle management chain, specifically:
the intelligent contract takes the confidential file ID, the confidential file category classification, the confidential file name and the current state of the confidential file as keys, takes other data as values, stores the keys to the block chain in a key value pair mode after coding, and generates all records related to the index by inquiring any field of the data.
Preferably, the intelligent closing specifically comprises the following processes in the execution process:
the first step is as follows: each organization in the command post is registered at MSP and registered with organization certification authority, and then data uplink or query request is initiated;
the second step is that: the software development kit constructs the request into a transaction proposal and sends the transaction proposal to a peer node of the endorsement, the peer node verifies the signature through MSP and determines whether the requester is authorized to execute the operation, and after the verification is successful, an intelligent contract is started to simulate and execute the transaction; if yes, inquiring a corresponding account book according to the transaction proposal content, and returning an inquiry result to the client after data is taken out;
the third step: if the operation is the uplink operation, the transaction and response information is returned to the SDK, the SDK is verified and packaged and then is broadcasted to the consensus network, and the order node sorts and packages the received transactions into blocks and broadcasts the blocks to all peer nodes of the same channel;
the fourth step: after receiving the block sent by the consensus network, the peer node verifies the transaction endorsement strategy, the block data and the transaction version number in the block;
the fifth step: after the peer node is verified, calling the intelligent contract;
and a sixth step: the peer node adds the block to a local block chain and modifies a K-V state database;
the seventh step: a transaction notification is sent to the client confirming whether the transaction was permanently appended to the chain.
Preferably, the file full-life-cycle management chain includes a consensus algorithm design process, specifically including the following processing steps:
(1) Starting processing, wherein nodes in the file full life cycle management chain send out applications for becoming consensus nodes to form an election node set M participating in election of the consensus nodes;
(2) Judging whether the period number j of the current node is less than or equal to 1, if not, entering the step (3), otherwise, entering the step (7);
(3) The updated node weight value W ij Sorting and judging the node weight value W ij Whether the sequence is less than or equal to Z-1, wherein Z is the scale number of the consensus nodes, if so, the step (4) is carried out, otherwise, the process is directly finished;
(4) Generating Z consensus nodes of a new consensus round, and weighting the Z consensus nodes by a node weight value W ij Starting a new consensus process by taking the largest node as a master node;
(5) After the consensus is finished, updating the node weight value W ij A number of epochs j +1;
(6) Judging whether the period number j is larger than the cycle number N set manually or not, if so, directly ending, otherwise, returning to the step (2);
(7) Numbering the nodes, and selecting Z consensus nodes in a starting stage by the supervision node according to the node credit value in the 1 st stage to start consensus processing;
(8) Sequencing the credit values of the nodes, judging whether the credit value of the current node is greater than 0 and whether the node number is positioned at the top 2, if so, entering the step (9), otherwise, directly ending;
(9) Numbering of consensus nodes CN i ((i =0,1, …, Z-1, and broadcasts a list of consensus node names CN 0 ，CN 1 ，…,CN Z-1 ；
(10) Said supervising node designating CN 0 A main node serving as a first-phase consensus node starts a consensus process in a starting phase;
(11) After the consensus is finished, updating the node weight value W through a dynamic node credit scoring mechanism ij 。
Preferably, the scale number Z of the common nodes in step (3) is determined according to the following calculation formula:
Z≥3(M*l)+1；
wherein M represents the number of nodes participating in competition with the common identification node in the file full life cycle management chain, and M belongs to N + ，N + For positive rational numbers, l represents the leakage rate of the file, f represents the number of malicious nodes, f =1,2, …,16, f ∈ N + Z represents the number of consensus nodes, and Z belongs to N + ；
At this time, the fault tolerance rate R of the file full life cycle management chain meets the following requirements:
preferably, initiating the consensus process comprises:
(a) Preliminary stage Pre-p:
the master node broadcasts a Pre-preparation phase message Pre-pp to each slave node i Wherein the expression of the pre-preparation phase message is shown as follows:
wherein the content of the first and second substances,
indicating a consensus node CN i Is sent to CN j The message of (a); pre-p denotes the Pre-preparation phase; h represents the block height; v is a view representing the set of correct node agreements; i represents consensus node number, i =0,1, …, Z-1; bh denotes the digest of Block, hb = Hash (Block), using the Hash function SHA-256; block represents a Block; vote represents the voting condition of the consensus node, wherein:
preferably, initiating the consensus process comprises:
(b) A preparation phase P:
each slave node receives the Pre-preparation stage broadcast message Pre-pir sent by the master node and judges the Pre-p sent by the master node i If it is correct, sending preparation stage message Pre to other nodes i The expression of the preparation phase message is shown in the following formula:
wherein, pre i Indicating the preparation phase message received by node i, each node receiving the preparation phase message Pre i I, construct preparation stage message vector
Meanwhile, a weight vector is constructed according to the node credit values obtained by the dynamic node credit value scoring mechanism
Wherein:
wherein w ij Representing the voting weight of the j stage node i; s ij Representing the credit value of the j-th node i; z represents the number of consensus nodes, and Z belongs to N + ；
The final consensus result was:
preferably, initiating the consensus process comprises:
(c) A confirmation stage C:
each slave node sends a broadcast message Com of the acknowledgement phase to the other nodes i The expression of the validation phase message is shown as follows:
wherein Com i Indicating the confirmation phase message received by the node i, each node receiving the confirmation phase message Com i Constructing an acknowledgment phase message vector
Meanwhile, a weight vector is constructed according to the node credit value obtained by the dynamic node credit value scoring mechanism
Wherein w ij Representing the voting weight of the j stage node i;
the final consensus result was:
preferably, initiating the consensus process comprises:
(d) And a weight updating stage:
after phase 1 consensus ends, the supervision node announces the processing state of the current file, and updates the weight w of the node voting weight according to a dynamic node credit value scoring mechanism ij * Forming updated weight vectors
Each node locally saves the updated weight list.
Preferably, if the consensus processing is completed at this stage, the expression of the message sent by the stage is changed to:
wherein, uw ij Representing an updated weight list held locally by the node,
representing a digital signature of the node.
Preferably, the consensus nodes are replaced once every 4 periods, the supervision node calculates and announces updated node credit values of all nodes, sorts the node credit values, simultaneously rejects the consensus nodes with the node credit values in the last 16 bits in the 4 periods, selects the node credit values of all the rest nodes except the consensus nodes selected in the last period from the 16 bits in the ranking order and the consensus nodes with the node credit values in the first (Z-16) bits in the last 4 periods as new consensus nodes, and selects the node with the highest credit value as a master node, so as to start the new consensus process.
This believe creates the environment and based on the full life cycle management device of secret-related unstructured data of block chain under, its key feature is, the device include:
a processor configured to execute computer-executable instructions;
and the memory stores one or more computer-executable instructions, and when the computer-executable instructions are executed by the processor, the steps of the block chain-based confidential unstructured data full-lifecycle management method in the trusted environment are realized.
The processor for block chain-based confidential unstructured data full-life cycle management in the trusted environment is mainly characterized in that the processor is configured to execute computer executable instructions, and when the computer executable instructions are executed by the processor, the steps of the block chain-based confidential unstructured data full-life cycle management method in the trusted environment are realized.
The computer readable storage medium is mainly characterized in that a computer program is stored thereon, and the computer program can be executed by a processor to realize the steps of the block chain-based confidential unstructured data full-life-cycle management method in the trusted environment.
By adopting the block chain-based full-life-cycle management method, the block chain-based full-life-cycle management device, the processor and the storage medium thereof, the full life cycle of the file is managed by adopting a block chain technology, and the whole-process supervision and credible traceability of the confidential file are ensured by storing information on the chain. Meanwhile, the consensus algorithm provided by the invention can improve the stability and the safety of the block chain system on the premise of not reducing the fault tolerance of the system.
Drawings
Fig. 1 is a logic flow diagram of the design of a consensus algorithm of a block chain-based secret-related unstructured data full-life cycle management method in a trusted environment.
Detailed Description
In order that the technical contents of the present invention can be more clearly described, the present invention will be further described with reference to specific embodiments.
Before describing in detail embodiments that are in accordance with the present invention, it should be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.
The method for managing the full life cycle of the confidential unstructured data based on the block chain in the trusted environment comprises the following steps: executing a full life cycle management process of applying, auditing, integrating and distributing the confidential documents through a document full life cycle management system; and through the consensus process of the whole participation node maintenance and group cooperation of the file full-life-cycle management chain and the strongly-associated data structure, the data on the node chain is ensured to be consistent and cannot be repeatedly changed, and meanwhile, the data authenticity and the integrity of the file full-life-cycle management system are ensured through the data hash stored on the verification chain.
As a preferred embodiment of the present invention, the file full-life-cycle management chain includes performing identity management design processing, specifically:
the method comprises the steps of adopting an open-source framework HyperLegend Fabric of a alliance chain, wherein a user obtains a digital identity through a public key infrastructure in the HyperLegend Fabric, converting a verifiable identity into a member of the Fabric network through a member management service module MSP, and verifying and authorizing an end user through the member management service module MSP to use the function of the Fabric network.
As a preferred embodiment of the present invention, the file full-life-cycle management chain includes an organization design process, specifically:
each service participant in the file full-life-cycle management system is regarded as an organization in the file full-life-cycle management chain, and the basic flow of the file full-life-cycle management mainly comprises four roles of a service system, a data processing center, a data maintenance center and a data exchange center and is responsible for maintaining the whole network and completing the work of application, verification, integration and distribution of confidential files.
As a preferred embodiment of the present invention, the file full-life-cycle management chain includes performing intelligent contract design processing, specifically:
the intelligent contract of the file full life cycle management chain is coded according to the business rules of the confidential files in the processes of application, approval, integration and distribution, the coded file is deployed in a Fabric network, and the programs which are agreed and operated by all nodes execute data inquiry or uplink storage operation by calling an Invoke method in the instantiation process after the intelligent contract is successfully installed.
As a preferred embodiment of the present invention, the intelligent contract includes a data structure definition process on the file full lifecycle management chain, specifically:
the intelligent contract takes the confidential file ID, the confidential file category classification, the confidential file name and the current state of the confidential file as keys, takes other data as values, stores the keys to a block chain in a key value pair mode after encoding, and generates all records related to the index by inquiring any field of the data.
As a preferred embodiment of the present invention, the intelligent agent specifically comprises the following processes in the implementation process:
the first step is as follows: each organization of the command post registers at MSP and uses organization certification authorization to register, and then initiates a data chain or inquiry request;
the second step is that: the software development kit constructs the request into a transaction proposal and sends the transaction proposal to a peer node of the endorsement, the peer node verifies the signature through MSP and determines whether the requester is authorized to execute the operation, and after the verification is successful, an intelligent contract is started to simulate and execute the transaction; if yes, inquiring a corresponding account book according to the transaction proposal content, and returning an inquiry result to the client after data is taken out;
the third step: if the operation is the uplink operation, the transaction and response information is returned to the SDK, the SDK is verified and packaged and then is broadcasted to the consensus network, and the order node sorts and packages the received transactions into blocks and broadcasts the blocks to all peer nodes of the same channel;
the fourth step: after receiving the block sent by the consensus network, the peer node verifies the transaction endorsement strategy, the block data and the transaction version number in the block;
the fifth step: after the peer node is verified, calling the intelligent contract;
and a sixth step: the peer node adds the block to a local block chain and modifies a K-V state database;
the seventh step: and sending a transaction notification client to confirm whether the transaction is permanently added to the chain.
As a preferred embodiment of the present invention, the file full-life-cycle management chain includes a consensus algorithm design process, specifically including the following processing steps:
(1) Starting processing, wherein nodes in the file full life cycle management chain send out applications for becoming consensus nodes to form an election node set M participating in election of the consensus nodes;
(2) Judging whether the period number j of the current node is less than or equal to 1, if not, entering the step (3), otherwise, entering the step (7);
(3) The updated node weight value W ij Sorting and judging the node weight value W ij Whether the sequence is less than or equal to Z-1, wherein Z is the scale number of the consensus nodes, if so, the step (4) is carried out, otherwise, the process is directly finished;
(4) Generating Z consensus nodes of a new consensus round, and weighting the Z consensus nodes by a node weight value W ij The largest node is used as a main node to start a new consensus process;
(5) After the consensus is finished, updating the node weight value W ij A number of epochs j +1;
(6) Judging whether the period number j is larger than the cycle number N set manually or not, if so, directly ending, otherwise, returning to the step (2);
(7) Numbering the nodes, and selecting Z consensus nodes in a starting stage by the supervision node according to the node credit value in the 1 st stage to start consensus processing;
(8) Sequencing the credit values of the nodes, judging whether the credit value of the current node is greater than 0 and whether the node number is positioned at the top 2, if so, entering the step (9), otherwise, directly ending;
(9) Numbering of consensus nodes CN i ((i =0,1, …, Z-1, and broadcasts a list of consensus node names CN 0 ，CN 1 ，…,CN Z-1 ；
(10) Said supervising node designating CN 0 A main node serving as a first-phase consensus node starts a consensus process in a starting phase;
(11) After the consensus is finished, updating the node weight value W through a dynamic node credit scoring mechanism ij 。
As a preferred embodiment of the present invention, in the step (3), the scale number Z of the common nodes is determined according to the following calculation formula:
Z≥3(M*l)+1；
wherein M represents the number of nodes participating in competition with the common identification node in the file full life cycle management chain, and M belongs to N + ，N + For positive rational numbers, l represents the leakage rate of the file, f represents the number of malicious nodes, f =1,2, …,16, f ∈ N + Z represents the number of consensus nodes, and Z belongs to N + ；
At this time, the fault tolerance rate R of the file full life cycle management chain meets the following requirements:
as a preferred embodiment of the present invention, initiating the consensus process comprises performing the following:
(a) Preliminary stage Pre-p:
the master node broadcasts a Pre-preparation phase message Pre-pp to each slave node i Wherein the expression of the pre-preparation phase message is shown as follows:
wherein the content of the first and second substances,
indicating a consensus node CN i Is sent to CN j The message of (2); pre-p denotes the Pre-preparation phase; h represents the block height; v is a view representing the set of correct node agreements; i represents consensus node number, i =0,1, …, Z-1; bh denotes the digest of Block, hb = Hash (Block), using the Hash function SHA-256; block represents a Block; vote represents the voting condition of the consensus node, wherein:
as a preferred embodiment of the present invention, initiating the consensus process comprises performing the following:
(b) A preparation phase P:
each slave node receives the broadcast message Pre-pir of the Pre-preparation stage sent by the master node and judges the Pre-p sent by the master node i If it is correct, sending preparation stage message Pre to other nodes i The expression of the preparation phase message is shown in the following formula:
wherein, pre i Indicating the preparation stage message received by the node i, each node according to the preparation stage received by the nodeMessage Pre i I, construct the prepare phase message vector
Meanwhile, a weight vector is constructed according to the node credit values obtained by the dynamic node credit value scoring mechanism
Wherein:
wherein, w ij Representing the voting weight of the j stage node i; s ij Representing the credit value of the j-th node i; z represents the number of consensus nodes, and Z belongs to N + ；
The final consensus result was:
in the dynamic node credit value scoring mechanism, S ij The credit value of the j-th node i is represented by the following formula:
wherein i represents the node numbered i, j represents the j-th stage, j =1,2, …, and j ∈ N + J' represents the number of times that the model identification result of the node in the previous j period is 0; k is a radical of ij Score of model recognition result representing j-th node i, S ij Representing the credit value of the j-th node i.
As a preferred embodiment of the present invention, initiating the consensus process comprises performing the following:
(c) A confirmation stage C:
each slave node sends a broadcast message Com of the acknowledgement phase to the other nodes i The expression of the validation phase message is shown as follows:
wherein Com i Indicating the confirmation phase message received by the node i, each node receiving the confirmation phase message Com according to the node i Constructing an acknowledgement phase message vector
Meanwhile, a weight vector is constructed according to the node credit value obtained by the dynamic node credit value scoring mechanism
Wherein w ij Representing the voting weight of the j stage node i;
the final consensus was:
as a preferred embodiment of the present invention, initiating the consensus process comprises performing the following:
(d) And a weight updating stage:
after phase 1 consensus ends, the supervision node announces the processing state of the current file, and updates the weight w of the node voting weight according to a dynamic node credit value scoring mechanism ij * Forming updated weight vectors
Each node locally saves the updated weight list.
As a preferred embodiment of the present invention, if the current stage completes the consensus process, the expression of the message sent by the stage is changed to:
wherein, uw ij Representing an updated weight list held locally by the node,
representing a digital signature of the node.
As a preferred embodiment of the present invention, the consensus nodes are replaced once every 4 periods, the supervision node calculates and announces updated node credit values of all nodes, sorts the node credit values, simultaneously rejects the consensus nodes with the node credit values in the last 4 periods located at the last 16 bits, selects the consensus nodes with the node credit values in the first 16 bits sorted and the consensus nodes with the node credit values in the last 4 periods located at the first (Z-16) bits from all the remaining nodes excluding the consensus nodes selected in the last period as the new consensus nodes, and selects the nodes with the highest credit values as the master nodes, thereby starting the new consensus process.
The technical scheme is explained in detail below, and the file full-life-cycle management system is composed of a file full-life-cycle management system and a file full-life-cycle management chain, wherein the file full-life-cycle management chain is realized by a federation chain network constructed by Hyperhedger Fabric. And a chain storage mode is adopted, namely the confidential file is stored in the file full life cycle management system, and the block chain stores the hash value and the chain storage position of the confidential file, so that the problem of capacity expandability of the block chain can be effectively solved, and the storage performance is improved.
The method comprises the following steps that a business participant executes full-life-cycle management processes such as application, audit, integration and distribution on confidential files through a file full-life-cycle management system, the file full-life-cycle management system sends data generated by each organization to a file full-life-cycle management chain, and the data on the node chain are ensured to be consistent and cannot be changed repeatedly through the consensus process of all participation nodes maintenance and group cooperation of the file full-life-cycle management chain and a strongly-associated data structure. The authenticity and the integrity of the data of the file full life cycle management system are ensured by verifying the hash of the data stored in the chain. The file full life cycle management system records the whole process from file generation to file destruction.
(1) Identity management design
The invention adopts an open source framework Hyperhedger Fabric of the alliance chain, and the Hyperhedger Fabric comprises the main characteristics of the alliance chain architecture in design. In the hyper-bridge Fabric, a user obtains a digital identity through Public Key In-front infrastructure (PKI), and then a Member Management Service (MSP) converts a verifiable identity into a Member of the Fabric network, and only an end user verified and authorized by the MSP module can use the function of the Fabric network.
(2) Tissue design
Each business participant in the file full lifecycle management system can be viewed as an organization in the file full lifecycle management chain. The basic process of file full life cycle management mainly comprises four roles of a service system, a data processing center, a data maintenance center and a data exchange center, and is responsible for maintaining the whole network and completing the work of application, verification, integration, distribution and the like of confidential files.
(3) Intelligent contract design
The intelligent contract of the file full life cycle management chain is coded according to business rules of the processes of confidential file application, approval, integration and distribution, is deployed in a Fabric network, and programs which are agreed and operated by all nodes execute data query or uplink storage operation by calling an Invoke method in the instantiation process after the intelligent contract is successfully installed.
In intelligent contracts, an on-chain data structure needs to be defined first.
The uplink data of the invention comprises an operation command, a security file ID, a timestamp, an operation user signature, a security file category classification, a security file name and a security file current state. The intelligent contract takes the ID, the category and the like of the confidential file as keys, takes other data as values, encodes the keys and stores the keys into a block chain in a key-value pair mode, and all records related to the index can appear when any field of the data is inquired.
The specific implementation process is as follows:
the first step is as follows: the authorities first register with the MSP and register with the organization authentication Authority (CA), and then initiate a data uplink or inquiry request.
The second step is that: a Software Development Kit (SDK) constructs the request as a transaction proposal. The transaction proposal is a request for calling the intelligent contract function to determine which data can be read or written into the ledger. The transaction proposal is then sent to the peer node of the endorsement. The peer node verifies the signature through the MSP and determines whether the requester is authorized to execute the operation, and after the verification is successful, the intelligent contract is started to simulate and execute the transaction. If yes, inquiring the corresponding account book according to the transaction proposal content, and returning the inquiry result to the client after taking out the data.
The third step: if the operation is the uplink operation, the transaction and response information is returned to the SDK, the SDK is verified and packaged and then broadcasted to the consensus network, and the order node sorts and packages the received transactions into blocks and broadcasts the blocks to all peer nodes in the same channel.
The fourth step: and the peer node verifies the transaction endorsement strategy, the block data and the transaction version number in the block after receiving the block sent by the consensus network.
The fifth step: and calling the intelligent contract after the peer node is verified.
And a sixth step: the peer node appends the tile to the local tile chain and modifies the K-V state database.
The seventh step: a transaction notification is sent to the client confirming whether the transaction was permanently appended to the chain.
(4) Consensus algorithm design
The invention provides an innovative consensus algorithm, the processing flow of which is shown in fig. 1:
1) Determining a number of consensus nodes
And determining the scale of the nodes participating in the election with the consensus nodes and the number of the consensus nodes in the file full-life-cycle management chain according to the number of participants processing the files in the service process. And sending out an application becoming a consensus node by the nodes in the file full life cycle management chain to form an election node set M participating in election of the consensus node.
In order to guarantee the safety of the consensus algorithm, nodes of a middle-upper leader in an enterprise tend to be selected as consensus nodes, and nodes of a post with large personnel flow are not selected as consensus nodes. However, due to some special situations, some malicious nodes are still regarded as normal nodes and are not identified, and may be selected as common nodes. The traditional Byzantine fault-tolerant algorithm requires that the number of malicious nodes in the consensus nodes cannot exceed 1/3 of the number of the consensus nodes, namely if the number of the malicious nodes in the consensus nodes is f, the number of normal nodes in the consensus nodes cannot be less than 2f + 1. Considering the worst condition, if malicious nodes in all election nodes participating in election of the consensus nodes in the file full-life-cycle management chain are all selected as the consensus nodes, and the fault tolerance rate of the system is not more than 33%, the scale of the consensus nodes is Z;
Z≥3(M*l)+1
and because the number of the common identification nodes in the file life-cycle management chain does not exceed 50, and the number of the malicious nodes in the file life-cycle management chain does not exceed 1/3, namely the number of the malicious nodes is 16, the worst case is also considered, the number of the nodes participating in the competition of the common identification nodes is:
wherein M represents the number of nodes participating in competition with the common identification node in the file full life cycle management chain, and M belongs to N + ，N + Is a positive rational number, l represents the leak rate of the file; f represents the number of malicious nodes, f =1,2, …,16,f e N + Z represents the number of the consensus nodes, and Z belongs to N + . At the moment, the fault tolerance rate R of the file full life cycle management chain meets the following requirements:
2) Initiating a consensus process
The supervising node randomly selects Z nodes from the nodes with the credit value of 1 as consensus nodes according to the credit value of the node in the 1 st period and numbers CN i (i＝0,1, …, Z-1), and specifies CN 0 As the master node of phase 1, the consensus process was started:
1. preliminary stage Pre-p:
the master node broadcasts a Pre-preparation phase message Pre-pp to each slave node i The expression of the pre-preparation phase message is shown as follows:
wherein
Indicating a consensus node CN i Is sent to CN j The message of (2); pre-p denotes the Pre-preparation phase; h represents the block height, the initial block height is 0, each increment of 1 unit, the block height is the unique identifier of the block; v represents a view, expresses a set of correct nodes which reach agreement, numbers are carried out from 0, when the master node is replaced, the view is switched to the next view (accounting round), and the number is increased by 1; i represents consensus node number, i =0,1, …, Z-1; bh denotes the digest of Block, hb = Hash (Block), using the Hash function SHA-256; block represents a Block; vote represents the voting condition of the consensus node, wherein:
2. a preparation phase P:
each slave node receives the Pre-preparation stage broadcast message Pre-pir sent by the master node and judges the Pre-p sent by the master node i If it is correct, sending preparation stage message Pre to other nodes i The expression of the preparation phase message is shown as follows:
wherein, pre i Represents the node i receivesThe nodes receive the preparation stage message Pre i I, construct the prepare phase message vector
Meanwhile, a weight vector is constructed according to the node credit values obtained by the dynamic node credit value scoring mechanism
Wherein:
wherein, w ij Representing the voting weight of the j stage node i; s ij Representing the credit value of the j-th node i; z represents the number of consensus nodes, and Z belongs to N + 。
The final consensus result was:
the PBFT consensus algorithm requires that the number of malicious nodes in the consensus node cannot exceed 1/3 of the number of the consensus nodes, that is, if the number of the malicious nodes in the consensus node is f, the number of normal nodes replying with correct messages in the consensus node cannot be less than 2f +1, so that achievement of consensus is guaranteed. Similarly, in the consensus algorithm provided by the present invention, if:
it indicates the weight of the node sending the correct message and that the consensus reaching condition is met, i.e. the consensus voting process of the segment is about to be entered.
However, if the slave node exceeding (2f +1/3f + 1) determines that the master node sends an incorrect preparation phase message confirmation order, a view switching process is triggered to replace the faulty master node, so as to ensure the security of consensus.
3. A confirmation stage C:
broadcast message Com for each slave node to send acknowledgement phase to other nodes i The expression of the validation phase message is shown as follows:
wherein Com i Indicating the confirmation phase message received by the node i, each node receiving the confirmation phase message Com according to the node i Constructing an acknowledgement phase message vector
Meanwhile, a weight vector is constructed according to the node credit values obtained by the dynamic node credit value scoring mechanism
Wherein w ij Indicating the voting weight of the j-th phase node i.
The final consensus result was:
similarly, in order to meet the fault tolerance requirement of the consensus algorithm provided by the invention, if:
the consensus is successful and the message sent by the master node is successfully written into the message list.
4. And a weight updating stage:
after the 1 st period, the supervision node announces the processing state of the current file, and updates the weight w of the node voting weight according to a dynamic node credit value scoring mechanism ij * Forming updated weight vectors
Each node locally saves the updated weight list.
3) General consensus Process
From the 2 nd stage, sequencing the Z consensus nodes according to the node voting weight calculated by the credit value of the node, selecting the consensus node with the highest credit value as a main node, and starting the consensus process: at this time, the consensus process of the four phases is basically the same as before, but the expression of the messages sent in the first 3 phases is changed:
wherein, uw ij Representing an updated weight list held locally by the node,
representing a digital signature of the node.
4) Consensus node replacement
The invention sets that the common identification node is changed every 4 periods, the supervision node calculates and announces updated node credit values of all nodes, sorts the nodes, eliminates the common identification node with the node credit value positioned at the 16 th position in the previous 4 periods, selects the node with the node credit values of all the rest nodes except the common identification node selected at the previous period and the common identification node with the node credit value positioned at the front (Z-16) position in the previous 4 periods as the new common identification node, and selects the node with the highest credit value as the main node. And after the change of the consensus node is finished, starting a new period of consensus again.
Secret-related unstructured data full-life-cycle management device based on block chains under the trusted environment, wherein the device comprises:
a processor configured to execute computer-executable instructions;
and the memory stores one or more computer-executable instructions, and when the computer-executable instructions are executed by the processor, the steps of the block chain-based confidential unstructured data full-lifecycle management method in the trusted environment are realized.
The processor is configured to execute computer-executable instructions, and when the computer-executable instructions are executed by the processor, the processor realizes the steps of the block chain-based confidential unstructured data full-life-cycle management method in the trusted environment.
The computer readable storage medium has a computer program stored thereon, and the computer program is executable by a processor to implement the steps of the method for managing a full lifecycle of confidential unstructured data based on a block chain in a trusted environment.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and alternate implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by suitable instruction execution devices.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, and the program may be stored in a computer readable storage medium, and when executed, the program includes one or a combination of the steps of the method embodiments.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.
In the description herein, references to the description of terms "an embodiment," "some embodiments," "an example," "a specific example," or "an embodiment," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.
By adopting the block chain-based full-life-cycle management method, the block chain-based full-life-cycle management device, the processor and the storage medium thereof, the full life cycle of the file is managed by adopting a block chain technology, and the whole-process supervision and credible traceability of the confidential file are ensured by storing information on the chain. Meanwhile, the consensus algorithm provided by the invention can improve the stability and the safety of the block chain system on the premise of not reducing the fault tolerance of the system.
In this specification, the invention has been described with reference to specific embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
Claims (17)
1. A full life cycle management method of secret-related unstructured data based on a block chain in a trusted environment is characterized by comprising the following steps: executing a full life cycle management process of applying, auditing, integrating and distributing the confidential documents through a document full life cycle management system; and through the consensus process of the whole participation node maintenance and group cooperation of the file full-life-cycle management chain and the strongly-associated data structure, the data on the node chain is ensured to be consistent and cannot be repeatedly changed, and meanwhile, the data authenticity and the integrity of the file full-life-cycle management system are ensured through the data hash stored on the verification chain.
2. The method for managing the full life cycle of the confidential unstructured data based on the block chain in the trusted environment according to claim 1, wherein the file full life cycle management chain comprises identity management design processing, specifically:
the method comprises the steps that an open-source frame HyperLegendr Fabric of a alliance chain is adopted, a user obtains digital identity through public key infrastructure, the verifiable identity is converted into a member of the Fabric network through a member management service module MSP, and the member management service module MSP verifies and authorizes the terminal user to use the function of the Fabric network.
3. The method for managing the full life cycle of the confidential unstructured data based on the block chain in the trusted environment according to claim 1, wherein the file full life cycle management chain comprises organization design processing, specifically:
each service participant in the file full-life-cycle management system is regarded as an organization in the file full-life-cycle management chain, and the basic flow of the file full-life-cycle management mainly comprises four roles of a service system, a data processing center, a data maintenance center and a data exchange center and is responsible for maintaining the whole network and completing the work of application, verification, integration and distribution of confidential files.
4. The method for managing the full life cycle of the confidential unstructured data based on the block chain in the trusted environment according to claim 3, wherein the file full life cycle management chain comprises intelligent contract design processing, specifically:
the intelligent contract of the file full life cycle management chain is coded according to the business rules of the confidential files in the processes of application, approval, integration and distribution, the coded file is deployed in a Fabric network, and the programs which are agreed and operated by all nodes execute data inquiry or uplink storage operation by calling an Invoke method in the instantiation process after the intelligent contract is successfully installed.
5. The method for managing the full life cycle of the confidential unstructured data based on the block chain in the trusted environment according to claim 4, wherein the intelligent contract includes a definition process of an on-chain data structure for the file full life cycle management chain, specifically:
the intelligent contract takes the confidential file ID, the confidential file category classification, the confidential file name and the current state of the confidential file as keys, takes other data as values, stores the keys to the block chain in a key value pair mode after coding, and generates all records related to the index by inquiring any field of the data.
6. The method according to claim 5, wherein the intelligent contract comprises the following steps:
the first step is as follows: each organization of the command post registers at MSP and uses organization certification authorization to register, and then initiates a data chain or inquiry request;
the second step is that: the software development toolkit constructs the request into a transaction proposal and sends the transaction proposal to a peer node of the endorsement, the peer node verifies the signature through MSP and determines whether the requester has the right to execute the operation, and after the verification is successful, an intelligent contract is started to simulate and execute the transaction; if yes, inquiring a corresponding account book according to the transaction proposal content, and returning an inquiry result to the client after data is taken out;
the third step: if the operation is the uplink operation, the transaction and response information is returned to the SDK, the SDK is verified and packaged and then is broadcasted to the consensus network, and the order node sorts and packages the received transactions into blocks and broadcasts the blocks to all peer nodes of the same channel;
the fourth step: after receiving the block sent by the consensus network, the peer node verifies the transaction endorsement strategy, the block data and the transaction version number in the block;
the fifth step: after the peer node is verified, calling the intelligent contract;
and a sixth step: the peer node adds the block to a local block chain and modifies a K-V state database;
seventh aspect of the invention the method comprises the following steps: a transaction notification is sent to the client confirming whether the transaction was permanently appended to the chain.
7. The method for managing the full life cycle of the confidential unstructured data based on the block chain in the trusted environment according to claim 1, wherein the file full life cycle management chain comprises a consensus algorithm design process, and specifically comprises the following processing steps:
(1) Starting processing, wherein nodes in the file full-life cycle management chain send out applications for becoming consensus nodes to form an election node set M participating in election of the consensus nodes;
(2) Judging whether the period number j of the current node is less than or equal to 1, if not, entering the step (3), otherwise, entering the step (7);
(3) The updated node weight value W ij Sorting and judging the node weight value W ij Whether the sequence is less than or equal to Z-1, wherein Z is the scale number of the consensus nodes, if so, the step (4) is carried out, otherwise, the process is directly finished;
(4) Generating Z consensus nodes of the new consensus wheel, and weighting the Z consensus nodes by using the node weight value W ij The largest node is used as a main node to start a new consensus process;
(5) After the consensus is finished, updating the node weight value W ij Number j + in the same period1；
(6) Judging whether the period number j is larger than the cycle number N set manually or not, if so, directly ending, otherwise, returning to the step (2);
(7) Numbering the nodes, and selecting Z consensus nodes in a starting stage by the supervision node according to the node credit value in the 1 st stage to start consensus processing;
(8) Sequencing the credit values of the nodes, judging whether the credit value of the current node is greater than 0 and whether the node number is positioned at the top 2, if so, entering the step (9), otherwise, directly ending;
(9) Numbering of consensus nodes CN i ((i =0,1, …, Z-1, and broadcasts a list of consensus node names CN 0 ，CN 1 ，…,CN Z-1 ；
(10) Said supervising node designating CN 0 A main node serving as a first-phase consensus node starts a consensus process in a starting phase;
(11) After the consensus is finished, updating the node weight value W through a dynamic node credit scoring mechanism ij 。
8. The method for managing the full life cycle of the dense unstructured data based on the block chain in the trusted environment according to claim 7, wherein the scale number Z of the common node in the step (3) is determined according to the following calculation formula:
Z≥3(M*l)+1；
wherein M represents the number of nodes participating in competition with the common identification node in the file full life cycle management chain, and M belongs to N + ，N + For positive rational numbers, l represents the leakage rate of the file, f represents the number of malicious nodes, f =1,2, …,16, f ∈ N + Z represents the number of the consensus nodes, and Z belongs to N + ；
At this time, the fault tolerance rate R of the file full life cycle management chain meets the following requirements:
9. the method according to claim 7, wherein starting the consensus process comprises:
(a) Preliminary stage Pre-p:
the master node broadcasts a Pre-preparation phase message Pre-pp to each slave node i Wherein the expression of the pre-preparation phase message is shown as follows:
wherein the content of the first and second substances,
indicating a consensus node CN i Is sent to CN j The message of (2); pre-p denotes the Pre-preparation phase; h represents the block height; v is a view representing the set of correct node agreements; i represents consensus node number, i =0,1, …, Z-1; bh denotes the digest of Block, hb = Hash (Block), using the Hash function SHA-256; block represents a Block; vote represents the voting condition of the consensus node, wherein:
10. the method for managing the full life cycle of the confidential unstructured data based on the block chain in the trusted environment as claimed in claim 9, wherein the starting of the consensus process comprises the following steps:
(b) A preparation phase P:
each slave node receives the master nodeSending Pre-preparation phase broadcast message Pre-pir, and judging Pre-p sent by main node i If it is correct, sending preparation stage message Pre to other nodes i The expression of the preparation phase message is shown as follows:
wherein, pre i Indicating the preparation stage message received by the node i, each node receiving the preparation stage message Pre i I, construct preparation stage message vector
Meanwhile, a weight vector is constructed according to the node credit value obtained by the dynamic node credit value scoring mechanism
Wherein:
wherein, w ij Representing the voting weight of the j stage node i; s ij Representing the credit value of the j-th node i; z represents the number of consensus nodes, and Z belongs to N + ；
The final consensus result was:
11. the method according to claim 10, wherein starting the consensus process comprises:
(c) A confirmation stage C:
each slave node sends a broadcast message Com of the acknowledgement phase to the other nodes i The expression of the validation phase message is shown as follows:
wherein Com i Indicating the confirmation phase message received by the node i, each node receiving the confirmation phase message Com i Constructing an acknowledgement phase message vector
Meanwhile, a weight vector is constructed according to the node credit values obtained by the dynamic node credit value scoring mechanism
Wherein w ij Representing the voting weight of the j stage node i;
the final consensus result was:
12. the method according to claim 11, wherein starting the consensus process comprises:
(d) And a weight updating stage:
after phase 1 consensus ends, the supervision node announces the processing state of the current file, and updates the weight w of the node voting weight according to a dynamic node credit value scoring mechanism ij * Forming updated weight vectors
Each node locally saves the updated weight list.
13. The method for managing the full lifecycle of the confidential unstructured data based on the block chain under the trusted environment according to any one of claims 9 to 11, wherein if the consensus processing is completed at the current stage, the expression of the message sent by the method is changed to:
wherein, uw ij Representing an updated weight list held locally by the node,
representing a digital signature of the node.
14. The method as claimed in any one of claims 7 to 12, wherein the consensus node is replaced once every 4 th period, the supervision node calculates and advertises updated node credit values of all nodes, sorts, eliminates the consensus node whose node credit value is 16 bits later in the previous 4 th period, selects the consensus node whose node credit value is 16 bits earlier in the ranking and the consensus node whose node credit value is (Z-16) bits earlier in the previous 4 th period except all the remaining nodes of the consensus node selected in the previous period as the new round of consensus node, and selects the node with the highest credit value as the master node, thereby starting the new period consensus process.
15. A confidential unstructured data full life cycle management device based on a block chain in a trusted environment is characterized by comprising:
a processor configured to execute computer-executable instructions;
a memory storing one or more computer-executable instructions that, when executed by the processor, perform the steps of the block-chain-based confidential unstructured data full lifecycle management method in a trusted environment according to any of claims 1 to 12.
16. A processor for block-chain-based confidential unstructured data full-lifecycle management in a trusted environment, the processor being configured to execute computer-executable instructions, which, when executed by the processor, implement the steps of the block-chain-based confidential unstructured data full-lifecycle management method in the trusted environment according to any one of claims 1 to 12.
17. A computer-readable storage medium, having stored thereon a computer program, the computer program being executable by a processor to perform the steps of the block-chain-based method for full lifecycle management of dense unstructured data in a trusted environment according to any of the claims 1 to 12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211661698.2A CN115828328A (en) | 2022-12-23 | 2022-12-23 | Method, device, processor and storage medium for managing full life cycle of confidential unstructured data based on block chain in trusted environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211661698.2A CN115828328A (en) | 2022-12-23 | 2022-12-23 | Method, device, processor and storage medium for managing full life cycle of confidential unstructured data based on block chain in trusted environment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115828328A true CN115828328A (en) | 2023-03-21 |
Family
ID=85517891
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211661698.2A Pending CN115828328A (en) | 2022-12-23 | 2022-12-23 | Method, device, processor and storage medium for managing full life cycle of confidential unstructured data based on block chain in trusted environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115828328A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116170162A (en) * | 2023-04-26 | 2023-05-26 | 湖南天河国云科技有限公司 | Selective consensus method, computer storage medium, and terminal device |
-
2022
- 2022-12-23 CN CN202211661698.2A patent/CN115828328A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116170162A (en) * | 2023-04-26 | 2023-05-26 | 湖南天河国云科技有限公司 | Selective consensus method, computer storage medium, and terminal device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110771095B (en) | System and method for implementing blockchain-based digital certificates | |
| CN109040271B (en) | Network equipment integrity protection method under distributed environment | |
| EP3491572B1 (en) | Method for controlling access to a shared resource | |
| CN110800254B (en) | System and method for generating digital signature | |
| CN115210741B (en) | Partially ordered blockchain | |
| CN109766673A (en) | A kind of alliance's formula audio-video copyright block catenary system and audio-video copyright cochain method | |
| CN111144881A (en) | Selective access to asset transfer data | |
| CN111598566A (en) | Network payment system based on mixed cross-chain | |
| CN112241919B (en) | Multi-domain blockchain network with data flow control | |
| CN114128214B (en) | Security layer for configuring blockchains | |
| US11775556B2 (en) | Faster view change for blockchain | |
| CN112154434A (en) | Automatic data projection of intelligent contract groups on blockchains | |
| AU2021273375B2 (en) | Cross-network identity provisioning | |
| CN114450708A (en) | Chain code recommendation based on existing chain codes | |
| Yan et al. | Blockchain based digital evidence chain of custody | |
| CN116941265A (en) | Blockchain network identity management using SSI | |
| CN112749417A (en) | Electronic academic certificate data protection and sharing system based on block chain | |
| Xu et al. | Trusted and flexible electronic certificate catalog sharing system based on consortium blockchain | |
| CN115828328A (en) | Method, device, processor and storage medium for managing full life cycle of confidential unstructured data based on block chain in trusted environment | |
| Zhu et al. | A study on the challenges and solutions of blockchain interoperability | |
| CN111091486B (en) | Block chain-based unified method for distributed government architecture | |
| CN112950180A (en) | Community certificate method and system based on alliance chain, electronic device and storage medium | |
| Ibor et al. | A conceptual framework for augmenting the security of digitized academic records in Nigerian tertiary institutions using blockchain technology | |
| CN112906069B (en) | Trusted computing method for blockchain registration management process | |
| WO2024082818A1 (en) | Multi-blockchain-based cross-chain processing method and apparatus, and device, system and medium |
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 |