CN117749349A - Block chain-based secure data market management system and method - Google Patents
Block chain-based secure data market management system and method Download PDFInfo
- Publication number
- CN117749349A CN117749349A CN202311808822.8A CN202311808822A CN117749349A CN 117749349 A CN117749349 A CN 117749349A CN 202311808822 A CN202311808822 A CN 202311808822A CN 117749349 A CN117749349 A CN 117749349A
- Authority
- CN
- China
- Prior art keywords
- data
- level
- industry
- key
- transaction
- 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
- 238000000034 method Methods 0.000 title claims abstract description 68
- 230000007774 longterm Effects 0.000 claims abstract description 51
- 238000007726 management method Methods 0.000 claims abstract description 49
- 230000004044 response Effects 0.000 claims abstract description 46
- 238000004364 calculation method Methods 0.000 claims abstract description 19
- 230000006399 behavior Effects 0.000 claims abstract description 5
- 238000002591 computed tomography Methods 0.000 claims description 62
- 238000004422 calculation algorithm Methods 0.000 claims description 60
- 238000012795 verification Methods 0.000 claims description 41
- 238000013523 data management Methods 0.000 claims description 24
- 230000001960 triggered effect Effects 0.000 claims description 10
- 230000007246 mechanism Effects 0.000 claims description 5
- 238000004806 packaging method and process Methods 0.000 claims description 4
- 238000012545 processing Methods 0.000 claims description 4
- 230000032683 aging Effects 0.000 claims description 3
- 238000012790 confirmation Methods 0.000 claims description 3
- 125000004122 cyclic group Chemical group 0.000 claims description 3
- 239000003999 initiator Substances 0.000 claims description 3
- 230000001105 regulatory effect Effects 0.000 claims description 3
- 238000012546 transfer Methods 0.000 claims description 3
- 238000005304 joining Methods 0.000 claims description 2
- 230000001360 synchronised effect Effects 0.000 claims description 2
- 238000010200 validation analysis Methods 0.000 claims description 2
- 238000011160 research Methods 0.000 description 11
- 238000012423 maintenance Methods 0.000 description 7
- 238000013502 data validation Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 206010028980 Neoplasm Diseases 0.000 description 3
- 201000011510 cancer Diseases 0.000 description 3
- 238000012550 audit Methods 0.000 description 2
- 238000013475 authorization Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 229940079593 drug Drugs 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
Landscapes
- Storage Device Security (AREA)
Abstract
The invention belongs to the technical field of blockchains combined with an anonymization method, and discloses a blockchain-based secure data market management system and a blockchain-based secure data market management method, which construct a tree-shaped blockchain group architecture and comprise a data value calculation model based on transaction behaviors; the user registration authentication accesses the data market network, and the encrypted plaintext is uploaded to an IPFS cloud server for uplink authentication; forming a data catalog at a high-level node by the data manager and the data value calculation intelligent contract at each level; the data consumer generates a transaction protocol application, signs and links up; the data owner generates a transaction response protocol signature and then issues a uplink; the data consumer verifies the signature and then obtains a plaintext; the data manager uses the private key to cancel the ring signature to obtain a long-term public key of the data consumer, and obtains the real identity through the authentication center to realize supervision; a trusted data directory and a data value system are formed, flexible expansibility is achieved, and safe and reliable data circulation can be achieved.
Description
Technical Field
The invention belongs to the technical field of blockchains combined with an anonymization method, and particularly relates to a blockchain-based secure data market management system and method.
Background
In the digital economic era, with the development of technologies such as big data, cloud computing, artificial intelligence and the like, the data is already a basic resource parallel to land, labor force, capital and technology, and is integrated into various fields such as production, distribution, circulation, consumption, social service management and the like. At present, the problems of rights protection, standard circulation, value calculation and the like of data also lack related standards and mechanisms, and the establishment of a unified data mass market becomes a solution for efficiently exerting the value of the data. The traditional centralized system management mode has the problems of multi-platform cross management, incompatibility among systems, easy tampering or loss of data and the like. The blockchain technology is used as an electronic account book with decentralization and distributed consensus, plays a role of 'certificate storage', and has very wide application prospect in the aspects of protecting data property rights, guaranteeing data transaction, supporting data value credit system establishment and the like.
Dynamic security protection of the whole process of data storage, circulation and use is a bottom line for maintaining the "normal order" of the data market, and protection of the transaction process is an important aspect of data security circulation. In mass data sharing, the data owner typically does not publish the data on the blockchain, but stores the data in the cloud server after encryption. If the data owner directly sends the private key of the data owner to a consumer or a cloud server, the problems of transmission channel safety, data unauthorized access and the like exist. In the prior art, the proxy re-encryption technology is adopted to solve the problem of data security sharing in the cloud computing environment, but the scheme cannot ensure a secure channel generally so that a public key indicating a consumption identity is not disclosed, thereby causing the security problem of transaction privacy disclosure.
Therefore, how to establish a data market which meets the requirements of mass, multi-type hierarchy and multi-party cross-domain scenes, not only can finish the data validation and the credible records of the value thereof, but also can support the safe circulation of the data, and provide reliable protection for the participants becomes a problem to be solved urgently.
Disclosure of Invention
In order to solve the technical problems, the invention provides a safe data market management system and method based on a blockchain, which constructs a tree-shaped blockchain group network system, each node in the tree maintains a alliance chain, a wide-area trusted data directory and a wide-area value system are built together, and a data transaction process can be evidence obtained by a data manager through block records, so that an effective solution is provided for building a standard, uniform, efficient circulation, safe and reliable data market.
The invention relates to a safe data market management system based on a block chain, which comprises a multi-fork tree system model constructed by advanced nodes, intermediate nodes, primary nodes and industry nodes and users;
the user comprises a data manager, a data owner and a data consumer;
the data manager refers to a data supervisor in each node and is responsible for authentication registration, data validation and data catalog information maintenance and data transaction maintenance and audit of each user;
The data owner refers to a user who performs data property certificate issuing on a chain and can respond to a data transaction request related to the user;
the data consumer refers to a user who initiates a transaction request and applies for obtaining certain data;
the root node layer of the multi-fork tree system model is a high-level layer, the leaf node layer is an industry layer, and the middle node layer is a medium-level layer and a primary layer; the other three layers are divided according to the size of the jurisdiction area except the industry layer, the jurisdiction areas of the high-level layer, the middle-level layer and the primary layer respectively correspond to a level I area, a level II area and a level III area, the level I area comprises a plurality of level II areas, and a plurality of level III areas form a level II area; the industry layer belongs to the III level area;
the root node is a high-level node, and is provided with a high-level data alliance chain, namely a high-level chain, which is managed by the highest data management department and is commonly maintained by the data management parties of all the managed II-level areas;
a middle-level data alliance chain, namely a middle-level chain, which is respectively built by each level-II region, is responsible for management by a middle-level data management department and is commonly maintained with all the governed level-III regions is deployed on the middle node taking the high-level node as a father node;
Each III-level region is in the jurisdiction range, and industry administrators of the jurisdiction region are assigned according to industry category division; on a primary node taking a middle-level node as a father node, each III-level region is deployed with a primary data alliance chain, namely a primary chain, which is respectively constructed and managed by a primary data management department and is commonly maintained with all industry management nodes in the region;
the leaf nodes are industry nodes, and an industry manager assigned by each primary node is responsible for management, and a primary industry data alliance chain, namely an industry chain, which is commonly maintained by different users of the same industry in the region is deployed.
Further, in the system, the data owner self-defines the data to be authenticated into public data and non-public data, the system marks the security level of the non-public data in the data catalog, and marks the value tuples of the public data;
the non-public data is scaled by the data provider to a secret level se= {1,2,3}, se=1 representing a "secret" level, se=2 representing a "secret" level, se=3 representing a "secret" level;
can disclose data to make data value V (Pr) c ，Pr t ，V rt ) Marking, where Pr c Is the calculated price, i.e. pricing, pr, provided by the data owner t Is the market price, i.e. the last price, V rt Is the real-time value V of data formed by calculating according to the frequency, range and regulation factors of a data manager and related to time rt The method comprises the steps of carrying out a first treatment on the surface of the Wherein Pr is c 、Pr t Is the unit of transaction currency, V rt Is 1; pr before the first circulation of data t And V rt All are set to 0, and the intelligent contract updates V in the circulation process;
V rt ＝f(d)×A t +A r f (d) is an aging function, d represents the number of days from the last transaction sent,A t representing the increment of data circulation value-> n i Representing the number of transactions in different ranges, a i Representing the value-added coefficients of transactions in different ranges, 1 to 4 respectively corresponding to the circulation in the same industry in the same class III region, the circulation in different industries in the same class III region, the circulation between different class III regions in the same class II region and the circulation between different class II regions, A r Representing the amount of data manager value adjustment.
A blockchain-based secure data market management method, the method implemented based on the model, comprising the steps of:
step 1, initializing a system: the key management center calls a system initialization algorithm to initialize according to the security parameters, and returns the public parameters of the system;
step 2, long-term key generation and identity authentication: the user invokes a key generation algorithm based on an asymmetric encryption system to autonomously generate a long-term public-private key pair, and performs real-name authentication on CA (certificate authority) arranged in an industry node by using the long-term public key, and a data manager records the corresponding relationship between the long-term public key and the real identity of the user;
Step 3, determining the data property rights: encrypting the original data plaintext by a data owner by using a symmetric encryption algorithm, generating a ciphertext, and storing the data ciphertext obtained by symmetric encryption into a semi-trusted IPFS cloud server; after receiving the ciphertext index returned by the IPFS cloud server, encrypting the index and the used symmetric key by using the long-term public key, and generating a data property certificate by using the certificate number generated by the system, the long-term public key of the data owner, the encryption information of the data corresponding to the property and the characteristics and the content description of the data;
step 4, data catalog generation: step-by-step confirmation of the data property certificates is completed by each level of node management servers deployed in the system, and the determined data property certificates are generated in a high-level chain to serve as final identifications of the right-confirming data; calculating intelligent contracts by data value deployed in each level of node management servers in the system, dynamically updating data value marks or secret classes, finally forming a catalog of data market rights and corresponding values or secret classes, and displaying public data at the front end;
step 5, the data consumer anonymously issues a data transaction protocol application: the data consumer generates a disposable public key by using a long-term public key held by the consumer, generates a target transaction protocol application by combining the disposable public key, invokes a linkable and revocable ring signature algorithm to sign the transaction protocol application, issues the protocol and the signature to an industry chain where the transaction protocol application is located, and carries out transaction transfer by each level of data management server according to the protocol application until a issuing condition of a verification request is triggered;
Step 6, the data owner issues a data transaction protocol response: the data owner verifies the ring signature message, judges the linkable property of the verified signature, and applies for the unlinked protocol to judge whether to achieve the transaction or not; if agreeing to achieve the transaction, generating a re-encryption key by using a disposable public key in the protocol, generating a transaction protocol response by combining the re-encryption key, and issuing the response to the industry chain after signing; if the transaction is not agreed, the position of writing the re-encryption key in the transaction protocol response is set to 0, and each level of node data management server judges and transmits the transaction protocol response until the message broadcasting condition is triggered.
Step 7, data consumer processes the agreement response: when the data consumer recognizes that the disposable public key in the protocol response message belongs to the data consumer, firstly, verifying the digital signature; after the verification is successful, for a response protocol of successful transaction, re-encrypting ciphertext information in the data property certificate by using a re-encryption key to obtain a new ciphertext, and simultaneously calculating a disposable private key corresponding to the disposable public key in the transaction by using a long-term private key of the user; the one-time private key can be used for completing decryption of the new ciphertext to obtain an index of the ciphertext stored by the target data on the IPFS cloud server and a corresponding symmetric key, and the target data can be obtained by searching the index and completing decryption;
Step 8, data transaction centralized supervision: when the supervision needs to know the real identity of the data consumer, the supervision party confirms and contacts the data supervision party according to the long-term public key of the data manager in the data transaction protocol, the supervision party executes a revocation algorithm capable of being linked with the revocable ring signature, the long-term public key of the anonymous data consumer can be recovered by using the private key of the supervision party, and the supervision party can recover the real identity of the transaction party according to the certificate information recorded by the CA.
Further, the step 1 specifically includes:
step 1-1, calling a system initialization algorithm: pp≡setup (1) λ ) Input system security parameter λ, output system global common parameter pp= (λ, q, G) 1 ,G T ,G,H s ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein G is 1 And G T Is a cyclic group of two identical prime orders q, G is group G 1 E represents the bilinear map G 1 ×G 1 →G T ，Z q Representing integer groups of order q, assuming G 1 And G T The discrete logarithm problem in (a) is difficult, H s Represents G 1 →Z q Is a cryptographic hash function of (c).
Further, the step 2 specifically includes:
user i (i.e. all users who have entered the system by registration) invokes the key generation algorithm (d i ,P i ) Independently generating public and private key pairs by using the GenKey_U (pp), and selecting a random number d by a user i i ∈Z q Calculating P as a private key i ＝d i G as public Key, P is used i Registering real name of CA set in industry node, and recording P by data manager i And the corresponding relation between the true identity of the user i.
Further, the step 3 specifically includes the following steps:
step 3-1, when user i performs data validation as a role of data owner, firstly encrypting the original data plaintext D by using a symmetric Key Key to generate ciphertext CT O The specific encryption process is as follows: CT (computed tomography) O ←Enc key (pp,D,Key)；
Step 3-2, user i uses the data ciphertext CT O Storing the ciphertext hash h into a semi-trusted IPFS cloud server, and calculating the ciphertext hash h by the IPFS cloud server path ＝H s (CT O ) And returns to user i, user i will h path And Key uses its own public Key P i Encryption generation of ciphertext CT OU The specific encryption process is as follows: CT (computed tomography) OU ←Enc(pp,(h path ,Key),P i )；
Step 3-3, user i generates an initial data title certificate DRC 0 (I 0 ,P i ,CT OU ,D e ) The release is carried out on an industry chain; i 0 Representing a base code, the base code being unique to the industry in the class III region; long-term public key P of data owner i Representing attribution of data, CT OU Encryption information representing data corresponding to property rights, D e Representing the data characteristics and content description.
Further, the step 4 specifically includes the following steps:
step 4-1, the industry node management server periodically reads the industry chainNewly added DRC 0 Certificate data, I of each certificate in new data 0 Front marking industry code, updated to I 1 Packaging and writing the primary links in the parent node, namely the primary node; the primary node management server periodically reads the newly-added certificate data in the primary chain and stores the I of each certificate in the new data 1 Pre-marked primary region code updated as I 2 Packaging and writing the data into a parent node, namely a medium-level chain in the medium-level node; the medium node management server periodically reads newly-added certificate data in the medium chain and stores the I of each certificate in the new data 2 Front-marked mid-level region code updated to I 3 The final package is written into a high-level chain, an ID is determined for each data title certificate, and the determined data title certificate DRC (I 3 ,P i ,CT OU ,D e ) As a unique representation of the pen validation data;
step 4-2, intelligent contract for data value calculation, according to the data value model, for the public data: recording a calculated price Pr submitted by the data ownership person c Generates data value V (Pr c ，Pr t ，V rt ) The method comprises the steps of carrying out a first treatment on the surface of the For non-public data: recording a data security class Se submitted by a data ownership person;
step 4-3, the advanced node calculates the submitted data value mark V or secret mark Se according to the DRC data set of the advanced chain and the intelligent contract, integrates the four-level data property directories of the advanced, intermediate, primary and industry, displays the data market directory in the front-end system, and the user can acquire the DRC information required by the user and the corresponding data value triplet V (Pr c ，Pr t ，V rt ) Or secret scale; when no transaction occurs, the intelligent contract can calculate the real-time value V of the update data according to the recorded value of d rt Value tags for data sets other than 0.
Further, the step 5 specifically includes the following steps:
assuming Bob represents the data consumer and Alice represents the data owner, they all belong to user i who was registered to the joining system in step 2, assuming that the data consumer Bob wantsThe certificate of purchase data owner Alice is DRC (I 3 ,P a ,CT OU ,D e ) Is a piece of data of (a); according to the method of step 2, alice's private key is d a ∈Z q The public key is P a ＝d a G, G; bob has a private key d b ∈Z q Public key P b ＝d b G, G; the industry data manager is used as an anonymous revocation mechanism, and the private key of the manager Linda of the industry chain where Bob is located is d l ∈Z q Public key P l ＝d l G, selecting random number r E Z q Setting revocation parameter R repeal ＝rG；
Step 5-1, the data consumer Bob calls a one-time public key generation algorithm: (P) OTB ,R o )←GenOTPK(pp,P b ) Selecting a random number r o ∈Z q Calculating R o ＝r o G, G; calculate t=h s (r o P b ) Generating a one-time public key P of Bob current transaction OTB ＝tG+P b As an anonymous address for the current transaction; and combine the destination UseObject, payment information Payment, protocol supervisor address P of the use destination UseObject, payment information Payment, and protocol supervisor address P of the target data l And a supervision parameter R repeal Etc. together with anonymous address P OTB Together listed as a transaction protocol M ta (P OTB ,DRC,UseObject,Payment,P l ,R repeal )；
Step 5-2, data consumer Bob invokes a linkable and revocable ring signature algorithm σ≡larrsig (pp, S, d) b ,M ta ) For transaction protocol message M ta Signing, (1) randomly selecting the public key of n-1 users and the own long-term public key P b Mixing to form a public key set s= { P 1 ,P 2 ,…,P α ,…,P n }(P α ＝P b ) The method comprises the steps of carrying out a first treatment on the surface of the (2) The policing information E and the key image J are calculated,(3) At Z q Is selected randomly { q } i I=1, …, n, i+.alpha } and { w- i I=1, …, n, i+.alpha }, calculate L i ＝q i G+w i P i (i≠Alpha) and->(4) Selecting a random number k E Z q Calculate L α =kg and R α ＝e(R repeal ,P l ) k The method comprises the steps of carrying out a first treatment on the surface of the (5) Calculate h c ＝H s (M ta ||L 1 ,…,L n ||R 1 ,…,R n ||S||P l ||R repeal I E); (6) Calculating w α ＝h c -∑w i mod q(i＝1,…,n,i≠α)，q α ＝k-w α d α mod q, generating signature σ= (J, w) 1 ,…,w n ,q 1 ,…,q n ) The method comprises the steps of carrying out a first treatment on the surface of the Bob signs information sigma, protocol message M ta Release to the industry chain where it is located;
step 5-3, industry node management server according to protocol message M ta I contained in DRC of (B) 3 Judging whether the owner Alice of the target data asset belongs to a member directly or indirectly administered by the current level alliance chain; a total of 4 cases are included: (1) Alice and Bob belong to the same industry in the same class III region, σ and M ta Issuing a request for requesting Alice verification on an industry chain to which the request belongs immediately; (2) Alice and Bob belong to different industries in the same class III region, bob will σ and M ta After publishing the industry chain to which he belongs, the data manager of the industry node will sigma and M ta Issuing a request for triggering Alice verification immediately on the primary chain; (3) Alice and Bob belong to different class III regions of the same class II region, bob will σ and M ta After publishing the industry chain to which he belongs, the data manager of the industry node will sigma and M ta Published on the primary chain to which the primary node's data manager will σ and M ta Issuing a request for requesting Alice verification on the affiliated intermediate-level chain immediately; (4) Alice and Bob belong to different class II regions, bob will σ and M ta After publishing the industry chain to which he belongs, the data manager of the industry node will sigma and M ta Published on the primary chain to which the primary node's data manager will σ and M ta Published on the affiliated intermediate-level chain, the intermediate-level nodeThe data manager will σ and M ta Issuing a request for requesting Alice verification on an advanced chain and triggering the request for requesting Alice verification immediately; and according to the 4 cases, the data management server networks of all levels directly or indirectly issue verification requests to Alice in a single-hop or multi-hop mode.
Further, the step 6 specifically includes the following steps:
step 6-1, the data owner Alice calls a link-revocable ring signature verification algorithm: 0/1≡LARRVer (pp, S, sigma, M) ta ) Verifying the ring signature message; (1) Calculate L' i ＝q i G+w i P i ，(2) Calculate->(3) Calculate h c′ ＝H s (M ta ||L′ 1 ,…,L′ n ||R′ 1 ,…,R′ n ||S||P l ||R repeal I E); (4) If h c_ver ＝h c′ If the verification is true, the algorithm outputs 1, the signature is proved to be effective, the execution is continued, otherwise, the verification fails, the algorithm outputs 0, and the execution is stopped;
step 6-2, the data owner Alice maintains a history key mirror listAfter each verification is successful, executing a link-revocable ring signature link-based judgment algorithm: />The key image J in signature sigma is combined with the history key image list +.>In contrast, if present in the list, it is indicated that the transaction protocol has been processed, a replay attack may occur, there is a chaining, return 1, stop execution, otherwise it is indicated that the transaction protocol has not been processed, there is no chaining, return 0, add the key image J in the signatureAnd (5) continuing to execute in the list. Normally, any observer can only know that the signature is done by one of the ring members and not specifically by which user;
step 6-3, if agreeing to the trade, the data owner Alice calls the re-encryption key generation algorithm: RPK (resilient force-resistant K) a→otb ←GenRPK(pp,d a ,P OTB ) Using its own private key d a And a disposable address P in a transaction protocol OTB Generating a re-encryption key RPK a→otb RPK is to a→otb Write transaction protocol application message M ta In generating transaction protocol reply message M tr (P OTB ,DRC,UseObject,Payment,P l ,R repeal ,RPK a→otb ) The method comprises the steps of carrying out a first treatment on the surface of the If not, setting the re-encryption key position to be 0;
step 6-4, the data owner Alice calls a transaction response digital signature generation algorithm: τ≡PRSig (pp, d) a ,M tr ) The method comprises the steps of carrying out a first treatment on the surface of the (1) Calculate h re ＝H s (RPK a→otb ) The method comprises the steps of carrying out a first treatment on the surface of the (2) Calculation of CT re ←Enc(pp,d a ,h re ) The method comprises the steps of carrying out a first treatment on the surface of the (3) Calculate τ= (CT re ,h re ) Using the private key d of the user according to the steps a For reply message M tr Digital signature is carried out to obtain tau, and tau and M are combined tr And published to the industry chain where it resides;
step 6-5, judging M by each level of data manager server tr Corresponding M ta Whether to issue on the current level blockchain specifically includes 4 cases: (1) Alice and Bob belong to the same industry in the same class III region, then Alice will be τ and M tr Triggering broadcast conditions immediately after release in the industry chain to which they belong; (2) Alice and Bob belong to different industries in the same class III region, then Alice will be τ and M tr After publishing the industry chain to which he belongs, the data manager of the industry node will τ and M tr The broadcast condition is immediately triggered after the broadcast is issued on the primary chain; (3) Alice and Bob belong to different class III regions of the same class II region, then Alice will be τ and M tr After publishing the industry chain to which he belongs, the data manager of the industry node will τ and M tr Is distributed atOn the primary chain, the data manager of the primary node will be τ and M tr The broadcast condition is triggered immediately after the broadcast is issued on the affiliated intermediate-level chain; (4) Alice and Bob belong to different class II regions, alice will then τ and M tr After publishing the industry chain to which he belongs, the data manager of the industry node will τ and M tr Published on the primary chain to which it belongs, the data manager of the primary node will be τ and M tr Published on the affiliated intermediate-level chain, the data manager of the intermediate-level node will tau and M tr Published on the high-level chain, and then triggers the broadcast condition. After triggering the broadcast conditions, each level of manager server broadcasts the response protocol M down the tree network tr And signature tau thereof, to the anonymous transaction initiator;
step 6-6, executing the calculation method in the intelligent contract execution data value model, and updating the calculation price Pr submitted by the data ownership person c Updating market price Pr according to the price of the successful data transaction protocol message t Calculating and updating the data circulation value increment A according to successful data transaction behaviors t In combination with adjustment of delta A by a data manager r Calculate V rt Update data value V (Pr) c ，Pr t ，V rt ) The method comprises the steps of carrying out a first treatment on the surface of the The successful data transaction is a protocol response message M returned by the data owner tr Transactions with intermediate re-encryption key bits other than 0; for non-public data: the data security class Se submitted by the data ownership person can be updated; the updated content is synchronized into the data directory.
Further, the step 7 specifically includes the following steps:
step 7-1 anonymous transaction applicant Bob recognizes the protocol reply message M tr One-time public key P in (a) OTB When the method belongs to the self, firstly, a transaction response digital signature verification algorithm is called: 0/1≡PRVer (pp, τ, M) tr ). (1) Calculate h' re ＝H s (RPK a→otb ) The method comprises the steps of carrying out a first treatment on the surface of the (2) Calculate h re_ver ←Dec(pp,P a ,CT re ) The method comprises the steps of carrying out a first treatment on the surface of the (3) Judging h' re ＝h re_ver If yes, returning to 1, indicating that the signature verification is successful, corresponding to the response protocol M tr Further proceedingProcessing; otherwise, returning to 0, indicating that the signature verification fails, and not processing the message of the target user;
step 7-2, data Consumer Bob responding to protocol response message M tr Judging, if the re-encryption key bit in the response protocol is 0, indicating that the transaction fails, otherwise, acquiring M tr RPK of (B) a→otb For CT OU Performing a re-encryption algorithm CT OC ←ReEnc(pp,CT OU ,RPK a→otb ) Obtain the public key P by one time OTB Encrypted ciphertext CT OC ；
Step 7-3, the data consumer Bob calls a one-time private key calculation algorithm: s is S OTB ←CalOTSK(pp,P OTB ,R o ,d b ) With a long-term private key d held by the person b Calculation of P OTB Corresponding one-time private key S OTB ＝H s (d b R o )+d b 。
Step 7-4, the data consumer Bob invokes a decryption algorithm (h path ,Key)←Dec(CT OC ,S OTB ) With the calculated one-time private key S OTB Is CT OC Decrypting to obtain the index h of ciphertext of the piece of data stored on IPFS path And a corresponding symmetric Key;
step 7-5, data consumer Bob refers to ciphertext index h path And accessing the target data ciphertext in the IPFS cloud server, and decrypting by using the symmetric Key Key to obtain the plaintext of the data.
Further, the step 8 specifically includes:
when there is a regulatory requirement that the true identity of the data consumer needs to be known, a linkable and revocable ring signature revocation algorithm is performed by the administrator Linda: p (P) b ←LARRR(pp,S,σ,d l ) Traversing the public key in the set S and judgingP output when equation is established i I.e. the long-term public key P of the data consumer Bob b The supervision party Linda can recover the true identity of the transaction party Bob according to the certificate information recorded by the CA.
The beneficial effects of the invention are as follows: the invention builds a tree-structured block chain group network, and performs data validation through a hierarchical block chain system to form a strategy of a data directory; the data property directory is maintained in a grading manner, the data resource is integrated in a standard credible manner, and the protection of the data property is realized; building a data organization structure capable of being flexibly expanded, and promoting the circulation efficiency of data elements in the market; establishing a trusted data value system, and calculating the data value by the intelligent contract according to transaction behaviors recorded in the blockchain to provide a trusted decision basis; the invention provides a data consumer identity protection mechanism, wherein a data consumer can anonymously initiate a transaction application through a disposable public key and a ring signature method, so that the transaction identity and behavior can not be tracked and analyzed, and meanwhile, a proxy re-encryption method can be combined to achieve safe data sharing; the invention also provides a safe transaction tracking mechanism, when the supervision requirement appears, the data manager can cancel the ring signature so as to obtain the true identity of the data consumer, thereby realizing controllable anonymity and having wide application prospect.
Drawings
FIG. 1 is a schematic diagram of a secure data market management system according to the present invention;
FIG. 2 is a timing diagram of a secure data market management method according to the present invention;
FIG. 3 is a timing diagram of the operation of data consumers and data owners in a chain group with different span area spacings described in the present invention;
FIG. 4 is a diagram illustrating a data directory structure according to the present invention.
Detailed Description
In order that the invention may be more readily understood, a more particular description of the invention will be rendered by reference to specific embodiments that are illustrated in the appended drawings.
Referring to fig. 1, the invention provides a safe data market management system based on a blockchain, which comprises a multi-fork tree system model constructed by advanced nodes, intermediate nodes, primary nodes and industry nodes, wherein a root node layer of the multi-fork tree system model is an advanced layer, a leaf node layer is an industry layer, and two intermediate nodes are an intermediate layer and a primary layer; the users of the system comprise three user roles of a data manager, a data owner and a data consumer.
In this embodiment, the establishment of a standardized data management market to which the system is applied is exemplified.
In the implementation process, a high-level layer is established as a root node in a certain I-level area by a certain data management service enterprise I-level organization (Data Management Services Enterprise I, DMSE-I), an industry level is a leaf node, and a middle level and a primary level are four-layer multi-fork tree-shaped block chain group networks of intermediate nodes. A dedicated communication network connection is established in a tree structure, equipped with server devices and client applications required for data storage, computation and transmission.
On the root node (hereinafter referred to as the advanced node), an advanced data federation chain (hereinafter referred to as the advanced chain) managed by the DMSE-I and maintained together with all of the class II branch authorities (Data Management Services Enterprise II, DMSE-II) established by the enterprise in all of the class II areas within the service area is deployed. The DMSE-II of each secondary region respectively establishes a medium-level data alliance chain (hereinafter referred to as medium-level chain) which is managed by the DMSE-II and is maintained together with all III-level branch authorities (Data Management Services Enterprise III, DMSE-III) established by the enterprise in all the managed III-level regions. And dividing the industry category of each class III area within the range of the jurisdiction according to the standard specified by the DMSE-I, and assigning an industry manager of the class III area. On an intermediate node taking a middle-level node as a father node (hereinafter referred to as a primary node), each class III region is deployed to respectively construct a primary data alliance chain (hereinafter referred to as a primary chain) which is managed by each DMSE-III and is commonly maintained with all industry management nodes in the region. The leaf nodes (hereinafter referred to as industry nodes) deploy industry data alliance chains (hereinafter referred to as industry chains) that are commonly maintained by different data providers of the same industry in the class III region, and are responsible for management by industry administrators assigned by each primary node.
A user model consisting of a data manager, a data owner or a data consumer is built in the four-layer multi-way tree-like blockchain group network.
In particular, data managers refer to users in the various levels of branches of the data management service enterprise in advanced, intermediate, primary, and industry nodes, both as certificate authorities (Certificate Authority, CA) in the current level federation chain and as members of the federation chain authentication maintenance in its parent node. And the authentication registration, data authorization and data directory information maintenance, data transaction maintenance and audit and the like of the user are responsible. The data owner and the data consumer refer to users who can conduct activities such as data right and data transaction in the data market after registering in a certain industry chain. The users who issue the data property certificates on the chain are collectively called as data owners and can respond to data transaction requests related to the users; the user who initiates the transaction request, applying for obtaining certain data, is referred to as the data consumer, and may be the owner of certain data at the same time.
A computationally updatable data value model is built in the four-layer multi-way tree-like blockchain swarm network as described below.
Specifically, the data owner can divide the to-be-determined data into public data and non-public data in a self-defined mode, the non-public data is shared by specific industry group personnel, and the public data can be published on a data catalog which is open to the public. The non-public data is scaled by the data provider to a secret level se= {1,2,3}, se=1 representing a "secret" level, se=2 representing a "secret" level, se=3 representing a "secret" level. Can disclose data to make data value V (Pr) c ，Pr t ，V rt ) Marking, where Pr c Calculated price (pricing), pr, provided by the data owner t Is the market price (last price) V rt Is the real-time value V of data formed by calculating according to factors such as the frequency, the range and the regulation and control of a data manager and the like of circulation related to time rt Wherein Pr is c 、Pr t Is the unit of transaction currency, V rt Is 1. Pr before the first circulation of data t And V rt All are set to 0, and in the circulation processThe smart contract updates V.
V rt ＝f(d)×A t +A r F (d) is an aging function, d represents the number of days from the last transaction sent,A t representing the increment of data circulation value->n i Representing the number of transactions in different ranges, a i Value-added coefficient { a } representing transactions in different ranges 1 ＝1,a 2 ＝10,a 3 ＝50,a 4 =300 },1 to 4 correspond to the circulation within the same industry in the same class III region, the circulation of different industries in the same class III region, the circulation between different class III regions in the same class II region, and the circulation between different class II regions, respectively, a r Representing the amount of data manager value adjustment.
The data owner in this embodiment is II 01 -III 02 Regional A medical institution, data consumer is II 03 -III 04 Regional B college of college; with reference to figure 2 of the drawings,representing the medical industry>Representative III 02 Area (S)>Represents II 01 Area (S)>Representing the scientific research industry, the>Representative III 04 Area (S)>Represents II 03 An area. The following is the security in this embodimentThe specific implementation process of the data management method comprises the following steps:
step 1, initializing a system: and the key management center of the DMSE-I calls a system initialization algorithm to initialize according to the security parameters, and returns the public parameters of the system.
Step 2, long-term key generation and identity authentication: and the user invokes a key generation algorithm based on an asymmetric encryption system to autonomously generate a long-term public-private key pair, and performs real-name authentication on a CA (certificate authority) set in an industry node (an administrator user is registered in a previous-level node, and the highest-level administrator node does not need to be registered) by using the long-term public key, wherein a data administrator records the corresponding relation between the long-term public key and the real identity of the user.
Step 3, determining the data property rights: II 01 -III 02 An area a medical institution as a data owner, which has a data set D of a desensitized treatment record for a cancer patient in the interval of 2003 to 2023 for 20 years, firstly encrypts the data set using the AES encryption algorithm to generate ciphertext; storing the data ciphertext obtained by symmetric encryption into a semi-trusted IPFS cloud server, receiving a ciphertext index returned by the IPFS cloud server, encrypting the ciphertext index and a used symmetric key by using a long-term public key of the user, and generating a preliminary data property certificate belonging to the hospital data set D by using the related information;
Step 4, uploading the data property certificate to a data catalog: by medical industry nodes, III deployed in a system 02 Primary node, II 01 Step-by-step confirmation of the preliminary data property certificate in the step 3 is finished step by the intermediate node and the advanced node, and the confirmed data property certificate is generated in an advanced chain and used as a final identification of the right-confirming data; the data value markers are updated by a "data value computation intelligent contract" deployed in the system in the above-described three-level node management server. Adding the final data property certificate and the data value mark into the existing data catalogue, and displaying the public data in a front-end query system;
step 5, the data consumer anonymously issues a data transaction protocol application: II 03 -III 04 Regional B college of college as a numberTo the customer's desire to obtain II in steps 3 to 4 01 -III 02 Data issued by regional A medical institution users, the university uses the long-term public key held by the university to generate a disposable public key, and generates a target transaction protocol application by combining the disposable public key, invokes a linkable and revocable ring signature algorithm to sign the transaction protocol application, and issues the protocol and the signature to III 04 On a scientific research industry chain (an industry node manager user to which the regional primary node belongs is used as an anonymous revocation authority), each level of data management server carries out transaction transfer according to protocol application until a release condition of a verification request is triggered;
Step 6, the data owner issues a data transaction protocol response: II 01 -III 02 A medical institution in the area verifies the ring signature information, judges the interlinkability of the signature passing the verification, judges that the information is a chainless protocol application, then agrees to achieve transaction, generates a re-encryption key by using a disposable public key in the protocol, generates a transaction protocol response in combination with the re-encryption key, and issues the response to the signature to III together with the response protocol 02 On an industry chain maintained by the medical industry nodes governed by the regional primary nodes, judging and transmitting transaction protocol responses by each level of node data management server until a message broadcasting condition is triggered;
step 7, the data consumer processes the protocol response: II 03 -III 04 When the college of university and college in the area recognizes that the disposable public key in the protocol response message belongs to the college, firstly, verifying the digital signature, after the signature verification is successful and judging that the digital signature is a response protocol (the re-encryption key bit is not 0) of a successful transaction, re-encrypting ciphertext information in the data property certificate by using the re-encryption key to obtain a new ciphertext, and simultaneously, calculating a disposable private key corresponding to the disposable public key in the transaction by using the long-term private key of the college, and decrypting the new ciphertext by using the disposable private key to obtain an index of ciphertext stored by the target data D on the IPFS cloud server and a corresponding symmetric key, and searching and decrypting to obtain the target data;
Step 8, data transaction centralized supervision: when the supervision requirement needs to know the true identity of the data consumer, confirming and contacting III according to the public key of the data manager in the data transaction protocol 04 The data supervisor of the scientific research industry node governed by the regional primary node executes a revocation algorithm capable of being linked and revoked to the ring signature, the long-term public key of the anonymous data consumer can be recovered by using the private key of the supervisor, and the transaction party II is recovered according to the certificate information recorded by CA (certificate authority) in the supervisor node 03 -III 04 The true identity of the college of university of the area B.
The step 1 specifically comprises the following steps:
step 1-1, calling a system initialization algorithm: pp≡setup (1) λ ) Inputting a system safety parameter h and outputting a system global public parameter pp= (lambda, q, G) 1 ,G T ,G,H s ). Wherein G is 1 And G T Is a cyclic group of two identical prime orders q, G is group G 1 E represents the bilinear map G 1 ×G 1 →G T ，Z q Representing integer groups of order q, assuming G 1 And G T The discrete logarithm problem in (a) is difficult, H s Represents G 1 →Z q Is a cryptographic hash function of (c).
The step 2 specifically comprises the following steps:
step 2-1, II 01 -III 02 A medical institution user in the area invokes a key generation algorithm GenKey_U (pp) and selects a random number d a ∈Z q Computing P as a long-term private key a ＝d a G serves as a long term public key. Similarly, II 03 -III 04 Regional B college of medical school user, generating long-term private key d b Long term public key P b ；III 04 Generating a long-term private key d by a scientific research industry node administrator user governed by a regional primary chain l Long term public key P l 。
The medical institution user uses P a III of the directions 02 CA (certificate authority) in the medical industry node governed by the regional primary node carries out real-name registration; the users of the higher universities use P b III of the directions 04 CA (certificate authority) in the scientific research industry node governed by the regional primary node carries out real-name registration. In the registration process, the relevant data manager records the corresponding relation between the long-term public key of the registered user and the true identity of the registered user. (other common and administrator users' key generation and registration processes that should exist in the embodiment system but need not be mentioned are similar to the steps described above and are omitted)
Further, the step 3 specifically includes the following steps:
step 3-1, II 01 -III 02 The medical institution user in the area A encrypts the original data plaintext D by using a symmetric Key Key to generate ciphertext CT O The specific encryption process is as follows: CT (computed tomography) O ←Enc key (pp,D,Key)。
Step 3-2, II 01 -III 02 Regional A medical institution user uses data ciphertext CT O Storing the ciphertext hash h into a semi-trusted IPFS cloud server, and calculating the ciphertext hash h by the IPFS cloud server path ＝H s (CT O ) And returned to the medical facility user who will h path And Key uses its own public Key P a Encryption generation of ciphertext CT OU The specific encryption process is as follows: CT (computed tomography) OU ←Enc(pp,(h path ,Key),P a )。
Step 3-3, II 01 -III 02 Regional A healthcare facility user generates an initial data title certificate DRC 0 (I 0 ,P a ,CT OU ,D e ) Published on industry chain, generating basic code I 0 =111 (in III 02 Only present in the industry in the area), P a Representing data belonging to the medical institution, CT OU Encryption information representing a data set corresponding to property rights, D e The content includes, 1: II 01 -III 02 -a hospital record dataset for cancer patient treatment between year 2003 and year 2023, 20; 2. type (2): images, text, numerical values; 3. size 55TB;4. the application is as follows: scientific research, and the like.
Further, the step 4 specifically includes the following steps:
step (a)4-1，III 02 The medical industry node management server governed by the regional primary node reads the newly increased DRC of the industry chain 0 Certificate data, I therein 0 Front marking industry code Q, updated to I 1 =q111, repackaged write III 02 A regional primary chain; III 02 The regional primary node management server reads newly added certificate data in the primary chain and sends the I of the new certificate 1 Front label III 02 Region code 02, updated to I 2 =02q111, repackaged write II 01 On the regional intermediate chain; II 01 The management server of the nodes in the area periodically reads newly-added certificate data in the medium chain and sends the I of the new certificate 2 Pre-label II 01 Region code 01, updated to I 3 =0102q111, finally packed to write in advanced chain, determine unique ID within the service-accepted domain in one system for the title certificate of data D:0102Q111, deterministic data property certificate DRC (0102Q 111, p a ,CT OU ,D e ) As a unique representation of the pen authorization data.
And 4-2, an intelligent contract for calculating the data value, wherein the attribute of the data set provided by the medical institution is public, and the data value V (0, 0) of the data set is generated according to the calculation definition of the data value model. Because the data set is provided for free by the medical facility, the first two calculated prices of the 3-tuple and the transaction price are both 0; and the data is not circulated for the first time, so the real-time value of the last data of the 3-tuple is also 0.
Step 4-3, referring to fig. 4, the dmse-I server calculates the submitted data value label V or security label Se according to the data property certificate set of the high-level chain and the intelligent contract, integrates the four-level data property catalogs of the "high-level, medium-level, primary and industry", displays the data market catalogs of the publicable data in the front-end system, and the user can obtain the DRC information required by himself and the corresponding data value triples V (Pr) through the modes of hierarchical category or keyword inquiry, DRC number retrieval and the like c ，Pr t ，V rt ). When no transaction occurs, the intelligent contract can calculate the real-time value V of the update data according to the recorded value of d rt A number other than 0Value tags based on the collection.
Further, the step 5 specifically includes the following steps:
II 03 -III 04 the direct regulatory agency of the regional B college of college users is III 04 A scientific research industry node manager governed by the regional primary node, the manager having a fixed supervision parameter (revocation parameter of ring signature) R repeal The calculation mode is as follows: selecting a random number r E Z q Setting revocation parameter R repeal ＝rG。
Step 5-1, II 03 -III 04 Regional B college of universities user invokes the one-time public key generation algorithm: (P) OTB ,R o )←GenOTPK(pp,P b ) Selecting a random number r o ∈Z q Calculating R o ＝r o G, G; calculate t=h s (r o P b ) Generate II 03 -III 04 Area B college of colleges and universities one-time public key P of this transaction OTB ＝tG+P b As an anonymous address for the current transaction. And combining the attribution II generated in the steps 3 to 4 01 -III 02 Data property certificate DRC of region a medical institution, use destination UseObject of data: research and study of xxx drugs of cancer patients and Payment information Payment are carried out: no (the data is free), address P of supervisor of the protocol l Revocation parameter R repeal Etc. together with anonymous address P OTB Together listed as a transaction protocol M ta (P OTB ,DRC,UseObject,Payment,P l ,R repeal )。
Step 5-2, II 03 -III 04 Regional B college of universities and colleges users invoke a linkable and revocable ring signature algorithm σ≡larrsig (pp, S, d) b ,P l ,M ta ) For transaction protocol message M ta And signing. (1) Randomly selecting the public key of n-1 users and the own long-term public key P b Mixing to form a public key set s= { P 1 ,P 2 ,…,P α ,…,P n }(P α ＝P b ) The method comprises the steps of carrying out a first treatment on the surface of the (2) The policing information E and the key image J are calculated,(3) At Z q Is selected randomly { q } i I=1, …, n, i+.alpha } and { w- i I=1, …, n, i+.alpha }, calculate L i ＝q i G+w i P i (i +.alpha) and +.> (4) Selecting a random number k E Z q Calculate L α =kg and R α ＝e(R repeal ,P l ) k The method comprises the steps of carrying out a first treatment on the surface of the (5) Calculate h c ＝H s (M ta ||L 1 ,…,L n ||R 1 ,…,R n ||S||P l ||R repeal I E); (6) Calculating w α ＝h c -∑w i mod q(i＝1,…,n,i≠α)，q α ＝k-w α d α mod q, generating signature σ= (J, w) 1 ,…,w n ,q 1 ,…,q n ). The college user signs the information sigma and the protocol message M ta Release to III 04 The area primary node is located on an industry chain of the node maintenance of the scientific research industry.
Step 5-3, industry node management server according to protocol message M ta I contained in DRC of (B) 3 Determining the owner II of the destination data asset =0901Q 111 01 -III 02 Whether the medical institution user of the area A belongs to a member directly administered or indirectly administered by the current level alliance chain. Referring to case (4), II in FIG. 3 01 -III 02 Regional A medical institution user and II 03 -III 04 Regional B college medical school users belong to different II regions, then the college users will σ and M ta Release at III 04 After the scientific research industry node under the control of the regional primary node maintains the industry chain, the data manager of the industry node carries out sigma and M ta Release at III 04 On the primary chain of region III 04 The data manager of the primary node of the region will sigma and M ta Release at II 03 On the regional intermediate chain, II 03 In the region ofThe data manager of the level node will sigma and M ta Published on the high-level chain, trigger please II immediately 01 -III 02 A request for user authentication by the medical institution for the area. In class I region, II 01 -III 02 The data management server networks of the areas indirectly issue authentication requests to the medical institutions in a multi-hop manner.
The step 6 specifically comprises the following steps:
step 6-1, II 01 -III 02 Regional a healthcare facility users invoke a linkable and revocable ring signature verification algorithm: 0/1≡LARRVer (pp, S, sigma, P) l ,M ta ) The ring signature message is verified. (1) Calculation of
L′ i ＝q i G+w i P i ，(2) Calculate->(3) Calculate h c′ ＝H s (M ta ||L′ 1 ,…,L′ n ||R′ 1 ,…,R′ n ||S||P l ||R repeal I E); (4) If h c_ver ＝h c′ If the verification is true, the algorithm outputs 1, the signature is proved to be effective, the execution is continued, otherwise, the verification fails, the algorithm outputs 0, and the execution is stopped.
Step 6-2, II 01 -III 02 Regional A healthcare facility users maintain a list of historical key imagesAfter each verification is successful, executing a link-revocable ring signature link-based judgment algorithm: /> The key image J in signature sigma is combined with the history key image list +.>In contrast, if the transaction protocol appears in the list, the transaction protocol is processed, replay attack possibly appears, the link exists, the execution is stopped by returning to 1, otherwise, the transaction protocol is not processed, the link does not exist, the link returns to 0, the key mirror image J in the signature is added into the list, and the execution is continued. Normally, any observer can only know that the signature is done by one of the users in the ring member and not specifically which user.
Step 6-3, if agreeing to the trade, II 01 -III 02 The regional a healthcare facility user invokes the re-encryption key generation algorithm: RPK (resilient force-resistant K) a→otb ←GenRPK(pp,d a ,P OTB ) Using its own private key d a And a disposable address P in a transaction protocol OTB Generating a re-encryption key RPK a→otb RPK is to a→otb Write transaction protocol application message M ta In generating transaction protocol reply message M tr (P OTB ,DRC,UseObject,Payment,P l ,R repeal ,RPK a→otb ). (if not agreed, the re-encryption key position is 0)
Step 6-4, II 01 -III 02 The A medical institution user of the area invokes a transaction response digital signature generation algorithm: τ≡PRSig (pp, d) a ,M tr ). (1) Calculate h re ＝H s (RPK a→otb ) The method comprises the steps of carrying out a first treatment on the surface of the (2) Calculation of CT re ←Enc(pp,d a ,h re ) The method comprises the steps of carrying out a first treatment on the surface of the (3) Calculate τ= (CT re ,h re ) Using the private key d of the user according to the steps a For reply message M tr Digital signature is carried out to obtain tau, and tau and M are combined tr And issue to III 02 The area primary node is in an industry chain of medical industry node maintenance.
Step 6-5, corresponding industry node, III 02 Regional primary node, II 01 M is judged upwards in sequence by each level of data manager servers in level nodes and high level nodes in the region tr Corresponding M ta Whether published on the current level blockchain. See fig. 3Case (4), II 01 -III 02 Regional A medical institution user and II 03 -III 04 B college of regional B is in different region II, II 01 -III 02 Regional A medical facility user will τ and M tr Release at III 02 After the industry chain maintained by the medical industry node governed by the regional primary node, the data manager of the industry node will tau and M tr Release at III 02 Regional primary chain III 02 The data manager of the primary node of the region will be τ and M tr Release at II 01 On the regional intermediate chain, the II 01 Data administrators of level nodes in the region will τ and M tr Published on the high-level chain, and then triggers the broadcast condition. After triggering the broadcast condition, each level of manager server starts from the advanced node to broadcast the response protocol M downwards along the tree structure network tr And its signature τ, sent to anonymous transaction initiator II 03 -III 04 Regional B college of university medical school users.
Step 6-6, calculating A by the calculation method in the intelligent contract execution data value model t ＝0+0+0+300×1＝300，V rt =1×300+0=300, and the data value V (0, 300) is updated into the data directory, as shown in fig. 4. Since the data in the embodiment is provided for hospital a for free compliance, the price and last transaction price are always 0.
The step 7 specifically comprises the following steps:
step 7-1, anonymous transaction applicant II 03 -III 04 Regional B college of university user identification protocol response message M tr One-time public key P in (a) OTB When the method belongs to the self, firstly, a transaction response digital signature verification algorithm is called: 0/1≡PRVer (pp, τ, M) tr ). (1) Calculate h' re ＝H s (RPK a→otb ) The method comprises the steps of carrying out a first treatment on the surface of the (2) Calculate h re_ver ←Dec(pp,P a ,CT re ) The method comprises the steps of carrying out a first treatment on the surface of the (3) Judging h' re ＝h re_ver If yes, returning to 1, indicating that the signature verification is successful, corresponding to the response protocol M tr Further processing is carried out; otherwise, returning to 0, indicating that the signature verification fails and is not for the targetThe message of the user is not processed;
step 7-2, after the signature verification is successful, II 03 -III 04 Regional B college of college user-to-protocol response message M tr Judging, if the re-encryption key bit in the response protocol is not 0, indicating that the transaction is successful, and obtaining M tr RPK of (B) a→otb For CT OU Performing a re-encryption algorithm CT OC ←ReEnc(pp,CT OU ,RPK a→otb ) Obtain the public key P by one time OTB Encrypted ciphertext CT OC ；
Step 7-3, II 03 -III 04 The regional B college of high school medical users invoke a one-time private key calculation algorithm: s is S OTB ←CalOTSK(pp,P OTB ,R o ,d b ) With a long-term private key d held by the person b Calculation of P OTB Corresponding one-time private key S OTB ＝H s (d b R o )+d b ；
Step 7-4, II 03 -III 04 The regional B college of university calls a decryption algorithm (h path ,Key)←Dec(CT OC ,S OTB ) With the calculated one-time private key S OTB Is CT OC Decrypting to obtain the index h of ciphertext of the piece of data stored on IPFS path And a corresponding symmetric Key;
step 7-5, II 03 -III 04 B college of universities and colleges users in the area according to the ciphertext index h path And accessing the target data ciphertext in the IPFS cloud server, and decrypting by using the symmetric Key Key to obtain the plaintext of the data.
The step 8 is specifically as follows: when the supervision requirement needs to know the true identity of the data consumer, the supervision party: III 04 The node manager of the scientific research industry governed by the regional primary node executes a revocation algorithm capable of linking and revoking the ring signature: p (P) b ←LARRR(pp,S,σ,d l ) Traversing the public key in the set S and judgingP output when equation is established i I.e. long-term public key for data consumerP b The supervisor can recover the transaction party II according to the certificate information recorded by the CA 03 -III 04 The true identity of the regional B-college medical school user.
The foregoing is merely a preferred embodiment of the present invention, and is not intended to limit the present invention, and all equivalent variations using the description and drawings of the present invention are within the scope of the present invention.
Claims (11)
1. A safe data market management system based on a blockchain is characterized by comprising a multi-fork tree system model constructed by advanced nodes, intermediate nodes, primary nodes and industry nodes and users;
the user comprises a data manager, a data owner and a data consumer;
the root node layer of the multi-fork tree system model is a high-level layer, the leaf node layer is an industry layer, and the middle node layer is a medium-level layer and a primary layer; the other three layers are divided according to the size of the jurisdiction area except the industry layer, the jurisdiction areas of the high-level layer, the middle-level layer and the primary layer respectively correspond to a level I area, a level II area and a level III area, the level I area comprises a plurality of level II areas, and a plurality of level III areas form a level II area; the industry layer belongs to the III level area;
The root node is a high-level node, and is provided with a high-level data alliance chain, namely a high-level chain, which is managed by the highest data management department and is commonly maintained by the data management parties of all the managed II-level areas;
a middle-level data alliance chain, namely a middle-level chain, which is respectively built by each level-II region, is responsible for management by a middle-level data management department and is commonly maintained with all the governed level-III regions is deployed on the middle node taking the high-level node as a father node;
each III-level region is in the jurisdiction range, and industry administrators of the jurisdiction region are assigned according to industry category division; on a primary node taking a middle-level node as a father node, each III-level region is deployed with a primary data alliance chain, namely a primary chain, which is respectively constructed and managed by a primary data management department and is commonly maintained with all industry management nodes in the region;
the leaf nodes are industry nodes, and an industry manager assigned by each primary node is responsible for management, and a primary industry data alliance chain, namely an industry chain, which is commonly maintained by different users of the same industry in the region is deployed.
2. The blockchain-based secure data marketplace management system of claim 1, wherein in the system, the data owner self-defines the to-be-authenticated data into publicly available data and non-public data, the system marks the non-public data in the data catalog with a secret, and marks the publicly available data with a data value tuple;
The non-public data is scaled by the data provider to a secret level se= {1,2,3}, se=1 representing a "secret" level, se=2 representing a "secret" level, se=3 representing a "secret" level;
can disclose data to make data value V (Pr) c ，Pr t ，V rt ) Marking, where Pr c Is the calculated price, i.e. pricing, pr, provided by the data owner t Is the market price, i.e. the last price, V rt Is the real-time value V of data formed by calculating according to the frequency, range and regulation factors of a data manager and related to time rt The method comprises the steps of carrying out a first treatment on the surface of the Wherein Pr is c 、Pr t Is the unit of transaction currency, V rt Is 1; pr before the first circulation of data t And V rt All are set to 0, and the intelligent contract updates V in the circulation process;
V rt ＝f(d)×A t +A r f (d) is an aging function, d represents the number of days from the last transaction sent,A t representing the increment of data circulation value-> n i Representing the number of transactions in different ranges, a i Representing the value-added coefficients of transactions in different ranges, 1 to 4 respectively corresponding to the circulation in the same industry in the same class III region, the circulation in different industries in the same class III region, the circulation between different class III regions in the same class II region and the circulation between different class II regions, A r Representing the amount of data manager value adjustment.
3. A method of blockchain-based secure data market management, characterized in that the method is implemented on the basis of the system of any of claims 1-2, comprising the steps of:
step 1, initializing a system: the key management center calls a system initialization algorithm to initialize according to the security parameters, and returns the public parameters of the system;
step 2, long-term key generation and identity authentication: the user invokes a key generation algorithm based on an asymmetric encryption system to autonomously generate a long-term public-private key pair, and performs real-name authentication on CA (certificate authority) arranged in an industry node by using the long-term public key, and a data manager records the corresponding relationship between the long-term public key and the real identity of the user;
step 3, determining the data property rights: encrypting the original data plaintext by a data owner by using a symmetric encryption algorithm, generating a ciphertext, and storing the data ciphertext obtained by symmetric encryption into a semi-trusted IPFS cloud server; after receiving the ciphertext index returned by the IPFS cloud server, encrypting the index and the used symmetric key by using the long-term public key, and generating a data property certificate by using the certificate number generated by the system, the long-term public key of the data owner, the encryption information of the data corresponding to the property and the characteristics and the content description of the data;
Step 4, data catalog generation: step-by-step confirmation of the data property certificates is completed by each level of node management servers deployed in the system, and the determined data property certificates are generated in a high-level chain to serve as final identifications of the right-confirming data; calculating intelligent contracts by data value deployed in each level of node management servers in the system, dynamically updating data value marks or secret classes, finally forming a catalog of data market rights and corresponding values or secret classes, and displaying public data at the front end;
step 5, the data consumer anonymously issues a data transaction protocol application: the data consumer generates a disposable public key by using a long-term public key held by the consumer, generates a target transaction protocol application by combining the disposable public key, invokes a linkable and revocable ring signature algorithm to sign the transaction protocol application, issues the protocol and the signature to an industry chain where the transaction protocol application is located, and carries out transaction transfer by each level of data management server according to the protocol application until a issuing condition of a verification request is triggered;
step 6, the data owner issues a data transaction protocol response: the data owner verifies the ring signature message, judges the linkable property of the verified signature, and applies for the unlinked protocol to judge whether to achieve the transaction or not; if agreeing to achieve the transaction, generating a re-encryption key by using a disposable public key in the protocol, generating a transaction protocol response by combining the re-encryption key, and issuing the response to the industry chain after signing; if the transaction is not agreed, the position of writing the re-encryption key in the transaction protocol response is set to be 0, and each level of node data management server judges and transmits the transaction protocol response until a message broadcasting condition is triggered;
Step 7, data consumer processes the agreement response: when the data consumer recognizes that the disposable public key in the protocol response message belongs to the data consumer, firstly, verifying the digital signature; after the verification is successful, for a response protocol of successful transaction, re-encrypting ciphertext information in the data property certificate by using a re-encryption key to obtain a new ciphertext, and simultaneously calculating a disposable private key corresponding to the disposable public key in the transaction by using a long-term private key of the user; the one-time private key can be used for completing decryption of the new ciphertext to obtain an index of the ciphertext stored by the target data on the IPFS cloud server and a corresponding symmetric key, and the target data can be obtained by searching the index and completing decryption;
step 8, data transaction centralized supervision: when the supervision needs to know the real identity of the data consumer, the supervision party confirms and contacts the data supervision party according to the long-term public key of the data manager in the data transaction protocol, the supervision party executes a revocation algorithm capable of being linked with the revocable ring signature, the long-term public key of the anonymous data consumer can be recovered by using the private key of the supervision party, and the supervision party can recover the real identity of the transaction party according to the certificate information recorded by the CA.
4. A method of blockchain-based secure data market management as in claim 3, wherein: the step 1 specifically comprises the following steps:
step 1-1, calling a system initialization algorithm: pp≡setup (1) λ ) Input system security parameter λ, output system global common parameter pp= (λ, q, G) 1 ，G T ，G，H s ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein G is 1 And G T Is a cyclic group of two identical prime orders q, G is group G 1 E represents the bilinear map G 1 ×G 1 →G T ，Z q Representing integer groups of order q, assuming G 1 And G T The discrete logarithm problem in (a) is difficult, H s Represents G 1 →Z q Is a cryptographic hash function of (c).
5. The blockchain-based secure data market management method of claim 4, wherein: the step 2 is specifically as follows:
all users i who have entered the system by registration invoke the key generation algorithm (d i ，P i ) Independently generating a long-term public and private key pair by using the GenKey_U (pp), and selecting a random number d by a user i i ∈Z q Computing P as a long-term private key i ＝d i G uses P as a long term public key i Registering real name of CA set in industry node, and recording P by data manager i And the corresponding relation between the true identity of the user i.
6. The blockchain-based secure data market management method of claim 5, wherein: the step 3 specifically comprises the following steps:
Step 3-1, whenWhen the user i is used as a data owner role to carry out data right, firstly encrypting the original data plaintext D by using a symmetric Key Key to generate ciphertext CT O The specific encryption process is as follows: CT (computed tomography) O ←Enc key (pp，D，Key)；
Step 3-2, user i uses the data ciphertext CT O Storing the ciphertext hash h into a semi-trusted IPFS cloud server, and calculating the ciphertext hash h by the IPFS cloud server path ＝H s (CT O ) And returns to user i, user i will h path And Key uses its own long-term public Key P i Encryption generation of ciphertext CT OU The specific encryption process is as follows: CT (computed tomography) OU ←Enc(pp，(h path ，Key)，P i )；
Step 3-3, user i generates an initial data title certificate DRC 0 (I 0 ，P i ，CT OU ，D e ) The release is carried out on an industry chain; i 0 Representing a base code, the base code being unique to the industry in the class III region; long-term public key P of data owner i Representing attribution of data, CT OU Encryption information representing data corresponding to property rights, D e Representing the data characteristics and content description.
7. The blockchain-based secure data marketplace management method of claim 6, wherein: the step 4 specifically comprises the following steps:
step 4-1, the industry node management server periodically reads the newly added DRC of the industry chain 0 Certificate data, I of each certificate in new data 0 Front marking industry code, updated to I 1 Packaging and writing the primary links in the parent node, namely the primary node; the primary node management server periodically reads the newly-added certificate data in the primary chain and stores the I of each certificate in the new data 1 Pre-marked primary region code updated as I 2 Packaging and writing the data into a parent node, namely a medium-level chain in the medium-level node; the medium node management server periodically reads newly-added certificate data in the medium chain and stores the I of each certificate in the new data 2 Front-marked mid-level region code updated to I 3 Final packed write advanced chainAn ID is determined for each data title certificate, and the determined data title certificate DRC (I 3 ，P i ，CT OU ，D e ) As a unique representation of the pen validation data;
step 4-2, intelligent contract for data value calculation, according to the data value model, for the public data: recording a calculated price Pr submitted by the data ownership person c Generates data value V (Pr c ，Pr t ，V rt ) The method comprises the steps of carrying out a first treatment on the surface of the For non-public data: recording a data security class Se submitted by a data ownership person;
step 4-3, the advanced node calculates submitted data value marks y or secret marks Se according to DRC data sets of the advanced chain and intelligent contracts, integrates four-level data property directories of advanced, intermediate, primary and industry, displays the data market directory in a front-end system, and a user can acquire DRC information required by the user and corresponding data value triples V (Pr c ，Pr t ，V rt ) Or secret scale; when no transaction occurs, the intelligent contract can calculate the real-time value V of the update data according to the recorded value of d rt Value tags for data sets other than 0.
8. The blockchain-based secure data market management method of claim 7, wherein: the step 5 specifically comprises the following steps:
assuming Bob represents the data consumer and Alice represents the data owner, who all belong to user I who registered to the joining system in step 2, suppose that Bob of the data consumer wants to purchase the certificate of Alice of the data owner as DRC (I 3 ，P a ，CT OU ，D e ) Is a piece of data of (a); according to the method of step 2, alice's private key is d a ∈Z q The public key is P a ＝d a G, G; bob has a private key d b ∈Z q Public key P b ＝d b G, G; the industry data manager is used as an anonymous revocation mechanism, and the private key of the manager Linda of the industry chain where Bob is located is d l ∈Z q Public key P l ＝d l G, selecting random number r E Z q Setting revocation parameter R repeaL ＝rG；
Step 5-1, the data consumer Bob calls a one-time public key generation algorithm: (P) OTB ，R o )←GenOTPK(pp，P b ) Selecting a random number r o ∈Z q Calculating R o ＝r o G, G; calculate t=h s (r o P b ) Generating a one-time public key P of Bob current transaction OTB ＝tG+P b As an anonymous address for the current transaction; and combine the destination UseObject, payment information Payment, protocol supervisor address P of the use destination UseObject, payment information Payment, and protocol supervisor address P of the target data l And a supervision parameter R repeal Etc. together with anonymous address P OTB Together listed as a transaction protocol M ta (P OTB ，DRC，UseObject，Payment，P l ，R repeal )；
Step 5-2, data consumer Bob invokes a linkable and revocable ring signature algorithm σ≡larrsig (pp, S, d) b ，M ta ) For transaction protocol message M ta Signing, (1) randomly selecting the public key of n-1 users and the own long-term public key P b Mixing to form a public key set s= { P 1 ，P 2 ，...，P α ，...，P n }(P α ＝P b ) The method comprises the steps of carrying out a first treatment on the surface of the (2) The policing information E and the key image J are calculated,(3) At Z q Is selected randomly { q } i I=1, …, n, i+.alpha } and { w- i I=1,.. i ＝q i G+w i P i (i +.alpha) and +.>(4) Selecting a random number k E Z q Calculate L α =kg and R α ＝e(R repeal ，P l ) k The method comprises the steps of carrying out a first treatment on the surface of the (5) Calculate h c ＝H s (M ta ||L 1 ，...，L n ||R 1 ，...，R n ||S||P l ||R repeaL I E); (6) Calculating w α ＝h c -∑w i mod q(i＝1，...，n，i≠α)，q α ＝k-w α d α mod q, generating signature σ= (J, w) 1 ，...，w n ，q 1 ，...，q n ) The method comprises the steps of carrying out a first treatment on the surface of the Bob signs information sigma, protocol message M ta Release to the industry chain where it is located;
step 5-3, industry node management server according to protocol message M ta I contained in DRC of (B) 3 Judging whether the owner Alice of the target data asset belongs to a member directly or indirectly administered by the current level alliance chain; a total of 4 cases are included: (1) Alice and Bob belong to the same industry in the same class III region, σ and M ta Issuing a request for requesting Alice verification on an industry chain to which the request belongs immediately; (2) Alice and Bob belong to different industries in the same class III region, bob will σ and M ta After publishing the industry chain to which he belongs, the data manager of the industry node will sigma and M ta Issuing a request for triggering Alice verification immediately on the primary chain; (3) Alice and Bob belong to different class III regions of the same class II region, bob will σ and M ta After publishing the industry chain to which he belongs, the data manager of the industry node will sigma and M ta Published on the primary chain to which the primary node's data manager will σ and M ta Issuing a request for requesting Alice verification on the affiliated intermediate-level chain immediately; (4) Alice and Bob belong to different class II regions, bob will σ and M ta After publishing the industry chain to which he belongs, the data manager of the industry node will sigma and M ta Published on the primary chain to which the primary node's data manager will σ and M ta Published on the affiliated intermediate-level chain, the data manager of the intermediate-level node will sigma and M ta Issuing a request for requesting Alice verification on an advanced chain and triggering the request for requesting Alice verification immediately; and according to the 4 cases, the data management server networks of all levels directly or indirectly issue verification requests to Alice in a single-hop or multi-hop mode.
9. The blockchain-based secure data market management method of claim 8, wherein: the step 6 specifically comprises the following steps:
Step 6-1, the data owner Alice calls a link-revocable ring signature verification algorithm: 0/1≡LARRVer (pp, S, sigma, M) ta ) Verifying the ring signature message; (1) Calculate L' i ＝q i G+w i P i ， (2) Calculate->(3) Calculate h c′ ＝H s (M ta ||L′ 1 ，...，L′ n ||R′ 1 ，...，R′ n ||S||P l ||R repeal I E); (4) If h c_ver ＝h c′ If the verification is true, the algorithm outputs 1, the signature is proved to be effective, the execution is continued, otherwise, the verification fails, the algorithm outputs 0, and the execution is stopped; .
Step 6-2, the data owner Alice maintains a history key mirror listAfter each verification is successful, executing a link-revocable ring signature link-based judgment algorithm: />The key image J in signature sigma is combined with the history key image list +.>In contrast, if present in the list, it indicates that the transaction protocol has been processed, a replay attack may occur, there is a link, return to 1, stop execution, otherwise it indicates that no replay attack has occurredAfter the transaction protocol is processed, the transaction protocol has no link, returns to 0, adds the key mirror image J in the signature to the list, and continues to execute. Normally, any observer can only know that the signature is done by one of the ring members and not specifically by which user;
step 6-3, if agreeing to the trade, the data owner Alice calls the re-encryption key generation algorithm: RPK (resilient force-resistant K) a→otb ←GenRPK(pp，d a ，P OTB ) Using its own private key d a And a disposable address P in a transaction protocol OTB Generating a re-encryption key RPK a→otb RPK is to a→otb Write transaction protocol application message M ta In generating transaction protocol reply message M tr (P OTB ，DRC，UseObject，Payment，P l ，R repeal ，RPK a→otb ) The method comprises the steps of carrying out a first treatment on the surface of the If not, setting the re-encryption key position to be 0;
step 6-4, the data owner Alice calls a transaction response digital signature generation algorithm: τ≡PRSig (pp, d) a ，M tr ) The method comprises the steps of carrying out a first treatment on the surface of the (1) Calculate h re ＝H s (RPK a→otb ) The method comprises the steps of carrying out a first treatment on the surface of the (2) Calculation of CT re ←Enc(pp，d a ，h re ) The method comprises the steps of carrying out a first treatment on the surface of the (3) Calculate τ= (CT re ，h re ) Using the private key d of the user according to the steps a For reply message M tr Digital signature is carried out to obtain tau, and tau and M are combined tr And published to the industry chain where it resides;
step 6-5, judging M by each level of data manager server tr Corresponding M ta Whether to issue on the current level blockchain specifically includes 4 cases: (1) Alice and Bob belong to the same industry in the same class III region, then Alice will be τ and M tr Triggering broadcast conditions immediately after release in the industry chain to which they belong; (2) Alice and Bob belong to different industries in the same class III region, then Alice will be τ and M tr After publishing the industry chain to which he belongs, the data manager of the industry node will τ and M tr The broadcast condition is immediately triggered after the broadcast is issued on the primary chain; (3) Alice and Bob belong to different class III regions of the same class II region, then Alice will be τ and M tr After publishing the industry chain to which he belongs, the data manager of the industry node will τ and M tr Published on the primary chain to which it belongs, the data manager of the primary node will be τ and M tr The broadcast condition is triggered immediately after the broadcast is issued on the affiliated intermediate-level chain; (4) Alice and Bob belong to different class II regions, alice will then τ and M tr After publishing the industry chain to which he belongs, the data manager of the industry node will τ and M tr Published on the primary chain to which it belongs, the data manager of the primary node will be τ and M tr Published on the affiliated intermediate-level chain, the data manager of the intermediate-level node will tau and M tr Published on the high-level chain, and then triggers the broadcast condition. After triggering the broadcast conditions, each level of manager server broadcasts the response protocol M down the tree network tr And signature tau thereof, to the anonymous transaction initiator;
step 6-6, executing the calculation method in the intelligent contract execution data value model, and updating the calculation price Pr submitted by the data ownership person c Updating market price Pr according to the price of the successful data transaction protocol message t Calculating and updating the data circulation value increment A according to successful data transaction behaviors t In combination with adjustment of delta A by a data manager r Calculate V rt Update data value V (Pr) c ，Pr t ，V rt ) The method comprises the steps of carrying out a first treatment on the surface of the The successful data transaction is a protocol response message M returned by the data owner tr Transactions with intermediate re-encryption key bits other than 0; for non-public data: the data security class Se submitted by the data ownership person can be updated; the updated content is synchronized into the data directory.
10. The blockchain-based secure data market management method of claim 9, wherein: the step 7 specifically comprises the following steps:
step 7-1 anonymous transaction applicant Bob recognizes the protocol reply message M tr One-time public key P in (a) OTB When the method belongs to the self, firstly, a transaction response digital signature verification algorithm is called: 0/1≡PRVer (pp, τ, M) tr ). (1) Calculate h' re ＝H s (RPK a→otb ) The method comprises the steps of carrying out a first treatment on the surface of the (2) Calculate h rever ←Dec(pp，P a ，CT re ) The method comprises the steps of carrying out a first treatment on the surface of the (3) Judging h' re ＝h re_ver If yes, returning to 1, indicating that the signature verification is successful, corresponding to the response protocol M tr Further processing is carried out; otherwise, returning to 0, indicating that the signature verification fails, and not processing the message of the target user;
step 7-2, data Consumer Bob responding to protocol response message M tr Judging, if the re-encryption key bit in the response protocol is 0, indicating that the transaction fails, otherwise, acquiring M tr RPK of (B) a→otb For CT OU Performing a re-encryption algorithm CT OC ←ReEnc(pp，CT OU ，RPK a→otb ) Obtain the public key P by one time OTB Encrypted ciphertext CT OC ；
Step 7-3, the data consumer Bob calls a one-time private key calculation algorithm: s is S OTB ←CalOTSK(pp，P OTB ，R o ，d b ) With a long-term private key d held by the person b Calculation of P OTB Corresponding one-time private key S OTB ＝H s (d b R o )+d b 。
Step 7-4, the data consumer Bob invokes a decryption algorithm (h path ，Key)←Dec(CT OC ，S oTB ) With the calculated one-time private key S OTB Is CT OC Decrypting to obtain the index h of ciphertext of the piece of data stored on IPFS path And a corresponding symmetric Key;
step 7-5, data consumer Bob refers to ciphertext index h path And accessing the target data ciphertext in the IPFS cloud server, and decrypting by using the symmetric Key Key to obtain the plaintext of the data.
11. The blockchain-based secure data market management method of claim 10, wherein: the step 8 is specifically as follows:
when there is a regulatory requirement that the true identity of the data consumer needs to be known, a linkable and revocable ring signature revocation algorithm is performed by the administrator Linda:P b ←LARRR(pp，S，σ，d l ) Traversing the public key in the set S and judgingP output when equation is established i I.e. the long-term public key P of the data consumer Bob b The supervision party Linda can recover the true identity of the transaction party Bob according to the certificate information recorded by the CA.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311808822.8A CN117749349A (en) | 2023-12-25 | 2023-12-25 | Block chain-based secure data market management system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311808822.8A CN117749349A (en) | 2023-12-25 | 2023-12-25 | Block chain-based secure data market management system and method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117749349A true CN117749349A (en) | 2024-03-22 |
Family
ID=90257483
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311808822.8A Pending CN117749349A (en) | 2023-12-25 | 2023-12-25 | Block chain-based secure data market management system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117749349A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117874838A (en) * | 2024-03-11 | 2024-04-12 | 誉农智汇(成都)农业科技发展集团有限公司 | Agricultural financial service method and system based on blockchain |
-
2023
- 2023-12-25 CN CN202311808822.8A patent/CN117749349A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117874838A (en) * | 2024-03-11 | 2024-04-12 | 誉农智汇(成都)农业科技发展集团有限公司 | Agricultural financial service method and system based on blockchain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11720891B2 (en) | Method and system for zero-knowledge and identity based key management for decentralized applications | |
| US10121143B1 (en) | Method and system for blockchain-based combined identity, ownership, integrity and custody management | |
| Lee | BIDaaS: Blockchain based ID as a service | |
| Qi et al. | Cpds: Enabling compressed and private data sharing for industrial Internet of Things over blockchain | |
| Aujla et al. | SecSVA: secure storage, verification, and auditing of big data in the cloud environment | |
| CN110033258B (en) | Service data encryption method and device based on block chain | |
| CN108667605B (en) | Data encryption and decryption method and device | |
| CN109450843B (en) | SSL certificate management method and system based on block chain | |
| CN107465681B (en) | Cloud computing big data privacy protection method | |
| CN107332858B (en) | Cloud data storage method | |
| Jiang et al. | Attribute-based encryption with blockchain protection scheme for electronic health records | |
| Yang et al. | Publicly verifiable data transfer and deletion scheme for cloud storage | |
| Buccafurri et al. | Integrating digital identity and blockchain | |
| Coelho et al. | Federation of attribute providers for user self-sovereign identity | |
| CN117749349A (en) | Block chain-based secure data market management system and method | |
| EP3817320B1 (en) | Blockchain-based system for issuing and validating certificates | |
| Guo et al. | Using blockchain to control access to cloud data | |
| Huynh et al. | A reliability guaranteed solution for data storing and sharing | |
| CN107395609B (en) | Data encryption method | |
| Zhang et al. | A traceable and revocable multi-authority attribute-based access control scheme for mineral industry data secure storage in blockchain | |
| Mittal et al. | A novel two-level secure access control approach for blockchain platform in healthcare | |
| Li et al. | Blockchain‐Based Fine‐Grained Data Sharing for Multiple Groups in Internet of Things | |
| Noh et al. | PyRos: A State Channel‐Based Access Control System for a Public Blockchain Network | |
| Verma et al. | Secure digital documents sharing using blockchain and attribute-based cryptosystem | |
| KR20230127696A (en) | A decentralized data sharing system and Collusion-Resistant Multi-Authority Attribute-Based Encryption Scheme based on a 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 |