CN113079200A - Data processing method, device and system - Google Patents
Data processing method, device and system Download PDFInfo
- Publication number
- CN113079200A CN113079200A CN202110296513.1A CN202110296513A CN113079200A CN 113079200 A CN113079200 A CN 113079200A CN 202110296513 A CN202110296513 A CN 202110296513A CN 113079200 A CN113079200 A CN 113079200A
- Authority
- CN
- China
- Prior art keywords
- task
- executed
- service
- result
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/12—Applying verification of the received information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Abstract
The specification discloses a data processing method, a device and a system, and specifically discloses that the data processing system comprises a client, a consensus network, a service subsystem and a data storage subsystem, wherein the service subsystem comprises a master node and a slave node, the consensus network comprises a plurality of block chain nodes, the service subsystem determines a task to be executed corresponding to a service request, divides the task to be executed into a plurality of sub tasks to be executed, determines corresponding sub task results, finally obtains a comprehensive task result corresponding to the task to be executed, stores the comprehensive task result into the data storage subsystem, obtains an address identifier corresponding to the comprehensive task result, and further stores the address identifier into a block chain. In this way, when the data processing task is executed, the task can be divided into a plurality of subtasks, and then the subtasks are processed in parallel by a plurality of nodes, so that the efficiency of data processing in the block chain system is improved.
Description
Technical Field
The present disclosure relates to the field of internet technologies, and in particular, to a method, an apparatus, and a system for data processing.
Background
With the continuous development of computer technology, the block chain technology comes up, and according to actual business requirements, data needing to be stored and certified can be stored in the block chain to prevent the data from being tampered, so that the data security is ensured.
At present, when data processing needs to be performed on service data, the service data to be subjected to data processing needs to be synchronized to be stored locally, then the service data synchronized to be stored locally is subjected to data processing together to obtain a data processing result, and then the data processing result can be carried in a transaction and stored in a block chain. Then, if the data amount of the service data is too large, the efficiency of data processing is greatly reduced.
Therefore, how to improve the efficiency of data processing is an urgent problem to be solved.
Disclosure of Invention
The present specification provides a method, an apparatus and a system for data processing, which partially solve the above problems in the prior art.
The technical scheme adopted by the specification is as follows:
the specification provides a data processing system, which comprises a client, a consensus network, a service subsystem and a data storage subsystem, wherein the service subsystem comprises a main node and a slave node, and the consensus network comprises a plurality of block chain nodes;
the service subsystem receives a service request sent by the client through the master node, determines a task to be executed corresponding to the service request according to the service request, performs task splitting according to the task to be executed to obtain a plurality of sub tasks to be executed, determines a slave node executing the sub task to be executed as a target slave node for each sub task to be executed through the master node, sends the sub task to be executed to the target slave node, executes the sub task to be executed through the target slave node to obtain a sub task result, receives each sub task result returned by each slave node through the master node, obtains a comprehensive task result corresponding to the task to be executed according to each sub task result, and sends the comprehensive task result to the data storage subsystem to obtain an address identifier corresponding to the comprehensive task result from the data storage subsystem, sending a transaction carrying the address identifier to a consensus network corresponding to the block chain, so that the consensus network stores the address identifier in the block chain after determining that the transaction passes consensus through each block chain link point included;
and the data storage subsystem receives the comprehensive task result sent by the service subsystem, generates an address identifier corresponding to the comprehensive task result according to the comprehensive task result, returns the address identifier to the service subsystem, and stores the comprehensive task result in the local part of the data storage subsystem.
Optionally, the data processing system further comprises: at least two pre-verification systems;
the pre-verification system receives a service request sent by the client, verifies a task to be executed corresponding to the service request according to the service request to obtain a verification result, and returns the verification result to the client;
and the client side sends service requests to the at least two pre-checking systems respectively, receives checking results returned by the at least two pre-checking systems, and sends the service requests to the service subsystem if the checking results returned by the at least two pre-checking systems meet preset conditions.
Optionally, the client determines, as a target result, a verification result that passes verification from the verification results returned by the at least two pre-verification systems, and determines that the verification results returned by the at least two pre-verification systems meet the preset condition if it is determined that a ratio of the target result in the verification results returned by the at least two pre-verification systems exceeds a set ratio.
Optionally, the service subsystem sends an acquisition request to each block link node included in the consensus network through a preset interface to acquire an encryption rule corresponding to each block link node included in the consensus network, encrypts the transaction according to the encryption rule to obtain encryption information, and sends the encryption information carrying the transaction to the consensus network to verify the encryption information according to the encryption rule corresponding to the block link node included in the consensus network.
Optionally, each blockchain node included in the consensus network acquires an encryption rule corresponding to each service security level from a preset security mechanism, determines the service security level corresponding to the acquisition request as a target security level when receiving the acquisition request sent by the service subsystem, and returns the encryption rule corresponding to the target security level to the service subsystem.
Optionally, the encryption rule includes: domestic commercial cryptographic algorithms.
Optionally, the service subsystem receives a data query request sent by the client, queries an address identifier corresponding to the data query request from the block chain, and returns data corresponding to the target address identifier stored in the data storage subsystem to the client through the target address identifier.
Optionally, the data storage subsystem comprises: an interplanetary file system, IPFS, the service subsystem comprising: HyperLegendr Fabric, the address identification comprising: and (4) hashing the address.
The present specification provides a method of data processing, comprising:
receiving a service request sent by a client through a main node contained in a service subsystem;
determining a task to be executed corresponding to the service request according to the service request;
splitting the tasks according to the tasks to be executed to obtain a plurality of sub tasks to be executed;
for each sub task to be executed, determining a slave node which executes the sub task to be executed in the service subsystem as a target slave node through the master node, and sending the sub task to be executed to the target slave node, so that the sub task to be executed is executed through the target slave node to obtain a sub task result;
receiving each subtask result returned by each slave node through the master node, and obtaining a comprehensive task result corresponding to the task to be executed according to each subtask result;
sending the comprehensive task result to the data storage subsystem so as to acquire an address identifier corresponding to the comprehensive task result from the data storage subsystem;
and sending the transaction carrying the address identifier to a consensus network corresponding to the block chain, so that the consensus network stores the address identifier in the block chain after determining that the transaction passes the consensus through the contained block chain link points.
The present specification provides an apparatus for data processing, comprising:
the receiving module is used for receiving a service request sent by a client through a main node contained in the service subsystem;
the determining module is used for determining a task to be executed corresponding to the service request according to the service request;
the splitting module is used for splitting the tasks according to the tasks to be executed to obtain a plurality of sub tasks to be executed;
the execution module is used for determining a slave node which executes the sub task to be executed in the service subsystem as a target slave node through the master node aiming at each sub task to be executed, and sending the sub task to be executed to the target slave node so as to execute the sub task to be executed through the target slave node and obtain a sub task result;
the processing module is used for receiving each subtask result returned by each slave node through the master node and obtaining a comprehensive task result corresponding to the task to be executed according to each subtask result;
the acquisition module is used for sending the comprehensive task result to the data storage subsystem so as to acquire an address identifier corresponding to the comprehensive task result from the data storage subsystem;
and the sending module is used for sending the transaction carrying the address identifier to a consensus network corresponding to the block chain, so that the consensus network stores the address identifier in the block chain after determining that the transaction passes the consensus through the contained block chain link points.
The present specification provides a computer-readable storage medium storing a computer program which, when executed by a processor, implements the above-described data processing method.
The present specification provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the above-mentioned data processing method when executing the program.
The technical scheme adopted by the specification can achieve the following beneficial effects:
the data processing system provided by the present specification includes a client, a consensus network, a service subsystem, and a data storage subsystem, where the service subsystem includes a master node and a slave node, and the consensus network includes a plurality of block chain nodes, where the service subsystem determines a task to be executed corresponding to a service request after receiving the service request sent by the client through the master node, then performs task splitting according to the task to be executed to obtain a plurality of sub tasks to be executed, determines, through the master node, a slave node that executes the sub task to be executed as a target slave node, sends the sub task to be executed to the target slave node, and executes the sub task to be executed through the target slave node to obtain a sub task result. And further, receiving each subtask result returned by each slave node through the master node, obtaining a comprehensive task result corresponding to the task to be executed according to each subtask result, and sending the comprehensive task result to the data storage subsystem. And then, the data storage subsystem receives the comprehensive task result sent by the service subsystem, generates an address identifier corresponding to the comprehensive task result according to the comprehensive task result, returns the address identifier to the service subsystem, and stores the comprehensive task result in the local part of the data storage subsystem. And then, the service subsystem acquires the address identifier corresponding to the comprehensive task result from the data storage subsystem, and sends the transaction carrying the address identifier to the consensus network corresponding to the block chain, so that the consensus network stores the address identifier in the block chain after determining that the transaction passes the consensus through the contained block chain link points.
It can be seen from the above system that, when executing a data processing task, the task can be divided into a plurality of subtasks, and then the subtasks are processed in parallel by a plurality of nodes, thereby improving the efficiency of data processing in the blockchain system.
Drawings
The accompanying drawings, which are included to provide a further understanding of the specification and are incorporated in and constitute a part of this specification, illustrate embodiments of the specification and together with the description serve to explain the specification and not to limit the specification in a non-limiting sense. In the drawings:
FIG. 1 is a schematic diagram of a data processing method in the present specification;
FIG. 2 is a block diagram of a data processing system provided herein;
FIG. 3 is a schematic diagram of a data processing apparatus provided herein;
fig. 4 is a schematic diagram of an electronic device corresponding to fig. 1 provided in the present specification.
Detailed Description
In order to make the objects, technical solutions and advantages of the present disclosure more clear, the technical solutions of the present disclosure will be clearly and completely described below with reference to the specific embodiments of the present disclosure and the accompanying drawings. It is to be understood that the embodiments described are only a few embodiments of the present disclosure, and not all embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present specification without any creative effort belong to the protection scope of the present specification.
The technical solutions provided by the embodiments of the present description are described in detail below with reference to the accompanying drawings.
Fig. 1 is a schematic flow chart of a data processing method in this specification, which specifically includes the following steps:
step S100, receiving a service request sent by a client through a master node included in a service subsystem.
As shown in fig. 2, the present specification relates to a data processing system, which includes a client, a consensus network, a service subsystem and a data storage subsystem, wherein the service subsystem includes a master node and a slave node, and the consensus network includes a plurality of blockchain nodes.
The service subsystem may be a hyper-tree Fabric, the data storage subsystem may be an Inter-planet File System (IPFS), the master node included in the service subsystem may be an order node (order node) in the hyper-tree Fabric, and the slave node included in the service subsystem may be a peer node (peer node) in the hyper-tree Fabric. In this specification, uplink operation of data may be performed by the master node in the service subsystem, that is, data is stored on the block chain by the master node, and of course, other slave nodes in the service subsystem may also perform uplink operation of data. If each node (including the master node and the slave node) in the service subsystem is not a block chain link point in the consensus network, the data can be stored in the block chain through a preset interface, that is, the interaction with the consensus network is realized through the preset interface. Of course, each node included in the service subsystem may itself be a blockchain node in the consensus network.
In a specific implementation, when a user needs to perform service processing, the user first registers or logs in through a client (or an Application (APP)) installed on a terminal device (such as a mobile phone, a tablet computer, a desktop computer, or the like) to access the data processing system. Then, the user sends a service request to a main node contained in the service subsystem through the client, so that the service subsystem executes a service corresponding to the service request.
Before sending a service request to a host node, a data processing system needs to check the service request initiated by the user to determine whether the service request meets a preset message format, whether the user has a qualification for executing the service, whether a pre-execution result corresponding to the service request meets a condition, and the like.
Based on this, the data processing system in this specification may further include at least two pre-verification systems, which are configured to verify the service request from the client before the user sends the service request to the host node through the client, and return a verification result to the client.
In specific implementation, a client accessing a data processing system first determines pre-verification systems related to a service request, and sends the service request to each pre-verification system related to the service request. And after receiving the service request, each pre-checking system checks the task to be executed corresponding to the service request to obtain a checking result and returns the checking result to the client. And then, the client side sends the service request to the service subsystem when determining that the check results returned by the pre-check systems meet the preset conditions according to the check results returned by the pre-check systems.
For each pre-verification system, when the pre-verification system verifies the task to be executed, the pre-verification system may simulate to execute the task to be executed to obtain a pre-execution result, and as the pre-verification result, the pre-verification result may include a result obtained after the pre-verification system pre-executes the service corresponding to the service request. Accordingly, the pre-verification system may return the pre-execution result to the client as a verification result. And then in the subsequent process, the client can judge that the check result returned by each pre-check system meets the preset condition according to the check result returned by each pre-check system. When the service subsystem is Hyperridge Fabric, the pre-verification system may be an endorsement node in Hyperridge Fabric.
The client receives the check results returned by each pre-check system, and needs to judge whether the check results meet the preset conditions according to the check results and the preset conditions of the service corresponding to the service request. That is to say, the preset conditions corresponding to different services may be different, and in specific implementation, the preset conditions of the service corresponding to the service request may need to be determined according to actual service requirements.
The client side can determine that the verification result meets the preset condition when determining that the ratio of the number of the verification results passing the verification to the number of the verification results returned by all the pre-verification systems exceeds the set ratio. For example, when checking the service request of the class a service, there are 6 pre-checking systems involved, and the client may determine, from the checking results returned by the 5 pre-checking systems, the checking result that passes the checking as the target result, and determine that the number of the target results is 5. Then, the client determines that the ratio of the target results returned by all the pre-verification systems is 5/6 and is greater than the set ratio 2/3, and thus, the verification results returned by all the pre-verification systems are determined to meet the preset condition.
Of course, the client may also determine, after determining that the check result returned by the specific pre-check system is a check result passing the check, the number of the check results that are the same as the check result returned by the specific pre-check system in the check results returned by the remaining pre-check systems, and determine whether the ratio between the number and the total number of the check results returned by all pre-check systems exceeds the set ratio, and if it is determined that the ratio exceeds the set ratio, it may be determined that the check result satisfies the preset condition. For example, when a service request of a class B service is checked, A, B, C and F are related to pre-check systems, and if the client determines that a check result returned by the pre-check system F (i.e., a specific pre-check system) is a check pass, it is determined that at least two check results returned by the pre-check systems in the remaining pre-check systems A, B, C are consistent with a check result returned by the pre-check system F, and it can be determined that the check result returned by each pre-check system satisfies a preset condition.
In this specification, after determining that the check result returned by each pre-check system satisfies the preset condition, the client sends the service request to the service subsystem, so that the service subsystem determines the task to be executed corresponding to the service request, and further determines the execution result corresponding to the task to be executed.
Step S102, according to the service request, determining a task to be executed corresponding to the service request.
And step S104, splitting the task according to the task to be executed to obtain a plurality of sub tasks to be executed.
Step S106, aiming at each sub task to be executed, determining a slave node which executes the sub task to be executed in the service subsystem as a target slave node through the master node, and sending the sub task to be executed to the target slave node, so as to execute the sub task to be executed through the target slave node and obtain a sub task result.
And step S108, receiving each subtask result returned by each slave node through the master node, and obtaining a comprehensive task result corresponding to the task to be executed according to each subtask result.
In the above steps, after receiving a service request from a client, a service subsystem first determines a task to be executed corresponding to the service request, and splits the task to be executed into a plurality of sub tasks to be executed. Then, aiming at each sub task to be executed, the business subsystem determines a target slave node for executing the sub task to be executed, distributes the sub task to be executed to a target slave node corresponding to the sub task to be executed in the system, and the target slave nodes are responsible for determining a sub task result corresponding to each sub task to be executed and returning the determined sub task result to the master node. And finally, the main node determines a comprehensive task result corresponding to the task to be executed according to all the subtask results. Therefore, when the service corresponding to the service request is an analysis processing task of a large amount of data, the service subsystem can split the analysis processing task into a plurality of subtasks, and then the service subsystem performs parallel processing on the subtasks, so that the efficiency of data analysis processing is improved.
Of course, after determining the task to be executed corresponding to the service request, the service subsystem may also obtain the remaining computation resource of each slave node in the service subsystem, determine a slave node (for example, a slave node whose remaining computation resource is not less than a set computation resource threshold) that can execute the task to be executed from the remaining computation resource, as a target slave node, and then, according to the remaining computation resource of each slave node, the task to be executed is divided to obtain the sub task to be executed corresponding to each target slave node, then, aiming at each sub task to be executed, sending the sub task to be executed to a corresponding target slave node, executing the sub task to be executed by the target slave node, obtaining a sub task result corresponding to the sub task to be executed and returning the sub task result to the master node, and then the main node determines a comprehensive task result corresponding to the task to be executed according to all the subtask results.
In this specification, when the service subsystem is a hyper-hedge Fabric, a real-time stream processing framework (such as spark, storm, and flink) may be built on a node included in the hyper-hedge Fabric, where a sequencing node (orderer node) in the hyper-hedge Fabric, that is, a master node, plays a role of a job management node (job-manager node) in the real-time stream processing framework, and a peer node (peer node) in the hyper-hedge Fabric, that is, a slave node, plays a role of a job node (worker node) in the real-time stream processing framework.
And step S110, sending the comprehensive task result to the data storage subsystem so as to acquire an address identifier corresponding to the comprehensive task result from the data storage subsystem.
Step S112, sending the transaction carrying the address identifier to a consensus network corresponding to the blockchain, so that after the consensus network determines that the transaction passes consensus through the contained blockchain link points, the address identifier is stored in the blockchain.
In this specification, after obtaining the comprehensive task result, the master node sends the comprehensive task result to the data storage subsystem. And after the data storage subsystem stores the comprehensive task result into a set storage space, the data storage subsystem returns an address identifier corresponding to the comprehensive task result to the main node. And then, the main node sends the transaction carrying the address identifier to the consensus network corresponding to the block chain, so that the consensus network stores the address identifier in the block chain after determining that the transaction passes the consensus through the contained block chain nodes.
When the data storage subsystem is an IPFS, the address identifier returned by the data storage subsystem may be a hash address. The hash address may be obtained by the data storage subsystem after performing hash encryption according to the content of the integrated task result. That is, the hash address is the content digest corresponding to the integrated task result. When the data storage subsystem stores the comprehensive task result, a key value pair is constructed according to a format of Hash (content digest corresponding to the comprehensive task result) which is index (index value of storage space of the comprehensive task result), and is stored in a Distributed Hash Table (DHT).
In specific implementation, when a user needs to query data, after the data is checked, a data query request may be sent to the host node through the client, and after the host node receives the data query request sent by the client, the host node queries the block chain according to information carried in the data query request, and queries an address identifier (i.e., a target address identifier) corresponding to the data query request from the block chain. Then, the host node may directly send a data acquisition request to the data storage subsystem according to the target address identifier, and then the data storage subsystem determines, based on the target address identifier and the constructed distributed hash table, a storage space corresponding to the target address identifier, and further acquires data corresponding to the target address identifier stored in the data storage subsystem, and returns the query result to the client. Of course, the host node may also return the target address identifier to the client, and the client sends a data acquisition request to the data storage subsystem according to the target address identifier to acquire data corresponding to the target address identifier.
The blockchain referred to in this specification is a technology developed based on cryptography technology, and requires frequent operations such as encryption, decryption, signature verification, hash operation, etc. for each blockchain node from the time a transaction is submitted to the time a block containing the transaction completes an uplink operation.
Today, with the rapid development of big data, the nation increasingly attaches importance to the security of national-level data information, so that the national crypto-administration in the nation develops a domestic commercial crypto-algorithm for business services that do not involve national confidentiality, so as to realize the security of data information of domestic citizens.
Based on this, in order to better meet various service requirements, the domestic commercial cryptographic algorithm needs to be integrated into a consensus network in the present specification, and in a commercial scenario where data needs to be encrypted by the domestic commercial cryptographic algorithm, the domestic commercial cryptographic algorithm is used to encrypt and chain the data. In other business scenarios where it is not necessary to use a domestic commercial cryptographic algorithm to encrypt data, the required cryptographic algorithm may be selected autonomously according to actual business requirements.
At present, the encryption and decryption functions in the consensus network are provided by a Blockchain Cryptographic Service Provider (BCCSP) in a Certificate Authority (CA). The interface functions that the BCCSP can realize may include: key life cycle management (which may include KeyGen key generation, KeyDeriv key derivation, keyinport key import, GetKey key export, etc.), hash management (which may include hash operation, GetHash obtaining hash function, etc.), signature verification management (which may include signature function, verification signature function, etc.), encryption and decryption functions (which may include Encrypt encryption function, Decrypt decryption function, etc.), and so on.
Most of the existing cryptographic algorithms of the consensus network are completed by relying on the four types of interface functions, so that the BCCSP in the CA of the consensus network can be directly improved. For example, a program module for implementing a domestic commercial cryptographic algorithm is added to a BCCSP in an existing CA of the consensus network, and a corresponding calling interface is written, and when the domestic commercial cryptographic algorithm is required to be used for encryption, nodes in the consensus network can call the domestic commercial cryptographic algorithm through the calling interfaces to complete corresponding encryption and decryption operations.
Wherein the CA may be Fabric-CA. In the specific implementation process, the Fabric-CA is mainly to implement identity control and data generation and storage of members joining a federation chain, and when a program module implementing a domestic commercial cryptographic algorithm is added, an encryption algorithm in a process of parsing a certificate application request and issuing a certificate stream needs to be modified into a domestic cryptographic algorithm through an interface in Lib, the domestic cryptographic algorithm needs to be extended in operations such as encoding and decoding of a certificate through Util (the package data tools), and finally, the original encryption algorithm needs to be replaced by the domestic commercial cryptographic algorithm in BCCSP in the Fabric, or the domestic commercial cryptographic algorithm needs to be added in addition to the original encryption algorithm.
Certainly, if the domestic commercial cryptographic algorithm is not integrated in the BCCSP of the CA of the consensus network, a program module for implementing the domestic commercial cryptographic algorithm may be added in the golang lib (GO language algorithm library), and a corresponding calling interface is written, and when the domestic commercial cryptographic algorithm needs to be used for encryption, the nodes in the consensus network may call the domestic commercial cryptographic algorithm in the golang lib through the calling interfaces to complete the corresponding encryption and decryption operations.
When the method is used specifically, an application in the Fabric-SDK (a large framework of a block chain, each application is issued and can call the function of the provided SDK) can define a calling interface of a domestic commercial cryptographic algorithm through an API (application programming interface) so as to realize data such as access to an account book, transaction information and the like in a consensus network. Further, to enable the Fabric to support domestic commercial cryptographic algorithms, a reference to the Fabric package may be replaced in the Vendor file to provide support for the domestic cryptographic algorithms.
In this specification, the service subsystem may send an acquisition request to each block link point included in the consensus network through a preset interface to acquire an encryption rule corresponding to each block link point included in the consensus network, encrypt a transaction according to the encryption rule to obtain encryption information, send the encryption information carried in the transaction to the consensus network, and verify the encryption information according to the encryption rule corresponding to the block link point included in the consensus network.
Each node in the service subsystem can also directly acquire information such as a signature certificate, a signature public key of other nodes in the consensus network and the like from the BCCSP or the golang lib integrating the encryption rule through a preset interface. Wherein the encryption rule may be a domestic commercial cryptographic algorithm.
Certainly, in this specification, each blockchain node included in the network is identified, the encryption rule corresponding to each service security level is obtained from a preset security mechanism, when an obtaining request sent by a service subsystem is received, the service security level corresponding to the obtaining request is determined to be a target security level, and the encryption rule corresponding to the target security level is returned to the service subsystem.
In this specification, when a service subsystem processes a service and it is necessary to identify each block link point included in a network to acquire an encryption rule corresponding to the service, the service security level according to the service processed by the service subsystem may be determined first, and then, the encryption rule corresponding to the service security level is determined, and finally, the encryption rule corresponding to the service security level is returned to the service subsystem. The encryption rules may include the domestic commercial cryptographic algorithm, and may also include encryption algorithms of other scenarios.
In addition, in this specification, if the client determines that the check result returned by each pre-check system does not satisfy the preset condition, a prompt message may be presented to the user at this time, the task to be executed corresponding to the service request is rejected from being executed, and the service request is not submitted to the master node. Of course, when the client refuses to execute the task to be executed corresponding to the service request, the client may also determine data such as the service request and the check result of the service request, as operation log information, and then send the operation log information to the master node, so that the master node stores the operation log information corresponding to the service request as data to be linked, performs consensus in the consensus network, and completes the link.
The above method for data processing provided for one or more embodiments of the present specification also provides a corresponding apparatus for data processing, as shown in fig. 3, based on the same idea.
Fig. 3 is a schematic diagram of a data processing apparatus provided in this specification, which specifically includes:
a receiving module 300, configured to receive, through a master node included in a service subsystem, a service request sent by a client;
a determining module 301, configured to determine, according to the service request, a task to be executed corresponding to the service request;
a splitting module 302, configured to split a task according to the task to be executed, so as to obtain a plurality of sub tasks to be executed;
an executing module 303, configured to determine, through the master node, a slave node in the service subsystem, which executes the sub task to be executed, as a target slave node for each sub task to be executed, and send the sub task to be executed to the target slave node, so as to execute the sub task to be executed through the target slave node, and obtain a sub task result;
the processing module 304 is configured to receive, by the master node, each subtask result returned by each slave node, and obtain a comprehensive task result corresponding to the task to be executed according to each subtask result;
an obtaining module 305, configured to send the comprehensive task result to the data storage subsystem, so as to obtain an address identifier corresponding to the comprehensive task result from the data storage subsystem;
a sending module 306, configured to send the transaction carrying the address identifier to a consensus network corresponding to the blockchain, so that after the consensus network determines that the transaction passes consensus through the included blockchain link points, the address identifier is stored in the blockchain.
Optionally, the sending module 306 sends an obtaining request to each block link node included in the consensus network through a preset interface to obtain an encryption rule corresponding to each block link node included in the consensus network, encrypts the transaction according to the encryption rule to obtain encryption information, and sends the encryption information carried in the transaction to the consensus network so as to verify the encryption information according to the encryption rule corresponding to the block link node included in the consensus network.
Optionally, the encryption rule includes: domestic commercial cryptographic algorithms.
Optionally, the apparatus further comprises:
the query module 307 receives the data query request sent by the client, queries an address identifier corresponding to the data query request from the block chain, and returns data corresponding to the target address identifier stored in the data storage subsystem to the client through the target address identifier.
Optionally, the data storage subsystem comprises: an interplanetary file system, IPFS, the service subsystem comprising: HyperLegendr Fabric, the address identification comprising: and (4) hashing the address.
The present specification also provides a computer-readable storage medium having stored thereon a computer program operable to execute the method of data processing provided in fig. 1 above.
This specification also provides a schematic block diagram of the electronic device shown in fig. 4. As shown in fig. 4, at the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile memory, and may also include hardware required for other services. The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs the computer program, so as to implement the data processing method described in fig. 1 above. Of course, besides the software implementation, the present specification does not exclude other implementations, such as logic devices or a combination of software and hardware, and the like, that is, the execution subject of the following processing flow is not limited to each logic unit, and may be hardware or logic devices.
In the 90 s of the 20 th century, improvements in a technology could clearly distinguish between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. Designers almost always obtain the corresponding hardware circuit structure by programming an improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by programming the Device by a user. A digital system is "integrated" on a PLD by the designer's own programming without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Furthermore, nowadays, instead of manually making an Integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as abel (advanced Boolean Expression Language), ahdl (alternate Hardware Description Language), traffic, pl (core universal Programming Language), HDCal (jhdware Description Language), lang, Lola, HDL, laspam, hardward Description Language (vhr Description Language), vhal (Hardware Description Language), and vhigh-Language, which are currently used in most common. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.
The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, and an embedded microcontroller, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may thus be considered a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functions of the various elements may be implemented in the same one or more software and/or hardware implementations of the present description.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, the description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
This description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only an example of the present specification, and is not intended to limit the present specification. Various modifications and alterations to this description will become apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification should be included in the scope of the claims of the present specification.
Claims (12)
1. A data processing system is characterized by comprising a client, a consensus network, a service subsystem and a data storage subsystem, wherein the service subsystem comprises a main node and a slave node, and the consensus network comprises a plurality of block chain nodes;
the service subsystem receives a service request sent by the client through the master node, determines a task to be executed corresponding to the service request according to the service request, performs task splitting according to the task to be executed to obtain a plurality of sub tasks to be executed, determines a slave node executing the sub task to be executed as a target slave node for each sub task to be executed through the master node, sends the sub task to be executed to the target slave node, executes the sub task to be executed through the target slave node to obtain a sub task result, receives each sub task result returned by each slave node through the master node, obtains a comprehensive task result corresponding to the task to be executed according to each sub task result, and sends the comprehensive task result to the data storage subsystem to obtain an address identifier corresponding to the comprehensive task result from the data storage subsystem, sending a transaction carrying the address identifier to a consensus network corresponding to the block chain, so that the consensus network stores the address identifier in the block chain after determining that the transaction passes consensus through each block chain link point included;
and the data storage subsystem receives the comprehensive task result sent by the service subsystem, generates an address identifier corresponding to the comprehensive task result according to the comprehensive task result, returns the address identifier to the service subsystem, and stores the comprehensive task result in the local part of the data storage subsystem.
2. The data processing system of claim 1, wherein the data processing system further comprises: at least two pre-verification systems;
the pre-verification system receives a service request sent by the client, verifies a task to be executed corresponding to the service request according to the service request to obtain a verification result, and returns the verification result to the client;
and the client side sends service requests to the at least two pre-checking systems respectively, receives checking results returned by the at least two pre-checking systems, and sends the service requests to the service subsystem if the checking results returned by the at least two pre-checking systems meet preset conditions.
3. The data processing system according to claim 2, wherein the client determines, as the target result, the verification result that passes the verification from the verification results returned by the at least two pre-verification systems, and determines that the verification results returned by the at least two pre-verification systems satisfy the preset condition if it is determined that the percentage of the target result in the verification results returned by the at least two pre-verification systems exceeds a preset percentage.
4. The data processing system of claim 1, wherein the service subsystem sends an acquisition request to each block link node included in the consensus network through a preset interface to acquire an encryption rule corresponding to each block link node included in the consensus network, encrypts the transaction according to the encryption rule to obtain encryption information, carries the encryption information in the transaction, and sends the encryption information to the consensus network, so that the encryption information is verified through the encryption rule corresponding to the block link node for each block link node included in the consensus network.
5. The data processing system of claim 4, wherein each blockchain node included in the consensus network obtains an encryption rule corresponding to each service security level from a preset security mechanism, determines the service security level corresponding to the obtaining request as a target security level when receiving the obtaining request sent by the service subsystem, and returns the encryption rule corresponding to the target security level to the service subsystem.
6. The data processing system of claim 5, wherein the encryption rules comprise: domestic commercial cryptographic algorithms.
7. The data processing system of claim 1, wherein the service subsystem receives a data query request sent by the client, queries an address identifier corresponding to the data query request from the block chain as a target address identifier, and returns data corresponding to the target address identifier stored in the data storage subsystem to the client through the target address identifier.
8. A data processing system according to any one of claims 1 to 7, wherein the data storage subsystem comprises: an interplanetary file system, IPFS, the service subsystem comprising: HyperLegendr Fabric, the address identification comprising: and (4) hashing the address.
9. A method of data processing, comprising:
receiving a service request sent by a client through a main node contained in a service subsystem;
determining a task to be executed corresponding to the service request according to the service request;
splitting the tasks according to the tasks to be executed to obtain a plurality of sub tasks to be executed;
for each sub task to be executed, determining a slave node which executes the sub task to be executed in the service subsystem as a target slave node through the master node, and sending the sub task to be executed to the target slave node, so that the sub task to be executed is executed through the target slave node to obtain a sub task result;
receiving each subtask result returned by each slave node through the master node, and obtaining a comprehensive task result corresponding to the task to be executed according to each subtask result;
sending the comprehensive task result to the data storage subsystem so as to acquire an address identifier corresponding to the comprehensive task result from the data storage subsystem;
and sending the transaction carrying the address identifier to a consensus network corresponding to the block chain, so that the consensus network stores the address identifier in the block chain after determining that the transaction passes the consensus through the contained block chain link points.
10. An apparatus for data processing, comprising:
the receiving module is used for receiving a service request sent by a client through a main node contained in the service subsystem;
the determining module is used for determining a task to be executed corresponding to the service request according to the service request;
the splitting module is used for splitting the tasks according to the tasks to be executed to obtain a plurality of sub tasks to be executed;
the execution module is used for determining a slave node which executes the sub task to be executed in the service subsystem as a target slave node through the master node aiming at each sub task to be executed, and sending the sub task to be executed to the target slave node so as to execute the sub task to be executed through the target slave node and obtain a sub task result;
the processing module is used for receiving each subtask result returned by each slave node through the master node and obtaining a comprehensive task result corresponding to the task to be executed according to each subtask result;
the acquisition module is used for sending the comprehensive task result to the data storage subsystem so as to acquire an address identifier corresponding to the comprehensive task result from the data storage subsystem;
and the sending module is used for sending the transaction carrying the address identifier to a consensus network corresponding to the block chain, so that the consensus network stores the address identifier in the block chain after determining that the transaction passes the consensus through the contained block chain link points.
11. A computer-readable storage medium, characterized in that the storage medium stores a computer program which, when being executed by a processor, carries out the method of claim 9.
12. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of claim 9 when executing the program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110296513.1A CN113079200A (en) | 2021-03-19 | 2021-03-19 | Data processing method, device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110296513.1A CN113079200A (en) | 2021-03-19 | 2021-03-19 | Data processing method, device and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113079200A true CN113079200A (en) | 2021-07-06 |
Family
ID=76612857
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110296513.1A Pending CN113079200A (en) | 2021-03-19 | 2021-03-19 | Data processing method, device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113079200A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113608859A (en) * | 2021-08-24 | 2021-11-05 | 京东科技控股股份有限公司 | Node task execution method and device and storage medium |
| CN113630451A (en) * | 2021-07-27 | 2021-11-09 | 山东浪潮科学研究院有限公司 | Calculation service system based on block chain and spark |
| CN113645283A (en) * | 2021-07-29 | 2021-11-12 | 北京三快在线科技有限公司 | Multilink communication method, device, storage medium and electronic equipment |
| CN113743949A (en) * | 2021-11-04 | 2021-12-03 | 支付宝(杭州)信息技术有限公司 | Method for executing transaction in block chain, main node and slave node |
| CN114221814A (en) * | 2021-12-16 | 2022-03-22 | 上海市共进通信技术有限公司 | System, method, device, processor and computer readable storage medium for realizing terminal equipment safe opening of special service |
| CN114448995A (en) * | 2021-12-24 | 2022-05-06 | 苏州纳智天地智能科技有限公司 | Distributed computing method based on raft selection main strategy |
| CN116010529A (en) * | 2023-03-08 | 2023-04-25 | 阿里云计算有限公司 | Data processing method and system |
| CN116185596A (en) * | 2023-04-24 | 2023-05-30 | 之江实验室 | Method and device for improving task execution efficiency of wide-area multi-cluster distributed system |
| CN117555697A (en) * | 2024-01-11 | 2024-02-13 | 之江实验室 | Distributed training-oriented cache loading system, method, device and equipment |
-
2021
- 2021-03-19 CN CN202110296513.1A patent/CN113079200A/en active Pending
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113630451A (en) * | 2021-07-27 | 2021-11-09 | 山东浪潮科学研究院有限公司 | Calculation service system based on block chain and spark |
| CN113630451B (en) * | 2021-07-27 | 2023-05-16 | 山东浪潮科学研究院有限公司 | Computing service system based on block chain and spark |
| CN113645283B (en) * | 2021-07-29 | 2023-04-07 | 北京三快在线科技有限公司 | Multilink communication method, device, storage medium and electronic equipment |
| CN113645283A (en) * | 2021-07-29 | 2021-11-12 | 北京三快在线科技有限公司 | Multilink communication method, device, storage medium and electronic equipment |
| CN113608859A (en) * | 2021-08-24 | 2021-11-05 | 京东科技控股股份有限公司 | Node task execution method and device and storage medium |
| CN113743949A (en) * | 2021-11-04 | 2021-12-03 | 支付宝(杭州)信息技术有限公司 | Method for executing transaction in block chain, main node and slave node |
| CN114221814A (en) * | 2021-12-16 | 2022-03-22 | 上海市共进通信技术有限公司 | System, method, device, processor and computer readable storage medium for realizing terminal equipment safe opening of special service |
| CN114221814B (en) * | 2021-12-16 | 2023-10-27 | 上海市共进通信技术有限公司 | System, method, device, processor and computer readable storage medium for realizing terminal equipment safety starting special service |
| CN114448995A (en) * | 2021-12-24 | 2022-05-06 | 苏州纳智天地智能科技有限公司 | Distributed computing method based on raft selection main strategy |
| CN116010529A (en) * | 2023-03-08 | 2023-04-25 | 阿里云计算有限公司 | Data processing method and system |
| CN116010529B (en) * | 2023-03-08 | 2023-08-29 | 阿里云计算有限公司 | Data processing method and system |
| CN116185596A (en) * | 2023-04-24 | 2023-05-30 | 之江实验室 | Method and device for improving task execution efficiency of wide-area multi-cluster distributed system |
| CN116185596B (en) * | 2023-04-24 | 2023-08-01 | 之江实验室 | Method and device for improving task execution efficiency of wide-area multi-cluster distributed system |
| CN117555697A (en) * | 2024-01-11 | 2024-02-13 | 之江实验室 | Distributed training-oriented cache loading system, method, device and equipment |
| CN117555697B (en) * | 2024-01-11 | 2024-04-05 | 之江实验室 | Distributed training-oriented cache loading system, method, device and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113079200A (en) | Data processing method, device and system | |
| US10698885B2 (en) | Method and device for writing service data in block chain system | |
| CN109614823B (en) | Data processing method, device and equipment | |
| CN107196900B (en) | Consensus checking method and device | |
| CN109886682B (en) | Method, node and storage medium for realizing contract calling in block chain | |
| CN111898156A (en) | Method, node and storage medium for realizing contract calling in block chain | |
| CN110781192B (en) | Verification method, device and equipment of block chain data | |
| CN111008840A (en) | Service processing system, service processing method, device and equipment | |
| CN109347839B (en) | Centralized password management method and device, electronic equipment and computer storage medium | |
| CN107578338B (en) | Service publishing method, device and equipment | |
| CN111767556A (en) | Method for realizing privacy protection in block chain, node and storage medium | |
| CN106873958B (en) | Calling method and device of application programming interface | |
| CN115098866A (en) | Method for detecting private data leakage | |
| CN111342966A (en) | Data storage method, data recovery method, device and equipment | |
| CN111899008A (en) | Resource transfer method, device, equipment and system | |
| CN112287376A (en) | Method and device for processing private data | |
| CN113076527A (en) | Block chain-based digital asset processing method and device | |
| CN112182506A (en) | Data compliance detection method, device and equipment | |
| CN114638005A (en) | Data processing method, device and system based on block chain and storage medium | |
| CN111737304B (en) | Processing method, device and equipment of block chain data | |
| CN113282959A (en) | Service data processing method and device and electronic equipment | |
| CN113792346A (en) | Trusted data processing method, device and equipment | |
| CN116049318A (en) | Data storage method and communication device | |
| CN113282628A (en) | Big data platform access method and device, big data platform and electronic equipment | |
| CN110995447B (en) | Data storage method, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |