CN113542317B - Method, equipment and storage medium for realizing file copy certification by intelligent consensus in use - Google Patents
Method, equipment and storage medium for realizing file copy certification by intelligent consensus in use Download PDFInfo
- Publication number
- CN113542317B CN113542317B CN202010292127.0A CN202010292127A CN113542317B CN 113542317 B CN113542317 B CN 113542317B CN 202010292127 A CN202010292127 A CN 202010292127A CN 113542317 B CN113542317 B CN 113542317B
- Authority
- CN
- China
- Prior art keywords
- copy
- data
- original text
- replicator
- proving
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 103
- 238000012795 verification Methods 0.000 claims abstract description 19
- 230000010076 replication Effects 0.000 claims description 26
- 239000012634 fragment Substances 0.000 claims description 7
- 230000000977 initiatory effect Effects 0.000 claims description 4
- 238000013500 data storage Methods 0.000 abstract description 3
- 238000004422 calculation algorithm Methods 0.000 description 11
- 238000010586 diagram Methods 0.000 description 11
- 230000006870 function Effects 0.000 description 11
- 238000004891 communication Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 7
- 230000006399 behavior Effects 0.000 description 6
- 238000004590 computer program Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 238000012946 outsourcing Methods 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000005236 sound signal Effects 0.000 description 4
- 241001481828 Glyptocephalus cynoglossus Species 0.000 description 3
- 230000002829 reductive effect Effects 0.000 description 3
- 229910002056 binary alloy Inorganic materials 0.000 description 2
- 230000000295 complement effect Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 201000001098 delayed sleep phase syndrome Diseases 0.000 description 1
- 208000033921 delayed sleep phase type circadian rhythm sleep disease Diseases 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000002427 irreversible effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000036961 partial effect Effects 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
- 238000004549 pulsed laser deposition Methods 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/16—Program or content traceability, e.g. by watermarking
-
- 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/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
- H04L63/1416—Event detection, e.g. attack signature detection
-
- 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/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computing Systems (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Multimedia (AREA)
- Technology Law (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Storage Device Security (AREA)
Abstract
The invention provides a method for realizing file copy certification by intelligent consensus in use. The method for realizing file copy proving by using the intelligent consensus comprises the steps of generating copy codes r of a data original text m by using the intelligent consensus method according to a workload coding unit length L, the data original text m and a node identifier id of a replicator; submitting the copy code r and the abstract information of the copy code r to a first storage area for storage, and submitting the abstract information of the data original text m to a second storage area for storage. The intelligent common realization file copy proving method provided by the invention converts the original content of the data file into the copy coding form of each copy storage node for storage, can enable a replicator to store the file in a honest and true way, effectively prevents the replicator from fraudulently attacking, and can simultaneously carry out workload proving and file coding. The method can be used in the fields of smart consensus file storage, multi-party cooperation data storage verification without trust basis, cooperation and the like in use.
Description
Technical Field
The invention relates to the technical field of blockchains, in particular to a method, equipment and a storage medium for realizing file copy certification by smart consensus in use.
Background
In 2008, a learner named "Zhongben Tong" (Satoshi Nakamoto) published "Bizhen: a paper of point-to-point electronic cash system lays the foundation of block chain technology. The block chain is a decentralized distributed database system which is maintained by all nodes in the block chain network in a common participation mode, and consists of a series of data blocks generated based on a cryptography method, wherein each data block is one block in the block chain. Blocks are linked together in order according to the order of the time of generation, forming a chain of data, known in the figure as a blockchain.
The blockchain is generated and validated by a special block and transaction, and has the security characteristics of being unchangeable, not counterfeitable and completely traceable. Therefore, the smart consensus implementation file storage technology in use has been rapidly developed in recent years. Of these, filecoin is a target product in this field, filecoin is intended to be a decentralized storage network, allowing users to buy and sell unused storage on open markets. Filecoin is characterized by replication certification and space-time certification, zero knowledge certification participation is needed, and the requirement on participating hardware equipment is high. In particular, replication attestation, one core problem that needs to be addressed is that a replicator 131 (storage node) that is not fully trusted, without the data file specified by the storage holder 110 (storage demand node), purports to participate in storing the replicated copy of the specified data file, and then the replicator 131 spoofs the verifier (verification node) 140 by several means so that the verifier believes that the replicator 131 actually stores the specified data file. These spoofing methods fall into a broad category:
1. Outsourcing, when the verifier 140 attempts to ask the replicator 131, requires the replicator 131 to provide all, part of the content or a hash of the content of a specified data file, etc. At this time, the replicator 131 does not store the specified data file contents itself, but spoofing is successfully completed by file contents held by other replicators 132.
2. When the content of the specified data file itself has a certain rule, for example, the content stored in one file is all space characters or the content is an arithmetic progression. Such files are submitted to the replicator 131, and the replicator 131 may not store the files, but rather, the files may be generated immediately when the verifier 140 asks for the files, using a specific algorithm or program, so as to achieve the purpose of reducing the use of storage space.
Wherein replicators 131, 132 establish a connection with the holder 110, verifier 140 via a file storage system network 120, the file storage system (INTERPLANETARY FILE SYSTEM, also called interstellar file system) is an underlying protocol of the internet, like the HTTP protocol.
In order to avoid the above problems, so that the replicator actually stores the specified data file, the replication certification scheme proposed in the prior art Filecoin generally adopts the core idea of slow encoding and fast decoding, so that the replicator is more willing to save the encoded replication copy instead of the original text before encoding. One of the copy proving schemes is chain type (chain), the basic principle is that original data are divided into a plurality of small data blocks, mutual dependency relations are introduced among different data blocks, and the like; on this basis, further improved copy proving schemes are STACKED DRG and schemes of zigzag DRG, VDF and the like, and the schemes further compress the complexity of decoding verification and improve randomness. For example, the zig-zag DRG firstly divides the original data into small data blocks in turn, each small data block is calculated to obtain a hash value, the small data block uses the hash value as encryption seed to perform encoding and decoding, and the hash values of the small data blocks establish a connection relationship according to DRG (Depth Robust Graph). Therefore, the encoding process cannot be parallel, so that the speed is reduced, the encoding process is not too slow, and the cheating behavior of the replicator for caching partial data is reduced.
However, the verification process of the duplication method requires zero knowledge to prove participation, and has high requirements on the participating hardware devices. Therefore, in order to better prevent the cheating and fraud of replicators, common attacks such as outsourcing attacks, generating attacks, and witch attacks in an open system are well resisted. There is a need for a new document copy certification method to ensure multi-party collaborative data preservation and verification without a trust basis.
It should be noted that the information disclosed in this background section is only for enhancement of understanding of the general background of the invention and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
In order to solve the defects in the prior art, the invention aims to provide equipment for realizing a file copy proving method by intelligent consensus in use and a storage medium.
In order to provide a method for realizing file copy proving by intelligent consensus in use, the invention is realized by the following technical scheme: a method for realizing file copy proving by intelligent consensus in use, which comprises,
S100: generating a copy code r of the data original text m by using a smart consensus method according to the unit length L of the workload code, the data original text m and the node identification id of a replicator;
s200, submitting the abstract information of the copy code r to a first storage area corresponding to the replicator for storage;
S300: and submitting the abstract information of the data original text m to a second storage area for storage.
Optionally, the method further includes assigning a plurality of replicators with different node identifiers ids to the data original m, assigning the data original m to the plurality of replicators respectively, and each replicator repeatedly executes steps S100 and S200.
Optionally, in step S100, the generating the replication code r of the data original m according to the unit length L of the workload code, the data original m, and the node identifier id of the replicator by using the smart consensus method includes,
S110: dividing the data original text m into a plurality of original text sub-data blocks m i,m＝m1||m2||…||mn with the length of L;
s120: in use, the smart consensus method generates a replica code r i for each of the original text sub-data blocks m i, where r=r 1||r2||…||rn, where 1.ltoreq.i.ltoreq.n.
Optionally, in step S120, said in-use smart consensus method generating a replica code r i for each of said original sub-data blocks m i comprises,
Iteratively trying the value of the copy code r i until the data with the length L at the specified position of the hash value h i is identical to the original text sub-data block m i, wherein the hash value h i is the hash value of the copy code r i and a copy proving parameter, and the copy proving parameter includes the node identification id of the replicator and the position of the original text sub-data block m i in the data original text m.
Optionally, a verification copy proving method is also included, the verification copy proving method includes the steps of,
S410: initiating a challenge to a replicator by using challenge data, wherein the challenge data comprises a data combination consisting of random positions and random lengths corresponding to a plurality of original text fragments;
S420: according to the copy segment corresponding to the challenge data, the replicator calculates to obtain a first hash and returns the first hash to the verifier;
S430: and the verifier acquires the copy content, calculates a second hash according to the challenge data, compares whether the first hash and the second hash are the same, verifies that the copy certification passes if the first hash and the second hash are the same, and verifies that the copy certification fails if the first hash and the second hash are not the same.
Optionally, in step S410, the challenge data further includes random data, where the random data is prefixed to the data combination or is spaced apart from the data combination.
Optionally, in step S420, the returning to the verifier includes the replicator writing the first hash to a blockchain.
The invention also provides a device for realizing file copy proving through intelligent in use, which is realized through the following technical scheme, and the device for realizing file copy proving through intelligent in use comprises a copy proving module, a first writing module and a second writing module, wherein the copy proving module is configured to generate a copy code r of the data original m according to a workload coding unit length L, the data original m and a node identifier id of a replicator;
the first writing module is configured to submit the copy code r and the summary information of the copy code r to a first storage area corresponding to the replicator for storage;
the second writing module is configured to submit the abstract information of the data original text m to a second storage area for storage.
Optionally, a verifier module is also included, the verifier module configured to initiate a challenge to the replicator to verify a proof of replication.
The invention also provides a device for proving the copy of the file by the public smart in use, which comprises a processor and a memory, wherein the processor is suitable for realizing each instruction, the memory is suitable for storing a plurality of instructions, and the instructions are suitable for being loaded and executed by the processor to realize the method for proving the copy of the file by the public smart in use.
The invention also provides a computer readable storage medium, wherein the computer readable storage medium stores computer executable instructions, and when the computer executable instructions are executed, the method for realizing file copy certification by intelligent in use is realized.
Compared with the prior art, the method for realizing file copy proof by intelligent consensus in use has the following beneficial effects:
The invention provides a method for realizing file copy proving by using intelligent consensus, which generates copy code r of data original text m according to a workload code unit length L, the data original text m and a node identifier id of a replicator. The intelligent common algorithm (workload Proof of Work/PoW) widely used in the bitcoin is converted into a coding algorithm with practical application value, so that the calculation forces (calculation force, calculation capability of equipment) are used on the copy Proof coding, a large amount of hardware equipment investment and energy sources in the prior art in the intelligent common algorithm consumed in the prior art are converted into the coding algorithm application with practical application value, and the utilization rate of energy sources and resources is effectively improved.
The invention adopts a simple hash algorithm to code the selectable difficulty, and is applicable to but not limited to various hash functions sha1/sha256/md5/blake b and the like.
Still further, the method for realizing file copy proving by smart consensus in use converts the original content of the data file into the unique copy coding form of each copy storage node for storage, can effectively resist the fraud attack of a replicator, effectively reduce the behaviors of a replicator providing storage service in a blockchain through methods such as outsourcing attack, attack generation, witches attack and the like, deceive the behavior of a verifier, and reduce the occurrence of the phenomenon of obtaining benefits at a low cost. So that the verifier believes that the replicator can honest and authentic store the file.
Furthermore, the smart consensus in use realizes the file copy proving method, if the replicator loses the related result, such as the result after the copy coding, the replication is generated from the original text again, and the cost is high, so the replicator tends to store the copy coded content in a honest way, rather than cheating.
Furthermore, the method for realizing file copy proving by intelligent consensus in use can be used in the fields of multi-party cooperation data storage verification, cooperation and the like based on blockchain file storage and no trust basis.
Still further, the method for implementing file copy proof by smart consensus in use further comprises a method for verifying copy proof, because in step S410, only the positions of a plurality of original text segments and the lengths of the original text segments need to be sent to a replicator, and the original text segments do not need to be sent, in step S420, only the hash of the replication segments need to be sent, and the traffic is small; the method can verify the copying of a plurality of original text fragments at a time and even the copying of all data originals, has more challenge combinations, can cover more original text fragments at any positions, and has higher efficiency.
Still further, the challenge data further includes random data, where the random data is used as a prefix of the data combination or is set at intervals with the data combination, and initiates a challenge to the replicator, and the combination of the random data and the data avoids the behavior that the replicator only stores a plurality of randomly selected original text segments for replication, and can better avoid cheating of the replicator under the condition that the traffic is increased limited. It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention as claimed.
Drawings
FIG. 1 is a block chain architecture diagram of the prior art;
FIG. 2 is a schematic flow chart of a method for implementing document copy certification by smart consensus in use according to an embodiment of the present invention;
fig. 3 is a schematic flow chart of step S100 in fig. 2;
FIG. 4 is a schematic structural diagram of a device for proving copy of a document by smart consensus in use according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a device for proving copy of a document using smart consensus;
Wherein reference numerals are as follows:
110-holder, 120-file storage system, 131, 132-replicator, 140-verifier;
210-a copy proving module, 220-a first writing module, 230-a second writing module, 240-a verifier module;
310-processor, 320-memory, 330-multimedia component, 340-I input/output interface, 350-communication component.
Detailed Description
To make the objects, advantages and features of the present invention more apparent, the present invention provides a method and apparatus for proving copy of a document by smart consensus in use, and a storage medium therefor, as described in further detail below with reference to the accompanying drawings. The following describes specific embodiments of the present invention in detail with reference to the drawings.
It should be understood that the detailed description and specific examples, while indicating and illustrating the invention, are not intended to limit the invention.
It should be noted that the terms "first," "second," and the like in the description and claims herein and in the foregoing figures are used for distinguishing between similar objects and not necessarily for understanding a particular sequence or order.
It is apparent that the method described herein comprises a series of steps, and that the order of the steps presented herein is not necessarily the only order in which the steps may be performed, and that some of the described steps may be omitted and/or some other steps not described herein may be added to the method.
It is further emphasized that the described embodiments are merely some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The embodiment of the invention provides a method for realizing file copy proving by smart consensus in use, which is shown in a figure 2 and comprises the following steps:
S100: and generating a copy code r of the data original text m by using a smart consensus method according to the work load coding unit length L, the data original text m and the node identification id of a replicator.
And S200, submitting the copy code r and the abstract information of the copy code r to a first storage area for storage, wherein the first storage area is a block chain node corresponding to the replicator. Preferably, in one embodiment, the digest information of the replica code r includes a hash of the replica code r.
S300: and submitting the abstract information of the data original text m to a second storage area for storage. Specifically, the summary information of the data original text m includes a hash of the data original text m. In particular, summary information herein is understood as mapping transformation of source data, including but not limited to the result of hash operation, but also the summary (index, extraction, etc.) of the original obtained in other ways, and the description thereof is omitted to avoid repetition.
Preferably, in one implementation mode, the in-use smart consensus realizes a file copy proving method, and the method further comprises the step of distributing a plurality of replicators with different node identification ids for the data original text m. In one embodiment, the method further includes respectively distributing the data original text m to a plurality of replicators, and each replicator repeatedly executes steps S100 and S200 respectively, so as to obtain a plurality of replication codes r with different data original text m. For example, in one embodiment, three replicators are allocated to provide storage service for the data original m, and each of the three replicators has node identifiers id1, id2 and id3, where the node identifiers id1, id2 and id3 are public keys, and are only used as node identifiers of replicators to distinguish replicators from other replicators, and are not used as asymmetric encryption/signature. In this way, the data original m will be allocated to three replicators of the node identification id1, the node identification id2 and the node identification id3, and each replicator will store the respective replication code r and the summary information of the replication code r, and submit the summary information to the respective corresponding first storage area for storage. Further, in one embodiment, the replicator is a resource provider in the blockchain network, either a node of the blockchain or a miner of the blockchain, and the first storage area may be located on the blockchain. The second storage area may be a node of a blockchain, or may be other storage medium. The blockchain network is based on a P2P (Peer to Peer) network, and each P2P network node participating in transaction and block replication (storage), verification and forwarding is a node in the blockchain network, and can be divided into a replication node and a verification node according to the approximate functions of the nodes. It will be apparent that three of the replicators in this embodiment are only used to assist in understanding the invention and do not constitute any limitation of the invention nor its limitation.
Specifically, in one embodiment, as shown in fig. 3, in step S100, the copy code r of the data original m is generated according to the unit length L of the workload code, the data original m, and the node id of the replicator by using the smart consensus method, which includes the following steps,
S110: dividing the data original text m into a plurality of original text sub-data blocks with the length of L, wherein m=m 1||m2||…||mn.
S120: in use, the smart consensus method generates a replica code r i for each of the original text sub-data blocks m i, where r=r 1||r2||…||rn, where 1.ltoreq.i.ltoreq.n.
In particular, in one embodiment, the data field m is preferably represented by a binary system, and the field sub-data block m i is also represented by a binary system. The work load coding unit length L determines the copying difficulty, the value of the work load coding unit length L is L bits, the work load coding unit length L is a positive integer, the calculated amount required by the replicator in the process of generating the copying is determined, and the larger the work load coding unit length L is, the larger the copying difficulty is. The invention iteratively tries the value of the copy code r i for each original text sub-data block m i by the method of the smart consensus and the workload certification, until the data with the length L at the appointed position of the hash value h i is the same as the original text sub-data block m i, wherein the hash value h i is the hash value of the copy code r i and the copy certification parameter, after the copy code r i of each original text sub-data block m i is obtained, i.e. a copy code r of said data original m is generated. In this embodiment, the replication certification parameter includes a node identifier id of the replicator and a location of the original sub-data block m i in the data original m. Obviously, the copy proving parameter can be adjusted according to the actual situation. Preferably, in other embodiments, the duplication proving parameter includes a node identification id of the duplicator and a coding nonce, where the nonce may be a digital value, and the invention is not limited thereto. In particular, for each original sub-data block m i, hash value H i, i.e. H i =h (id+nonce), is calculated using the node identification id and nonce as inputs to the hash function, iterating the nonce (e.g. nonce plus 1 at each attempt) until the data of length L at the specified position in hash value H i is identical to the original sub-data block m i, i.e. m i =h (id+nonce) [ -L: ], iterating the nonce is stopped, the nonce at this time is used as a copy code r i, and the copy code r i of the original text sub-data block m i is obtained. Since m i＝H(id+ri) [ -L: ], and so on, if the replicator holds the replication code r, the data original m can be obtained according to the replication code r. Preferably, adding the location data H (id+i+r i) can avoid the replicator from building a huge reverse hash map to accelerate the replication certification forgery. In particular, during the process of proving the workload by the smart consensus in use, the copy coding can be performed simultaneously. The basic principle is that the workload proves that a difficulty D needs to be set, and iteration is performed until the output value of the hash is smaller than the difficulty D through iteration nonce (1 is added each time). In attempting to find a target that is less than difficulty D, a portion of the output of the hash value (e.g., the least significant L bits) may be utilized for encoding. Once the length of the specified location of the hash of the workload proof nonce is L bits of data equal to m i,, then r i =nonce. Thus, the workload certification (nonce is continually incremented by 1, looking for hash output less than difficulty D) and the copy-code can be performed simultaneously. Because other replicators only copy the coded or original content, other replicators of the content after copy coding cannot save the content, and because the hash function has unidirectionality and is irreversible, the time for calculating the copied content from the original is longer, and the copied content of the replicators only needs to be saved by the replicators. Thus, outsourcing attack and the like of a third party and the behavior occurrence of deception verifiers are effectively resisted.
The smart consensus file copy proving method in use provided by the invention adopts a simple hash algorithm to code selectable difficulties, and is suitable for various hash functions sha1/sha256/md5/blake b and the like; further, the present invention converts the well-known consensus algorithm (Proof of Work/PoW) widely used in bitcoin into a practically useful coding algorithm, so that these algorithms are used on copy Proof codes as a useful coding calculation. In the prior art, a large amount of hardware equipment investment and energy are consumed on a central smart consensus algorithm to acquire return of bitcoin and the like. This practice is widely regarded as a waste of energy resources; still further, in blockchain-based file systems, the nodes are not fully trusted. Replicators in the blockchain that provide storage services can cheat the verifier by outsourcing attacks, generation attacks, witches attacks, and the like, so that the cost is reduced and benefits are obtained. In order to enable replicators to store files in a honest and true manner, the intelligent recognition implementation file replication proving method in use provided by the invention converts the original text content of the data file into a unique replication coding form of each replication storage node for storage, and can effectively resist fraud attack of the replicators; furthermore, the intelligent consensus file copy proving method in use provided by the invention has the advantages that if a replicator loses a result after copy coding, copy is generated from an original text again, the cost is high, so that the replicator can store the content after copy coding in a honest way, and the content is not cheated and fraudulent; furthermore, the method for realizing file copy proving by intelligent consensus in use can be used in the fields of file storage based on block chains, multi-party cooperation data storage verification without trust basis, cooperation and the like.
Further, after the copy code r of the data original m is generated by the replicator, the verifier may ask the replicator randomly to request to provide the copy-encoded content of the designated location of the data original m. If the replicator can provide corresponding replication coded content, the replication certification verification is passed; otherwise, the copy certification verification fails.
In one embodiment, a method for verifying copy certification is provided, a verifier initiates a challenge to a replicator, inputs corresponding index information and randomly selected original text segments, acquires a copy segment corresponding to the original text segment returned by the replicator, decodes the copy segment by the verifier to obtain a decoded copy segment corresponding to the original text segment, and then compares whether the original text segment and the decoded copy segment are consistent, if so, the copy certification verification is passed, and the replicator is trusted; if not, the copy certification verification fails. The method for verifying copy proof can randomly designate the original text segments at any positions to verify the method for verifying copy proof of the file by smart consensus in use, but the verification method has the defects of large traffic, less challenge combination and only one segment at a time.
In one exemplary embodiment of the present invention, another method for verifying copy proving is provided, which is used for verifying the method for implementing file copy proving by smart consensus in use provided by the foregoing embodiment, and includes the following steps:
S410: and initiating a challenge to a replicator by using challenge data, wherein the challenge data comprises a data combination consisting of random positions and random lengths corresponding to the plurality of original text fragments. Particularly, the random positions and the random lengths corresponding to the original text segments can be the positions and the lengths of the original text segments in the data original text; the position and the length of the copy segment corresponding to the original text segment in the copy data can also be adopted. For ease of understanding, the description below will be given by taking as an example the random positions and random lengths of the pieces of the original document in the data original document. In one embodiment, a number of the random positions are random number sequences generated as discrete logarithms. The random length may be k (kilo) bits. The random position may be a start position or an end position of the original text segment, and is preferably a start position. Preferably, the starting position of each original text segment is a random position, and the length of each original text segment is a random length, namely: several pieces of text for the challenge are randomly chosen.
Further, the challenge data may further include random data prefixed to or spaced apart from the data combination. The random data is added, so that cheating actions of replicators can be fundamentally avoided under the condition that the traffic is increased limitedly.
Optionally, the selecting method of the plurality of original text segments at least includes one of the following three modes. In one embodiment, the aggregate of the plurality of original text segments is a subset of the data original text, for example, for the data original text abc, taking a randomly selected original text segment b as an example, a position of b in the data original text abc is 2 (taking 1 as a start bit), a length of b is 1, and a position corresponding to b in the data original text abc and a length of b are used to challenge a replicator. In another embodiment, the plurality of original text segments are composed of a plurality of first original text segments and a plurality of second original text segments Wen Pianduan, wherein the first original text segments are randomly selected and the second original text segments are complements of the first original text segments. Still taking the data original text abc as an example, the randomly selected original text segment b is the first subset, then the complementary sets a and c of b are the second subset of the original text segments, and thus the three original text segments b, a and c are used for initiating challenges to replicators. Similarly, if a is taken as the first subset of the randomly selected original text segments, the complement bc of a is taken as the second subset of the original text segments. In yet another embodiment, the plurality of original text segments includes a plurality of randomly selected original text segments and the entire text of the data original. Similarly, taking the data original text abc as an example, b is an original text segment selected from the data, and then the full text abc of the data original text is used as the original text segment to initiate challenges to a replicator. Thus, if there are data originals of length 1024, if the random challenge uses two originals as challenges, there are 1024 x 1023 combinations, there are 1024 x 1023 x 1022 combinations using three bits, and so on. Therefore, compared with the first implementation mode, the latter two methods for selecting the original text segment can fully cover the data original text when the replicator is challenged, and can be quite safe under the condition of limited traffic increase, thereby well avoiding cheating actions of the replicator.
S420: and according to the copy segment corresponding to the challenge data, the replicator calculates a first hash and returns the first hash to the verifier.
S430: and the verifier acquires the copy content, calculates a second hash according to the challenge data, compares whether the first hash and the second hash are the same, verifies that the copy certification passes if the first hash and the second hash are the same, and verifies that the copy certification fails if the first hash and the second hash are not the same.
Compared with the verification method of the previous implementation method, the verification method for verifying the file copy proving method implemented by the smart co-knowledge in use provided in this embodiment, because in step S410, only the positions of a plurality of original text segments and the lengths of the original text segments need to be sent to the replicator, and the original text segments need not to be sent, in step S420, only the hashes of the replication segments need to be sent, and the traffic is small; moreover, a plurality of original text fragments and even all data originals can be verified at one time, particularly random data are added, the challenge combination is more, more random-position original text fragments can be verified, the efficiency is higher, and the cheating behavior of a replicator is better avoided.
Based on the same inventive concept, a further embodiment of the present invention provides a device for proving copy of a document with a smart consensus in use, where the term "unit" or "module" is used below as a combination of software and/or hardware that can implement a predetermined function. While the means described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
Fig. 4 is a block diagram of a device for proving copy of a file in use by implementing smart co-recognition according to an embodiment of the present invention, including a copy proving module 210, a first writing module 220 and a second writing module 230, where the copy proving module 210 is configured to generate a copy code r of a data original m according to a unit length L of a workload code, the data original m, and a node identifier id of a replicator, by using the smart co-recognition method; a first writing module 210 configured to submit the copy code r and summary information of the copy code r to a first storage area for storage, where the first storage area includes a storage node corresponding to the replicator; a second writing module 230 is configured to submit the summary information of the data original m to the second storage area for saving.
Preferably, in another embodiment, the provision of the in-use smart consensus implementation document duplication certification device further comprises a verifier module 240, the verifier module 240 being configured to initiate a challenge to the replicator to verify the duplication certification.
Regarding the in-use smart co-realization file copy proving apparatus in the above-described embodiments, for implementing the in-use smart co-realization file copy proving method, since the principle of the in-use smart co-realization file copy proving apparatus to solve the problem is similar to the in-use smart co-realization file copy proving method, the implementation of the in-use smart co-realization file copy proving apparatus may refer to the implementation of the in-use smart co-realization file copy proving method, and the specific manner in which each module performs the operation has been described in detail in the embodiments related to the method, which will not be explained in detail herein.
The device for proving the copy of the in-use intelligent common realization file has the same beneficial effects as the method for proving the copy of the in-use intelligent common realization file when the device for proving the copy of the in-use intelligent common realization file is implemented, and is not repeated herein.
In addition, the division of the file copy proving device component modules is only one logic function division in the use process, and other division modes can be adopted in actual implementation. Moreover, the physical implementation of each module may also have a plurality of manners, which the present invention is not limited to.
Fig. 5 is a block diagram illustrating a configuration of a smart consensus implementation document copy certification device in use according to an embodiment of the present invention. As shown in fig. 5, the present smart consensus implementation document copy proving apparatus in use described in the present embodiment includes: a processor 310 and a memory 320, said processor 310 being adapted to implement instructions, said memory 320 being adapted to store instructions adapted to be loaded by the processor 310 and to perform the in-use smart consensus implementation of the file copy certification method described in any of the embodiments above. Preferably, the in-use smart consensus implementation document copy proving device provided in this embodiment may further include one or more of a multimedia component 330, an input/output interface 340, and a communication component 350, where the input/output interface is an I/O interface.
In particular, the processor 310 is configured to control the overall operation of the in-use smart co-implemented document copy certification device to perform all or part of the steps in the in-use smart co-implemented document copy certification method described above. The memory 320 is used to store various types of data to support the operation of the smart co-implemented document copy certification device in use, which may include, for example, instructions for any application or method operating on the smart co-implemented document copy certification device in use, as well as application-related data, such as contact data, messages, pictures, audio, video, and the like. The Memory 320 may be implemented by any type or combination of volatile or non-volatile Memory devices, such as static random access Memory (Static Random Access Memory, SRAM), electrically erasable programmable Read-Only Memory (ELECTRICALLY ERASABLE PROGRAMMABLE READ-Only Memory, EEPROM), erasable programmable Read-Only Memory (Erasable Programmable Read-Only Memory, EPROM), programmable Read-Only Memory (Programmable Read-Only Memory, PROM), read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk, or optical disk. The multimedia component 330 may include a screen and an audio component. Wherein the screen may be, for example, a touch screen, the audio component being for outputting and/or inputting audio signals. For example, the audio component may include a microphone for receiving external audio signals. The received audio signals may be further stored in the memory 320 or transmitted through the communication component 350. Preferably, the audio assembly further comprises at least one speaker for outputting audio signals. The input/output interface 340 provides an interface between the processor 310 and other interface modules, which may be a keyboard, mouse, buttons, etc. These buttons may be virtual buttons or physical buttons. The communication component 350 is configured to perform wired or wireless communication between the in-use smart consensus implementation document copy proving device and other devices. Wherein the wireless communication includes, but is not limited to: such as Wi-Fi, bluetooth, near field Communication (NFC for short), 2G, 3G or 4G, or a combination of one or more thereof, so that the respective Communication component 350 may comprise: wi-Fi module, bluetooth module, NFC module.
Further, preferably, in an exemplary embodiment, the in-use smart implementation document copy proving apparatus may be implemented by one or more Application specific integrated circuits (Application SPECIFIC INTEGRATED circuits, abbreviated as ASICs), digital signal processors (DIGITALSIGNAL PROCESSOR, abbreviated as DSPs), digital signal processing devices (DIGITAL SIGNAL Processing Device, abbreviated as DSPDs), programmable logic devices (Programmable Logic Device, abbreviated as PLDs), field programmable gate arrays (Field Programmable GATE ARRAY, abbreviated as FPGAs), controllers, microcontrollers, microprocessors, or other electronic components for performing the in-use smart implementation document copy proving method described above.
The in-use intelligent consensus realization file copy proving device has the same beneficial effects as the in-use intelligent realization file copy proving method when executing the in-use intelligent consensus realization file copy proving method, and is not repeated herein.
In another exemplary embodiment, there is also provided a computer readable storage medium having stored thereon computer executable instructions that when executed implement the steps of implementing a file copy proving method as described above with the smart consensus in use, the specific steps having been described in detail above and not repeated herein. For example, the computer readable storage medium may be the memory 320 including program instructions executable by the processor 310 of the in-use smart co-implemented document copy certification device to perform the in-use smart co-implemented document copy certification method.
When the computer executable instructions on the computer readable storage medium provided by the invention are executed to realize the method for realizing file copy proving by the intelligent consensus in use, the method has the same beneficial effects as the method for realizing file copy proving by the intelligent consensus in use, and the description is omitted here.
The preferred embodiments of the present invention have been described in detail above with reference to the accompanying drawings, but the present invention is not limited to the specific details of the above embodiments, and various simple modifications can be made to the technical solution of the present invention within the scope of the technical concept of the present invention, and all the simple modifications belong to the protection scope of the present invention.
In addition, the specific features described in the above embodiments may be combined in any suitable manner without contradiction. The various possible combinations of the invention are not described in detail in order to avoid unnecessary repetition.
Moreover, any combination of the various embodiments of the invention can be made without departing from the spirit of the invention, which should also be considered as disclosed herein.
From the description of the implementations above, those skilled in the art will appreciate that embodiments of the invention may be provided as a method, system, or computer program product. Thus, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects but in many cases the former is a preferred embodiment. Based on such understanding, the portions of the technical solutions of the present invention that contribute to the prior art can be embodied in the form of a computer software product stored on a computer readable storage medium, including but not limited to disk storage, CD-ROM, optical storage, etc.
The present invention is described in terms of 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 flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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.
The above description is only of a preferred embodiment of a method, apparatus and storage medium for implementing document copy certification for smart co-ordination in use provided by the present invention, and the present invention includes, but is not limited to, the configurations set forth in the above implementations. Various modifications and variations of the embodiments of the invention will be apparent to those skilled in the art in light of the foregoing description. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention are included in the protection scope of the present invention.
Claims (8)
1. A method for realizing file copy proving by intelligent consensus in use is characterized by comprising the following steps of,
S100: generating a copy code r of the data original text m by using a smart consensus method according to the unit length L of the workload code, the data original text m and the node identification id of a replicator;
s200, submitting the abstract information of the copy code r to a first storage area corresponding to the replicator for storage;
S300: submitting the abstract information of the data original text m to a second storage area for storage;
The step S100 specifically includes: s110: dividing the data original text m into a plurality of original text sub-data blocks m i,m＝m1||m2||…||mn with the length of L;
S120: generating a copy code r i of each original text sub-data block m i by using the intelligent consensus method, wherein the copy code r=r 1||r2||…||rn, and i is more than or equal to 1 and less than or equal to n;
In step S120, the in-use smart consensus method generates a replica code r i for each of the original sub-data blocks m i, including,
Iteratively trying the value of the copy code r i until the data with the length L at the specified position of the hash value h i is identical to the original text sub-data block m i, wherein the hash value h i is the hash value of the copy code r i and a copy proving parameter, and the copy proving parameter includes the node identification id of the replicator and the position of the original text sub-data block m i in the data original text m.
2. The method for proving file replication by intelligent consensus in use according to claim 1 further comprising assigning a plurality of replicators with different node identification ids to the data original m, assigning the data original m to the plurality of replicators respectively, and each of the replicators repeatedly executing steps S100, S200.
3. The in-use smart co-recognition implementation document duplication proof method of claim 1 further comprising a verification duplication proof method including the steps of,
S410: initiating a challenge to a replicator by using challenge data, wherein the challenge data comprises a data combination consisting of random positions and random lengths corresponding to a plurality of original text fragments;
S420: according to the copy segment corresponding to the challenge data, the replicator calculates to obtain a first hash and returns the first hash to the verifier;
S430: and the verifier acquires the copy content, calculates a second hash according to the challenge data, compares whether the first hash and the second hash are the same, verifies that the copy certification is successful if the first hash and the second hash are the same, and verifies that the copy certification is failed if the first hash and the second hash are not the same.
4. A method of proving file replication in use by smart co-recognition according to claim 3, wherein in step S410, the challenge data further comprises random data prefixed to or spaced apart from the data combination.
5. A method of implementing proof of copy documents as claimed in claim 3, wherein in step S420, said returning to the verifier comprises said replicator writing said first hash to the blockchain.
6. The device for realizing file copy proving through intelligent consensus in use is characterized by comprising a copy proving module, a first writing module and a second writing module, wherein,
The copy proving module is configured to generate a copy code r of the data original text m according to the workload coding unit length L, the data original text m and the node identification id of a replicator by using a smart consensus method;
the method for generating the copy code r of the data original text m by using the smart consensus method according to the work load coding unit length L, the data original text m and the node identification id of a replicator comprises the following steps:
Dividing the data original text m into a plurality of original text sub-data blocks m i,m＝m1||m2||…||mn with the length of L;
Generating a copy code r i of each original text sub-data block m i by using the intelligent consensus method, wherein the copy code r=r 1||r2||…||rn, and i is more than or equal to 1 and less than or equal to n;
The in-use smart consensus method generates a replica code r i for each of the original text sub-data blocks m i, comprising:
Iteratively trying the value of the copy code r i until the data with the length L at the designated position of the hash value h i is identical to the original text sub-data block m i, wherein the hash value h i is the hash value of the copy code r i and a copy proving parameter, and the copy proving parameter comprises the node identification id of the replicator and the position of the original text sub-data block m i in the data original text m;
the first writing module is configured to submit the copy code r and the summary information of the copy code r to a first storage area corresponding to the replicator for storage;
the second writing module is configured to submit the abstract information of the data original text m to a second storage area for storage.
7. An in-use smart co-recognition enabled document duplication proving device of claim 6 further comprising a verifier module configured to initiate a challenge to the replicator to verify duplication proving.
8. An in-use smart co-implemented document copy certification device comprising a processor adapted to implement instructions and a memory adapted to store instructions adapted to be loaded by the processor and to perform the in-use smart co-implemented document copy certification method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010292127.0A CN113542317B (en) | 2020-04-14 | 2020-04-14 | Method, equipment and storage medium for realizing file copy certification by intelligent consensus in use |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010292127.0A CN113542317B (en) | 2020-04-14 | 2020-04-14 | Method, equipment and storage medium for realizing file copy certification by intelligent consensus in use |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113542317A CN113542317A (en) | 2021-10-22 |
| CN113542317B true CN113542317B (en) | 2024-05-28 |
Family
ID=78119985
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010292127.0A Active CN113542317B (en) | 2020-04-14 | 2020-04-14 | Method, equipment and storage medium for realizing file copy certification by intelligent consensus in use |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113542317B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106339473A (en) * | 2016-08-29 | 2017-01-18 | 北京百度网讯科技有限公司 | Method and device for copying file |
| CN108647523A (en) * | 2018-04-28 | 2018-10-12 | 华南理工大学 | A kind of electronic identification system based on block chain and deposit card, file access pattern method |
| CN109189727A (en) * | 2018-09-14 | 2019-01-11 | 江西理工大学 | A kind of block chain ciphertext cloud storage sharing method based on property broker re-encryption |
| CN109194708A (en) * | 2018-07-24 | 2019-01-11 | 哈尔滨工程大学 | A kind of distributed memory system and its identity identifying method based on block chain technology |
| CN109284625A (en) * | 2018-09-03 | 2019-01-29 | 佛山科学技术学院 | A kind of Data Access Security method and device based on block chain |
| CN109284624A (en) * | 2018-09-03 | 2019-01-29 | 佛山科学技术学院 | A kind of data safety partition method and device based on the storage of block chain |
| WO2019140464A1 (en) * | 2018-01-15 | 2019-07-18 | Cooner Jason Ryan | Internet of things devices for use with an encryption service |
| WO2019170814A1 (en) * | 2018-03-07 | 2019-09-12 | The MaidSafe Foundation | Data transaction system and method |
| CN110832825A (en) * | 2017-05-22 | 2020-02-21 | 维萨国际服务协会 | Network for increasing verification speed by preventing data from being tampered |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9471586B2 (en) * | 2013-01-10 | 2016-10-18 | International Business Machines Corporation | Intelligent selection of replication node for file data blocks in GPFS-SNC |
| US11146380B2 (en) * | 2017-08-03 | 2021-10-12 | Parity Technologies Ltd. | Methods and systems for a heterogeneous multi-chain framework |
| US10897499B2 (en) * | 2018-04-24 | 2021-01-19 | International Business Machines Corporation | Resolving status and synchronization discrepancies in a distributed computing environment using blockchains |
| US20190370793A1 (en) * | 2018-06-04 | 2019-12-05 | Decentralized Finance Labs, Inc. | Hybrid consensus for blockchain using proof of work and proof of stake |
-
2020
- 2020-04-14 CN CN202010292127.0A patent/CN113542317B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106339473A (en) * | 2016-08-29 | 2017-01-18 | 北京百度网讯科技有限公司 | Method and device for copying file |
| CN110832825A (en) * | 2017-05-22 | 2020-02-21 | 维萨国际服务协会 | Network for increasing verification speed by preventing data from being tampered |
| WO2019140464A1 (en) * | 2018-01-15 | 2019-07-18 | Cooner Jason Ryan | Internet of things devices for use with an encryption service |
| WO2019170814A1 (en) * | 2018-03-07 | 2019-09-12 | The MaidSafe Foundation | Data transaction system and method |
| CN108647523A (en) * | 2018-04-28 | 2018-10-12 | 华南理工大学 | A kind of electronic identification system based on block chain and deposit card, file access pattern method |
| CN109194708A (en) * | 2018-07-24 | 2019-01-11 | 哈尔滨工程大学 | A kind of distributed memory system and its identity identifying method based on block chain technology |
| CN109284625A (en) * | 2018-09-03 | 2019-01-29 | 佛山科学技术学院 | A kind of Data Access Security method and device based on block chain |
| CN109284624A (en) * | 2018-09-03 | 2019-01-29 | 佛山科学技术学院 | A kind of data safety partition method and device based on the storage of block chain |
| CN109189727A (en) * | 2018-09-14 | 2019-01-11 | 江西理工大学 | A kind of block chain ciphertext cloud storage sharing method based on property broker re-encryption |
Non-Patent Citations (4)
| Title |
|---|
| Tengfei Xue ; Yuyu Yuan ; Zahir Ahmed ; Krishna Moniz ; Ganyuan Cao ; Cong Wang.Proof of Contribution: A Modification of Proof of Work to Increase Mining Efficiency. 2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC).2018,636-644. * |
| Xu Hao ; Long Yu ; Liu Zhiqiang ; Liu Zhen ; Gu Dawu.Dynamic Practical Byzantine Fault Tolerance.2018 IEEE Conference on Communications and Network Security (CNS).2018,1-8. * |
| 一个高传输效率的多值拜占庭共识方案;郭兵勇;李新宇;;密码学报(05);66-78 * |
| 带有主动恢复的拜占庭容错算法在区块链中的应用;赵振龙;硕士电子期刊;20190115;第二-四章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113542317A (en) | 2021-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US12047510B2 (en) | Quantumproof blockchain | |
| JP7472338B2 (en) | Pseudorandom number generation in blockchain | |
| Sriman et al. | Blockchain technology: Consensus protocol proof of work and proof of stake | |
| CN108885741B (en) | Tokenization method and system for realizing exchange on block chain | |
| EP3449452B1 (en) | Implementing logic gate functionality using a blockchain | |
| CN110915166A (en) | Block chain | |
| CN112968884B (en) | Block chain heterogeneous consensus method and terminal for preventing hacker attack | |
| CN110709874A (en) | Voucher generation and distribution method and system for block chain network | |
| CN112219371A (en) | Bidirectional block chain | |
| CN110149323B (en) | Processing device with ten-million-level TPS (platform secure protocol) contract processing capacity | |
| CN115211073A (en) | Public key generation method | |
| WO2023072965A1 (en) | Methods and systems for distributed blockchain functionalities | |
| Tin et al. | Provably secure key exchange: an engineering approach | |
| CN109274674B (en) | Block chain heterogeneous consensus method with high security and terminal | |
| CN113542317B (en) | Method, equipment and storage medium for realizing file copy certification by intelligent consensus in use | |
| Endignoux | Design and implementation of a post-quantum hash-based cryptographic signature scheme | |
| CN118176694A (en) | Method and system for distributed blockchain functionality | |
| CN118216121A (en) | Method and system for distributed blockchain functionality | |
| Li et al. | A noninteractive multireplica provable data possession scheme based on smart contract | |
| Algazy et al. | Syrga2: Post-Quantum Hash-Based Signature Scheme | |
| CN118202622A (en) | Method and system for distributed blockchain functionality | |
| EP4360032A1 (en) | Systems and methods for transaction validation in layer 2 | |
| Yang et al. | HB+‐MHT: Lightweight and Efficient Data Integrity Verification Scheme for Cloud Virtual Machines | |
| Lei et al. | Enhancing Editability in Permissionless Blockchain: A Three-Chain Model for Efficiency and Ledger Consistency | |
| WO2023156099A1 (en) | Identity-linked blockchain addresses |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |