CN111881218A - Public space data sharing method based on block chain - Google Patents
Public space data sharing method based on block chain Download PDFInfo
- Publication number
- CN111881218A CN111881218A CN202010789922.0A CN202010789922A CN111881218A CN 111881218 A CN111881218 A CN 111881218A CN 202010789922 A CN202010789922 A CN 202010789922A CN 111881218 A CN111881218 A CN 111881218A
- Authority
- CN
- China
- Prior art keywords
- data
- block chain
- shared
- node
- sharing
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 230000005540 biological transmission Effects 0.000 claims abstract description 25
- 238000007906 compression Methods 0.000 claims description 12
- 230000006835 compression Effects 0.000 claims description 12
- 238000007781 pre-processing Methods 0.000 claims description 6
- 230000008859 change Effects 0.000 claims description 5
- 239000003999 initiator Substances 0.000 claims description 3
- 238000003860 storage Methods 0.000 claims description 2
- 239000000203 mixture Substances 0.000 claims 1
- 239000002994 raw material Substances 0.000 claims 1
- 230000008569 process Effects 0.000 description 5
- 238000012544 monitoring process Methods 0.000 description 4
- 238000009826 distribution Methods 0.000 description 3
- RTZKZFJDLAIYFH-UHFFFAOYSA-N Diethyl ether Chemical compound CCOCC RTZKZFJDLAIYFH-UHFFFAOYSA-N 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 239000008358 core component Substances 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005242 forging Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- G06F16/275—Synchronous replication
-
- 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Accounting & Taxation (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a public space data sharing method based on a block chain, which comprises the steps of distinguishing and intercepting data to be shared according to keywords, and respectively uploading the data to a block chain network; generating each data node on the block chain network, wherein the data nodes comprise different keywords and the data to be shared corresponding to the keywords; receiving a data request instruction, and correspondingly selecting the data node according to the instruction; the data sharing method comprises the steps that sharing of data in the data nodes is achieved through a data sharing interface, data to be shared are distinguished and intercepted through comparison according to keywords and specific abstract information, then a data packet is compressed to generate secondary data nodes, meanwhile, secret signatures are added to ensure that information is not public and not leaked, and smooth operation of a block chain is further ensured through limiting of transmission rate.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a public space data sharing method based on a block chain.
Background
The blockchain is essentially a shared database, and the data or information stored in the database has the characteristics of being unforgeable, having whole-course trace, having traceability, having public transparency, having collective maintenance and the like. As a novel decentralized protocol, the intelligent contract can safely store data, information cannot be forged and falsified, and an intelligent contract can be intelligently executed without the auditing of any centralized mechanism. Based on the characteristics, the block chain technology lays a solid trust foundation, creates a reliable cooperation mechanism and has wide application prospect.
At present, a data sharing method based on a block chain adopts a block chain technology to share data, a data providing node synchronizes data to the block chain, and the block chain synchronizes data from the block chain to a data acquiring node. However, the data sharing method has certain defects in the sharing of public data, on one hand, the operation efficiency of a block chain is affected due to the fact that the quantity of the shared public data is increased and the quantity of nodes is increased at present, on the other hand, the privacy of the data is not guaranteed to a certain extent, and the risk of data leakage exists in the sharing process.
Disclosure of Invention
This section is for the purpose of summarizing some aspects of embodiments of the invention and to briefly introduce some preferred embodiments. In this section, as well as in the abstract and the title of the invention of this application, simplifications or omissions may be made to avoid obscuring the purpose of the section, the abstract and the title, and such simplifications or omissions are not intended to limit the scope of the invention.
The present invention is proposed in view of the above-mentioned problems of the existing data sharing method based on the block chain.
Therefore, the technical problem solved by the invention is as follows: the method solves the problems that the operation efficiency of the block chain is easily influenced and the data leakage risk also exists in the sharing process in the conventional public data sharing method based on the block chain.
In order to solve the technical problems, the invention provides the following technical scheme: a public space data sharing method based on a block chain comprises the steps of distinguishing and intercepting data to be shared according to keywords, and respectively uploading the data to a block chain network; generating each data node on the block chain network, wherein the data nodes comprise different keywords and the data to be shared corresponding to the keywords; receiving a data request instruction, and correspondingly selecting the data node according to the instruction; and sharing data in the data nodes is realized through a data sharing interface.
As a preferred solution of the block chain-based common spatial data sharing method according to the present invention, wherein: distinguishing and intercepting the data to be shared according to the keywords, and respectively uploading the data to be shared to the block chain network; comparing the keywords to distinguish the data to be shared; intercepting according to a distinguishing result, sending the abstract information to the block chain network for evidence storage, and receiving a returned transaction address of the shared data evidence; and forming an intercepted data packet by the transaction address, the keyword and the intercepted data to be shared, and generating each data node on the block chain network.
As a preferred solution of the block chain-based common spatial data sharing method according to the present invention, wherein: and generating the intercepted data packet, then performing compression preprocessing, determining the node position change information of each piece of compressed data to be shared, and recording the size of the compressed data stream.
As a preferred solution of the block chain-based common spatial data sharing method according to the present invention, wherein: after the compression processing, determining whether the data to be shared has a part needing to be encrypted; if yes, calculating the hash value and the private key of the intercepted data packet after the corresponding part is compressed; and acquiring the signature information of the intelligent contract, uploading the private key to the intelligent contract, and interactively storing the data element information of the corresponding encrypted part with the intelligent contract.
As a preferred solution of the block chain-based common spatial data sharing method according to the present invention, wherein: receiving a data request instruction, and realizing the sharing of the data in the correspondingly selected data node through a data sharing interface specifically comprises receiving the data request instruction and correspondingly selecting the data node according to the instruction; determining a transmission rate according to the selected actual condition of the data node; transmitting corresponding data packets according to the determined transmission rate; and the instruction initiator decompresses and acquires corresponding data after receiving the data packet to realize sharing.
As a preferred solution of the block chain-based common spatial data sharing method according to the present invention, wherein: determining the transmission rate in dependence on the selected data node actual condition by the following formula,
wherein,
wherein, is the transmission rate; n' is the number of bytes contained in the transmitted data node; n is the number of bytes contained in the data to be shared; p' is the number of the data nodes participating in transmission at the same time; p is the number of all the data nodes contained in the block chain network; h (x) is a function formula shared by instructions sent by the same node, and x is an integer.
As a preferred solution of the block chain-based common spatial data sharing method according to the present invention, wherein: the block chain network is an Ethernet or a super account book.
As a preferred solution of the block chain-based common spatial data sharing method according to the present invention, wherein: the keywords are time or location regions.
As a preferred solution of the block chain-based common spatial data sharing method according to the present invention, wherein: and storing the flow of the data acquisition request on the block chain network node.
The invention has the beneficial effects that: the invention provides a public space data sharing method based on a block chain, which distinguishes and intercepts data to be shared by comparing key words with specific abstract information, then compresses a data packet to generate secondary data nodes, increases a secret signature to ensure that the information is not disclosed and leaked, and further ensures smooth operation of the block chain by limiting a transmission rate.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise. Wherein:
FIG. 1 is a flowchart of a method for sharing common spatial data based on block chains according to the present invention;
FIG. 2 is a flowchart of data distinguishing and intercepting in the block chain-based common spatial data sharing method according to the present invention;
FIG. 3 is a flowchart of receiving a request instruction and completing sharing in the method for sharing common spatial data based on a blockchain according to the present invention;
FIG. 4 is a diagram of a network architecture to which the method of the present invention relates;
FIG. 5 is a diagram of the information interaction relationship between nodes involved in the method of the present invention.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, specific embodiments accompanied with figures are described in detail below, and it is apparent that the described embodiments are a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making creative efforts based on the embodiments of the present invention, shall fall within the protection scope of the present invention.
Example 1
At present, a data sharing method based on a block chain adopts a block chain technology to share data, a data providing node synchronizes data to the block chain, and the block chain synchronizes data from the block chain to a data acquiring node. However, the data sharing method has a certain defect in the sharing of public data, on one hand, the operation efficiency of a block chain is affected due to the fact that the quantity of the shared public data (such as monitoring data) is increased and the quantity of nodes is increased, on the other hand, the privacy of the data is not guaranteed to a certain extent, and the risk of data leakage exists in the sharing process.
Accordingly, referring to fig. 1-5, the present invention provides a method for sharing common spatial data based on block chains, comprising:
s1: distinguishing and intercepting data to be shared according to the keywords, and uploading the data to a block chain network respectively;
considering that the data volume of public data, such as monitoring data, is continuously increased along with the development of the society, if the existing unified uploading operation is adopted during data sharing, the pressure of a receiving end of a block chain network is easily increased, and the efficiency of the uploading end of the block chain network is greatly influenced, the invention creatively provides to distinguish data according to keyword information in the first step.
The block chain network is an ether house or a super account book, the keywords can be preset in advance according to actual classification, for example, the keywords are set to be time or position areas, time is taken as the keywords for example, on one hand, the same group of monitoring data can be selected and distinguished by taking different times as distinguishing points, and on the other hand, the monitoring data of different groups at the same time can be selected and distinguished by taking different groups as distinguishing points.
Referring to fig. 2, the method specifically includes the following steps:
s1.1: abstracting data to be shared based on a preset algorithm to obtain abstract information;
specifically, the preset algorithm is a Hash algorithm, and it should be noted that the preset algorithm is only an example and is not limited herein. For example, user a computes a digital digest using a Hash algorithm, which commonly includes MD5 and the SHA family of algorithms, for each piece of information in the shared data set.
S1.2: comparing the keywords to distinguish the data to be shared;
after the summary information is obtained, the summary information of each section of data to be shared can be distinguished for the first time, for example, the data to be shared can be distinguished by taking 'time' as a distinguishing point, the data to be shared can be distinguished according to the difference of time, then preset keywords are compared, the data to be shared and the time can be correspondingly matched to obtain a final grouping result, or the time is taken as a keyword, so that the summary information meeting the requirements in different time periods can be obtained, and the data to be shared can be distinguished.
S1.3: intercepting according to the distinguishing result, sending the abstract information to the block chain network for storing the certificate, and receiving the returned transaction address of the current shared data certificate;
it should be noted that:
the interception principle is as follows:
loading data into program variables;
sorting the loaded data according to the determined distinguishing characteristics, and further counting the number of different numerical data in the data and the number of each numerical value;
drawing a distribution histogram of the values;
selecting a maximum threshold Tmax and a minimum threshold Tmin which are most concentrated in the distribution according to requirements, so that the ratio P of the number of the interception intervals in the total number of points (length) is not less than a threshold R, and the common threshold P is set to 1/2(Tmax + Tmin);
and selecting the interval with the minimum difference between the maximum threshold Tmax and the minimum threshold Tmin as a final interception interval.
The interception of the data is performed by the following codes:
s1.4: and forming an intercepted data packet by the transaction address, the keyword and the intercepted data to be shared, and generating each data node on the block chain network.
S2: generating data nodes on a block chain network, wherein the data nodes comprise different keywords and corresponding data to be shared;
and further, generating an intercepted data packet, performing compression preprocessing, determining the position change information of each compressed data to be shared, and recording the size of the compressed data stream.
In order to further improve the efficiency of the uploading end of the block chain network, the invention creatively provides that the intercepted data is compressed and preprocessed to obtain smaller data flow, on one hand, the size of a data packet for data transmission is reduced, on the other hand, the subsequent encryption operation is carried out, it is not difficult to understand that the obvious encryption difficulty of the compressed data packet and the requirement on a processor are smaller than the encryption of the whole data, as shown in the following table 1, the efficiency comparison between the compression preprocessing and the uploading of the same segment of data without the compression preprocessing is realized:
table 1: compression efficiency comparison table
| Compressed upload time(s) | Upload time without compression(s) | |
| 500Mb | 2.009 | 2.231 |
| 1000Mb | 3.774 | 6.902 |
| 1500Mb | 7.140 | 13.66 |
As shown in the above table 1, when the transmission documents are 500Mb, 1000Mb, and 1500Mb, respectively, the compressed corresponding documents are 124Mb, 266Mb, and 513Mb, respectively, and it is apparent from the above table that the uploading efficiency is significantly improved by using the compression preprocessing.
After compression, uploading the data to a block chain network to obtain corresponding data nodes, recording the node relation of the corresponding data, and determining the node position change information of each compressed data to be shared. When an acquirer puts forward a request, data is compressed, and other specific information in the data cannot be obtained in time except summary information, so that a corresponding request instruction is sent to original data, and a corresponding data compression packet is selected according to the change relation of nodes.
Furthermore, the method further comprises the following steps after the compression treatment:
determining whether the data to be shared has a part needing to be encrypted;
if yes, calculating the hash value and the private key of the intercepted data packet after the corresponding part is compressed;
and acquiring the signature information of the intelligent contract, uploading the private key to the intelligent contract, and interactively storing the data element information of the corresponding encrypted part with the intelligent contract.
Specifically, the intelligent contract is a solid, or chaincode.
In order to ensure the safety of data, corresponding encryption is carried out during uploading, only abstract information is disclosed, specific contents are not disclosed in detail, and when a user shares data, the identity of the user can be authenticated, for example, a public key and a private key can be obtained based on a preset algorithm; generating a certificate application file based on the public key and the identity information to obtain an identity certificate; based on the identity certificate, a data sharing request is sent.
For example, information may be secured by way of a digital certificate. A digital certificate is a string of numbers that can indicate the identity of a user of a network and is issued by a digital certificate authority to the user to provide a way to verify the identity of the user in the network, encrypt and decrypt information and data transmitted in the network.
For example, a data sharing center may be used as a digital certificate center to manage and distribute digital certificates for users in compliance with the PKI system. PKI is a general framework established on the basis of public and private keys to realize secure and reliable message transmission and identity confirmation, and does not represent a specific cryptography technology and process. In general, PK I includes at least the following core components: ca (verification authority): responsible for the issuance and revocation of certificates, receiving requests from the RA; RA (registration authority): and verifying the user identity, checking the data validity, taking charge of registration, and sending the data to the CA if the verification is passed.
The specific authentication method may include: a user generates a public key and a private key pair by using an asymmetric encryption algorithm, wherein the representative algorithm of the asymmetric encryption algorithm comprises RSA, elliptic curve (ECC), SM2 and the like; providing a public key, identity and some basic information of organization by a user, generating a certificate application file, and registering application information through RA; the CA verifies the identity and authentication information provided by the user, signs a public key provided by the user, completes the manufacture of the certificate and issues the certificate to the user; through the steps, the data sharing center can safely and legally manage the famous users so as to prevent a certain entity from forging and abusing the public key.
S3: receiving a data request instruction, and correspondingly selecting a data node according to the instruction;
s4: and sharing data in the data nodes is realized through the data sharing interface.
Specifically, referring to fig. 3, receiving a data request instruction and implementing sharing of data in a corresponding selected data node through a data sharing interface includes:
receiving a data request instruction, and correspondingly selecting a data node according to the instruction;
determining a transmission rate according to the actual condition of the selected data node;
transmitting corresponding data packets according to the determined transmission rate;
and after receiving the data packet, the instruction initiator decompresses the data packet to acquire corresponding data, so as to realize sharing.
Preferably, the transmission rate is determined according to the selected data node actual condition by the following formula:
wherein,
wherein, is the transmission rate; n' is the number of bytes contained in the transmitted data node; n is the number of bytes contained in the data to be shared; p' is the number of data nodes participating in transmission at the same time; p is the number of all data nodes contained in the block chain network; h (x) is a function formula shared by instructions sent by the same node, and x is an integer.
It should be noted that, in the actual operation process, the upload terminal has no requirement for efficiency, but has a greater requirement for network efficiency for the sharing terminal user, for example, different users share different data on the blockchain network at the same time, and different users share the data of the same node at the same time, which all affect the efficiency of the network, and in order to ensure the maximum transmission efficiency distribution, the sharing efficiency of the users is constrained according to different situations, so as to maximize the overall efficiency.
As shown in table 2 below, a comparison table of the overall efficiency with and without the transmission limiting method of the present invention is shown:
table 2: transmission efficiency integral comparison table
| Integral delay times | Integral delay time(s) | Overall efficiency | |
| The invention | 0 | 1.37 | 0.988 |
| Without using transmission restrictions | 6 | 18.76 | 0.545 |
As shown in table 2 above, when transmitting the compressed packets of the same size, we choose to compare the cases of "different users share different data on the blockchain network at the same time", where 15-bit users share requests for 124Mb compressed packets at the same time, and it is obvious from table 2 above that the efficiency is significantly better than the prior art.
Additionally, the flow of the data acquisition request is stored on the block chain network node, so that the next acquisition of the request flow is facilitated, and the time and the operation are saved.
The invention provides a public space data sharing method based on a block chain, which distinguishes and intercepts data to be shared by comparing key words with specific abstract information, then compresses a data packet to generate secondary data nodes, increases a secret signature to ensure that the information is not disclosed and leaked, and further ensures smooth operation of the block chain by limiting a transmission rate.
It should be noted that the above-mentioned embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, which should be covered by the claims of the present invention.
Claims (9)
1. A method for sharing public space data based on a block chain is characterized in that: comprises the steps of (a) preparing a mixture of a plurality of raw materials,
distinguishing and intercepting data to be shared according to the keywords, and uploading the data to a block chain network respectively;
generating each data node on the block chain network, wherein the data nodes comprise different keywords and the data to be shared corresponding to the keywords;
receiving a data request instruction, and correspondingly selecting the data node according to the instruction;
and sharing data in the data nodes is realized through a data sharing interface.
2. The method of claim 1, wherein: distinguishing and intercepting the data to be shared according to the keywords, and respectively uploading the data to the block chain network,
abstracting the data to be shared based on a preset algorithm to obtain abstract information;
comparing the keywords to distinguish the data to be shared;
intercepting according to a distinguishing result, sending the abstract information to the block chain network for evidence storage, and receiving a returned transaction address of the shared data evidence;
and forming an intercepted data packet by the transaction address, the keyword and the intercepted data to be shared, and generating each data node on the block chain network.
3. The method of claim 2, wherein: and generating the intercepted data packet, then performing compression preprocessing, determining the node position change information of each piece of compressed data to be shared, and recording the size of the compressed data stream.
4. The method of claim 3, wherein: the method also comprises the following steps after the compression treatment,
determining whether the data to be shared has a part needing to be encrypted;
if yes, calculating the hash value and the private key of the intercepted data packet after the corresponding part is compressed;
and acquiring the signature information of the intelligent contract, uploading the private key to the intelligent contract, and interactively storing the data element information of the corresponding encrypted part with the intelligent contract.
5. The method of claim 3 or 4, wherein: receiving a data request instruction, and implementing the sharing of the data in the corresponding selected data node through a data sharing interface,
receiving a data request instruction, and correspondingly selecting the data node according to the instruction;
determining a transmission rate according to the selected actual condition of the data node;
transmitting corresponding data packets according to the determined transmission rate;
and the instruction initiator decompresses and acquires corresponding data after receiving the data packet to realize sharing.
6. The method of claim 5, wherein: determining the transmission rate in dependence on the selected data node actual condition by the following formula,
wherein,
wherein, is the transmission rate; n' is the number of bytes contained in the transmitted data node; n is the number of bytes contained in the data to be shared; p' is the number of the data nodes participating in transmission at the same time; p is the number of all the data nodes contained in the block chain network; h (x) is a function formula shared by instructions sent by the same node, and x is an integer.
7. The method for sharing common spatial data based on block chains according to any one of claims 1 to 4 or 6, wherein: the block chain network is an Ethernet or a super account book.
8. The method of claim 7, wherein: the keywords are time or location regions.
9. The method of claim 8, wherein: and storing the flow of the data acquisition request on the block chain network node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010789922.0A CN111881218A (en) | 2020-08-07 | 2020-08-07 | Public space data sharing method based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010789922.0A CN111881218A (en) | 2020-08-07 | 2020-08-07 | Public space data sharing method based on block chain |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111881218A true CN111881218A (en) | 2020-11-03 |
Family
ID=73211304
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010789922.0A Withdrawn CN111881218A (en) | 2020-08-07 | 2020-08-07 | Public space data sharing method based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111881218A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112597117A (en) * | 2020-12-26 | 2021-04-02 | 讯飞智元信息科技有限公司 | File sharing method, related device and file sharing system |
| CN114358764A (en) * | 2021-11-15 | 2022-04-15 | 深圳众联数字科技有限公司 | Privacy calculation method based on intelligent contracts in block chain and related equipment |
-
2020
- 2020-08-07 CN CN202010789922.0A patent/CN111881218A/en not_active Withdrawn
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112597117A (en) * | 2020-12-26 | 2021-04-02 | 讯飞智元信息科技有限公司 | File sharing method, related device and file sharing system |
| CN114358764A (en) * | 2021-11-15 | 2022-04-15 | 深圳众联数字科技有限公司 | Privacy calculation method based on intelligent contracts in block chain and related equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20230023857A1 (en) | Data processing method and apparatus, intelligent device, and storage medium | |
| JP7285840B2 (en) | Systems and methods for authenticating off-chain data based on proof verification | |
| US10296248B2 (en) | Turn-control rewritable blockchain | |
| WO2018126858A1 (en) | Blockchain technology-based robust atm network system and information processing method therefor | |
| US20180152442A1 (en) | Blockchain-supported, hash tree-based digital signature infrastructure | |
| KR20190075771A (en) | Authentication System Using Block Chain Through Distributed Storage after Separating Personal Information | |
| CN111183446A (en) | Centralized account book system based on block chain management | |
| CN109472164A (en) | The verification method and its network and electronic equipment of contract dataset | |
| CN110474892B (en) | False data injection attack defense method based on block chain technology | |
| US20210192012A1 (en) | Right holder terminal, user terminal, right holder program, user program, content utilization system, and content utilization method | |
| CN109491965A (en) | The storage method and its network and electronic equipment of purchase sale of electricity contract | |
| CN110224984A (en) | A kind of multi-party authorization method and device based on block chain technology | |
| CN111656386A (en) | Managing transaction requests in ledger system | |
| CN111881218A (en) | Public space data sharing method based on block chain | |
| CN111406398A (en) | Managing trust points in an account book system | |
| US20230237437A1 (en) | Apparatuses and methods for determining and processing dormant user data in a job resume immutable sequential listing | |
| CN111630545B (en) | Managing transaction requests in ledger system | |
| Wu et al. | Distributed Timestamp Mechanism Based on Verifiable Delay Functions. | |
| US20240179019A1 (en) | Consensus result synchronization across algorithms of different fault tolerance types | |
| CN113779642B (en) | Data processing method, device and system thereof, and electronic equipment | |
| US20240073045A1 (en) | Blockchain-based data processing method and apparatus, device, medium, and product | |
| Zhang et al. | Efficient auditing scheme for secure data storage in fog-to-cloud computing | |
| WO2022068234A1 (en) | Encryption method and apparatus based on shared root key, device and medium | |
| CN111143381B (en) | Method and device for updating trust points in multi-layer block chain structure | |
| CN114826607B (en) | Edge computing node compression method based on block chain and lightweight storage system |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20201103 |
|
| WW01 | Invention patent application withdrawn after publication |