Reorganization of archives, method for reorganization of archives and archive management system

Abstract

The present invention relates to the field of information technology, and in particular to a reorganized archive, including several slice groups and item signatures, wherein the slice group includes slices, slice hash value sets, evidence hash values ​​and block heights, wherein the slices are obtained by cutting the original archive scans, and the hash values ​​of all slices of the archive scans constitute the slice hash value sets, and the hash values ​​of the slice hash values ​​are extracted, and uploaded to the blockchain as evidence hash values ​​for storage, and the slices are associated with field names, and the item signatures are signatures of the hash values, items and timestamps of all slices by a preset private key, and the slices corresponding to the field set are selected according to the search value and field set submitted by the archive user, and the hash value set, evidence hash value and block height of the corresponding slices are read to form a reorganized archive, and the archive user compares the evidence hash value stored on the blockchain, and then determines that the slice content is true. The beneficial effects of the present invention are: the cost of archive preservation is greatly reduced, and the scope of leakage of archive information is better controlled.

Description

Technical Field

[0001] The present invention relates to the field of information technology, and in particular to a reorganized archive, a method for reorganizing archive, and an archive management system. Background Art

[0002] Archives refer to original records of various forms with preservation value directly formed by people in various social activities. Original record is its essential attribute. For example, it can be used as evidence in case of disputes, and as qualification certificate or information basis when handling more matters. Because of the record and certificate attributes of archives, archives usually need to be kept in paper form. Not only does it require a special storage place, but it is also difficult to retrieve it again after storage. When handling affairs, it is usually necessary to prepare supporting materials again, resulting in repeated work. Therefore, it is necessary to study new archives and archive management plans.

[0003] For example, Chinese patent CN110584344A, published on December 20, 2019, is a paper archive management system that can solve the current problem of difficulty in finding archives after automatic storage. In addition, the archives have been put into storage and cannot be taken out or moved by themselves, which greatly facilitates future automated searches. Before putting into storage, image detection is performed first, so that users can see the appearance of the file first when looking for the file, which improves the speed of confirmation. At the same time, the size of the file can also be determined by the camera; the aging degree of the file is detected by a laser device, and timely reminders are given for old files to prevent the file from being damaged; in addition, two-step confirmation of weight is performed during storage to prevent the file from being stored in the wrong grid due to confusion; in addition, a corresponding automatically controlled document cabinet is designed, which can automatically control opening and closing, and has a simple structure. A monitoring device is also set according to the storage process, which is only turned on when the file is being processed, reducing the storage space for monitoring and making the monitoring more efficient. However, its technical solution still relies on the management of paper documents, which is not only costly but also inefficient. Summary of the invention

[0004] The technical problem to be solved by the present invention is that the current paper-based archives are stored and managed at high cost and low efficiency. A method for reorganizing archives and an archives management system are proposed, which can reduce the cost of archives storage and improve the efficiency of archives.

[0005] In order to solve the above technical problems, the technical solution adopted by the present invention is: a reorganized archive, including several slice groups and matter signatures, the slice group includes slices, slice hash value sets, evidence hash values ​​and block heights, the slices are obtained by cutting the original archive scan, the archive scan is cut into several slices, each slice contains at most one field area, the hash values ​​of all slices of the archive scan constitute a slice hash value set, the hash value of the slice hash value is extracted, and uploaded to the blockchain storage as the evidence hash value, and the corresponding block height is obtained. According to the type of the original archive scan, the cutting scheme and the search field are manually set, the field name of the corresponding field area is associated with the slice formed by the cutting scheme, and when the original archive scan is received, the archive is manually labeled The search key value is the value of the search field in the archive scan, and the slice is associated with the slice hash value set, the evidence hash value, the block height and the search key value for storage. The matter signature is the signature of the hash value, the handling matter and the timestamp of all slices by the preset private key. According to the search value and the field set contained in the archive request submitted by the archive user, from the slices of the archive scan whose search key values ​​meet the search value, the slice corresponding to the field set is selected, and the hash value set, the evidence hash value and the block height of the corresponding slice are read to form a reorganized archive. The archive user extracts the hash value of the slice, and after comparing it with the slice hash value set, the hash value of the slice hash value set is extracted, and after comparing it with the evidence hash value stored on the blockchain, it is determined that the content recorded in the slice is authentic.

[0006] Preferably, a hollow area is defined for each slice containing a field area of ​​each file type, an image of the hollow area is cut out as a patch, a hash value of the slice after the patch is taken out is extracted and included in a slice hash value set, the patch is copied multiple times, a watermark is added to each patch respectively, the watermark includes an item identifier and an N-bit hexadecimal number, the watermark traverses the combination of the item identifier and the N-bit character, the hash value of the patch after the watermark is added is extracted and recorded as the patch hash value, all the patch hash values ​​constitute a patch hash value set, the slice hash value set of the archive and the hash values ​​of multiple patch hash value sets are used as storage hash values, when establishing a reorganized archive, the patch corresponding to the watermark whose item identifier is consistent with the item to be handled and whose N-bit characters are the same as the N characters at the end of the item signature is selected to restore the slice, and the slice group also includes a patch hash value set.

[0007] Preferably, the sorting of N-bit characters is set, the sorting sequence number of the N-bit characters is obtained, and the offset function of the pixel offset of the watermark position relative to the upper left corner of the patch with respect to the sorting sequence number is set. When adding a watermark to the patch, the position to add the watermark is determined based on the pixel offset obtained by the offset function.

[0008] A method for reorganizing archives, used to generate a reorganized archive as described above, comprising: setting a cutting scheme and a search field for each archive type, wherein the cutting scheme includes a cutting position and a field name included in the slice; receiving an archive scan, cutting the archive scan according to the cutting scheme corresponding to the archive type, and obtaining a plurality of slices; associating the slices with corresponding field names, identifying the values ​​of the search fields in the archive scans, recording them as search key values, and associating the slices with the search key values; extracting the hash values ​​of the slices and incorporating them into a slice hash value set, extracting the hash values ​​of the slice hash value set as a storage hash value, uploading to a blockchain storage, and obtaining a corresponding block height; receiving an archive request sent by an archive user, wherein the archive request includes a matter to be handled, a search value, and a required field set, and verifying the requester After the identity is found, several archive scans whose search key value meets the search value are searched; from the slices of the several archive scans obtained by the search, the slice corresponding to the field set is selected, and the slice hash value set, the evidence hash value and the block height corresponding to the slice are obtained; the slice corresponding to the field set is placed in the blank image area, and an event signature is generated, which is a signature of the hash value, the event and the timestamp of all slices corresponding to the field set by a preset private key, and the event signature is displayed in the blank image area to form a reconstructed archive; the slice hash value set, the evidence hash value and the block height associated with the reconstructed archive are provided to the archive user; after the archive user verifies the event signature, the slice hash value and the evidence hash value, it is determined that the content recorded in the slice is authentic, that is, the reconstructed archive is authentic.

[0009] Preferably, a hollow area is defined for each slice containing a field area of ​​each file type; after receiving a scanned copy of the file and cutting it to obtain a slice, an image of the slice in the hollow area is cut out as a patch, and a hash value of the slice after the patch is taken out is extracted and included in a slice hash value set; the patch is copied multiple times, and a watermark is added to each patch respectively, wherein the watermark includes an item identifier and an N-bit hexadecimal number, and the watermark traverses a combination of the item identifier and the N-bit character; the hash value of the patch after the watermark is added is extracted and recorded as the patch hash value, and all the patch hash values ​​constitute a patch hash value set; the slice hash value set of the file and the hash values ​​of multiple patch hash value sets are used as storage hash values; when establishing a reorganized file, the patch corresponding to the watermark whose item identifier is consistent with the item to be handled and whose N-bit characters are the same as the N characters at the end of the item signature is selected to restore the slice, and the slice group also includes a patch hash value set.

[0010] Preferably, the sorting of N-bit characters is set to obtain the sorting sequence number of the N-bit characters; an offset function of the pixel offset of the watermark position relative to the upper left corner of the patch with respect to the sorting sequence number is set; when adding a watermark to the patch, the adding position of the watermark is determined according to the pixel offset obtained by the offset function.

[0011] A file management system, used to execute the above-mentioned method for reorganizing files, comprises a file receiving module, a file evidence module, a file storage module and a file reorganization module, wherein the file receiving module receives a file scan, cuts the file scan into a plurality of slices according to a manually set cutting scheme and a search field, obtains the value of the search field in the file scan, and records it as a search key value, wherein the file evidence module extracts the hash value of the slice and incorporates it into a slice hash value set, extracts the hash value of the slice hash value set as the evidence hash value, uploads the evidence hash value to the blockchain storage, obtains the corresponding block height, and the file storage module associates the slice of the file scan with the slice hash value set, the evidence hash value, the block height and the search key value for storage, and the file reorganization module receives the file request of the file user, and the The archive request includes matters to be handled, search values ​​and required field sets. After verifying the identity of the requester, the archive reorganization module searches for several archive scans whose search key values ​​meet the search values, selects slices corresponding to the field set from the slices of the several archive scans obtained by the search, places the slices corresponding to the field set in a blank image area, generates a matter signature, and the matter signature is a signature of a preset private key on the hash values, matters to be handled and timestamps of all slices corresponding to the field set. The matter signature is displayed in the blank image area to form a reorganized archive, and the reorganized archive-associated slice hash value set, the evidence hash value and the block height are provided to the archive user. After verifying the matter signature, the slice hash value and the evidence hash value, the archive user determines that the content recorded in the slice is authentic and reliable, that is, the reorganized archive is deemed authentic and reliable.

[0012] Preferably, a hollow area is manually demarcated for each slice containing a field area of ​​each file type, and the hollow position is stored by the file receiving module. The file receiving module cuts out the image of the hollow area as a patch, and the file receiving module copies the patch multiple times, and adds a watermark on each patch respectively. The watermark includes an event identifier and an N-bit hexadecimal number, and the watermark traverses the combination of the event identifier and the N-bit character. The evidence storage module extracts the hash value of the slice after the patch is taken out and incorporates it into the slice hash value set. The evidence storage module extracts the hash value of the patch after adding the watermark, which is recorded as the patch hash value. All patch hash values ​​constitute the patch hash value set. The slice hash value set of the file and the hash values ​​of multiple patch hash value sets are used as storage hash values. When the file reorganization module establishes the reorganized file, it selects the patch corresponding to the watermark whose event identifier is consistent with the event to be handled and whose N-bit characters are the same as the N characters at the end of the event signature to restore the slice. The slice group also includes the patch hash value set.

[0013] Preferably, the file receiving module sets the sorting of N-bit characters and obtains the sorting sequence number of the N-bit characters. The file receiving module stores the offset function of the patch watermark, and the offset function is a function of the pixel offset of the watermark position relative to the upper left corner of the patch with respect to the sorting sequence number. When the file receiving module adds a watermark to the patch, the watermark adding position is determined according to the pixel offset obtained by the offset function.

[0014] The substantial effect of the present invention is as follows: by using blockchain to store archive scans, authenticity proof is provided for archive scans, so that electronic archive scans also have the effect of vouchers, thereby eliminating the need to preserve paper copies and greatly reducing the cost of archive preservation; by reorganizing archives, vouchers can be provided for handling matters, while at the same time, content that is not required for handling matters can continue to be hidden, which can better control the scope of leakage of archive information. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 , 2 This is a schematic diagram of a file scan in Example 1.

[0016] Figure 3 This is a schematic diagram of file reorganization in Example 1.

[0017] Figure 4 Schematic diagram of the file reorganization method according to Embodiment 1.

[0018] Figure 5 Schematic diagram of the archive management system of Example 1.

[0019] Figure 6 This is a schematic diagram of the patch of Example 2.

[0020] Figure 7 This is a schematic diagram of the watermark of the patch in Example 2.

[0021] Figure 8 This is a schematic diagram of the reorganization file in Example 2.

[0022] Fig. 9 This is a schematic diagram of the file reorganization method of Example 2.

[0023] Among them: 10. Blockchain, 11. Slice, 12. Field area, 13. Slice hash value set, 14. Evidence hash value, 15. Reorganized archive, 16. Item signature, 17. Patch, 18. Offset, 19. Slice watermark, 20. Archive receiving module, 30. Archive evidence module, 40. Archive storage module, 50. Archive reorganization module. DETAILED DESCRIPTION

[0024] The specific implementation of the present invention will be further described below through specific examples in conjunction with the accompanying drawings.

[0025] Embodiment 1:

[0026] A reorganized file, including a plurality of slices 11 groups and event signatures 16, wherein the slice 11 group includes a slice 11, a slice hash value set 13, a certificate hash value 14 and a block height, see the attached Figure 1 and attached Figure 2 , the slice 11 is obtained by cutting the original archive scan, the archive scan is cut into several slices 11, each slice 11 contains at most one field area 12, the hash values ​​of all slices 11 of the archive scan constitute a slice hash value set 13, the hash value of the hash value of the slice 11 is extracted, and uploaded to the blockchain 10 for storage as the evidence hash value 14, as shown in Table 1, the corresponding block height is obtained, according to the type of the original archive scan, the cutting scheme and the search field are manually set, and the field name of the corresponding field area 12 is associated with the slice 11 formed by the cutting scheme. When receiving the original archive scan, the archive search key value is manually marked, and the search key value is the value of the search field in the archive scan. The slice 11 is associated with the slice hash value set 13, the evidence hash value 14, the block height and the search key value for storage, and the matter signature 16 is the signature of the hash value, the handling matter and the timestamp of all slices 11 by the preset private key. Please refer to the attached Figure 3 , according to the search value and field set contained in the archive request submitted by the archive user, select the slice 11 corresponding to the field set from the slices 11 of the archive scans whose search key values ​​meet the search value, read the hash value set, the evidence hash value 14 and the block height of the corresponding slice 11, and form a reconstructed archive 15.

[0027] Table 1 Slice hash value set 13 and evidence hash value 14

[0028] Slice 111 HASH(Zone1) = E641D3…2E2EB5 Slice 112 HASH(Zone2) = EE56AE…6B76AB Slice 113 HASH(Zone3) = CEDC92…E08B2D … … Slice 118 HASH(Zone8) = FA7296…5F319B Evidence hash value 14 HASH({HASH(Zone1),…, HASH(Zone8)})= FC8309…AE787B

[0029] The archive user extracts the hash value of slice 11, and after comparing it with slice hash value set 13, extracts the hash value of slice hash value set 13, and compares it with the evidence hash value 14 stored on blockchain 10, it is determined that the content recorded in slice 11 is authentic.

[0030] like Figure 1 and Figure 2 The two scanned files contain the fields 12 of monthly income, education and professional title. When registering for holiday benefits, the content of benefits needs to be determined based on monthly income, education and professional title. According to the prior art, it is necessary to re-register the relevant information of the target population, resulting in low efficiency and increased workload. Figure 1 and Figure 2 The corresponding slices 11 are obtained from the two files and the following is established: Figure 3The reorganized file 15 shown. The reorganized file 15 contains all the fields required for handling matters. At the same time, other information recorded in the original scanned file can be hidden. The use of blockchain 10 to store evidence can prove the authenticity of the slice 11 and has the effect of a voucher. That is, it can be used to handle matters and at the same time control the scope of information diffusion.

[0031] A method for reorganizing the file 15 is used to generate the reorganized file 15 as described above, see the attached Figure 4 , including: step A01) setting a cutting scheme and a search field for each file type, the cutting scheme including a cutting position and a field name included in a slice 11; step A02) receiving a scanned file, cutting the scanned file according to the cutting scheme corresponding to the file type, and obtaining a plurality of slices 11; step A03) associating the slice 11 with the corresponding field name, identifying the value of the search field in the scanned file, recording it as a search key value, and associating the slice 11 with the search key value; step A04) extracting the hash value of the slice 11 and incorporating it into a slice hash value set 13, extracting the hash value of the slice hash value set 13 as a storage hash value 14, uploading it to the blockchain 10 for storage, and obtaining the corresponding block height; step A05) receiving a file request sent by a file user, the file request including a matter to be handled, a search value, and a required field set, and after verifying the identity of the requester, finding a plurality of search keys that match the search value. Scanned archive; Step A06) Select the slice 11 corresponding to the field set from the slices 11 of the scanned archive obtained by searching, and obtain the slice hash value set 13, the evidence hash value 14 and the block height corresponding to the slice 11; Step A07) Place the slice 11 corresponding to the field set in the blank image area, generate the matter signature 16, the matter signature 16 is the signature of the preset private key on the hash value, the handling matter and the timestamp of all the slices 11 corresponding to the field set, and display the matter signature 16 in the blank image area to form a reconstructed archive 15; Step A08) Provide the reconstructed archive 15 with the associated slice hash value set 13, the evidence hash value 14 and the block height to the archive user; Step A09) After the archive user verifies the matter signature 16, the slice 11 hash value and the evidence hash value 14, it is determined that the content recorded in the slice 11 is authentic, that is, the reconstructed archive 15 is authentic.

[0032] A file management system is used to execute the method of reorganizing the file 15 as described above, see the attached Figure 5, including an archive receiving module 20, an archive evidence module 30, an archive storage module 40 and an archive reorganization module 50. The archive receiving module 20 receives the archive scan, cuts the archive scan into several slices 11 according to the manually set cutting scheme and search field, obtains the value of the search field in the archive scan, and records it as the search key value. The archive evidence module 30 extracts the hash value of the slice 11 and incorporates it into the slice hash value set 13, extracts the hash value of the slice hash value set 13 as the evidence hash value 14, uploads the evidence hash value 14 to the blockchain 10 for storage, and obtains the corresponding block height. The archive storage module 40 associates the slice 11 of the archive scan with the slice hash value set 13, the evidence hash value 14, the block height and the search key value for storage. The archive reorganization module 50 receives the archive request of the archive user, and the archive request includes the handling matters, the search value and the required field set, after the archive reorganization module 50 verifies the identity of the requester, it searches for several archive scans whose retrieval key value matches the retrieval value, selects the slice 11 corresponding to the field set from the slices 11 of the several archive scans obtained by the search, places the slice 11 corresponding to the field set in the blank image area, generates an event signature 16, and the event signature 16 is a signature of the hash value, the event and the timestamp of all the slices 11 corresponding to the field set by the preset private key, displays the event signature 16 in the blank image area, constitutes a reorganized archive 15, and provides the reorganized archive 15 with the associated slice hash value set 13, the evidence hash value 14 and the block height to the archive user. After the archive user verifies the event signature 16, the slice 11 hash value and the evidence hash value 14, it determines that the content recorded in the slice 11 is authentic, that is, the reorganized archive 15 is authentic.

[0033] The beneficial technical effect of this embodiment is: by using the blockchain 10 to store the archive scans, the authenticity of the archive scans is proved, so that the electronic archive scans also have the effect of vouchers, so there is no need to save paper copies, which greatly reduces the cost of archive preservation; by reorganizing the archives 15, it is possible to provide vouchers for handling matters, while at the same time allowing the content that is not required for the handling of matters to continue to be hidden, so that the scope of leakage of archive information can be better controlled.

[0034] Embodiment 2:

[0035] A reorganized file 15, based on the first embodiment, this embodiment provides a higher security for the reorganized file 15 through an improved solution, please refer to the attached Figure 6In this embodiment, a hollow area is defined for each slice 11 of each file type that includes a field area 12, an image of the hollow area is cut out as a patch 17, a hash value of the slice 11 after the patch 17 is taken out is extracted and included in a slice hash value set 13, the patch 17 is copied multiple times, a watermark is added to each patch 17, the watermark includes an event identifier and an N-bit hexadecimal number, the watermark traverses the combination of the event identifier and the N-bit character, the hash value of the patch 17 after the watermark is added is extracted and recorded as a patch hash value, all the patch hash values ​​constitute a patch hash value set, the slice hash value set 13 of the file and the hash values ​​of multiple patch hash value sets are used as storage hash values, when establishing a reorganized file 15, the event identifier is consistent with the event to be handled, and the patch 17 corresponding to the watermark whose N-bit character is the same as the N-bit character at the end of the event signature 16 is selected to restore the slice 11, and the slice 11 group also includes a patch hash value set.

[0036] A watermark is added to the patch 17, and the watermark includes the matter and 3 characters. Since the value range of the characters of the signature includes uppercase and lowercase letters, numbers, the symbol +, the symbol / and the symbol =, with a total of 65 possible values, the end of the signature is usually fixed to =. This embodiment does not specify whether the symbol = at the end is included in the N characters at the end of the matter signature 16. This is because if the symbol = is not included in the N at the end of the matter signature 16, a better technical effect will be achieved. If it is included, although the technical effect is reduced, it does not affect the implementation. When recording 6 possible matters, it is necessary to establish 6*65^3=1647750 watermarks, generate 1647750 patches 17, and extract the hash value of each patch 17. The hash value takes up little storage space. And there is no need to store all 1647750 watermarked patches 17. After generating a watermarked patch 17 and extracting the hash value, the watermarked patch 17 can be deleted. It is only necessary to keep all the patch hash values ​​and one patch 17 without the watermark, and record the location where the watermark is added once. Since the text content of the watermark can be derived, after recording the location where the watermark is added, the derived watermark text content can be added to the patch 17 according to the location where the watermark is added. Therefore, the storage space consumed is not large. Similarly, in addition to the location where the watermark is added, the font, font size, transparency, rotation center and rotation angle of the watermark text can also be recorded. Since it only needs to be recorded once, it will not cause a large amount of storage space to be used during implementation.

[0037] Please see attached Figure 7 , set the sorting of N-bit characters, obtain the sorting number of N-bit characters, set the pixel offset 18 of the watermark position relative to the upper left corner of the patch 17 and the offset function of the sorting number, and when adding a watermark to the patch 17, determine the adding position of the watermark according to the pixel offset 18 obtained by the offset function. By setting the pixel offset, it is prevented that the file user can infer the adding method of the watermark and add the watermark by himself. It can prevent the patch 17 from being forged.

[0038] Slice 11 records the content of field area 12 separately, and there is a problem that the owner of field area 12 cannot be determined. To this end, this embodiment provides the following solution. Add a slice watermark 19 to each slice 11 containing field area 12. Slice watermark 19 records several search key values, and then extract the hash value of slice 11 and include it in slice hash value set 13. Please refer to the attached Figure 8 . The slice 11 with the slice watermark 19 can clearly identify the owner of the archive to which it belongs, and will not cause the problem of misidentification in the reorganized archive 15. When this solution is not implemented, the slices 11 in the reorganized archive 15 belong to the same owner, which is guaranteed by the reputation of the institution that established the reorganized archive 15. In addition, when uploading the evidence hash value 14 to the blockchain 10, associating the evidence hash value 14 with the corresponding retrieval key value and uploading them together to the blockchain 10 for storage can also ensure that the slices 11 belong to the same owner. When a slice 11 in the reorganized archive 15 is cut from a scanned copy of someone else's archive, verifying the slice hash value set 13 and the evidence hash value 14 of the slice 11 can reveal from the blockchain 10 that the retrieval key value associated with the evidence hash value 14 does not match.

[0039] A method for reorganizing a file 15, based on the first embodiment, this embodiment proposes a further improvement. Fig. 9 , including: step B01) defining a hollow area for each slice 11 containing a field area 12 of each file type; step B02) after receiving the scanned file and cutting to obtain the slice 11, cutting out the image of the slice 11 in the hollow area as a patch 17, extracting the hash value of the slice 11 after taking out the patch 17 and including it in the slice hash value set 13; step B03) copying the patch 17 multiple times, adding a watermark to each patch 17, the watermark including the event identifier and N hexadecimal numbers, the watermark traversing the event identifier and N bit characters; step B04) extracting the hash value of the patch 17 after adding the watermark, recorded as the patch hash value, all the patch hash values ​​constitute a patch hash value set; step B05) the slice hash value set 13 of the archive and the hash values ​​of multiple patch hash value sets are used as storage hash values; step B06) when establishing the reorganized archive 15, select the patch 17 corresponding to the watermark whose item identifier is consistent with the item to be handled and whose N-bit characters are the same as the last N characters of the item signature 16 to restore the slice 11, and the slice 11 group also includes the patch hash value set.

[0040] Set the sorting of N-bit characters and obtain the sorting sequence number of the N-bit characters; set the pixel offset 18 of the watermark position relative to the upper left corner of the patch 17 with respect to the offset function of the sorting sequence number; when adding a watermark to the patch 17, determine the adding position of the watermark according to the pixel offset 18 obtained by the offset function.

[0041] A file management system, manually demarcates a hollow area for each slice 11 containing a field area 12 of each file type, the hollow position is stored by a file receiving module 20, the file receiving module 20 cuts out an image of the hollow area as a patch 17, the file receiving module 20 copies the patch 17 multiple times, adds a watermark to each patch 17, the watermark includes an event identifier and an N-bit hexadecimal number, the watermark traverses the combination of the event identifier and the N-bit character, the evidence storage module extracts the hash value of the slice 11 after the patch 17 is taken out and incorporates it into a slice hash value set 13, the evidence storage module extracts the hash value of the patch 17 after the watermark is added, and records it as a patch hash value, all the patch hash values ​​constitute a patch hash value set, the slice hash value set 13 of the file and the hash values ​​of multiple patch hash value sets are used as storage hash values, when the file reorganization module 50 establishes a reorganized file 15, selects the patch 17 corresponding to the watermark whose event identifier is consistent with the event to be handled and whose N-bit characters are the same as the N characters at the end of the event signature 16 to restore the slice 11, and the slice 11 group also includes the patch hash value set.

[0042] The file receiving module 20 sets the sorting of N-bit characters and obtains the sorting sequence number of the N-bit characters. The file receiving module 20 stores the offset function of the watermark of the patch 17. The offset function is a function of the pixel offset 18 of the watermark position relative to the upper left corner of the patch 17 and the sorting sequence number. When the file receiving module 20 adds a watermark to the patch 17, the watermark adding position is determined according to the pixel offset 18 obtained by the offset function.

[0043] Compared with the first embodiment, this embodiment adds a sticker 17 and adds a watermark associated with the handling matter on the sticker 17, so as to prevent the shared reorganized file 15 from being maliciously reused, causing information leakage or wrong handling of matters.

[0044] The above-described embodiment is only a preferred solution of the present invention and does not limit the present invention in any form. There are other variations and modifications without exceeding the technical solution described in the claims.

Claims

1. A reorganization file, characterized in that: It includes several slice groups and transaction signatures. The slice group includes slices, slice hash value sets, evidence hash values ​​and block heights. The slice is obtained by cutting the original archive scan, and the archive scan is cut into several slices, each slice contains at most one field area, and the hash values ​​of all slices of the archive scan constitute a slice hash value set. The hash value of the slice hash value is extracted and uploaded to the blockchain storage as the evidence hash value to obtain the corresponding block height. According to the type of the original archive scan, manually set the cutting plan and search field, and associate the field name of the corresponding field area with the slice formed by the cutting plan. When receiving the original archive scan, manually mark the archive's search key value, which is the value of the search field in the archive scan, and store the slice associated with the slice hash value set, the evidence hash value, the block height and the search key value. The transaction signature is a signature of the hash value, transaction items and timestamp of all slices by the preset private key. According to the search value and field set contained in the archive request submitted by the archive user, a slice corresponding to the field set is selected from the slices of the archive scans whose search key values ​​match the search value, and the hash value set, the evidence hash value and the block height of the corresponding slice are read to form a reorganized archive. The archive user extracts the hash value of the slice, compares it with the slice hash value set, and then extracts the hash value of the slice hash value set, and compares it with the hash value of the evidence stored on the blockchain, then it is determined that the content recorded in the slice is authentic; For each slice containing a field area of ​​each file type, a hollow area is defined, an image of the hollow area is cut out as a patch, and the hash value of the slice after the patch is taken out is extracted and included in the slice hash value set. The patch is copied multiple times, and a watermark is added to each patch respectively. The watermark includes an event identifier and an N-bit hexadecimal number. The watermark traverses the combination of the event identifier and the N-bit character, and the hash value of the patch after adding the watermark is extracted and recorded as the patch hash value. All patch hash values ​​constitute a patch hash value set. The slice hash value set of the archive and the hash values ​​of multiple patch hash value sets are used as storage hash values. When establishing a reorganized archive, the patch corresponding to the watermark whose event identifier is consistent with the event to be handled and whose N-bit character is the same as the last N-bit character of the event signature is selected to restore the slice. The slice group also includes the patch hash value set.

2. A reorganized file according to claim 1, characterized in that: Set the sorting of N-bit characters, obtain the sorting sequence number of N-bit characters, set the offset function of the pixel offset of the watermark position relative to the upper left corner of the patch about the sorting sequence number, and when adding a watermark to the patch, determine the adding position of the watermark according to the pixel offset obtained by the offset function.

3. A method for reorganizing a file, for generating a reorganized file as claimed in claim 1 or 2, characterized in that: include: Setting a cutting scheme and a search field for each file type, wherein the cutting scheme includes a cutting position and a field name included in the slice; Receive the scanned file, cut it according to the cutting plan corresponding to the file type, and obtain several slices; Associate the slice with the corresponding field name, identify the value of the search field in the archive scan, record it as the search key value, and associate the slice with the search key value; Extract the hash value of the slice and include it in the slice hash value set. Extract the hash value of the slice hash value set as the evidence hash value, upload it to the blockchain storage, and obtain the corresponding block height. Receive a file request sent by a file user, the file request including a matter to be handled, a search value and a required field set, and after verifying the identity of the requester, search for a number of file scans whose search key value matches the search value; From the slices of several archive scans obtained by searching, select the slice corresponding to the field set, and obtain the slice hash value set, evidence hash value and block height corresponding to the slice; Place the slices corresponding to the field set in the blank image area, generate a signature for the matter, which is a signature of the preset private key on the hash value, the matter and the timestamp of all the slices corresponding to the field set, and display the signature in the blank image area to form a reconstructed archive; Providing the reorganized file-associated slice hash value set, the evidence hash value, and the block height to the file user; After the archive user verifies the signature of the event, the slice hash value and the evidence hash value, he / she determines that the content recorded in the slice is authentic and reliable, and thus determines that the reconstructed archive is authentic and reliable.

4. A method for reorganizing files according to claim 3, characterized in that: Delimit hollowed-out areas for each slice containing field areas for each file type; After receiving the archive scan and cutting to obtain slices, cut out the image of the slice in the hollow area as a patch, extract the hash value of the slice after taking out the patch and include it in the slice hash value set; Copy the patch multiple times, and add a watermark on each patch, wherein the watermark includes an event identifier and an N-digit hexadecimal number, and the watermark traverses a combination of the event identifier and the N-digit character; Extract the hash value of the patch after adding the watermark, record it as the patch hash value, and all the patch hash values ​​constitute a patch hash value set; The hash values ​​of the slice hash value set and the plurality of patch hash value sets of the archive are used as storage hash values; When establishing a reorganized file, the patch recovery slice corresponding to the watermark whose item identifier is consistent with the item to be handled and whose N-bit characters are the same as the last N-bit characters of the item signature is selected, and the slice group also includes a patch hash value set.

5. A method for reorganizing files according to claim 4, characterized in that: Set the sorting of N-bit characters and obtain the sorting sequence number of N-bit characters; Set the pixel offset of the watermark position relative to the upper left corner of the patch with respect to the offset function of the sorting sequence number; When adding a watermark to a patch, the location where the watermark is added is determined according to the pixel offset obtained by the offset function.

6. A file management system for executing the file reorganization method according to any one of claims 3 to 5, characterized in that: It includes archive receiving module, archive evidence storage module, archive storage module and archive reorganization module. The archive receiving module receives the archive scan, cuts the archive scan into several slices according to the manually set cutting scheme and search field, obtains the value of the search field in the archive scan, and records it as the search key value. The archive evidence module extracts the hash value of the slice and incorporates it into the slice hash value set, extracts the hash value of the slice hash value set as the evidence hash value, uploads the evidence hash value to the blockchain storage, and obtains the corresponding block height. The archive storage module associates the slice of the archive scan with the slice hash value set, the evidence hash value, the block height and the search key value for storage. The archive reorganization module receives the archive request of the archive user, and the archive request includes the handling items, the search value and the required field set. The archive reorganization module receives the archive request of the archive user, and the archive request includes the handling items, the search value and the required field set. After the group module verifies the identity of the requester, it searches for several archive scans whose search key values ​​match the search value, selects the slices corresponding to the field set from the slices of the several archive scans obtained from the search, places the slices corresponding to the field set in the blank image area, and generates a matter signature, which is a signature of the hash value, the matter and the timestamp of all slices corresponding to the field set by a preset private key. The matter signature is displayed in the blank image area to form a reconstructed archive, and the hash value set of slices associated with the reconstructed archive, the evidence hash value and the block height are provided to the archive user. After the archive user verifies the matter signature, the slice hash value and the evidence hash value, he determines that the content recorded in the slice is authentic, that is, the reconstructed archive is deemed authentic.

7. A file management system according to claim 6, characterized in that: A hollow area is manually demarcated for each slice containing a field area of ​​each file type, and the hollow position is stored by the file receiving module. The file receiving module cuts out the image of the hollow area as a patch. The file receiving module copies the patch multiple times and adds a watermark to each patch. The watermark includes an event identifier and an N-bit hexadecimal number. The watermark traverses the combination of the event identifier and the N-bit character. The file storage module extracts the hash value of the slice after the patch is taken out and incorporates it into the slice hash value set. The file storage module extracts the hash value of the patch after adding the watermark, which is recorded as the patch hash value. All patch hash values ​​constitute the patch hash value set. The slice hash value set of the file and the hash values ​​of multiple patch hash value sets are used as storage hash values. When the file reorganization module establishes the reorganized file, it selects the patch corresponding to the watermark whose event identifier is consistent with the event to be handled and whose N-bit character is the same as the N-bit character at the end of the event signature to restore the slice. The slice group also includes the patch hash value set.

8. A file management system according to claim 7, characterized in that: The file receiving module sets the sorting of N-bit characters and obtains the sorting sequence number of the N-bit characters. The file receiving module stores the offset function of the watermark, which is a function of the pixel offset of the watermark position relative to the upper left corner of the patch with respect to the sorting sequence number. When the file receiving module adds a watermark to the patch, the watermark adding position is determined according to the pixel offset obtained by the offset function.

Images