CN113554421A - Police affair resource data governance cooperation method based on block chain - Google Patents

Police affair resource data governance cooperation method based on block chain Download PDF

Info

Publication number
CN113554421A
CN113554421A CN202111085205.0A CN202111085205A CN113554421A CN 113554421 A CN113554421 A CN 113554421A CN 202111085205 A CN202111085205 A CN 202111085205A CN 113554421 A CN113554421 A CN 113554421A
Authority
CN
China
Prior art keywords
data
block
block chain
user
chain
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
Application number
CN202111085205.0A
Other languages
Chinese (zh)
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.)
Nanjing Fiberhome Telecommunication Technologies Co ltd
Original Assignee
Nanjing Fiberhome Telecommunication 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 Nanjing Fiberhome Telecommunication Technologies Co ltd filed Critical Nanjing Fiberhome Telecommunication Technologies Co ltd
Priority to CN202111085205.0A priority Critical patent/CN113554421A/en
Publication of CN113554421A publication Critical patent/CN113554421A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/10Office automation; Time management
    • G06Q10/103Workflow collaboration or project management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • G06Q50/26Government or public services

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Tourism & Hospitality (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Educational Administration (AREA)
  • Primary Health Care (AREA)
  • Computing Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Development Economics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Health & Medical Sciences (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Storage Device Security (AREA)

Abstract

The invention discloses a police service resource data governance cooperation method based on a block chain, belongs to the technical field of block chain cross-chain data cooperation technology and application of police service data management in the block chain technology, and applies the characteristics of block chain multi-party cooperation, safety, credibility and the like to the construction of data standards, the guarantee of data safety and the control of a data sharing process. On the basis of realizing comprehensive collection of police resource data, a case network is built and integrated by using technical characteristics such as a block chain distributed account book and public and private key encryption, a service data standard commonly recognized by each public security department is built, a cross-department service scene is built by means of an intelligent contract, and cross-department service collaboration is supported efficiently.

Description

Police affair resource data governance cooperation method based on block chain
Technical Field
The invention belongs to the technical field of application of a block chain cross-chain data cooperation technology and police service data management in the block chain technology, and particularly relates to a police service resource data governance cooperation method based on a block chain.
Background
With the continuous improvement of informatization level, a public security department generates, collects and stores a large amount of police resource data in the case processing process. The branch mechanisms of the public security industry are numerous, the informatization levels of all the mechanisms are different, the mechanisms are difficult to organically combine with other departments, the information is easily collected and updated untimely and inaccurate in the working processes of police service resource data generation, transmission, processing, storage and the like, common knowledge cannot be formed among all the departments for the co-construction and sharing modes of case resources, and cross-department and cross-hierarchy information transmission and data sharing are still difficult to realize.
The problem faced by current police resource data is summarized in three aspects: 1. the data security problem and the data tampering problem are solved, and in the system, if data extraction personnel, system administrators and database management personnel are communicated in series, some data in the database are tampered, so that the credibility of the data in the database is seriously influenced. 2. The problem of expansibility of the data convergence platform is that when a new subject mechanism or system needs to submit data to the sharing platform, complex adaptation work needs to be performed. 3. After the data are gathered, whether the data are used in a specified range or not and whether the data are illegally used or not are judged, and higher requirements are put forward on a management method and a management tool of a police resource data management department.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a police service resource data governance cooperative method based on a block chain aiming at the defects of the background technology, wherein the characteristics of multi-party cooperation, safety, credibility and the like of the block chain are applied to the construction of a data standard, the guarantee of data safety and the control of a data sharing process; on the basis of realizing comprehensive collection of police resource data, a case network is built and integrated by using technical characteristics such as a block chain distributed account book and public and private key encryption, a service data standard commonly recognized by each public security department is built, a cross-department service scene is built by means of an intelligent contract, cross-department service collaboration is efficiently supported through practice, and the method has a very good advantage for realizing police resource data sharing and case service collaboration based on the characteristics of non-falsification, decentralization, data encryption and trust transfer of a block chain technology.
The invention adopts the following technical scheme for solving the technical problems:
a police service resource data governance cooperative method based on a block chain specifically comprises the following steps:
step 1, constructing a case data quality collaborative model based on a block chain: through governing model structure, method, flow and number
Introducing an anti-tampering technology according to sharing and access control, data updating and intelligent contracts to achieve a governing target based on the characteristics of a regional chain distributed account book, an encryption algorithm and a consensus mechanism;
step 2, establishing a multi-party cooperation standard: implementing complexities by establishing rule-based data and standardized intelligent contracts
Each record of the business logic industry standard library chain is orderly linked from the back to the front, and the method is safe and stable, cannot be tampered and can be traced;
step 3, the intelligent contract forms a solidified transparent service: performing solidified transparent business logic by means of intelligent contracts
Performing hard core control on data standards and operation flows of various services, and storing service data through intelligent cooperation, thereby effectively avoiding service conflicts caused by problems of management modes, rule changes, system upgrading and the like among departments;
step 4, the multi-partition user authorization mechanism guarantees privacy security: user information authorization for realizing transactor and business management and business
Unified configuration management is provided for service data items, protocol management, protocol content management, authorization modes, electronic approval process management, cloud storage encryption and the like;
and 5, finishing the cooperative treatment of the block chain data.
As a further preferable scheme of the police service resource data governance collaborative method based on the block chain, in step 1, a tamper-proof technology is introduced, specifically as follows:
attackerFirst before attempting to tamper with the newest block
Figure 172314DEST_PATH_IMAGE001
For the data of the block, an attacker needs to modify the hash value of the block and recalculate the hash values of all the blocks; setting the current full-network honesty node computing power to be per second
Figure 27137DEST_PATH_IMAGE002
Calculating the secondary hash value, wherein the block hash value under the current calculation difficulty contains
Figure 508672DEST_PATH_IMAGE003
A prefix binary 0; the attacker is newly added computing power with the magnitude of computing power per second
Figure 841564DEST_PATH_IMAGE004
Calculating a secondary hash value; if no new node participates, the probability that the honest node obtains a new block in each second is
Figure 124778DEST_PATH_IMAGE005
The probability of an attacker obtaining a new block is
Figure 150503DEST_PATH_IMAGE006
(ii) a Initial height difference between attacker and honest node
Figure 886378DEST_PATH_IMAGE007
Is provided with
Figure 819699DEST_PATH_IMAGE008
Is as follows
Figure 534583DEST_PATH_IMAGE009
Height difference of second, height difference
Figure 731209DEST_PATH_IMAGE010
The probability of change per second is divided into 3 cases:
event(s)
Figure 954380DEST_PATH_IMAGE011
: if the attacker does not generate a block, the honest node generates a block,
Figure 399049DEST_PATH_IMAGE012
plus 1, probability
Figure 391275DEST_PATH_IMAGE013
Event(s)
Figure 289961DEST_PATH_IMAGE014
: if the attacker does not generate a block, the honest node generates a block,
Figure 141374DEST_PATH_IMAGE015
minus 1, probability
Figure 383874DEST_PATH_IMAGE016
Event(s)
Figure 230607DEST_PATH_IMAGE017
: if the attacker does not generate a block, the honest node generates a block,
Figure 769036DEST_PATH_IMAGE015
invariance, probability
Figure 701220DEST_PATH_IMAGE018
The height difference per second
Figure 248876DEST_PATH_IMAGE019
The variation probability distribution of (a) conforms to a plurality of distributions:
Figure 481274DEST_PATH_IMAGE020
when in use
Figure 721763DEST_PATH_IMAGE021
The attacker successfully pursues honestyThe node issues the block chain, and the data is successfully tampered;
in that
Figure 406822DEST_PATH_IMAGE022
Within a second, will appear
Figure 256704DEST_PATH_IMAGE022
Event of secondary altitude change, device
Figure 343609DEST_PATH_IMAGE023
Is composed of
Figure 754998DEST_PATH_IMAGE024
The number of occurrences; when the tampering is successful, the user may,
Figure 927354DEST_PATH_IMAGE025
at least take place
Figure 551233DEST_PATH_IMAGE026
Then, set
Figure 492644DEST_PATH_IMAGE027
Is an event
Figure 74935DEST_PATH_IMAGE028
The difference between the actual number of occurrences and the minimum number of occurrences, then
Figure 469008DEST_PATH_IMAGE028
The actual number of occurrences is
Figure 427736DEST_PATH_IMAGE029
Figure 191031DEST_PATH_IMAGE030
The number of occurrences is based on the number of occurrences of the first two, and is
Figure 944223DEST_PATH_IMAGE031
Wherein, in the step (A),
Figure 825591DEST_PATH_IMAGE032
then is at
Figure 588011DEST_PATH_IMAGE033
Within seconds, the probability of an attacker pursuing honest nodes is as follows:
Figure 238435DEST_PATH_IMAGE034
obtaining the probability of successful tampering block data of an attacker according to a formula and the depth of the tampered block
Figure 896950DEST_PATH_IMAGE001
The increase in (c) is lower and lower.
As a further preferable scheme of the coordination method for police service resource data governance based on the block chain, the step 2 is specifically divided into two stages:
the first stage is outside the chain, and consists of an identity authentication module, a right management module and a supervision management module, and is used for verifying the user state, giving rewards to the user and supervising the user behavior;
the second stage is in the chain, which is composed of industry standard library chains, wherein each industry standard library chain is used for storing and reading police service resource data information of the industry standard library chain; and the user is verified to be a registered user through the identity authentication module, and the registered user carries out interaction between the first stage and the second stage by calling the intelligent contract.
As a further preferable scheme of the block chain-based police service resource data governance collaborative method of the present invention, a block chain-based police service resource data standard co-construction management algorithm and process are as follows:
step 2.1, the police service resource data demander submits a registration application, and the identity of the police service resource data demander is verified through an identity authentication module to obtain a corresponding return state, wherein the police service resource data demander becomes a registered user if the registration is successful, and otherwise the police service resource data demander fails to register;
step 2.2, the data demander has corresponding integral information through the authority management module;
step 2.3, the data demander has corresponding supervision information through a supervision management module;
step 2.4, the data demander calls an intelligent contract to apply, inquire and clone the data standard;
and 2.5, automatically completing corresponding operation by the police service resource data standard library chain by means of an intelligent contract.
As a further preferable scheme of the police service resource data governance collaborative method based on the block chain, in step 3, the storage of contract codes and states by the block chain guarantees the reliability and observability of contract storage, an intelligent contract is a code stored on the block chain, a contract state is stored in the block chain, the contract codes are executed through block chain link points, a contract calculation result through a distributed consistency algorithm is stored in the block chain, and the contract state is updated; the state transition of the blockchain can be given as shown in the formula:
Figure 265614DEST_PATH_IMAGE035
wherein the content of the first and second substances,
Figure 300566DEST_PATH_IMAGE036
a state transfer function for a block chain;
Figure 587189DEST_PATH_IMAGE037
for block chains at time
Figure 416605DEST_PATH_IMAGE038
The state of (1);
Figure 538145DEST_PATH_IMAGE039
is a police service;
the method comprises the following steps that services are collected and placed into blocks, each block is indicated by a hash value of the block, one block not only has a set of hash and transaction of the previous block, but also has a block chain state from the block, the hash of the previous block is placed into the block, and therefore the block is connected into a chain, and the specific expression is as follows:
Figure 376788DEST_PATH_IMAGE040
the hash of the previous block is put into the block, so that the block is connected into a chain to form a nested function, wherein the specific expression is as follows:
Figure 1804DEST_PATH_IMAGE041
the block chain stores all case services in a block, so that the following tracing query is facilitated, the latest state of the block chain is stored in an MPT, and the MPT is written as merkle patricia trie, wherein the MPT is a combined abbreviation of a Mercker tree and a Telejia tree, is an improved data structure which integrates the advantages of the two tree structures of the Mercker tree and the prefix tree, is a very important data structure in an Ether, and is used for storing a state change state tree of the police service, generating a latest state abstract in real time, and further quickly finding required information according to a state keyword Key.
5. The cooperative police service resource data governance method based on the block chain as claimed in claim 1, wherein:
in step 4, the query keyword submitted by the data user should meet two security requirements, one is the privacy of the query keyword, namely the query keyword of the data user cannot be delivered to the cloud server in a plaintext form; second, if the query keyword is unlinkable, assume that the data user
Figure 267701DEST_PATH_IMAGE042
All the contained keys need to be retrieved from the encrypted inverted index
Figure 610957DEST_PATH_IMAGE043
The data user utilizes the key by the following two steps
Figure 987712DEST_PATH_IMAGE044
Encrypting the query key
Figure 467235DEST_PATH_IMAGE043
And a query trapdoor is generated,
first, the data user
Figure 668147DEST_PATH_IMAGE042
Randomly selecting an element
Figure 233120DEST_PATH_IMAGE045
The following formula is calculated, wherein,
Figure 413566DEST_PATH_IMAGE046
is from a collection
Figure 747595DEST_PATH_IMAGE047
The random numbers are selected randomly and uniformly: to facilitate writing
Figure 620873DEST_PATH_IMAGE048
Wherein the content of the first and second substances,
Figure 673143DEST_PATH_IMAGE049
is two orders of prime number
Figure 657279DEST_PATH_IMAGE050
The cyclic multiplication group of (a) is,
Figure 111395DEST_PATH_IMAGE051
into a group
Figure 889995DEST_PATH_IMAGE052
A generator of (2); defining bilinear mappings
Figure 928096DEST_PATH_IMAGE053
And two secure hash functions
Figure 450344DEST_PATH_IMAGE054
Respectively hashing character strings of any length into groups
Figure 758965DEST_PATH_IMAGE055
And group
Figure 708467DEST_PATH_IMAGE056
An element of (1);
Figure 469750DEST_PATH_IMAGE057
randomly and uniformly slave to a group for a key distribution center
Figure 61268DEST_PATH_IMAGE058
The two elements selected above are used for generating a secret key;
secondly, for each
Figure 224396DEST_PATH_IMAGE059
Data user u calculation
Figure 344799DEST_PATH_IMAGE060
Figure 858957DEST_PATH_IMAGE061
(1)
Wherein the content of the first and second substances,
Figure 221543DEST_PATH_IMAGE062
in order to be a collection of attributes,
Figure 239177DEST_PATH_IMAGE063
for the complete set of system attributes
Figure 796060DEST_PATH_IMAGE064
Any one of the attributes of (a), (b), (c), (d) and (d) any one of (d), (d) and (d) any (d) and (d) an (d) an (d) an (d,
Figure 531935DEST_PATH_IMAGE062
presentation group
Figure 465256DEST_PATH_IMAGE065
One set of the above-mentioned (c) is,
Figure 337397DEST_PATH_IMAGE066
is from a collection
Figure 65182DEST_PATH_IMAGE065
Wherein the random number is randomly and uniformly selected,
Figure 288353DEST_PATH_IMAGE067
Figure 759785DEST_PATH_IMAGE068
is an attribute
Figure 256407DEST_PATH_IMAGE069
A random attribute key is generated, and the random attribute key is generated,
Figure 155093DEST_PATH_IMAGE070
data owner based on index key
Figure 599980DEST_PATH_IMAGE071
Access rights requirement of, defining an access control tree
Figure 875104DEST_PATH_IMAGE072
From
Figure 987416DEST_PATH_IMAGE072
Starting from the root node of (1), in a top-down manner
Figure 791424DEST_PATH_IMAGE072
Each node in
Figure 989188DEST_PATH_IMAGE073
Constructing a polynomial
Figure 536844DEST_PATH_IMAGE074
And is provided with
Figure 769242DEST_PATH_IMAGE074
The number of the highest order term being the threshold for grounding
Figure 242686DEST_PATH_IMAGE075
As little as 1, i.e.
Figure 927745DEST_PATH_IMAGE076
(ii) a For root node
Figure 279092DEST_PATH_IMAGE077
The data owner randomly selects a value
Figure 100418DEST_PATH_IMAGE078
And is provided with
Figure 511808DEST_PATH_IMAGE079
Data owner settings for any other node
Figure 418584DEST_PATH_IMAGE080
When the data owner decides to revoke an attribute of the data consumer
Figure 573622DEST_PATH_IMAGE081
He only needs to be an attribute
Figure 515033DEST_PATH_IMAGE081
Generating a new attribute key
Figure 330280DEST_PATH_IMAGE082
And use
Figure 724352DEST_PATH_IMAGE082
With a full set of replacement keys
Figure 683081DEST_PATH_IMAGE083
Sending out
Figure 478998DEST_PATH_IMAGE082
Sending the data to a cloud server; when the cloud server receives
Figure 232191DEST_PATH_IMAGE082
Then, first use
Figure 379138DEST_PATH_IMAGE082
With a full set of updated attribute keys
Figure 610399DEST_PATH_IMAGE083
Then, for each encrypted inverted list
Figure 260824DEST_PATH_IMAGE084
Which has access to a control tree of
Figure 184917DEST_PATH_IMAGE085
If, if
Figure 819161DEST_PATH_IMAGE085
Contains an attribute
Figure 352648DEST_PATH_IMAGE081
Then the cloud server uses the attribute key
Figure 857579DEST_PATH_IMAGE082
Updating
Figure 952574DEST_PATH_IMAGE084
In (1)
Figure 808534DEST_PATH_IMAGE086
Is composed of
Figure 381598DEST_PATH_IMAGE087
After update
Figure 272194DEST_PATH_IMAGE084
Can be expressed as:
Figure 272511DEST_PATH_IMAGE088
(2)
suppose that
Figure 615768DEST_PATH_IMAGE085
Leaf node in
Figure 750777DEST_PATH_IMAGE089
Corresponding attribute is
Figure 230300DEST_PATH_IMAGE081
That is to say
Figure 667098DEST_PATH_IMAGE090
The cloud server has strong storage and calculation capacity, is used for storing encrypted outsourced data, is also used for inquiring on the encrypted security index according to the inquiry trapdoor submitted by the data user and returning an encrypted inquiry result to the data user, and when the cloud receives the data user
Figure 232071DEST_PATH_IMAGE091
Query trapdoor
Figure 412517DEST_PATH_IMAGE092
Then, an encrypted inverted list is given
Figure 12125DEST_PATH_IMAGE093
The cloud server can return the inverted list only if the following two conditions are satisfied simultaneously
Figure 619824DEST_PATH_IMAGE093
Index of all encrypted data files: firstly, the
Figure 672094DEST_PATH_IMAGE091
With a list of inversions
Figure 390651DEST_PATH_IMAGE093
Inquiry authority, II
Figure 608881DEST_PATH_IMAGE094
If true; the whole safety inquiry process is divided into the following two sub-processes:
the first subprocess is that the cloud server traps the door according to the query
Figure 387481DEST_PATH_IMAGE095
Determining data users
Figure 927047DEST_PATH_IMAGE096
Whether or not there is a pair index
Figure 449295DEST_PATH_IMAGE093
The inquiry authority is specifically as follows:
let
Figure 23496DEST_PATH_IMAGE097
Is an access control tree
Figure 972997DEST_PATH_IMAGE098
For each leaf node
Figure 734280DEST_PATH_IMAGE097
Let a
Figure 60219DEST_PATH_IMAGE099
Representing the attribute of the leaf node representation, i.e.
Figure 223347DEST_PATH_IMAGE100
If, if
Figure 842285DEST_PATH_IMAGE101
Then, calculate:
Figure 356443DEST_PATH_IMAGE102
if it is not
Figure 220494DEST_PATH_IMAGE103
Then define
Figure 238128DEST_PATH_IMAGE104
Wherein, the meaning of the characters can be known by formulas (1) and (2);
for each non-leaf node
Figure 795011DEST_PATH_IMAGE105
With a node threshold of
Figure 796465DEST_PATH_IMAGE106
If there is one containing
Figure 198628DEST_PATH_IMAGE106
An
Figure 336348DEST_PATH_IMAGE105
Set of child nodes of
Figure 297089DEST_PATH_IMAGE107
And for each child node
Figure 520260DEST_PATH_IMAGE108
All satisfy
Figure 991692DEST_PATH_IMAGE109
Then calculate
Figure 983919DEST_PATH_IMAGE110
Wherein the content of the first and second substances,
Figure 617026DEST_PATH_IMAGE111
is the lagrange coefficient; if no such collection exists, a collection of attributes is indicated to the data consumer
Figure 327493DEST_PATH_IMAGE112
Unsatisfied node
Figure 337037DEST_PATH_IMAGE113
Is then defined
Figure 183770DEST_PATH_IMAGE114
For access control tree
Figure 518937DEST_PATH_IMAGE115
Root node of
Figure 689936DEST_PATH_IMAGE116
After the above recursion operation, if
Figure 768750DEST_PATH_IMAGE117
Then, the attribute set of the data user is described
Figure 735569DEST_PATH_IMAGE118
Unsatisfied access control trees
Figure 710479DEST_PATH_IMAGE115
Otherwise
Figure 395538DEST_PATH_IMAGE119
When the above first sub-process is completed, if
Figure 746885DEST_PATH_IMAGE120
Then it means that the data consumer is not aligned to the keyword
Figure 568210DEST_PATH_IMAGE121
The query authority of (1); otherwise, the cloud server continues to execute a second sub-process to determine whether the following equation holds:
Figure 714021DEST_PATH_IMAGE122
wherein the content of the first and second substances,
Figure 384911DEST_PATH_IMAGE123
Figure 539949DEST_PATH_IMAGE124
the meaning is shown in formula (2);
if the equality is true, the query keyword is indicated
Figure 481360DEST_PATH_IMAGE125
And encrypting the inverted index
Figure 63651DEST_PATH_IMAGE126
Index key in (1)
Figure 457724DEST_PATH_IMAGE127
Equal, then the cloud server returns the index
Figure 150873DEST_PATH_IMAGE126
All encrypted data files in the file system; data consumer uses file decryption key granted by data owner
Figure 212370DEST_PATH_IMAGE128
Decrypting the ciphertext; the correctness of the security query can be verified by the following derivation:
Figure 231142DEST_PATH_IMAGE129
if the trapdoor
Figure 846931DEST_PATH_IMAGE130
Query keyword in (1)
Figure 343771DEST_PATH_IMAGE131
And
Figure 758310DEST_PATH_IMAGE132
middle index key word
Figure 682403DEST_PATH_IMAGE133
Are equal, i.e.
Figure 51068DEST_PATH_IMAGE134
Then:
Figure 351599DEST_PATH_IMAGE135
compared with the prior art, the invention adopting the technical scheme has the following technical effects:
1. the invention solves the problems of safety and privacy protection of data sharing, and under a distributed account book sharing mechanism, each node stores the total police affair shared data, so that the traditional data center management mode is not applicable any more; in the data sharing process of the block chain, a national secret SM2 asymmetric encryption algorithm is adopted, each police resource data processing related personnel and sub-department are defined as a main body, and a set of encrypted and decrypted public and private keys are granted to each main body; when data are transmitted in a department, a main public key corresponding to the data is obtained, field-level encryption is carried out on a police affair resource data body, and then transaction of a block chain is formed and submitted to a public account book, so that police affair resource data which are totally shared are recorded in the block chain, but each field is encrypted, and the contradiction between real-time sharing, authentication change and safe utilization of the data is fundamentally solved;
2. the invention realizes credible police resource data sharing by means of a distributed account book: by means of the characteristics of the block chain distributed account book, all nodes on the chain participate in data storage and verification, all department nodes on the chain maintain the same public account book together, each department is guaranteed to have the most accurate and full police resource data, the transaction traceability is guaranteed through the characteristics of public and private key encryption technology, the transaction cannot be repudiated and damaged, and the privacy of individuals/units is guaranteed not to be revealed;
3. the method constructs an ecological mechanism for sharing and utilizing police service resource data, constructs a set of ecological mechanism for promoting sharing and utilizing of the police service resource data of the block chain by means of the Token mechanism of the block chain, and improves the enthusiasm of data sharing of departments; in practical application, a new mode of collecting business-driven data is explored, points are obtained through data sharing, and the use right of the data is obtained in the form of point consumption; the mechanism is solidified by using a block chain intelligent contract, the increment of the integral and the consumption of all nodes are visible, and the question of each department on fairness and authority is eliminated.
Drawings
FIG. 1 is a schematic diagram of a police resource data quality collaboration model of the present invention;
FIG. 2 is a flow of the multi-partition offload processing of the present invention;
fig. 3 is a flowchart of a coordination method for police resource data governance based on a block chain.
Detailed Description
The technical scheme of the invention is further explained in detail by combining the attached drawings:
the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
A block chain-based police service resource data governance coordination method is disclosed, as shown in FIG. 1, and specifically comprises the following steps:
step 1, constructing a case data quality collaborative model based on a block chain: through governing model structure, method, flow and number
Introducing an anti-tampering technology according to sharing and access control, data updating and intelligent contracts to achieve a governing target based on the characteristics of a regional chain distributed account book, an encryption algorithm and a consensus mechanism;
step 2, establishing a multi-party cooperation standard: implementing complexities by establishing rule-based data and standardized intelligent contracts
Each record of the business logic industry standard library chain is orderly linked from the back to the front, and the method is safe and stable, cannot be tampered and can be traced;
step 3, the intelligent contract forms a solidified transparent service: performing solidified transparent business logic by means of intelligent contracts
Performing hard core control on data standards and operation flows of various services, and storing service data through intelligent cooperation, thereby effectively avoiding service conflicts caused by problems of management modes, rule changes, system upgrading and the like among departments;
step 4, the multi-partition user authorization mechanism guarantees privacy security: user information authorization for realizing transactor and business management and business
Unified configuration management is provided for service data items, protocol management, protocol content management, authorization modes, electronic approval process management, cloud storage encryption and the like;
and 5, finishing the cooperative treatment of the block chain data.
The method comprises the following specific steps: 001, constructing a data quality cooperation model based on a block chain:
by analyzing the data governance requirements in a big data environment, the problems of data standardization, data quality management, data safety, compliance and the like are the primary challenges facing data governance. The data standardization level comprises metadata management and main data management, the consistency, the normalization and the integrity of data are guaranteed on the basis, and the data quality is improved. The distributed account book characteristic of the block chain can guarantee data security and sharing, the privacy of the participants and users is guaranteed through an encryption mechanism, and the efficient opinion achievement under the multi-party collaboration environment can be guaranteed through a consensus mechanism. The schematic diagram of the police service resource data quality collaboration model of the invention is shown in fig. 1. The data management mainly comprises the aspects of data standardization, data quality management, data safety compliance and the like, and finally achieves the management targets of strategy consistency, risk control, operation compliance and value realization through the cooperative management of the three. The implementation of the governance target is mainly based on the characteristics of a block chain distributed account book, an encryption algorithm and a consensus mechanism and is realized through three aspects of a governance model structure and method flow, data sharing and access control, data updating and intelligent contracts.
And a block chain anti-tampering technology is introduced into the model, so that the data consistency is ensured. The blockchain technique guarantees data consistency using a workload-proof consensus mechanism. Suppose an attacker tries to tamper the first before the newest block
Figure 856530DEST_PATH_IMAGE136
Block chunk data, an attacker must modify the chunk hash values and recalculate the hash values for all chunks afterwards. Assuming that the current full-network honest node computing power is per second
Figure 217104DEST_PATH_IMAGE137
Calculating the secondary hash value, wherein the block hash value under the current calculation difficulty contains
Figure 807485DEST_PATH_IMAGE138
The prefix is binary 0. The attacker is newly added computing power with the magnitude of computing power per second
Figure 646128DEST_PATH_IMAGE139
And calculating a secondary hash value. For an attacker to calculate the past blocks mainly without influencing the generation speed of the new blocks, the calculation difficulty of the hash value of the new blocks cannot be increased, and for simplifying the calculation, no new node participates, and the probability that the honest node obtains the new blocks in each second is
Figure 271145DEST_PATH_IMAGE140
The probability of an attacker obtaining a new block is
Figure 802620DEST_PATH_IMAGE141
. Initial height difference between attacker and honest node
Figure 378833DEST_PATH_IMAGE142
Is provided with
Figure 21167DEST_PATH_IMAGE143
Is as follows
Figure 500690DEST_PATH_IMAGE144
Height difference of second, height difference
Figure 937487DEST_PATH_IMAGE145
The probability of change per second is divided into 3 cases.
Event(s)
Figure 768040DEST_PATH_IMAGE146
The attacker does not generate blocks, the honest nodes generate blocks,
Figure 948486DEST_PATH_IMAGE147
plus 1, probability
Figure 813673DEST_PATH_IMAGE148
Event(s)
Figure 421372DEST_PATH_IMAGE149
The attacker does not generate blocks, the honest nodes generate blocks,
Figure 473642DEST_PATH_IMAGE147
minus 1, probability
Figure 457778DEST_PATH_IMAGE150
Event(s)
Figure 428007DEST_PATH_IMAGE151
The attacker does not generate blocks, the honest nodes generate blocks,
Figure 472186DEST_PATH_IMAGE147
invariance, probability
Figure 746173DEST_PATH_IMAGE152
Height difference per second
Figure 534000DEST_PATH_IMAGE153
Is adapted to fit a plurality of distributions
Figure 842622DEST_PATH_IMAGE154
When in use
Figure 57702DEST_PATH_IMAGE155
And then, an attacker successfully catches up with the honest nodes, can distribute the block chains and successfully tampers the data. In that
Figure 84564DEST_PATH_IMAGE156
Within a second, will appear
Figure 613766DEST_PATH_IMAGE156
Event of secondary altitude change, device
Figure 541008DEST_PATH_IMAGE157
Is composed of
Figure 926990DEST_PATH_IMAGE158
The number of occurrences; when the tampering is successful, the user may,
Figure 175569DEST_PATH_IMAGE159
at least take place
Figure 305199DEST_PATH_IMAGE160
Then, set
Figure 588413DEST_PATH_IMAGE161
Is an event
Figure 879717DEST_PATH_IMAGE162
The difference between the actual number of occurrences and the minimum number of occurrences, then
Figure 881171DEST_PATH_IMAGE163
The actual number of occurrences is
Figure 548913DEST_PATH_IMAGE164
Figure 952212DEST_PATH_IMAGE165
The number of occurrences is based on the number of occurrences of the first two, and is
Figure 414417DEST_PATH_IMAGE166
Wherein, in the step (A),
Figure 903168DEST_PATH_IMAGE167
. In that
Figure 873135DEST_PATH_IMAGE168
Within seconds, the probability of an attacker pursuing honest nodes is
Figure 865362DEST_PATH_IMAGE170
Obtaining the probability of successful tampering block data of an attacker according to a formula and the depth of the tampered block
Figure 764048DEST_PATH_IMAGE171
The increase in (c) is lower and lower.
The police service resource data standard construction model based on the block chain is provided in the step, and by means of the ideas that technical data of the block chain is public, transparent and traceable, each crime record in an industry standard library is orderly linked from back to front, so that the police service resource data standard construction model has the characteristics of safety, stability, incapability of being tampered and traceable. The industry standard library chain network is an end-to-end distributed network which is constructed by all added nodes together, all the nodes are required to be maintained together, external data acquired by the internet and internal data stored in a block chain can be read by establishing a rule-based data and a standardized intelligent contract, complex business logic is realized, an application scheme of data standardization is finally constructed, and an important target of data management is realized.
002 standards for multiparty collaboration are constructed:
the blockchain is a unique way for storing data in cryptocurrency such as bitcoin, and is a self-referenced data structure, which is commonly used for storing a large amount of transaction information. Based on a data quality collaborative model, the invention provides a police service resource data standard management method based on a block chain on the basis of comprehensively considering a data standard management model, and the invention realizes the ordered linking of each police service resource record from back to front by utilizing the design idea of a transparent and traceable product architecture of data disclosure of the block chain technology, and has the characteristics of safety, stability, no tampering and convenient tracing. The whole construction is divided into two stages: the first stage is outside the chain, mainly composed of an identity authentication module, a right management module and a supervision management module, and mainly responsible for verifying the user state, giving rewards to the user and supervising the user behavior; and the second stage is in a chain, mainly comprising industry standard library chains, wherein each industry standard library chain comprises a module which is responsible for storing and reading police service resource data information of the industry standard library chain. And the user is verified to be a registered user through the identity authentication module, and the registered user carries out interaction between the first stage and the second stage by calling the intelligent contract.
The police service resource data standard co-construction management algorithm and process based on the block chain are as follows:
the method comprises the following steps: the police resource data demander submits a registration application, and the identity of the police resource data demander is verified through the identity authentication module to obtain a corresponding return state. If the registration is successful, the user becomes a registered user, otherwise, the registration is failed.
Step two: the data demander has corresponding point information through the authority management module.
Step three: the data demander has corresponding supervision information through the supervision management module.
Step four: and the data demander calls the intelligent contract to carry out operations such as application, query, cloning and the like of the data standard.
Step five: and the police service resource data standard library chain automatically completes corresponding operation by means of an intelligent contract.
The data standardization needs to follow a certain standardization principle, and the standardization principle can improve the data quality to the maximum extent, ensure the standardization and form a data sharing mechanism. The police service resource data standard co-construction method based on the block chain unifies the rules of the data standard, unifies the data query interface, and can share data in real time. Through an incentive system of authority management, user viscosity is enhanced, the problem of data island is eliminated, and data standard interconnection, intercommunication and mutual trust are realized.
003 Smart contracts form a solid transparent business:
when police resource data are shared, the block chain guarantees the complete consistency of the police resource data of each node through the account book, and meanwhile, an executable code can be issued on the block chain. The method executes the solidified and transparent business logic in an intelligent contract mode, performs hard core control on data standards, operation flows and the like of various businesses, and effectively avoids business conflicts caused by problems of management modes among departments, rule change, system upgrade and the like.
The storage of the contract codes and the states by the block chain ensures the reliability and the availability of the contract storageObservability, the intelligent contract is code stored on the blockchain, the contract state is stored in the blockchain, the contract code is executed through the blockchain link points, the contract calculation result through the distributed consistency algorithm is stored in the blockchain, and the contract state is updated. The state transition of the blockchain can be given as shown in the formula:
Figure 474515DEST_PATH_IMAGE172
wherein
Figure 484059DEST_PATH_IMAGE173
A state transfer function for a block chain;
Figure 596372DEST_PATH_IMAGE174
for block chains at time
Figure 400380DEST_PATH_IMAGE175
The state of (1);
Figure 598143DEST_PATH_IMAGE176
in order to police service, in a block chain system, services are collected and placed into blocks, each block is referred to by a hash value of the block, one block not only has a set of hash and transaction of the previous block, but also has a block chain state up to the block, and the hash of the previous block is placed into the block, so that the block is connected into a chain, wherein the specific expression is as follows:
Figure 411378DEST_PATH_IMAGE177
the hash of the previous block is put into the block, so that the block is connected into a chain to form a nested function, wherein the specific expression is as follows:
Figure 876732DEST_PATH_IMAGE178
the block chain stores all case services in a block, so that the following tracing query is facilitated, the latest state of the block chain is stored in an MPT (quick patricia trie), wherein the MPT is a combined abbreviation of a Merck tree and a Terrisian tree, is an improved data structure which integrates the advantages of the Merck tree and a prefix tree, is a very important data structure in an Ether, and is used for storing the state change (state tree) of the police service in the patent, instantly generating the latest state abstract, and further quickly finding out the required information according to a Key (state keyword).
Taking case-related police type and case-related detailed information of case management departments as examples, a block chain intelligent contract technology is introduced, the problems of consistency, timeliness and safety of the case-related police type and the case-related detailed information can be well solved, after all the police departments achieve consensus on business standards according to business requirements, shared intelligent contract codes are formed and issued to a 'block chain + police resource management' platform, different operations of all the departments on account data based on own data authorities are achieved through achieving the consensus intelligent contracts, and account data can be updated in real time through intelligent contracts such as network security police increasing, refreshing and importing the case information and inquiring case tables. Through the convention of the transaction rules, disputes caused by the problems of unclear rules and the like among departments are completely avoided, and the data of different departments are completely consistent under the block chain guarantee.
The 004 multi-partition user authorization mechanism guarantees privacy security:
police service resource data sharing of the block chain effectively solves the safety and privacy protection of data, and emphasizes the use right of a business policeman to the data in public security service.
The query keywords submitted by the data user meet two security requirements, namely the privacy of the query keywords is ensured, namely the query keywords of the data user cannot be delivered to the cloud server in a plaintext form; second, if the query keyword is unlinkable, assume that the data user
Figure 117221DEST_PATH_IMAGE179
All the contained keys need to be retrieved from the encrypted inverted index
Figure 802280DEST_PATH_IMAGE180
The data user utilizes the key by the following two steps
Figure 153627DEST_PATH_IMAGE181
Encrypting the query key
Figure 974952DEST_PATH_IMAGE180
And a query trapdoor is generated,
first, the data user
Figure 120763DEST_PATH_IMAGE179
Randomly selecting an element
Figure 27539DEST_PATH_IMAGE182
Calculating the following formula (
Figure 182577DEST_PATH_IMAGE183
Is from a collection
Figure 362803DEST_PATH_IMAGE184
Random numbers selected randomly and uniformly): to facilitate writing
Figure 945094DEST_PATH_IMAGE185
Wherein the content of the first and second substances,
Figure 339167DEST_PATH_IMAGE186
is two orders of prime number
Figure 32316DEST_PATH_IMAGE187
The cyclic multiplication group of (a) is,
Figure 93813DEST_PATH_IMAGE188
into a group
Figure 581426DEST_PATH_IMAGE189
A generator of (2). Defining bilinear mappings
Figure 462795DEST_PATH_IMAGE190
And two secure hash functions
Figure 225214DEST_PATH_IMAGE191
Respectively hashing character strings of any length into groups
Figure 875638DEST_PATH_IMAGE192
And group
Figure 298267DEST_PATH_IMAGE193
An element of (1).
Figure 135773DEST_PATH_IMAGE194
Randomly and uniformly slave to a group for a key distribution center
Figure 373988DEST_PATH_IMAGE195
The two elements selected above are used to generate a key.
Secondly, for each
Figure 613339DEST_PATH_IMAGE196
Data user
Figure 442755DEST_PATH_IMAGE197
Computing
Figure 266092DEST_PATH_IMAGE198
(1)
Wherein the content of the first and second substances,
Figure 839156DEST_PATH_IMAGE199
in order to be a collection of attributes,
Figure 464172DEST_PATH_IMAGE200
for the complete set of system attributes
Figure 730069DEST_PATH_IMAGE201
Any one of the attributes of (a), (b), (c), (d) and (d) any one of (d), (d) and (d) any (d) and (d) an (d) an (d) an (d,
Figure 807746DEST_PATH_IMAGE199
presentation group
Figure 184501DEST_PATH_IMAGE202
One set of the above-mentioned (c) is,
Figure 929603DEST_PATH_IMAGE203
is from a collection
Figure 864936DEST_PATH_IMAGE202
Wherein the random number is randomly and uniformly selected,
Figure 429909DEST_PATH_IMAGE204
Figure 875934DEST_PATH_IMAGE205
is an attribute
Figure 209963DEST_PATH_IMAGE200
A random attribute key is generated, and the random attribute key is generated,
Figure 817662DEST_PATH_IMAGE206
data owner based on index key
Figure 869932DEST_PATH_IMAGE207
Access rights requirement of, defining an access control tree
Figure 119648DEST_PATH_IMAGE208
From
Figure 308183DEST_PATH_IMAGE208
Starting from the root node of (1), in a top-down manner
Figure 352363DEST_PATH_IMAGE208
Each node in
Figure 891928DEST_PATH_IMAGE209
Constructing a polynomial
Figure 906852DEST_PATH_IMAGE210
And is provided with
Figure 481053DEST_PATH_IMAGE210
The number of the highest order term being the threshold for grounding
Figure 430555DEST_PATH_IMAGE211
As little as 1, i.e.
Figure 457417DEST_PATH_IMAGE212
. For root node
Figure 517776DEST_PATH_IMAGE213
The data owner randomly selects a value
Figure 353008DEST_PATH_IMAGE214
And is provided with
Figure 237526DEST_PATH_IMAGE215
Data owner settings for any other node
Figure 486104DEST_PATH_IMAGE216
When the data owner decides to revoke an attribute of the data consumer
Figure 350155DEST_PATH_IMAGE200
He only needs to be an attribute
Figure 633369DEST_PATH_IMAGE200
Generating a new attribute key
Figure 924673DEST_PATH_IMAGE217
And use
Figure 926127DEST_PATH_IMAGE217
With a full set of replacement keys
Figure 593869DEST_PATH_IMAGE218
Sending out
Figure 731589DEST_PATH_IMAGE217
To the cloud server. When the cloud server receives
Figure 692330DEST_PATH_IMAGE217
Then, first use
Figure 915500DEST_PATH_IMAGE217
With a full set of updated attribute keys
Figure 121354DEST_PATH_IMAGE218
Then, for each encrypted inverted list
Figure 379160DEST_PATH_IMAGE219
Which has access to a control tree of
Figure 277846DEST_PATH_IMAGE220
If, if
Figure 253892DEST_PATH_IMAGE220
Contains an attribute
Figure 997857DEST_PATH_IMAGE200
Then the cloud server uses the attribute key
Figure 844590DEST_PATH_IMAGE217
Updating
Figure 914178DEST_PATH_IMAGE219
In (1)
Figure 344897DEST_PATH_IMAGE221
Is composed of
Figure 158132DEST_PATH_IMAGE222
After update
Figure 124951DEST_PATH_IMAGE223
Can be expressed as:
Figure 365439DEST_PATH_IMAGE224
(2)
suppose that
Figure 784919DEST_PATH_IMAGE225
Leaf node in
Figure 136266DEST_PATH_IMAGE226
Corresponding attribute is
Figure 223171DEST_PATH_IMAGE200
That is to say
Figure 634561DEST_PATH_IMAGE227
The cloud server has strong storage and calculation capacity, is used for storing encrypted outsourced data, is also used for inquiring on the encrypted security index according to the inquiry trapdoor submitted by the data user and returning an encrypted inquiry result to the data user, and when the cloud receives the data user
Figure 541337DEST_PATH_IMAGE228
Query trapdoor
Figure 935190DEST_PATH_IMAGE229
Then, an encrypted inverted list is given
Figure 876601DEST_PATH_IMAGE230
The cloud server can return the inverted list only if the following two conditions are satisfied simultaneously
Figure 458892DEST_PATH_IMAGE230
Index of all encrypted data files: firstly, the
Figure 852964DEST_PATH_IMAGE228
With a list of inversions
Figure 546114DEST_PATH_IMAGE230
Inquiry authority, II
Figure 810873DEST_PATH_IMAGE231
If true; the whole safety inquiry process is divided into the following two sub-processes:
the first subprocess is that the cloud server traps the door according to the query
Figure 564066DEST_PATH_IMAGE232
Determining data users
Figure 943969DEST_PATH_IMAGE228
Whether or not there is a pair index
Figure 706389DEST_PATH_IMAGE230
The inquiry authority is specifically as follows:
let
Figure 356813DEST_PATH_IMAGE226
Is an access control tree
Figure 15327DEST_PATH_IMAGE233
For each leaf node
Figure 383992DEST_PATH_IMAGE226
Let a
Figure 418944DEST_PATH_IMAGE200
Representing the attribute of the leaf node representation, i.e.
Figure 189454DEST_PATH_IMAGE234
If, if
Figure 18870DEST_PATH_IMAGE235
Then, calculate:
Figure 874830DEST_PATH_IMAGE236
if it is not
Figure 212008DEST_PATH_IMAGE237
Then define
Figure 571445DEST_PATH_IMAGE238
The meaning of the character can be seen from the formulas (1) and (2).
For each non-leaf node
Figure 837342DEST_PATH_IMAGE239
With a node threshold of
Figure 915019DEST_PATH_IMAGE240
If there is one containing
Figure 557353DEST_PATH_IMAGE240
An
Figure 36876DEST_PATH_IMAGE239
Set of child nodes of
Figure 473673DEST_PATH_IMAGE241
And for each child node
Figure 38647DEST_PATH_IMAGE242
All satisfy
Figure 999519DEST_PATH_IMAGE243
Then calculate
Figure 849661DEST_PATH_IMAGE244
Figure 457360DEST_PATH_IMAGE245
Wherein the content of the first and second substances,
Figure 509630DEST_PATH_IMAGE246
is the lagrange coefficient; if no such collection exists, a collection of attributes is indicated to the data consumer
Figure 228187DEST_PATH_IMAGE247
Unsatisfied node
Figure 947881DEST_PATH_IMAGE248
Is then defined
Figure 726482DEST_PATH_IMAGE249
For access control tree
Figure 468DEST_PATH_IMAGE250
Root node of
Figure 522716DEST_PATH_IMAGE251
After the above recursion operation, if
Figure 329873DEST_PATH_IMAGE252
Then, the attribute set of the data user is described
Figure 279374DEST_PATH_IMAGE253
Unsatisfied access control trees
Figure 40657DEST_PATH_IMAGE254
Otherwise
Figure 569859DEST_PATH_IMAGE255
When the above first sub-process is completed, if
Figure 732987DEST_PATH_IMAGE256
Then it means that the data consumer is not aligned to the keyword
Figure 853389DEST_PATH_IMAGE257
The query authority of (1); otherwise, the cloud server continues to execute a second sub-process to determine whether the following equation holds:
Figure 866082DEST_PATH_IMAGE258
wherein the content of the first and second substances,
Figure 730133DEST_PATH_IMAGE259
the meanings are shown in formula (2)
If the equality is true, the query keyword is indicated
Figure 747768DEST_PATH_IMAGE260
And encrypting the inverted index
Figure 570230DEST_PATH_IMAGE261
Index key in (1)
Figure 306105DEST_PATH_IMAGE262
Equal, then the cloud server returns the index
Figure 973847DEST_PATH_IMAGE261
All encrypted data files in the file system; data consumer uses file decryption key granted by data owner
Figure 845988DEST_PATH_IMAGE263
Decrypting the ciphertext; the correctness of the security query can be verified by the following derivation:
Figure 573773DEST_PATH_IMAGE264
if the trapdoor
Figure 62523DEST_PATH_IMAGE265
Query keyword in (1)
Figure 766911DEST_PATH_IMAGE260
And
Figure 759138DEST_PATH_IMAGE261
middle index key word
Figure 657824DEST_PATH_IMAGE266
Are equal, i.e.
Figure 102712DEST_PATH_IMAGE267
Then:
Figure 112256DEST_PATH_IMAGE268
the main idea of inter-chain privacy protection is to perform a partitioned processing on the user's request. The physical network layers of all the partitions are common, so that a network interface layer needs to take the role of transaction shunting, when a client sends a transaction request to a node, a unique ID (NS _ ID) of a partition where the transaction is located needs to be attached, the interface layer forwards the transaction to an NSM through the NS _ ID in an analysis request and distributes the transaction by the NSM, the next figure shows the processing flow of the multi-partition transaction request, the client sends 3 transactions to the node, and after receiving the transaction request, the node needs to perform one-time transaction analysis on an RPC interface layer, reads the NS _ ID of the transaction, and forwards the transaction ID and the transaction itself to an NSM partition manager. Subsequently, the NSM distributes the transaction request to the processing modules of the corresponding partitions according to the given NS _ ID, thereby implementing the offloading processing of the transaction.
The flow of the multi-partition splitting process is shown in fig. 2.
Compared with the traditional transaction processing flow, the transaction processing flow with the common identification of the partitions has two more steps: the RPC interface layer analyzes the partition ID, and the partition manager NSM distributes the transaction according to the partition ID. After the NSM has shunted transactions, the processing logic inside the partition is consistent with the original solution. In the reconstruction process of the partition consensus scheme, each module in the system needs to be decoupled, so that the calling logic between the modules becomes clearer
The authorization of the user is obtained in a specific service scene, and the external organization can use the data of the user. In order to ensure the stable operation of the business process, the authorization of the user information realizes that the transactor provides uniform configuration management with business management, business data items, protocol management, protocol content management, authorization modes, electronic approval process management and the like. And according to the management requirement of the authorization service, the face recognition verification and the short message verification are docked to verify the real person authentication. And (4) based on different application scenes of the access authorized by the blockchain data, the natural person/legal person authorizes the relevant organization and allows the use of the relevant data of the authorized subject. It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
The above embodiments are only for illustrating the technical idea of the present invention, and the protection scope of the present invention is not limited thereby, and any modifications made on the basis of the technical scheme according to the technical idea of the present invention fall within the protection scope of the present invention. While the embodiments of the present invention have been described in detail, the present invention is not limited to the above embodiments, and various changes can be made without departing from the spirit of the present invention within the knowledge of those skilled in the art.

Claims (6)

1. A police service resource data governance cooperative method based on a block chain is characterized in that: the method specifically comprises the following steps:
step 1, constructing a case data quality collaborative model based on a block chain: through governing model structure, method, flow and number
Introducing an anti-tampering technology according to sharing and access control, data updating and intelligent contracts to achieve a governing target based on the characteristics of a regional chain distributed account book, an encryption algorithm and a consensus mechanism;
step 2, establishing a multi-party cooperation standard: implementing complexities by establishing rule-based data and standardized intelligent contracts
Each record of the business logic industry standard library chain is orderly linked from the back to the front, and the method is safe and stable, cannot be tampered and can be traced;
step 3, the intelligent contract forms a solidified transparent service: performing solidified transparent business logic by means of intelligent contracts
Performing hard core control on data standards and operation flows of various services, and storing service data through intelligent cooperation, thereby effectively avoiding service conflicts caused by problems of management modes, rule changes, system upgrading and the like among departments;
step 4, the multi-partition user authorization mechanism guarantees privacy security: user information authorization for realizing transactor and business management and business
Unified configuration management is provided for service data items, protocol management, protocol content management, authorization modes, electronic approval process management, cloud storage encryption and the like;
and 5, finishing the cooperative treatment of the block chain data.
2. The cooperative police service resource data governance method based on the block chain as claimed in claim 1, wherein:
in step 1, a tamper-proof technique is cited, specifically as follows:
if an attacker tries to tamper the data of the h block before the latest block, the attacker needs to modify the hash value of the block and recalculate the hash values of all the blocks afterwards; setting the current computing power of the whole network honest nodes as hash value computation for p times per second, wherein the block hash value contains g prefix binary 0 under the current computing difficulty; an attacker is newly added computing power, and the computing power is calculated by q times of Hash values per second; if no new node participates, the probability that the honest node obtains a new block in each second is
Figure 368138DEST_PATH_IMAGE001
The probability of an attacker obtaining a new block is
Figure 500043DEST_PATH_IMAGE002
(ii) a Initial height difference between attacker and honest node
Figure 776434DEST_PATH_IMAGE003
Is provided with
Figure 183145DEST_PATH_IMAGE004
The height difference is the ith second, the height difference is
Figure 756821DEST_PATH_IMAGE005
The probability of change per second is divided into 3 cases:
event(s)
Figure 731730DEST_PATH_IMAGE006
: if the attacker does not generate a block, the honest node generates a block,
Figure 541423DEST_PATH_IMAGE007
plus 1, probability
Figure 971399DEST_PATH_IMAGE008
Event(s)
Figure 917358DEST_PATH_IMAGE009
: if the attacker does not generate a block, the honest node generates a block,
Figure 328748DEST_PATH_IMAGE010
minus 1, probability
Figure 501103DEST_PATH_IMAGE011
Event(s)
Figure 531507DEST_PATH_IMAGE012
: if the attacker does not generate a block, the honest node generates a block,
Figure 472918DEST_PATH_IMAGE010
invariance, probability
Figure 914264DEST_PATH_IMAGE013
The height difference per second
Figure 573916DEST_PATH_IMAGE014
The variation probability distribution of (a) conforms to a plurality of distributions:
Figure 267065DEST_PATH_IMAGE015
when in use
Figure 938349DEST_PATH_IMAGE016
When the attacker successfully catches up with the honest nodes and distributes the block chains, the data is successfully tampered;
within t seconds, t height change events occur, and n is set as
Figure 957121DEST_PATH_IMAGE017
The number of occurrences; when the tampering is successful, the user may,
Figure 963123DEST_PATH_IMAGE018
at least take place
Figure 194384DEST_PATH_IMAGE019
Let j be an event
Figure 717245DEST_PATH_IMAGE020
The difference between the actual number of occurrences and the minimum number of occurrences, then
Figure 641338DEST_PATH_IMAGE020
The actual number of occurrences is
Figure 275582DEST_PATH_IMAGE021
Figure 435168DEST_PATH_IMAGE022
The number of occurrences is based on the number of occurrences of the first two, and is
Figure 205678DEST_PATH_IMAGE023
Wherein, in the step (A),
Figure 176039DEST_PATH_IMAGE024
then within t seconds, the probability of the attacker pursuing honest nodes is:
Figure 359896DEST_PATH_IMAGE026
the probability of success of tampering the block data by an attacker according to a formula is lower and lower with the increase of the tampering block depth h.
3. The cooperative police service resource data governance method based on the block chain as claimed in claim 1, wherein:
the step 2 is divided into two stages:
the first stage is outside the chain, and consists of an identity authentication module, a right management module and a supervision management module, and is used for verifying the user state, giving rewards to the user and supervising the user behavior;
the second stage is in the chain, which is composed of industry standard library chains, wherein each industry standard library chain is used for storing and reading police service resource data information of the industry standard library chain; and the user is verified to be a registered user through the identity authentication module, and the registered user carries out interaction between the first stage and the second stage by calling the intelligent contract.
4. The cooperative police service resource data governance method based on the block chain as claimed in claim 3, wherein: the police service resource data standard co-construction management algorithm and process based on the block chain are as follows:
step 2.1, the police service resource data demander submits a registration application, and the identity of the police service resource data demander is verified through an identity authentication module to obtain a corresponding return state, wherein the police service resource data demander becomes a registered user if the registration is successful, and otherwise the police service resource data demander fails to register;
step 2.2, the data demander has corresponding integral information through the authority management module;
step 2.3, the data demander has corresponding supervision information through a supervision management module;
step 2.4, the data demander calls an intelligent contract to apply, inquire and clone the data standard;
and 2.5, automatically completing corresponding operation by the police service resource data standard library chain by means of an intelligent contract.
5. The cooperative police service resource data governance method based on the block chain as claimed in claim 1, wherein:
in step 3, the storage of the block chain on contract codes and states ensures the reliability and observability of contract storage, the intelligent contracts are codes stored on the block chain, the contract states are stored in the block chain, the contract codes are executed through block chain link points, the contract calculation results through a distributed consistency algorithm are stored in the block chain, and the contract states are updated; the state transition of the blockchain can be given as shown in the formula:
Figure 932959DEST_PATH_IMAGE027
wherein the content of the first and second substances,
Figure 698921DEST_PATH_IMAGE028
a state transfer function for a block chain;
Figure 964817DEST_PATH_IMAGE029
is the state of the blockchain at time t; t is a police service;
the method comprises the following steps that services are collected and placed into blocks, each block is indicated by a hash value of the block, one block not only has a set of hash and transaction of the previous block, but also has a block chain state from the block, the hash of the previous block is placed into the block, and therefore the block is connected into a chain, and the specific expression is as follows:
Figure 167129DEST_PATH_IMAGE030
the hash of the previous block is put into the block, so that the block is connected into a chain to form a nested function, wherein the specific expression is as follows:
Figure 75042DEST_PATH_IMAGE031
the block chain stores all case services in a block, so that the following tracing query is facilitated, the latest state of the block chain is stored in an MPT, and the MPT is written as merkle patricia trie, wherein the MPT is a combined abbreviation of a Mercker tree and a Telejia tree, is an improved data structure which integrates the advantages of the two tree structures of the Mercker tree and the prefix tree, is a very important data structure in an Ether, and is used for storing a state change state tree of the police service, generating a latest state abstract in real time, and further quickly finding required information according to a state keyword Key.
6. The cooperative police service resource data governance method based on the block chain as claimed in claim 1, wherein:
in step 4, the query keyword submitted by the data user should meet two security requirements, one is the privacy of the query keyword, namely the query keyword of the data user cannot be delivered to the cloud server in a plaintext form; second, if the query keyword is unlinkable, assume that the data user
Figure 554565DEST_PATH_IMAGE032
All the contained keys need to be retrieved from the encrypted inverted index
Figure 132308DEST_PATH_IMAGE033
The data user utilizes the key by the following two steps
Figure 697281DEST_PATH_IMAGE034
Encrypting the query key
Figure 877727DEST_PATH_IMAGE033
And a query trapdoor is generated,
first, the data user
Figure 601969DEST_PATH_IMAGE032
Randomly selecting an element
Figure 209668DEST_PATH_IMAGE035
The following formula is calculated, where r is from the set
Figure 134374DEST_PATH_IMAGE036
The random numbers are selected randomly and uniformly: to facilitate writing
Figure 118511DEST_PATH_IMAGE037
Figure 697260DEST_PATH_IMAGE038
Figure 741439DEST_PATH_IMAGE039
Wherein the content of the first and second substances,
Figure 281005DEST_PATH_IMAGE040
is two orders of prime number
Figure 944198DEST_PATH_IMAGE041
The cyclic multiplication group of (a) is,
Figure 252820DEST_PATH_IMAGE042
into a group
Figure 326955DEST_PATH_IMAGE043
A generator of (2); defining bilinear mappings
Figure 353817DEST_PATH_IMAGE044
And two secure hash functions
Figure 945335DEST_PATH_IMAGE045
Respectively hashing character strings of any length into groups
Figure 983830DEST_PATH_IMAGE046
And group
Figure 369812DEST_PATH_IMAGE047
An element of (1);
Figure 883970DEST_PATH_IMAGE048
randomly and uniformly slave to a group for a key distribution center
Figure 138233DEST_PATH_IMAGE046
The two elements selected above are used for generating a secret key;
secondly, for each
Figure 155868DEST_PATH_IMAGE049
Data user
Figure 588117DEST_PATH_IMAGE050
Computing
Figure 323992DEST_PATH_IMAGE051
Figure 850789DEST_PATH_IMAGE052
(1)
Wherein, S is an attribute set,
Figure 254088DEST_PATH_IMAGE053
for the complete set of system attributes
Figure 981873DEST_PATH_IMAGE054
S represents a group
Figure 835338DEST_PATH_IMAGE046
One set of the above-mentioned (c) is,
Figure 572350DEST_PATH_IMAGE055
is from a collection
Figure 689211DEST_PATH_IMAGE046
Wherein the random number is randomly and uniformly selected,
Figure 587897DEST_PATH_IMAGE056
Figure 298364DEST_PATH_IMAGE057
is an attribute
Figure 448853DEST_PATH_IMAGE053
A random attribute key is generated, and the random attribute key is generated,
Figure 295587DEST_PATH_IMAGE058
data owner based on index key
Figure 630753DEST_PATH_IMAGE059
Access rights requirement of, defining an access control tree
Figure 687571DEST_PATH_IMAGE060
From
Figure 766385DEST_PATH_IMAGE060
From the root node ofIn the following way
Figure 608571DEST_PATH_IMAGE060
Each node in
Figure 583480DEST_PATH_IMAGE061
Constructing a polynomial
Figure 534118DEST_PATH_IMAGE062
And is provided with
Figure 10099DEST_PATH_IMAGE062
The number of the highest order term being the threshold for grounding
Figure 831424DEST_PATH_IMAGE063
As little as 1, i.e.
Figure 118180DEST_PATH_IMAGE064
(ii) a For the root node R, the data owner randomly selects a value
Figure 24957DEST_PATH_IMAGE065
And is provided with
Figure 445574DEST_PATH_IMAGE066
Data owner settings for any other node
Figure 246039DEST_PATH_IMAGE067
When the data owner decides to revoke an attribute of the data consumer
Figure 828330DEST_PATH_IMAGE053
He only needs to be an attribute
Figure 360418DEST_PATH_IMAGE053
Generating a new attribute key
Figure 53568DEST_PATH_IMAGE068
And use
Figure 115065DEST_PATH_IMAGE068
With a full set of replacement keys
Figure 258470DEST_PATH_IMAGE069
Sending out
Figure 874259DEST_PATH_IMAGE068
Sending the data to a cloud server; when the cloud server receives
Figure 246466DEST_PATH_IMAGE068
Then, first use
Figure 162469DEST_PATH_IMAGE068
With a full set of updated attribute keys
Figure 86563DEST_PATH_IMAGE069
Then, for each encrypted inverted list
Figure 579861DEST_PATH_IMAGE070
Which has access to a control tree of
Figure 614813DEST_PATH_IMAGE071
If, if
Figure 260689DEST_PATH_IMAGE071
Contains an attribute
Figure 355684DEST_PATH_IMAGE053
Then the cloud server uses the attribute key
Figure 211645DEST_PATH_IMAGE068
Updating
Figure 440501DEST_PATH_IMAGE070
In (1)
Figure 65517DEST_PATH_IMAGE072
Is composed of
Figure 206780DEST_PATH_IMAGE073
After update
Figure 550036DEST_PATH_IMAGE070
Can be expressed as:
Figure 192370DEST_PATH_IMAGE074
(2)
suppose that
Figure 796527DEST_PATH_IMAGE075
Leaf node in
Figure 498904DEST_PATH_IMAGE076
Corresponding attribute is
Figure 63877DEST_PATH_IMAGE053
That is to say
Figure 116760DEST_PATH_IMAGE077
The cloud server has strong storage and calculation capacity, is used for storing encrypted outsourced data, is also used for inquiring on the encrypted security index according to the inquiry trapdoor submitted by the data user and returning an encrypted inquiry result to the data user, and when the cloud receives the data user
Figure 981947DEST_PATH_IMAGE078
Query trapdoor
Figure 714280DEST_PATH_IMAGE079
After that, givenAn encrypted posting list
Figure 766550DEST_PATH_IMAGE080
The cloud server can return the inverted list only if the following two conditions are satisfied simultaneously
Figure 750686DEST_PATH_IMAGE080
Index of all encrypted data files: firstly, the
Figure 345747DEST_PATH_IMAGE078
With a list of inversions
Figure 124347DEST_PATH_IMAGE080
Inquiry authority, II
Figure 663913DEST_PATH_IMAGE081
If true; the whole safety inquiry process is divided into the following two sub-processes:
the first subprocess is that the cloud server traps the door according to the query
Figure 310795DEST_PATH_IMAGE082
Determining whether data user u has a pair index
Figure 884995DEST_PATH_IMAGE080
The inquiry authority is specifically as follows:
let
Figure 709863DEST_PATH_IMAGE083
Is an access control tree
Figure 2304DEST_PATH_IMAGE084
For each leaf node
Figure 62664DEST_PATH_IMAGE083
Let a
Figure 881584DEST_PATH_IMAGE053
Representing the attribute of the leaf node representation, i.e.
Figure 1987DEST_PATH_IMAGE085
If, if
Figure 516145DEST_PATH_IMAGE086
Then, calculate:
Figure 255562DEST_PATH_IMAGE087
if it is not
Figure 804355DEST_PATH_IMAGE088
Then define
Figure 220293DEST_PATH_IMAGE089
Wherein, the meaning of the characters can be known by formulas (1) and (2);
for each non-leaf node
Figure 956168DEST_PATH_IMAGE090
With a node threshold of
Figure 889489DEST_PATH_IMAGE091
If there is one containing
Figure 899646DEST_PATH_IMAGE091
An
Figure 627430DEST_PATH_IMAGE090
Set of child nodes of
Figure 975235DEST_PATH_IMAGE092
And for each child node
Figure 446667DEST_PATH_IMAGE093
All satisfy
Figure 314260DEST_PATH_IMAGE094
Then calculate
Figure 947367DEST_PATH_IMAGE095
Wherein the content of the first and second substances,
Figure 782468DEST_PATH_IMAGE096
is the lagrange coefficient; if no such collection exists, a collection of attributes is indicated to the data consumer
Figure 792012DEST_PATH_IMAGE097
Unsatisfied node
Figure 904325DEST_PATH_IMAGE090
Is then defined
Figure 849278DEST_PATH_IMAGE098
For access control tree
Figure 781462DEST_PATH_IMAGE099
Root node of
Figure 719331DEST_PATH_IMAGE100
After the above recursion operation, if
Figure 420571DEST_PATH_IMAGE101
Then, the attribute set of the data user is described
Figure 802005DEST_PATH_IMAGE097
Unsatisfied access control trees
Figure 487064DEST_PATH_IMAGE099
Otherwise
Figure 838411DEST_PATH_IMAGE102
When the above first sub-process is completed, if
Figure 49949DEST_PATH_IMAGE103
Then it means that the data consumer is not aligned to the keyword
Figure 461339DEST_PATH_IMAGE104
The query authority of (1); otherwise, the cloud server continues to execute a second sub-process to determine whether the following equation holds:
Figure 633694DEST_PATH_IMAGE105
Figure 661169DEST_PATH_IMAGE106
wherein the content of the first and second substances,
Figure 337001DEST_PATH_IMAGE107
Figure 309505DEST_PATH_IMAGE107
the meanings are shown in formula (2)
If the equality is true, the query keyword is indicated
Figure 703577DEST_PATH_IMAGE108
And encrypting the inverted index
Figure 662306DEST_PATH_IMAGE109
Index key in (1)
Figure 599169DEST_PATH_IMAGE110
Equal, then the cloud server returns the index
Figure 86782DEST_PATH_IMAGE109
All encrypted data files in the file system; data consumer uses file decryption key granted by data owner
Figure 233730DEST_PATH_IMAGE111
Decrypting the ciphertext; the correctness of the security query can be verified by the following derivation:
Figure 855204DEST_PATH_IMAGE112
if the trapdoor
Figure 771207DEST_PATH_IMAGE113
Query keyword in (1)
Figure 570667DEST_PATH_IMAGE114
And
Figure 939332DEST_PATH_IMAGE109
the middle index key w is equal, i.e.
Figure 974284DEST_PATH_IMAGE115
Then:
Figure 135007DEST_PATH_IMAGE116
CN202111085205.0A 2021-09-14 2021-09-14 Police affair resource data governance cooperation method based on block chain Pending CN113554421A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111085205.0A CN113554421A (en) 2021-09-14 2021-09-14 Police affair resource data governance cooperation method based on block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111085205.0A CN113554421A (en) 2021-09-14 2021-09-14 Police affair resource data governance cooperation method based on block chain

Publications (1)

Publication Number Publication Date
CN113554421A true CN113554421A (en) 2021-10-26

Family

ID=78134624

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111085205.0A Pending CN113554421A (en) 2021-09-14 2021-09-14 Police affair resource data governance cooperation method based on block chain

Country Status (1)

Country Link
CN (1) CN113554421A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114142996A (en) * 2021-11-18 2022-03-04 贵州大学 Searchable encryption method based on SM9 cryptographic algorithm
CN117033738A (en) * 2023-10-07 2023-11-10 广东省信息工程有限公司 Digital file management method and system based on blockchain
CN117874826A (en) * 2024-03-11 2024-04-12 成都数据集团股份有限公司 Database authority management system and method
CN117874826B (en) * 2024-03-11 2024-05-24 成都数据集团股份有限公司 Database authority management system and method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113127652A (en) * 2020-01-15 2021-07-16 腾讯科技(北京)有限公司 Abstract acquisition method, device and computer readable storage medium
CN113129038A (en) * 2021-06-21 2021-07-16 浙江数秦科技有限公司 Green food evaluation system based on block chain
CN113177670A (en) * 2021-05-27 2021-07-27 腾讯科技(深圳)有限公司 Data processing method, device, equipment and readable storage medium

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113127652A (en) * 2020-01-15 2021-07-16 腾讯科技(北京)有限公司 Abstract acquisition method, device and computer readable storage medium
CN113177670A (en) * 2021-05-27 2021-07-27 腾讯科技(深圳)有限公司 Data processing method, device, equipment and readable storage medium
CN113129038A (en) * 2021-06-21 2021-07-16 浙江数秦科技有限公司 Green food evaluation system based on block chain

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
宋俊典等: "基于区块链的数据治理协同方法", 《计算机应用》 *
尹辉: "云计算环境下隐私保护的安全查询技术研究", 《中国博士学位论文全文数据库》 *
盛念祖等: "基于区块链智能合约的物联网数据资产化方法", 《浙江大学学报(工学版)》 *
顾颖等: "基于区块链的新型政务业务协同模式研究", 《江苏科技信息》 *
黄洁华等: "众筹区块链上的智能合约设计", 《信息安全研究》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114142996A (en) * 2021-11-18 2022-03-04 贵州大学 Searchable encryption method based on SM9 cryptographic algorithm
CN114142996B (en) * 2021-11-18 2023-09-05 贵州大学 Searchable encryption method based on SM9 cryptographic algorithm
CN117033738A (en) * 2023-10-07 2023-11-10 广东省信息工程有限公司 Digital file management method and system based on blockchain
CN117033738B (en) * 2023-10-07 2023-12-08 广东省信息工程有限公司 Digital file management method and system based on blockchain
CN117874826A (en) * 2024-03-11 2024-04-12 成都数据集团股份有限公司 Database authority management system and method
CN117874826B (en) * 2024-03-11 2024-05-24 成都数据集团股份有限公司 Database authority management system and method

Similar Documents

Publication Publication Date Title
EP4120114A1 (en) Data processing method and apparatus, smart device and storage medium
CN108833081B (en) Block chain-based equipment networking authentication method
CN109040271B (en) Network equipment integrity protection method under distributed environment
US11410145B2 (en) Blockchain-implemented method for control and distribution of digital content
CN109314636B (en) Cryptographic method and system for secure extraction of data from blockchains
JP2021512569A (en) Blockchain data processing method, management side, client side, converter and medium
Ali et al. Blockchain and the future of the internet: A comprehensive review
ul Hassan et al. Blockchain and the future of the internet: a comprehensive review
CN113312574A (en) Cloud data integrity auditing method based on block chain
CN113554421A (en) Police affair resource data governance cooperation method based on block chain
WO2023082690A1 (en) Matrix consortium blockchain based sponsoring method capable of concealing real name
CN109428892A (en) Multistage rewritable block chain
CN115049398A (en) Complete data asset trusted management and value transfer system and method
CN114285867B (en) Air-railway combined transport data sharing system based on alliance chain and attribute encryption
El Defrawy et al. Founding digital currency on secure computation
CN114900290A (en) Data transaction model and privacy protection method based on block chain
CN112801778A (en) Federated bad asset blockchain
CN115270145A (en) User electricity stealing behavior detection method and system based on alliance chain and federal learning
Yang et al. A blockchain-based keyword search scheme with dual authorization for electronic health record sharing
Jiang et al. Research on the application of blockchain in copyright protection
Xie et al. A novel blockchain-based and proxy-oriented public audit scheme for low performance terminal devices
Gao et al. BFR-SE: a blockchain-based fair and reliable searchable encryption scheme for IoT with fine-grained access control in cloud environment
TWM586416U (en) Implementing a multi-center, distributed verification system for transactions based on blockchain technology
CN117043772A (en) Block chain data separation
Xiao et al. A collaborative auditing scheme with dynamic data updates based on blockchain

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20211026

RJ01 Rejection of invention patent application after publication