CN111984614B - Method, device and system for sharing files - Google Patents
Method, device and system for sharing files Download PDFInfo
- Publication number
- CN111984614B CN111984614B CN202010772434.9A CN202010772434A CN111984614B CN 111984614 B CN111984614 B CN 111984614B CN 202010772434 A CN202010772434 A CN 202010772434A CN 111984614 B CN111984614 B CN 111984614B
- Authority
- CN
- China
- Prior art keywords
- hash value
- file
- current
- acquiring
- file compression
- 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 73
- 230000006835 compression Effects 0.000 claims abstract description 176
- 238000007906 compression Methods 0.000 claims abstract description 174
- 239000004973 liquid crystal related substance Substances 0.000 claims description 13
- 238000004590 computer program Methods 0.000 claims description 10
- 230000006837 decompression Effects 0.000 claims description 3
- 239000000758 substrate Substances 0.000 claims 3
- 239000000523 sample Substances 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 13
- 230000008569 process Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000013307 optical fiber Substances 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/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/176—Support for shared access to files; File sharing support
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/174—Redundancy elimination performed by the file system
- G06F16/1744—Redundancy elimination performed by the file system using compression, e.g. sparse files
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention discloses a method, a device and a system for sharing files, and relates to the technical field of computers. One embodiment of the method comprises the following steps: acquiring a file to be shared, forming a file compression packet, executing a blockchain uplink operation on the file compression packet, acquiring corresponding first hash values, selecting a set number of first hash values for uplink, and acquiring a current hash value; and circulating until the root hash value is obtained, and storing the current hash value of each level in a set number of bifurcation tree structures. Traversing hash values of the bifurcation tree structure nodes based on the root hash values to obtain shared files in the file compression package; by adopting the method that a plurality of files are compressed into file compression packages, the technical problem of overhigh network resource burden caused by large number of files is partially overcome, and the efficiency of file chaining and sharing is improved by concurrently chaining the file compression packages; and storing and sharing the root hash value by utilizing the bifurcation tree structure, and acquiring the shared file through the root hash value, thereby improving the safety of the file.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method, an apparatus, and a system for sharing files.
Background
In the business process of enterprises, files needed by the business are needed to be shared, particularly the business between enterprises is related, with the development of blockchain technology, the enterprises can share files based on blockchains, and the adopted method mainly comprises the following steps: 1. and 2, storing the files in a centralized database, and uploading and broadcasting electronic certificates of the files to realize sharing.
In the process of implementing the present invention, the inventor finds that at least the following problems exist in the prior art:
when the number of the files is large, the method of the method 1 is utilized, so that the utilization rate of network resources is too high, and the efficiency of file uplink is reduced; in the method 2, a centralized database is used for storing the file, and when the file is a file with higher security, a certain security risk exists.
Disclosure of Invention
In view of this, an embodiment of the present invention provides a method and an apparatus for sharing a file, which can obtain a file to be shared, form a file compression packet, execute a blockchain chaining operation on the file compression packet and obtain a corresponding first hash value, select a set number of first hash values to be chained and obtain a current hash value; and circulating until the root hash value is obtained, and storing the current hash value of each level in a set number of bifurcation tree structures. Traversing hash values of the bifurcation tree structure nodes based on the root hash values to obtain shared files in the file compression package; by adopting the method that a plurality of files are compressed into file compression packages, the technical problem of overhigh network resource burden caused by large number of files is partially overcome, and the efficiency of file chaining and sharing is improved by concurrently chaining the file compression packages; and storing and sharing the root hash value by utilizing the bifurcation tree structure, and acquiring the shared file through the root hash value, thereby improving the safety of the file.
To achieve the above object, according to a first aspect of an embodiment of the present invention, there is provided a method for sharing a file, including: acquiring files to be shared to form a plurality of file compression packages; executing a blockchain uplink operation on the file compression packet, and acquiring at least three first hash values corresponding to the file compression packet from a blockchain; taking the first hash value as a current hash value, and circularly executing the following operations until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2; and taking the current hash value as a root hash value and sending the hash value.
Optionally, the method for sharing files is characterized in that,
obtaining a file to be shared to form a plurality of file compression packages, including:
and acquiring files to be shared in a predefined time range, forming at least three file packages, and determining the number of files in the file packages according to the network bandwidth.
Optionally, the method for sharing files is characterized in that,
and respectively executing compression and encryption operation on the file package to form the file compression package.
Optionally, the method for sharing files is characterized in that,
and executing the concurrent block chain uplink operation on the file compression package.
To achieve the above object, according to a second aspect of an embodiment of the present invention, there is provided a method for sharing a file, including: receiving a current hash value; the following steps are circularly executed until a file compression packet corresponding to the current hash value is obtained; determining that a file compression packet hash value which is the same as the current hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the blockchain; a2: and determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value.
Optionally, the method for sharing files is characterized in that,
the file compression packet corresponding to the current hash value is obtained, which comprises the following steps:
and acquiring a file compression package corresponding to the current hash value, decompressing and decrypting the file compression package, and acquiring a file in the file compression package.
In order to achieve the above object, according to a third aspect of the embodiments of the present invention, there is provided an apparatus for sharing a file, including: the device comprises a file compression packet uplink module, a node hash value acquisition module and a root hash value acquisition module; wherein, the liquid crystal display device comprises a liquid crystal display device,
the file compression package uplink module is used for acquiring files to be shared to form a plurality of file compression packages; executing a blockchain uplink operation on the file compression packet, and acquiring at least three first hash values corresponding to the file compression packet from a blockchain;
the upper-level hash value obtaining module is configured to take the first hash value as a current hash value, and circularly execute the following operations until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2;
The root hash value obtaining module is configured to take the current hash value as a root hash value, and send the hash value.
Optionally, the device for sharing files is characterized in that,
obtaining a file to be shared to form a plurality of file compression packages, including:
and acquiring files to be shared in a predefined time range, forming at least three file packages, and determining the number of files in the file packages according to the network bandwidth.
Optionally, the device for sharing files is characterized in that,
and respectively executing compression and encryption operation on the file package to form the file compression package.
Optionally, the device for sharing files is characterized in that,
and executing the concurrent block chain uplink operation on the file compression package.
In order to achieve the above object, according to a fourth aspect of the embodiments of the present invention, there is further provided an apparatus for sharing a file, including: acquiring an on-chain file module; wherein, the liquid crystal display device comprises a liquid crystal display device,
the file module on the acquisition chain is used for receiving the current hash value; the following steps are circularly executed until a file compression packet corresponding to the current hash value is obtained; determining that a file compression packet hash value which is the same as the current hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the blockchain; a2: and determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value.
Optionally, the device for sharing files is characterized in that,
the file compression packet corresponding to the current hash value is obtained, which comprises the following steps:
and acquiring a file compression package corresponding to the current hash value, decompressing and decrypting the file compression package, and acquiring a file in the file compression package.
To achieve the above object, according to a fifth aspect of an embodiment of the present invention, there is provided a system 900 for sharing files, including an apparatus 700 for sharing files provided in the above third aspect, and an apparatus 800 for sharing files provided in the above fourth aspect;
in order to achieve the above object, according to a sixth aspect of an embodiment of the present invention, there is provided an electronic device for sharing a file, including: one or more processors; and a storage means for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to implement the method as described in any of the methods of sharing files described above.
To achieve the above object, according to a seventh aspect of the embodiments of the present invention, there is provided a computer-readable medium having stored thereon a computer program, characterized in that the program, when executed by a processor, implements a method as any one of the above-described methods of sharing files.
One embodiment of the above invention has the following advantages or benefits: acquiring a file to be shared, forming a file compression packet, executing a blockchain uplink operation on the file compression packet, acquiring corresponding first hash values, selecting a set number of first hash values for uplink, and acquiring a current hash value; and circulating until the root hash value is obtained, and storing the current hash value of each level in a set number of bifurcation tree structures. Traversing hash values of the bifurcation tree structure nodes based on the root hash values to obtain shared files in the file compression package; by adopting the method that a plurality of files are compressed into file compression packages, the technical problem of overhigh network resource burden caused by large number of files is partially overcome, and the efficiency of file chaining and sharing is improved by concurrently chaining the file compression packages; and storing and sharing the root hash value by utilizing the bifurcation tree structure, and acquiring the shared file through the root hash value, thereby improving the safety of the file.
Further effects of the above-described non-conventional alternatives are described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a flow chart of a method for storing shared files according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for obtaining a shared file according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of storing shared file hash values using a multi-way tree structure according to one embodiment of the present invention;
FIG. 4 is a flowchart of a method for obtaining a shared file according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of storing shared file hash values using a multi-way tree structure according to one embodiment of the present invention;
FIG. 6 is a flow chart of a shared file according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of an apparatus for sharing files according to an embodiment of the present invention;
FIG. 8 is a schematic diagram of an apparatus for acquiring a shared file according to an embodiment of the present invention;
FIG. 9 is a schematic diagram of a system for obtaining a shared file according to an embodiment of the present invention;
FIG. 10 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;
fig. 11 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
As shown in fig. 1, an embodiment of the present invention provides a method for storing a shared file, which may include the following steps:
step S101: acquiring files to be shared to form a plurality of file compression packages; and executing the block chain uplink operation on the file compression packet, and acquiring at least three first hash values corresponding to the file compression packet from a block chain.
Specifically, the file to be shared may be a transaction file generated by an electronic bank, a statement file generated by an electronic bank, an order file generated by an electronic mall, etc.; the invention does not limit the format and the content of the file with sharing; further, acquiring the file to be shared to form a plurality of file compression packages, including: and acquiring files to be shared in a predefined time range, forming at least three file packages, and determining the number of files in the file packages according to the network bandwidth.
Specifically, one embodiment of the present invention is based on hash values corresponding to a plurality of file compression packets, and a hash value structure of a multi-way tree is formed by circulating through each level of hash values to uplink and obtain a hash value of a next level, wherein the number of branches of the multi-way tree is at least 3, that is, the set number is an integer greater than 2; namely, at least three first hash values corresponding to the file compression packet are obtained from a blockchain; it will be appreciated that the number of file compression packages may be based on the number of shared files received within a time frame, i.e. the files to be shared generated within a predefined time frame, for example, transaction files generated by an electronic bank within an hour, statement files generated by two electronic banks within an hour, order files generated by an electronic mall within a day, etc., are obtained, where the predefined time frame may be set according to the scenario of the service and the number of files generated, for example, one day, one hour, one minute, etc.; the invention is not limited to the specific content of the predefined time range.
Further, acquiring files to be shared, for example, acquiring files to be shared in a predefined time range, forming at least three file packages, determining the number of files in each file package according to network bandwidth, and forming at least three file compression packages respectively; the method comprises the steps of obtaining the number of files generated in the predefined time range, combining the factors such as the bandwidth of a network, dividing the files to form a plurality of file packages, and respectively compressing the file packages to form file compression packages; the number of the files contained in the file package is set according to the size of the files, so that the number of the file packages is variable, the number of the files contained in each file package is determined by acquiring the bandwidth of a network according to the total amount in a time range, and further, the file packages are compressed to form a plurality of file compression packages;
And respectively executing compression and encryption operation on the file package to form the file compression package. The method for encrypting the files comprises the steps of forming at least three file compression packages, and further comprises the steps of executing compression operation and encryption operation, wherein the security of the files is improved through encryption, particularly the security of the files with high security requirements, such as statements among electronic banks, is improved, and the encryption method can be used for encrypting compression software, such as gzip, winRAR and the like; the encryption method can use the compression software to encrypt, and can also use the operating system or the encryption software to encrypt, and the specific method used for compression and the specific method used for encryption are not limited by the invention.
Still further, performing a blockchain concurrent chaining operation on each file compression package, wherein the concurrent chaining operation of the file compression packages is performed because each file compression package does not have a transaction-dependent relationship; that is, a blockchain concurrent chaining operation is performed on the file compression package. It can be understood that, due to the limitation of resources such as bandwidth of a network, the uplink operation of a plurality of file compression packages can be performed in batches, and the concurrent uplink operation is performed by the file compression packages in each batch, so that the efficiency of the file uplink is improved through the simultaneous uplink operation; further, performing blockchain uplink operation on the at least three file compression packets, and acquiring at least three first hash values corresponding to the at least three file compression packets respectively; the method comprises the steps that file compression packets can be used as transactions to execute blockchain uplink operation respectively, hash values returned for the transactions are obtained from blockchains respectively, and the hash values are first hash values corresponding to the file compression packets; the blockchain used may be a federation chain, a private chain, etc., and the invention is not limited to the type of blockchain. The particular tools or methods used to perform blockchain upward links are not limited by the present invention.
Step S102: taking the first hash value as a current hash value, and circularly executing the following operations until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2.
Specifically, according to the first hash value corresponding to each file compression packet formed in step S101, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from the blockchain; specifically, the intermediate hash value may be generated by combining the set number of current hash values based on the selected set number of current hash values, or may be generated by calculating the set number of current hash values. Further, the intermediate hash value may be used as a transaction to perform a blockchain up-link operation, and a second hash value returned for the transaction may be obtained from the blockchain, respectively; and circulating the step to obtain second hash values of all the levels. The set number is an integer greater than 2, for example, 3, 4, 10, 100, 1000, where the set number is used to set the number of branches of the multi-tree structure, and the set number may be determined according to the service scenario or the number of file compression packets, and the specific numerical value of the set number is not limited in the present invention.
In the circulation process, the first hash value and the second hash value are used as current hash values; it will be appreciated that, according to the above description, hash values of each level are obtained through a loop until a unique root hash value is obtained (i.e., until the number of the current hash values is 1), and a blockchain is performed on the first hash value and the second hash value (the current hash value) respectively, so as to form a hash value storage structure of a multi-tree (a set number of bifurcation trees). By the method, the complexity of acquiring the file is improved, and therefore the safety of the file is improved.
The following is illustrative, for example: the number of the file compression packet hash values is 99, and 99 first hash values are correspondingly formed; setting the number to be 5; the first hash value is taken as a current hash value, and the following operations are circularly executed until the number of the current hash values is 1: that is, the following operations are circularly performed with 99 first hash values as current hash values: respectively selecting a set number (for example, 5) of current hash values from 99 hash values, generating an intermediate hash value based on the selected set number (for example, 5) of current hash values, executing a blockchain uplink operation on the intermediate hash value, executing a blockchain uplink operation, and acquiring a corresponding second hash value from a blockchain; it can be understood that, the 99 first hash values are respectively selected to be 5 current hash values, an intermediate hash value is generated according to the selected 5 hash values, a blockchain uplink operation is performed on the intermediate hash value, corresponding second hash values are obtained from a blockchain, and through the operation, 19 second hash values can be obtained; further, obtaining 19 second hash values based on 95 (19×5) pairs of hash values of the 99 first hash values, it can be understood that, because the set number is 5, and the number of the current hash values which are not selected is also 4 and are not selected is smaller than the set number (for example: 5), generating an intermediate hash value based on the 4 first hash values, performing a blockchain uplink operation on the intermediate hash value, and obtaining a corresponding second hash value from the blockchain; that is, when there is the current hash value that is not selected and the number of the current hash values that is not selected is smaller than the set number, an intermediate hash value is generated based on the current hash value that is not selected, a blockchain chaining operation is performed on the intermediate hash value, and a corresponding second hash value is acquired from a blockchain.
Based on the above example steps, 99 first hash values obtain 20 second hash values, further, the 20 second hash values are used as current hash values, the steps are circularly executed, further, similarly, 5 (set number) of the 20 current hash values are respectively selected to generate intermediate hash values, the blockchain uplink operation is executed on the intermediate hash values, the corresponding next-level second hash values are obtained from the blockchain, and 4 second hash values (current hash values) are obtained; still further, 1 second hash value is obtained, i.e. until the number of the current hash values is 1; the cyclically performed operations are stopped. That is, the following operations are cyclically executed with the first hash value as the current hash value until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2.
It will be appreciated that, in accordance with the above description, the hash value is obtained through a loop operation until a unique root hash value is obtained, forming a hash value storage structure of a multi-way tree. By the method, the complexity of acquiring the file is improved, and therefore the safety of the file is improved. Further description of the method of obtaining the root hash value is consistent with step S301-step S303 of the example shown in fig. 3; and will not be described in detail herein.
Step S103: and taking the current hash value as a root hash value and sending the hash value.
Specifically, according to the storage structure of the multi-tree (i.e. the set number of bifurcation trees) described in step S102, a root hash value is obtained and sent through a loop; further, the steps are described below with reference to the schematic diagram of fig. 5, and as shown in fig. 5, if the set number is N; the numbers in each circle represent the identifications of the current hash values of each level, and the number of the current hash values of each level is not smaller than the set number before the root hash value is acquired, the set number N of the current hash values are respectively selected, intermediate hash values are respectively generated according to the selected set number N of the current hash values, the block chain uplink operation is carried out on the intermediate hash values, and a plurality of corresponding second hash values are acquired from the block chain; circularly executing the operations, and obtaining the root hash value after M layers pass, wherein the number of the current hash values is 1; further, there are two methods of transmitting the root hash value: 1) Transmitting the root hash value to an acquirer with the authority to acquire the shared file through a block chain; 2) The root hash value is sent to the acquirer with the right to acquire the shared file in other ways, for example: official e-mail, etc.; it will be appreciated that the root hash value is sent to an acquirer having rights to acquire the shared file, the acquirer having rights being one or more parties; for example: the file is statement of accounts generated by bank A and bank B in a predefined time range; after step S101-step S103, a root hash value is generated, and the root hash value is sent to banks a and B having access to these statement files; it is apparent that the security of the document is further improved by this operation.
As shown in fig. 2, an embodiment of the present invention provides a method for obtaining a shared file, which may include the following steps:
step S201: receiving a current hash value; the following steps are circularly executed until a file compression packet corresponding to the current hash value is obtained; determining that a file compression packet hash value which is the same as the current hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the blockchain; a2: and determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value.
Specifically, according to the root hash value, the description of the method for obtaining the file in the file compression packet corresponding to the file compression packet hash value from the blockchain is consistent with the examples described in steps S401-S403, and will not be described in detail herein.
As shown in fig. 3, an embodiment of the present invention provides a method for storing a shared file and a hash value using a multi-way tree structure, which may include the steps of:
step S301: and obtaining a first hash value corresponding to each file compression packet.
Specifically, descriptions about generating the file compression packet and acquiring the corresponding first hash value are consistent with step S101, and will not be described herein. In the example shown in fig. 3, which contains 10 file compression packages, it is understood that the number of file compression packages may be tens, hundreds, millions, hundreds of thousands, millions, tens of millions, etc.; to specifically explain step S301 to step S303, the present example takes a set number of 4 as an example, that is, a 4-ary tree structure; according to the file compression packets 1-10, first hash values 1-10 are respectively obtained.
Step S302-step S303: a second hash value is obtained.
Specifically, the example of step S302-step S303 describes the operation of acquiring the second hash value (current hash value) performed in a loop; specifically, for illustration, as shown in fig. 3, the second hash value is described with 3 example levels, level 1, level 2, level 3, respectively; as shown in fig. 3, 10 first hash values are included in the example; setting the number to be 4, taking the first hash value as a current hash value, and circularly executing the following operations until the number of the current hash values is 1; respectively selecting 4 first hash values from 10 first hash values, generating an intermediate hash value based on the 4 first hash values, performing blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; for example, based on the first hash value 1-4, a second hash value 1 is obtained, and based on the first hash value 5-8, a second hash value 2 is obtained; when the first hash value 9 and the first hash value 10 (2 groups are subtracted from 10, each group is 4, and the remainder is 2) are the current hash values which are not selected, and the number of the current hash values which are not selected is smaller than the set number, 2<4, acquiring a corresponding second hash value 3 based on the 2 first hash values (the first hash value 9 and the first hash value 10); that is, the following operations are cyclically executed with the first hash value as the current hash value until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2.
Step S303: a root hash value is obtained.
Specifically, according to the step-aware example of step S302, 3 second hash values are included in the level 2, and the second hash values are taken as the current hash values; further executing the operation of step S302, and obtaining a second hash value of the level 3; since the number of the second hash values (current hash values) is 1, the current hash value is taken as a root hash value; it will be appreciated that the hierarchy of the set number of multi-way trees is determined by the number of file compression packet hash values (first hash values); the number of the hash values of the file compression packets is related to the number of the files related to the generated service, and the invention does not limit the set number and the number of the hash values (first hash values) of the file compression packets.
As shown in fig. 4, an embodiment of the present invention provides a method for obtaining a shared file based on a hash value of a multi-way tree structure, where the method may include the following steps:
the following steps S401 to S403 illustrate a method of acquiring a shared file based on hash values of a multi-way tree structure with the example described in step S301 to step S303 as an example;
step S401: based on the current hash value (root hash value).
Specifically, receiving a current hash value; determining that a file compression packet hash value identical to the current hash value exists on the blockchain; as shown in fig. 4, determining that the hash value of the file compression packet which is the same as the current hash value does not exist on the blockchain, that is, the current hash value is not the hash value of the file compression packet, determining a set number of lower hash values corresponding to the current hash value, and taking the lower hash values as the current hash value; the lower hash value of the current hash value is respectively a lower hash value 1, a lower hash value 2 and a lower hash value 3; and taking the lower-level hash value as the current hash value.
Step S402 to step S403: the loop execution obtains the lower hash value.
An example of a process of traversing and acquiring file compression packets by hash values of each layer below the root hash value is described below through steps S402 to S403; specifically, as shown in fig. 4, the current hash value (lower hash value 1, lower hash value 2, lower hash value 3) is received; determining that the same file compression packet hash value as the current hash value (the lower hash value 1, the lower hash value 2 and the lower hash value 3) does not exist on the blockchain; determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value, for example: determining each sub-hash value corresponding to the lower-level hash value 1 as a lower-level hash value 1-a lower-level hash value 4; determining each sub-hash value corresponding to the lower-level hash value 2 as a lower-level hash value 5-lower-level hash value 8; determining each sub-hash value corresponding to the lower-level hash value 3 as a lower-level hash value 9 and a lower-level hash value 10; further, determining that there is a file compression packet hash value on the blockchain that is the same as the current hash value (lower hash value 1-lower hash value 10); acquiring a file compression packet corresponding to the current hash value from the blockchain; file compression package 1-file compression package 10, respectively. That is, receiving the current hash value; the following steps are circularly executed until a file compression packet corresponding to the current hash value is obtained; determining that a file compression packet hash value which is the same as the current hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the blockchain; a2: and determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value.
Further, obtaining a file compression packet corresponding to the current hash value includes: acquiring a file compression package corresponding to the current hash value, decompressing and decrypting the file compression package, and acquiring a file in the file compression package; specifically, for each acquired file compression package, decompression and decryption operations are performed, and the decompression and decryption methods correspond to the compression and encryption methods.
It can be understood that the level of the set number of bifurcation trees is determined by the number of hash values of the file compression package and the set number; the number of the hash values of the file compression packets is related according to the number of the files related to the generated service, and the invention does not limit the set number and the number of the hash values of the file compression packets.
As shown in fig. 6, an embodiment of the present invention provides a process of sharing files, including the following steps:
as a schematic flow shown in fig. 6, a procedure of sharing file chaining is described using step S601 to step S603; describing a process of the shared file acquirer acquiring the shared file by using step S604 to step S605; for example, the execution of the shared file upload may be a banking headquarter, and the shared file acquirer may be an enterprise that is business-directly related to the shared file, such as: bank 1, bank 2, bank 3, etc.
Step S601: and acquiring files to be shared to form a plurality of file compression packages.
The step of executing the blockchain uplink operation on the file compression packet and obtaining at least three first hash value descriptions corresponding to the file compression packet from the blockchain is consistent with the step S101, and will not be described herein. Further, acquiring the file to be shared to form a plurality of file compression packages, including: and acquiring files to be shared in a predefined time range, forming at least three file packages, and determining the number of files in the file packages according to the network bandwidth. Further, compressing and encrypting operations are respectively carried out on the file package to form the file compression package. And executing the concurrent block chain uplink operation on the file compression package.
Step S602: taking the first hash value as a current hash value, and circularly executing the following operations until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2.
Specifically, the description of the circularly acquired root hash value is consistent with step S102, and will not be repeated here.
Step S603: and taking the current hash value as a root hash value and sending the hash value.
Specifically, the description about the transmission root hash value coincides with step S103, and is not repeated here.
Step S604: receiving a current hash value; the following steps are circularly executed until a file compression packet corresponding to the current hash value is obtained; determining that a file compression packet hash value which is the same as the current hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the blockchain; a2: and determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value.
Specifically, the description of obtaining each lower-level hash value corresponding to the root hash value according to the root hash value is consistent with step S201, and will not be described in detail herein; further, obtaining a file compression packet corresponding to the current hash value includes: and acquiring a file compression package corresponding to the current hash value, decompressing and decrypting the file compression package, and acquiring a file in the file compression package.
As shown in fig. 7, an embodiment of the present invention provides an apparatus 700 for sharing a file, including: a file compression packet uplink module 701, a node hash value acquisition module 702 and a root hash value acquisition module 703; wherein, the liquid crystal display device comprises a liquid crystal display device,
the file compression package uplink module 701 is configured to obtain a file to be shared, and form a plurality of file compression packages; executing a blockchain uplink operation on the file compression packet, and acquiring at least three first hash values corresponding to the file compression packet from a blockchain;
the upper hash value obtaining module 702 is configured to take the first hash value as a current hash value, and circularly execute the following operations until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2;
The root hash value obtaining module 703 is configured to take the current hash value as a root hash value, and send the hash value.
Optionally, the file compression package uplink module 701 is further configured to obtain a file to be shared, form a plurality of file compression packages, and include: and acquiring files to be shared in a predefined time range, forming at least three file packages, and determining the number of files in the file packages according to the network bandwidth.
Optionally, the file compression package uplink module 701 is further configured to perform compression and encryption operations on the file package, to form the file compression package.
Optionally, the file compression package uplink module 701 is further configured to perform a blockchain concurrent uplink operation on the file compression package.
As shown in fig. 8, an embodiment of the present invention provides an apparatus 800 for sharing files, including: acquiring an on-chain file module 801; wherein, the liquid crystal display device comprises a liquid crystal display device,
the on-chain file acquisition module 801 is configured to receive a current hash value; the following steps are circularly executed until a file compression packet corresponding to the current hash value is obtained; determining that a file compression packet hash value which is the same as the current hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the blockchain; a2: and determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value.
Optionally, the on-chain file obtaining module 801 is further configured to obtain a file compression packet corresponding to the current hash value, and includes: and acquiring a file compression package corresponding to the current hash value, decompressing and decrypting the file compression package, and acquiring a file in the file compression package.
The embodiment of the invention also provides electronic equipment for sharing the file, which comprises: one or more processors; and a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method provided by any of the embodiments described above.
The embodiment of the invention also provides a computer readable medium, on which a computer program is stored, which when executed by a processor implements the method provided by any of the above embodiments.
Fig. 10 illustrates an exemplary system architecture 1000 to which the method of sharing a file or the apparatus of sharing a file of the embodiment of the present invention may be applied.
As shown in fig. 10, a system architecture 1000 may include terminal devices 1001, 1002, 1003, a network 1004, and a server 1005. The network 1004 serves as a medium for providing a communication link between the terminal apparatuses 1001, 1002, 1003 and the server 1005. The network 1004 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user can interact with a server 1005 via a network 1004 using terminal apparatuses 1001, 1002, 1003 to receive or transmit messages or the like. Various client applications such as an enterprise application client, a web browser application, a search class application, an instant messaging tool, a mailbox client, and the like may be installed on the terminal devices 1001, 1002, 1003.
The terminal devices 1001, 1002, 1003 may be various electronic devices having a display screen and supporting running various client applications, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 1005 may be a server providing various services, such as a background management server providing support for a request for acquiring a file made by a user with the terminal apparatuses 1001, 1002, 1003. The background management server can execute the uplink and the storage of the file to be shared, process the proposed request for acquiring the file and return the file to the terminal equipment.
It should be noted that, the method for sharing files provided in the embodiment of the present invention is generally executed by the server 1005, and accordingly, the device for sharing files is generally disposed in the server 1005.
It should be understood that the number of terminal devices, networks and servers in fig. 10 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 11, there is illustrated a schematic diagram of a computer system 1100 suitable for use in implementing the terminal device of an embodiment of the present invention. The terminal device shown in fig. 11 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 11, the computer system 1100 includes a Central Processing Unit (CPU) 1101, which can execute various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 1102 or a program loaded from a storage section 1108 into a Random Access Memory (RAM) 1103. In the RAM 1103, various programs and data required for the operation of the system 1100 are also stored. The CPU 1101, ROM 1102, and RAM 1103 are connected to each other by a bus 1104. An input/output (I/O) interface 1105 is also connected to bus 1104.
The following components are connected to the I/O interface 1105: an input section 1106 including a keyboard, a mouse, and the like; an output portion 1107 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 1108 including a hard disk or the like; and a communication section 1109 including a network interface card such as a LAN card, a modem, and the like. The communication section 1109 performs communication processing via a network such as the internet. The drive 1110 is also connected to the I/O interface 1105 as needed. Removable media 1111, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is installed as needed in drive 1110, so that a computer program read therefrom is installed as needed in storage section 1108.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network via the communication portion 1109, and/or installed from the removable media 1111. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 1101.
The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules and/or units involved in the embodiments of the present invention may be implemented in software, or may be implemented in hardware. The described modules and/or units may also be provided in a processor, e.g., may be described as: the processor comprises a file compression packet uplink module, a node hash value acquisition module and a root hash value acquisition module; the names of these modules do not limit the module itself in some cases, for example, the node hash value acquisition module may also be described as "a module that performs a blockchain chaining operation on a first hash value of a file compression packet and acquires a second hash value from the blockchain". It can also be described as: a processor includes an acquire in-chain file module; the names of these modules do not limit the module itself in some cases, for example, the file module on the acquisition chain may also be described as "a module for acquiring a hash value of a file compression packet on the blockchain according to a root hash value, and acquiring a file included in the file compression packet according to the hash value of the file compression packet".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include: acquiring files to be shared to form a plurality of file compression packages; executing a blockchain uplink operation on the file compression packet, and acquiring at least three first hash values corresponding to the file compression packet from a blockchain; taking the first hash value as a current hash value, and circularly executing the following operations until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2; and taking the current hash value as a root hash value and sending the hash value. Receiving a current hash value; the following steps are circularly executed until a file compression packet corresponding to the current hash value is obtained; determining that a file compression packet hash value which is the same as the current hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the blockchain; a2: and determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value.
According to the technical scheme provided by the embodiment of the invention, the technical problem of overlarge network resource burden caused by large number of files is partially overcome by adopting the method of compressing a plurality of files into the file compression package, and the efficiency of file chaining and sharing is improved by simultaneously chaining the file compression packages; and storing and sharing the root hash value by utilizing the bifurcation tree structure, and acquiring the shared file through the root hash value, thereby improving the safety of the file.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (11)
1. A method of sharing a file, comprising:
acquiring files to be shared to form a plurality of file compression packages;
executing a blockchain uplink operation on the file compression packet, and acquiring at least three first hash values corresponding to the file compression packet from a blockchain;
taking the first hash value as a current hash value, and circularly executing the following operations until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2;
And taking the current hash value as a root hash value and sending the hash value.
2. The method of claim 1, wherein the step of determining the position of the substrate comprises,
obtaining a file to be shared to form a plurality of file compression packages, including:
and acquiring files to be shared in a predefined time range, forming at least three file packages, and determining the number of files in the file packages according to the network bandwidth.
3. The method of claim 2, wherein the step of determining the position of the substrate comprises,
and respectively executing compression and encryption operation on the file package to form the file compression package.
4. The method of claim 1, wherein the step of determining the position of the substrate comprises,
and executing the concurrent block chain uplink operation on the file compression package.
5. A method of obtaining a shared file implemented in accordance with the method of claim 1, comprising:
receiving a current hash value; the following steps are circularly executed until a file compression packet corresponding to the current hash value is obtained;
determining that a file compression packet hash value which is the same as the current hash value exists on the block chain, and if so, executing A1; otherwise, executing A2;
a1: acquiring a file compression packet corresponding to the current hash value from the blockchain;
A2: and determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value.
6. The method of claim 5, wherein the step of determining the position of the probe is performed,
the file compression packet corresponding to the current hash value is obtained, which comprises the following steps:
and obtaining a file compression package corresponding to the current hash value, and performing decompression and decryption operations on the file compression package to obtain a file in the file compression package.
7. An apparatus for sharing a file, comprising: the device comprises a file compression packet uplink module, a node hash value acquisition module and a root hash value acquisition module; wherein, the liquid crystal display device comprises a liquid crystal display device,
the file compression package uplink module is used for acquiring files to be shared to form a plurality of file compression packages; executing a blockchain uplink operation on the file compression packet, and acquiring at least three first hash values corresponding to the file compression packet from a blockchain;
the node hash value obtaining module is configured to take the first hash value as a current hash value, and circularly execute the following operations until the number of the current hash values is 1: respectively selecting a set number of current hash values from the at least three current hash values, generating an intermediate hash value based on the selected set number of current hash values, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; when the current hash value which is not selected exists and the number of the current hash values which are not selected is smaller than the set number, generating an intermediate hash value based on the current hash value which is not selected, performing a blockchain uplink operation on the intermediate hash value, and acquiring a corresponding second hash value from a blockchain; taking the second hash value as the current hash value; the set number is an integer greater than 2;
The root hash value obtaining module is configured to take the current hash value as a root hash value, and send the hash value.
8. An apparatus for obtaining a shared file implemented by an apparatus as claimed in claim 7, comprising: acquiring an on-chain file module; wherein, the liquid crystal display device comprises a liquid crystal display device,
the file module on the acquisition chain is used for receiving the current hash value; the following steps are circularly executed until a file compression packet corresponding to the current hash value is obtained; determining that a file compression packet hash value which is the same as the current hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the blockchain; a2: and determining each lower-level hash value corresponding to the current hash value, and taking the lower-level hash value as the current hash value.
9. A system for sharing files, comprising: the apparatus for sharing a file according to claim 7, and the apparatus for acquiring a shared file according to claim 8.
10. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs,
When executed by the one or more processors, cause the one or more processors to implement the method of any of claims 1-4 or 5-6.
11. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-4 or 5-6.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010772434.9A CN111984614B (en) | 2020-08-04 | 2020-08-04 | Method, device and system for sharing files |
| PCT/CN2021/110599 WO2022028486A1 (en) | 2020-08-04 | 2021-08-04 | File sharing method, device, and system |
| EP21852328.0A EP4180984A1 (en) | 2020-08-04 | 2021-08-04 | File sharing method, device, and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010772434.9A CN111984614B (en) | 2020-08-04 | 2020-08-04 | Method, device and system for sharing files |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111984614A CN111984614A (en) | 2020-11-24 |
| CN111984614B true CN111984614B (en) | 2023-05-26 |
Family
ID=73445010
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010772434.9A Active CN111984614B (en) | 2020-08-04 | 2020-08-04 | Method, device and system for sharing files |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111984614B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022028486A1 (en) * | 2020-08-04 | 2022-02-10 | 中国人民银行数字货币研究所 | File sharing method, device, and system |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106815530A (en) * | 2016-12-26 | 2017-06-09 | 北京爱接力科技发展有限公司 | Data deposit card method, data verification method and device |
| CN109101572A (en) * | 2018-07-17 | 2018-12-28 | 何晓行 | Card method, apparatus and server, storage medium are deposited based on block chain |
| CN109657499A (en) * | 2018-10-31 | 2019-04-19 | 深圳市网心科技有限公司 | Metadata validation method, system server and computer readable storage medium |
| CN109684871A (en) * | 2018-12-20 | 2019-04-26 | 鸿秦（北京）科技有限公司 | File memory method and system based on block chain |
| CN109903049A (en) * | 2019-03-01 | 2019-06-18 | 长沙理工大学 | A kind of block chain transaction data storage method, device, equipment and storage medium |
| CN110020544A (en) * | 2018-12-26 | 2019-07-16 | 阿里巴巴集团控股有限公司 | The Hash information processing method and system of record are stored in the block of block chain |
| CN110032581A (en) * | 2019-01-18 | 2019-07-19 | 阿里巴巴集团控股有限公司 | A kind of service scripts storage method and device based on block chain |
| CN110599174A (en) * | 2019-09-20 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Block chain information processing method and related equipment |
| JP6626228B1 (en) * | 2019-03-19 | 2019-12-25 | 株式会社スカイコム | Management server, document file management system, document file management method, and document file management program |
| CN111209262A (en) * | 2020-01-10 | 2020-05-29 | 浪潮天元通信信息系统有限公司 | Large-scale distributed safe storage system based on block chain |
| CN111259070A (en) * | 2019-11-28 | 2020-06-09 | 国网山东省电力公司 | Method and related device for storing and acquiring service data |
-
2020
- 2020-08-04 CN CN202010772434.9A patent/CN111984614B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106815530A (en) * | 2016-12-26 | 2017-06-09 | 北京爱接力科技发展有限公司 | Data deposit card method, data verification method and device |
| CN109101572A (en) * | 2018-07-17 | 2018-12-28 | 何晓行 | Card method, apparatus and server, storage medium are deposited based on block chain |
| CN109657499A (en) * | 2018-10-31 | 2019-04-19 | 深圳市网心科技有限公司 | Metadata validation method, system server and computer readable storage medium |
| CN109684871A (en) * | 2018-12-20 | 2019-04-26 | 鸿秦（北京）科技有限公司 | File memory method and system based on block chain |
| CN110020544A (en) * | 2018-12-26 | 2019-07-16 | 阿里巴巴集团控股有限公司 | The Hash information processing method and system of record are stored in the block of block chain |
| CN110032581A (en) * | 2019-01-18 | 2019-07-19 | 阿里巴巴集团控股有限公司 | A kind of service scripts storage method and device based on block chain |
| CN109903049A (en) * | 2019-03-01 | 2019-06-18 | 长沙理工大学 | A kind of block chain transaction data storage method, device, equipment and storage medium |
| JP6626228B1 (en) * | 2019-03-19 | 2019-12-25 | 株式会社スカイコム | Management server, document file management system, document file management method, and document file management program |
| CN110599174A (en) * | 2019-09-20 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Block chain information processing method and related equipment |
| CN111259070A (en) * | 2019-11-28 | 2020-06-09 | 国网山东省电力公司 | Method and related device for storing and acquiring service data |
| CN111209262A (en) * | 2020-01-10 | 2020-05-29 | 浪潮天元通信信息系统有限公司 | Large-scale distributed safe storage system based on block chain |
Non-Patent Citations (2)
| Title |
|---|
| 一种采用签名与哈希技术的云存储去重方案;张桂鹏，匡振曦，陈平华;《计算机工程与应用》;第56卷(第1期);全文 * |
| 区块链技术在电子病历共享的应用研究;翟社平，汪一景，陈思吉;《西安电子科技大学学报》;第47卷(第5期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111984614A (en) | 2020-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11323546B2 (en) | Executing remote commands | |
| CN107292197B (en) | Data encryption method, data decryption method, encryption device and decryption device | |
| CN113364795B (en) | Data transmission method and proxy server | |
| CN111950030A (en) | Data sharing storage method based on block chain, terminal equipment and storage medium | |
| CN114826733B (en) | File transmission method, device, system, equipment, medium and program product | |
| CN110753020A (en) | Network request processing method and device | |
| CN111460129A (en) | Method and device for generating identification, electronic equipment and storage medium | |
| CN110572422A (en) | Data downloading method and device | |
| EP4180985A1 (en) | File sharing method, apparatus, and system | |
| CN111339206B (en) | Block chain-based data sharing method and device | |
| CN112416396A (en) | Application program updating method and system | |
| CN111931474A (en) | Information table generation method and device, electronic equipment and computer readable medium | |
| CN111984614B (en) | Method, device and system for sharing files | |
| CN112489760B (en) | Prescription processing method and system based on distributed identity authentication | |
| CN111984613B (en) | Method, device and system for sharing files | |
| CN111984612B (en) | Method, device and system for sharing files | |
| CN111984616B (en) | Method, device and system for updating shared file | |
| CN112257039B (en) | Identity attribute adding method and device and electronic equipment | |
| CN115277684A (en) | File transmission method, device, equipment and storage medium | |
| CN109088929B (en) | Method and device for sending information | |
| CN111835846B (en) | Information updating method and device and electronic equipment | |
| WO2022028486A1 (en) | File sharing method, device, and system | |
| CN113301058B (en) | Information encryption transmission method and device, electronic equipment and computer readable medium | |
| CN111783044B (en) | Method and device for sharing login state | |
| CN113472785B (en) | Data processing method and device, electronic equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |