CN111984614A - Method, device and system for sharing files - Google Patents
Method, device and system for sharing files Download PDFInfo
- Publication number
- CN111984614A CN111984614A CN202010772434.9A CN202010772434A CN111984614A CN 111984614 A CN111984614 A CN 111984614A CN 202010772434 A CN202010772434 A CN 202010772434A CN 111984614 A CN111984614 A CN 111984614A
- Authority
- CN
- China
- Prior art keywords
- hash value
- file
- current
- block chain
- acquiring
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 77
- 230000006835 compression Effects 0.000 claims abstract description 138
- 238000007906 compression Methods 0.000 claims abstract description 136
- 238000004590 computer program Methods 0.000 claims description 11
- 230000006837 decompression Effects 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 13
- 230000008569 process Effects 0.000 description 12
- 238000004891 communication Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 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
- 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
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
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: acquiring files to be shared, forming a file compression package, performing block chain chaining operation on the file compression package and acquiring corresponding first hash values, and selecting a set number of first hash values to chain and acquire a current hash value; and circulating until a root hash value is obtained, and storing the current hash values of all levels in a set number of branched tree structures. Traversing the hash values of the nodes of the bifurcated tree structure based on the root hash value to obtain a shared file in the file compression package; by compressing a plurality of files into file compression packages, the technical problem of overhigh network resource burden caused by large file quantity is partially solved, and the efficiency of chaining and sharing the files is improved by simultaneously chaining the file compression packages; the root hash value is stored and shared by using the bifurcated tree structure, and the shared file is obtained through the root hash value, so that the safety of the file is improved.
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 a file.
Background
In the business process of an enterprise, files required by the business are often required to be shared, especially the business between the enterprise and the enterprise is involved, with the development of the block chain technology, the files can be shared between the enterprises based on the block chain, and the adopted method mainly comprises the following steps: 1. and 2, storing the files in a centralized database, and uploading the electronic certificate of the files and broadcasting to realize sharing.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
by using the method of method 1, when the number of files is large, the utilization rate of network resources is too high, which results in the reduction of the uplink efficiency of the files; in the method 2, the centralized database is used for storing the files, and when the files are high in safety, certain safety risks exist.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for sharing a file, which can obtain a file to be shared, form a compressed file package, perform block chaining operation on the compressed file package and obtain corresponding first hash values, select a set number of first hash values to chain and obtain a current hash value; and circulating until a root hash value is obtained, and storing the current hash values of all levels in a set number of branched tree structures. Traversing the hash values of the nodes of the bifurcated tree structure based on the root hash value to obtain a shared file in the file compression package; by compressing a plurality of files into file compression packages, the technical problem of overhigh network resource burden caused by large file quantity is partially solved, and the efficiency of chaining and sharing the files is improved by simultaneously chaining the file compression packages; the root hash value is stored and shared by using the bifurcated tree structure, and the shared file is obtained through the root hash value, so that the safety of the file is improved.
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; performing block chain chaining operation on the file compressed packet, and acquiring at least three first hash values corresponding to the file compressed packet from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 of sharing files, wherein,
acquiring a file to be shared to form a plurality of file compression packages, wherein the file compression packages comprise:
the method comprises the steps of obtaining files to be shared in a predefined time range, forming at least three file packages, and determining the number of the files in the file packages according to network bandwidth.
Optionally, the method of sharing files, wherein,
and respectively executing compression and encryption operations on the file packet to form the file compression packet.
Optionally, the method of sharing files, wherein,
and performing block chain concurrent uplink operation on the file compression package.
To achieve the above object, according to a second aspect of the embodiments of the present invention, there is provided a method for sharing a file, including: receiving a current hash value; circularly executing the following steps until the file compression packet corresponding to the current hash value is obtained; determining that the block chain has a file compressed packet hash value which is the same as the current hash value, if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the block chain; 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 of sharing files, wherein,
acquiring a file compression package corresponding to the current hash value, wherein the acquiring comprises:
and acquiring a file compression packet corresponding to the current hash value, and performing decompression and decryption operations on the file compression packet to acquire files in the file compression packet.
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 system comprises a file compression package chain module, a node hash value acquisition module and a root hash value acquisition module; wherein,
the file compression package chaining module is used for acquiring files to be shared and forming a plurality of file compression packages; performing block chain chaining operation on the file compressed packet, and acquiring at least three first hash values corresponding to the file compressed packet from a block chain;
the superior hash value obtaining module is configured to take the first hash value as a current hash value, and cyclically 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; taking the second hash value as the current hash value; the set number is an integer greater than 2;
and the root hash value acquisition module is used for taking the current hash value as a root hash value and sending the hash value.
Optionally, the apparatus for sharing files is characterized in that,
acquiring a file to be shared to form a plurality of file compression packages, wherein the file compression packages comprise:
the method comprises the steps of obtaining files to be shared in a predefined time range, forming at least three file packages, and determining the number of the files in the file packages according to network bandwidth.
Optionally, the apparatus for sharing files is characterized in that,
and respectively executing compression and encryption operations on the file packet to form the file compression packet.
Optionally, the apparatus for sharing files is characterized in that,
and performing block chain concurrent 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 also provided an apparatus for sharing a file, including: acquiring a link file module; wherein,
the on-chain file obtaining module is used for receiving the current hash value; circularly executing the following steps until the file compression packet corresponding to the current hash value is obtained; determining that the block chain has a file compressed packet hash value which is the same as the current hash value, if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the block chain; 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 apparatus for sharing files is characterized in that,
acquiring a file compression package corresponding to the current hash value, wherein the acquiring comprises:
and acquiring a file compression packet corresponding to the current hash value, and performing decompression and decryption operations on the file compression packet to acquire files in the file compression packet.
To achieve the above object, according to a fifth aspect of the embodiments of the present invention, there is provided a system 900 for sharing files, comprising the apparatus 700 for sharing files provided in the third aspect and the apparatus 800 for sharing files provided in the fourth aspect;
to achieve the above object, according to a sixth aspect of the embodiments of the present invention, there is provided an electronic device for sharing a file, including: one or more processors; storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to carry out a method as claimed in any one of the above methods of sharing files.
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 a computer program stored thereon, wherein the program is configured to implement, when executed by a processor, any one of the above-mentioned methods of sharing a file.
One embodiment of the above invention has the following advantages or benefits: acquiring files to be shared, forming a file compression package, performing block chain chaining operation on the file compression package and acquiring corresponding first hash values, and selecting a set number of first hash values to chain and acquire a current hash value; and circulating until a root hash value is obtained, and storing the current hash values of all levels in a set number of branched tree structures. Traversing the hash values of the nodes of the bifurcated tree structure based on the root hash value to obtain a shared file in the file compression package; by compressing a plurality of files into file compression packages, the technical problem of overhigh network resource burden caused by large file quantity is partially solved, and the efficiency of chaining and sharing the files is improved by simultaneously chaining the file compression packages; the root hash value is stored and shared by using the bifurcated tree structure, and the shared file is obtained through the root hash value, so that the safety of the file is improved.
Further effects of the above-mentioned non-conventional alternatives will be 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 flowchart illustrating a method for storing shared files according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart of acquiring a shared file according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating a method for storing hash values of shared files using a multi-way tree structure according to an embodiment of the present invention;
FIG. 4 is a flowchart illustrating a process for obtaining a shared file according to an embodiment of the present invention;
FIG. 5 is a diagram illustrating a method for storing hash values of shared files by using a multi-way tree structure according to an embodiment of the present invention;
FIG. 6 is a flowchart illustrating sharing files according to an embodiment of the present invention;
FIG. 7 is a block diagram of an apparatus for sharing files according to an embodiment of the present invention;
FIG. 8 is a schematic structural diagram of an apparatus for acquiring a shared file according to an embodiment of the present invention;
FIG. 9 is a block diagram of a system for obtaining shared files 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 employed;
fig. 11 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as 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, where the method may include the following steps:
step S101: acquiring files to be shared to form a plurality of file compression packages; and performing block chain chaining operation on the file compressed packet, and acquiring at least three first hash values corresponding to the file compressed packet from the block chain.
Specifically, the file to be shared may be a transaction file generated by an electronic bank, a reconciliation file generated by the electronic bank, an order file generated by an electronic mall, or the like; the invention does not limit the format and the content of the shared file; further, acquiring a file to be shared to form a plurality of file compression packages, including: the method comprises the steps of obtaining files to be shared in a predefined time range, forming at least three file packages, and determining the number of the files in the file packages according to network bandwidth.
Specifically, one embodiment of the present invention is based on hash values corresponding to a plurality of file compression packets, and forms a multi-branch tree-like hash value structure by looping through hash values of each level and obtaining a hash value of a next level, where a branch number of the multi-branch 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 compressed packet are obtained from the block chain; it is understood that the number of the file compression packages may be according to the number of the received shared files in a time range, that is, the files to be shared generated in a predefined time range are obtained, for example, a transaction file generated by a certain electronic bank within one hour, a reconciliation file generated by two electronic banks within one hour, an order file generated by an electronic mall within one day, and the like, and the predefined time range may be set according to the scene of the business and the number of the generated files, for example, one day, one hour, one minute, and the like; the invention is not limited to the specific content of the predefined time range.
Further, obtaining files to be shared, for example, obtaining files to be shared within a predefined time range to form at least three file packages, determining the number of files in each file package according to a network bandwidth, and forming at least three file compression packages respectively; obtaining the number of the files generated in the predefined time range, combining the bandwidth of a network and other factors, dividing the files to form a plurality of file packets, and respectively compressing the file packets to respectively form file compression packets; the number of 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 operations on the file packet to form the file compression packet. The method comprises the steps of forming at least three file compression packages, executing compression operation and encryption operation, improving the security of files through encryption, particularly improving the security of files with high security requirements such as statements between electronic banks, and the like, wherein the encryption method can be used for encrypting by using compression software such as gzip, WinRAR and the like; the encryption method may be encryption using compression software, or encryption using an operating system or encryption software, and the specific method used for compression and the specific method for encryption are not limited in the present invention.
Furthermore, block chain concurrent uplink operation is performed on each file compression package, and because each file compression package does not have a dependent transaction relationship, concurrent uplink operation of the file compression packages is performed; that is, block chain concurrent uplink operations are performed on the file compression package. It can be understood that, due to the limitation of resources such as network bandwidth, etc., uplink operations of multiple file compressed packages may be performed in batches, and each file compressed package in a batch performs concurrent uplink, so that the efficiency of file uplink is improved through the simultaneous uplink operations; further, performing block chain chaining operation on the at least three compressed file packages, and acquiring at least three first hash values corresponding to the at least three compressed file packages respectively; the method comprises the steps that a block chain chaining operation can be executed by taking a file compression packet as a transaction respectively, and hash values returned for the transaction are obtained from the block chain respectively, wherein the hash values are first hash values corresponding to the file compression packet; the used blockchain may be a federation chain, a private chain, or the like, and the type of blockchain is not limited in the present invention. The invention is not limited to the specific tools or methods used to perform the blockchain chaining.
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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; taking the second hash value as the current hash value; the set number is an integer greater than 2.
Specifically, according to a first hash value corresponding to each file compressed packet formed in step S101, an intermediate hash value is generated based on a set number of selected current hash values, a block chain chaining operation is performed on the intermediate hash value, and a corresponding second hash value is obtained from the block chain; specifically, the intermediate hash value is generated based on the selected current hash values of the set number, the current hash values of the set number may be combined to generate the intermediate hash value, or the current hash values of the set number may be calculated to generate the intermediate hash value. Further, the intermediate hash value may be used as a transaction to perform uplink operation on the blockchain, and second hash values returned for the transaction are respectively obtained from the blockchain; and circulating the steps 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, and the set number is used to set the number of branches of the multi-branch tree structure, and the set number may be determined according to a service scenario or the number of file compression packets.
In the circulation process, the first hash value and the second hash value are used as current hash values; it can be understood that, according to the above description, the hash value storage structure of a multi-way tree (a set number of split trees) is formed by performing block chain chaining on the first hash value and the second hash value (the current hash value) respectively through looping to obtain hash values of each level until obtaining a unique root hash value (i.e., until the number of the current hash value is 1). By the method, the complexity of obtaining the file is improved, and the safety of the file is improved.
The following are examples, for example: the number of the file compression packet hash values is 99, and 99 first hash values are correspondingly formed; the set number is 5; 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: that is, the following operations are performed circularly with the 99 first hash values as the current hash values: respectively selecting a set number (for example, 5) of current hash values from 99 hash values, generating intermediate hash values based on the selected set number (for example, 5) of current hash values, performing a block chain uplink operation on the intermediate hash values, and acquiring corresponding second hash values from a block chain; it can be understood that, respectively selecting 5 current hash values from 99 first hash values, generating intermediate hash values according to the selected 5 hash values, performing a chain chaining operation on the intermediate hash values, and acquiring corresponding second hash values from a blockchain, where through the above operations, 19 second hash values are acquired; further, when 19 second hash values are obtained based on 95(19 × 5) pair hash values of the 99 first hash values, it can be understood that, since the set number is 5, 4 unselected pair hash values are not selected, and the number of unselected pair hash values is less than the set number (for example: 5), an intermediate hash value is generated based on the 4 first hash values, a block chain chaining operation is performed on the intermediate hash value, and a corresponding second hash value is obtained from the block chain; that is, when the current hash value that is not selected exists and the number of the current hash values that are not selected is less 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 obtained 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 taken as current hash values, the above steps are executed in a loop, further, similarly, 5 (set number) of the 20 current hash values are respectively selected to generate intermediate hash values, a blockchain chaining operation is executed on the intermediate hash values, corresponding second hash values of the next hierarchy are obtained from the blockchain, and 4 second hash values (current hash values) are obtained; further, 1 second hash value is obtained, namely, until the number of the current hash values is 1; the operation of the loop execution is stopped. That is, 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; taking the second hash value as the current hash value; the set number is an integer greater than 2.
It will be appreciated that, according to the above description, the operation of obtaining hash values through a loop operation until a unique root hash value is obtained forms a hash value storage structure of a multi-way tree. By the method, the complexity of obtaining the file is improved, and the safety of the file is improved. Further description of the method of obtaining the root hash value is consistent with steps S301-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-way tree (i.e., the set number of the multi-way trees) described in step S102, through circulation, a root hash value is obtained and sent; further, the above steps will be described below with reference to the schematic diagram of fig. 5, and if the set number is N, as shown in fig. 5; the number in each circle represents the identifier of the current hash value of each level, and assuming that the number of the current hash values of each level is not less than the set number before the root hash value is obtained, a set number N of the current hash values are respectively selected, intermediate hash values are respectively generated according to the selected set number of the current hash values, block chain chaining operation is performed on the intermediate hash values, and a plurality of corresponding second hash values are obtained from the block chain; circularly executing the operation, and acquiring a root hash value when the number of the current hash values is 1 after M levels; further, there are two methods for sending the root hash value: 1) sending the root hash value to an acquirer having the authority of acquiring the shared file through a block chain; 2) and sending the root hash value to an acquirer having the authority of acquiring the shared file in other ways, for example: official e-mails, etc.; it can be understood that, the root hash value is sent to an acquirer having authority to acquire the shared file, where the acquirer having authority may be one or more parties; for example: the file is a statement generated by the bank A and the bank B within a predefined time range; generating root hash values after the steps S101-S103, and sending the root hash values to a bank A and a bank B which have the acquiring authority for the account statement files; obviously, the security of the file is further improved by this operation.
As shown in fig. 2, an embodiment of the present invention provides a method for acquiring a shared file, where the method may include the following steps:
step S201: receiving a current hash value; circularly executing the following steps until the file compression packet corresponding to the current hash value is obtained; determining that the block chain has a file compressed packet hash value which is the same as the current hash value, if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the block chain; 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 the method for obtaining the file in the file compression package corresponding to the hash value of the file compression package from the blockchain according to the root hash value is consistent with the examples described in steps S401 to S403, and is not repeated here.
As shown in fig. 3, an embodiment of the present invention provides a method for storing a shared file and a hash value by using a multi-way tree structure, where the method may include the following steps:
step S301: and acquiring a first hash value corresponding to each file compression packet.
Specifically, the description about generating the file compression package and obtaining the corresponding first hash value is consistent with step S101, and is not repeated herein. In the example shown in fig. 3, 10 file compression packages are included, and it is understood that the number of file compression packages may be tens, hundreds, tens of thousands, hundreds of thousands, millions, tens of millions, etc.; to specifically describe steps S301 to S303, the set number is 4 in this example, that is, the structure is a 4-way tree; and respectively acquiring first hash values 1-10 according to the file compression packages 1-10.
Step S302-step S303: and acquiring a second hash value.
Specifically, the example of step S302 to step S303 describes the operation of obtaining the second hash value (current hash value) that is executed in a loop; specifically, for illustration, as shown in fig. 3, the second hash value is described using 3 example levels, level 1, level 2, level 3, respectively; as shown in fig. 3, an example includes 10 first hash values; if the set number is 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 a block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; for example, the second hash value 1 is obtained based on the first hash values 1-4, and the second hash value 2 is obtained based on the first hash values 5-8; the first hash values 9 and the first hash values 10 (2 groups are subtracted from 10, each group has 4, and the remainder is 2) are the current hash values which are not selected, and when the number of the current hash values which are not selected is less than the set number, 2<4, the corresponding second hash value 3 is obtained based on the 2 first hash values (the first hash value 9 and the first hash value 10); that is, 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 known example of step S302, level 2 includes 3 second hash values, and the second hash values are used as the current hash values; further executing the operation of step S302 to obtain a second hash value of 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 is understood that the level of the set number of the multi-way trees is determined by the number of the file compression package hash values (first hash values); the number of the file compression packet hash values is related to the number of the files related to the generated service, and the set number and the number of the file compression packet hash values (first hash values) are not limited.
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 includes the following steps:
the following steps S401 to S403 illustrate a method of acquiring a shared file based on a hash value of a multi-way tree structure, taking the example described in steps S301 to S303 as an example;
step S401: according to the current hash value (root hash value).
Specifically, a current hash value is received; determining that a file compression packet hash value identical to the current hash value exists on the block chain; as shown in fig. 4, if it is determined that there is no file compressed packet hash value that is the same as the current hash value on the block chain, that is, the current hash value is not a hash value of a file compressed packet, determining a set number of lower-level hash values corresponding to the current hash value, and taking the lower-level hash values as the current hash value; the lower-level hash values of the current hash value are respectively a lower-level hash value 1, a lower-level hash value 2 and a lower-level hash value 3; and using the lower-level hash value as the current hash value.
Step S402-step S403: and circularly executing to obtain the lower-level hash value.
An example of a process of traversing and acquiring a file compression package by hash values of layers 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 no file compression packet hash value identical to the current hash value (subordinate hash value 1, subordinate hash value 2, subordinate hash value 3) exists on the block chain; determining each subordinate hash value corresponding to the current hash value, and taking the subordinate 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-a 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 a file compressed packet hash value identical to the current hash value (subordinate hash value 1-subordinate hash value 10) exists on the block chain; acquiring a file compression packet corresponding to the current hash value from the block chain; respectively, file compression package 1-file compression package 10. Namely, receiving a current hash value; circularly executing the following steps until the file compression packet corresponding to the current hash value is obtained; determining that the block chain has a file compressed packet hash value which is the same as the current hash value, if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the block chain; 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 the file compression package corresponding to the current hash value includes: acquiring a file compression packet corresponding to the current hash value, and performing decompression and decryption operations on the file compression packet to acquire files in the file compression packet; specifically, for each acquired file compression packet, decompression and decryption operations are performed, and the decompression and decryption methods correspond to the compression and encryption methods.
It is understood that the set number of levels of the forking tree is determined by the number of the hash values of the file compression package and the set number; the number of the file compression packet hash values is related to the number of the files related to the generated service, and the set number and the number of the file compression packet hash values are not limited by the invention.
As shown in fig. 6, an embodiment of the present invention provides a process for sharing a file, where the process includes the following steps:
as shown in the schematic flow of FIG. 6, the process of sharing the uplink file is described by steps S601-S603; the process of acquiring the shared file by the shared file acquirer is described by using step S604 to step S605; for example, the sharing file uplink is executed by a bank headquarters, and the sharing file acquirer is an enterprise directly related to the sharing file in business, for example: bank 1, bank 2, bank 3, etc.
Step S601: and acquiring the files to be shared to form a plurality of file compression packages.
Performing a block chain chaining operation on the file compressed packet, and obtaining at least three first hash value descriptions corresponding to the file compressed packet from the block chain is consistent with step S101, which is not described herein again. Further, acquiring a file to be shared to form a plurality of file compression packages, including: the method comprises the steps of obtaining files to be shared in a predefined time range, forming at least three file packages, and determining the number of the files in the file packages according to network bandwidth. Further, compressing and encrypting operations are respectively carried out on the file packet to form the file compressed packet. And performing block chain concurrent 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; taking the second hash value as the current hash value; the set number is an integer greater than 2.
Specifically, the description about obtaining the root hash value through the loop is consistent with step S102, and is not repeated here.
Step S603: and taking the current hash value as a root hash value, and sending the hash value.
Specifically, the description about sending the root hash value is consistent with step S103, and is not repeated here.
Step S604: receiving a current hash value; circularly executing the following steps until the file compression packet corresponding to the current hash value is obtained; determining that the block chain has a file compressed packet hash value which is the same as the current hash value, if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the block chain; 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 is not repeated here; further, obtaining the file compression package corresponding to the current hash value includes: and acquiring a file compression packet corresponding to the current hash value, and performing decompression and decryption operations on the file compression packet to acquire files in the file compression packet.
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 file compression package chaining module 701 is configured to obtain files to be shared and form a plurality of file compression packages; performing block chain chaining operation on the file compressed packet, and acquiring at least three first hash values corresponding to the file compressed packet from a block chain;
the upper hash value obtaining module 702 is configured to take the first hash value as a current hash value, and execute the following operations in a loop 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 use the current hash value as a root hash value, and send the root hash value.
Optionally, the file compression package uplink module 701 is further configured to obtain a file to be shared, and form a plurality of file compression packages, including: the method comprises the steps of obtaining files to be shared in a predefined time range, forming at least three file packages, and determining the number of the files in the file packages according to network bandwidth.
Optionally, the chain module 701 of the file compression package is further configured to perform compression and encryption operations on the file package respectively to form the file compression package.
Optionally, the uplink module 701 of the file compression package is further configured to perform a block chain 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 a file, including: acquiring an on-chain file module 801; wherein,
the obtain-chained file module 801 is configured to receive a current hash value; circularly executing the following steps until the file compression packet corresponding to the current hash value is obtained; determining that the block chain has a file compressed packet hash value which is the same as the current hash value, if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the block chain; 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 obtaining on-chain file module 801 is further configured to obtain a file compression package corresponding to the current hash value, where the obtaining includes: and acquiring a file compression packet corresponding to the current hash value, and performing decompression and decryption operations on the file compression packet to acquire files in the file compression packet.
An embodiment of the present invention further provides an electronic device for sharing a file, including: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are enabled to realize the method provided by any one of the above embodiments.
Embodiments of the present invention further provide a computer-readable medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method provided in any of the above embodiments.
Fig. 10 illustrates an exemplary system architecture 1000 to which the method of sharing files or the apparatus for sharing files of embodiments of the present invention may be applied.
As shown in fig. 10, the system architecture 1000 may include terminal devices 1001, 1002, 1003, a network 1004, and a server 1005. The network 1004 is used to provide a medium for communication links between the terminal devices 1001, 1002, 1003 and the server 1005. Network 1004 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 1001, 1002, 1003 to interact with a server 1005 via a network 1004 to receive or transmit messages or the like. Various client applications, such as an enterprise application client, a web browser application, a search-type application, an instant messenger, a mailbox client, etc., 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 the running of various client applications, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 1005 may be a server that provides various services, such as a background management server that supports a request for acquiring a file by a user with the terminal device 1001, 1002, 1003. The background management server can uplink and store the file to be shared, process the proposed request for acquiring the file, and return the file to the terminal device.
It should be noted that the method for sharing files provided by 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, shown is a block diagram of a computer system 1100 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 11 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 11, the computer system 1100 includes a Central Processing Unit (CPU)1101, which can perform various appropriate actions and processes in accordance with 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 necessary 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 portion 1106 including a keyboard, mouse, and the like; an output portion 1107 including a signal output unit such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and a speaker; a storage section 1108 including a hard disk and the like; and a communication section 1109 including a network interface card such as a LAN card, a modem, or the like. The communication section 1109 performs communication processing via a network such as the internet. A driver 1110 is also connected to the I/O interface 1105 as necessary. A removable medium 1111 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1110 as necessary, so that a computer program read out therefrom is mounted into the storage section 1108 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the 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 illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication portion 1109 and/or installed from the removable medium 1111. The above-described functions defined in the system of the present invention are executed when the computer program is executed by a Central Processing Unit (CPU) 1101.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination 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 present invention, 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, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. 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 flowchart 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 described in the embodiments of the present invention may be implemented by software, and may also be implemented by hardware. The described modules and/or units may also be provided in a processor, and may be described as: a processor comprises a file compression package chain module, a node hash value acquisition module and a root hash value acquisition module; the names of these modules do not constitute a limitation to the module itself in some cases, for example, the node hash value obtaining module may also be described as a "module that performs a blockchain chaining operation on a first hash value of a compressed file packet and obtains a second hash value from the blockchain". It can also be described as: a processor includes an acquire on-chain file module; for example, the module for obtaining the files on the chain may be further described as a "module for obtaining the hash value of the compressed file packet on the block chain according to the root hash value and obtaining the files included in the compressed file packet according to the hash value of the compressed file 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 separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: acquiring files to be shared to form a plurality of file compression packages; performing block chain chaining operation on the file compressed packet, and acquiring at least three first hash values corresponding to the file compressed packet from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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; circularly executing the following steps until the file compression packet corresponding to the current hash value is obtained; determining that the block chain has a file compressed packet hash value which is the same as the current hash value, if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the block chain; 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 of the embodiment of the invention, a plurality of files are compressed into the file compression package, so that the technical problem of overhigh network resource burden caused by large file quantity is partially solved, and the efficiency of chaining and sharing the files is improved by simultaneously chaining the file compression packages; the root hash value is stored and shared by using the bifurcated tree structure, and the shared file is obtained through the root hash value, so that the safety of the file is improved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection 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;
performing block chain chaining operation on the file compressed packet, and acquiring at least three first hash values corresponding to the file compressed packet from a block chain;
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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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,
acquiring a file to be shared to form a plurality of file compression packages, wherein the file compression packages comprise:
the method comprises the steps of obtaining files to be shared in a predefined time range, forming at least three file packages, and determining the number of the files in the file packages according to network bandwidth.
3. The method of claim 2,
and respectively executing compression and encryption operations on the file packet to form the file compression packet.
4. The method of claim 1,
and performing block chain concurrent uplink operation on the file compression package.
5. A method of sharing a file, comprising:
receiving a current hash value; circularly executing the following steps until the file compression packet corresponding to the current hash value is obtained;
determining that the block chain has a file compressed packet hash value which is the same as the current hash value, if so, executing A1; otherwise, executing A2;
a1: acquiring a file compression packet corresponding to the current hash value from the block chain;
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,
acquiring a file compression package corresponding to the current hash value, wherein the acquiring comprises:
and acquiring a file compression packet corresponding to the current hash value, and performing decompression and decryption operations on the file compression packet to acquire files in the file compression packet.
7. An apparatus for sharing files, comprising: the system comprises a file compression package chain module, a node hash value acquisition module and a root hash value acquisition module; wherein,
the file compression package chaining module is used for acquiring files to be shared and forming a plurality of file compression packages; performing block chain chaining operation on the file compressed packet, and acquiring at least three first hash values corresponding to the file compressed packet from a block chain;
the superior hash value obtaining module is configured to take the first hash value as a current hash value, and cyclically 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; 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 block chain chaining operation on the intermediate hash value, and acquiring a corresponding second hash value from a block chain; taking the second hash value as the current hash value; the set number is an integer greater than 2;
and the root hash value acquisition module is used for taking the current hash value as a root hash value and sending the hash value.
8. An apparatus for sharing files, comprising: acquiring a link file module; wherein,
the on-chain file obtaining module is used for receiving the current hash value; circularly executing the following steps until the file compression packet corresponding to the current hash value is obtained; determining that the block chain has a file compressed packet hash value which is the same as the current hash value, if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the current hash value from the block chain; 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 files of claim 7, and the apparatus for sharing files of claim 8.
10. An electronic device, comprising:
one or more processors;
a storage device 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 one of claims 1-4 or 5-6.
11. A computer-readable medium, on which a computer program is stored, which program, when being executed by a processor, is adapted to carry out the method of any one of claims 1-4 or 5-6.
Priority Applications (4)
| 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 |
| US18/040,467 US20240330242A1 (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 true CN111984614A (en) | 2020-11-24 |
| CN111984614B 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) |
Cited By (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 |
|---|
| 张桂鹏，匡振曦，陈平华: "一种采用签名与哈希技术的云存储去重方案", 《计算机工程与应用》 * |
| 翟社平，汪一景，陈思吉: "区块链技术在电子病历共享的应用研究", 《西安电子科技大学学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022028486A1 (en) * | 2020-08-04 | 2022-02-10 | 中国人民银行数字货币研究所 | File sharing method, device, and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111984614B (en) | 2023-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109729040B (en) | Method, apparatus and computer readable medium for selection of a protocol | |
| CN110572422B (en) | Data downloading method, device, equipment and medium | |
| CN113364795B (en) | Data transmission method and proxy server | |
| CN111460129A (en) | Method and device for generating identification, electronic equipment and storage medium | |
| CN111478781B (en) | Message broadcasting method and device | |
| CN110753020A (en) | Network request processing method and device | |
| US12086107B2 (en) | File sharing method, apparatus, and system | |
| CN112416396A (en) | Application program updating method and system | |
| CN110795328A (en) | Interface testing method and device | |
| CN111339206A (en) | Data sharing method and device based on block chain | |
| CN112131095A (en) | Pressure testing method and device | |
| CN111984614B (en) | Method, device and system for sharing files | |
| CN111984612B (en) | Method, device and system for sharing files | |
| CN111984613B (en) | Method, device and system for sharing files | |
| CN111984616B (en) | Method, device and system for updating shared file | |
| CN113778499A (en) | Method, device, equipment and computer readable medium for publishing service | |
| CN113283991B (en) | Processing method and device for transaction data on blockchain | |
| CN112257039B (en) | Identity attribute adding method and device and electronic equipment | |
| US20240330242A1 (en) | File sharing method, device, and system | |
| CN112559001A (en) | Method and device for updating application | |
| CN113472565B (en) | Method, apparatus, device and computer readable medium for expanding server function | |
| CN111835846B (en) | Information updating method and device and electronic equipment | |
| CN116743408A (en) | Distributed file sharing method and system based on block chain | |
| CN116955362A (en) | Task processing method and device | |
| CN118426947A (en) | Cluster resource processing method and device |
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 |