A method and storage medium for sharing government data

Abstract

This invention discloses a method and storage medium for sharing government data, belonging to the field of data processing technology. This invention queries similar government data corresponding to the government data to be uploaded, and analyzes whether the current uploading user has the upload permission for the government data to be uploaded by comparing the user information of the uploading user of the similar government data with the user information of the current uploading user. This prevents users from uploading restricted shared data of other departments through their own user terminals, which could lead to the data being leaked to departments without the necessary permissions.

Description

Technical Field

[0001] This invention relates to the field of data processing technology, and in particular to a method and storage medium for sharing government data. Background Technology

[0002] Government data sharing is of paramount importance in modern government governance and social development. It can not only improve government efficiency and transparency, but also promote social innovation, economic development, and the improvement of the quality of public services.

[0003] In government data sharing, shareable data does not necessarily mean that it can be shared with all departments and all personnel. Often, some shareable data is restricted to specific departments. In the current technology, simply setting different access permissions for different users for each data does not prevent users in other departments with access permissions from uploading the data to the sharing platform through their own user terminals, resulting in leakage to departments without access permissions. Summary of the Invention

[0004] To address the technical problems existing in the prior art, this invention provides a method for sharing government data, comprising the following steps:

[0005] Configuration steps: Configure user information for each user, including department information and job level;

[0006] Data upload steps:

[0007] S1. Obtain the government data to be uploaded and query whether there is similar government data in the sharing platform. If it exists, execute S2. If it does not exist, upload the government data to be uploaded to the sharing platform and set access permission information.

[0008] S2. Obtain the user information of the user who uploaded the similar government data, and compare it with the user information of the current uploader. Analyze whether the current uploader has the upload permission for the government data to be uploaded. If it does, then execute S3.

[0009] S3. Analyze whether the uploaded government data is updated data of the corresponding similar government data. If so, send the uploaded government data to the upload user of the corresponding similar government data to confirm whether it has been updated. If the update is confirmed, upload the uploaded government data to the sharing platform to update the similar government data. The access permission information of the uploaded government data is the same as that of the corresponding similar government data.

[0010] Data access steps: The sharing platform obtains the access instruction of the current user, determines whether the user information of the current user meets the access permission information of the government data to be accessed, and if it does, the sharing platform encrypts the government data to be accessed and encapsulates it into a data packet and sends it to the user's client. The user's client decrypts the data packet to obtain the government data to be accessed.

[0011] Furthermore, the query and sharing platform determines whether there is similar government data corresponding to the government data to be uploaded, specifically:

[0012] Obtain the preset content tags and data collection information of the government data to be uploaded, and compare them with the government data in the sharing platform. If the corresponding preset content tags and data collection information are the same as the government data to be uploaded, then the corresponding government data is the similar government data to the government data to be uploaded.

[0013] Furthermore, the analysis of whether the currently uploading user has the upload permission for the government data to be uploaded specifically involves:

[0014] When the department information of the user who uploaded the similar government data is consistent with the department information of the current uploader, and the rank of the current uploader is greater than or equal to the rank of the user who uploaded the similar government data, then the current uploader has the upload permission for the government data to be uploaded.

[0015] Furthermore, the analysis of whether the uploaded government data is updated data of corresponding similar government data specifically includes:

[0016] The values ​​of each major data item in the government data to be uploaded are compared with the values ​​of each major data item in the corresponding similar government data. The analysis is conducted to determine whether there are major data items with different values. If so, the uploaded government data is determined to be updated data of the corresponding similar government data.

[0017] Furthermore, the access permission information includes the department authorized to grant access and the corresponding authorized access rank.

[0018] Furthermore, the step of determining whether the user information of the currently accessing user matches the access permission information of the government data to be accessed specifically involves:

[0019] If the department information of the current user belongs to the authorized access department, and the job level of the current user belongs to the corresponding authorized access job level in the authorized access department, then the user information of the current user meets the access permission information of the government data to be accessed.

[0020] Furthermore, the access instruction includes the public key of the current accessing user and the access time, wherein the access time includes the current access time and the last historical access time;

[0021] The sharing platform encrypts and encapsulates the government data to be accessed into a data packet before transmitting it to the user's client. Specifically, this includes:

[0022] X11. The sharing platform uses its own private key to calculate and obtain the original digital signature of the government data to be accessed.

[0023] X12. The sharing platform will divide the government data to be accessed into multiple first data blocks, and then sort them in sequence to form a data block sequence.

[0024] X13. The sharing platform randomly generates a symmetric session key, encrypts each first data block into a first ciphertext block, and forms an initial ciphertext block sequence according to the order of the data block sequence.

[0025] X14. Determine the parity of the current access time and the last access time in history;

[0026] X15. Based on the parity of the last access time in history, extract the ciphertext blocks at odd / even positions in the initial ciphertext block sequence and arrange them sequentially at the end of the sequence to form the first ciphertext block sequence. Then, based on the parity of the current access time, extract the ciphertext blocks at odd / even positions in the first ciphertext block sequence and arrange them sequentially at the end of the sequence to form the final ciphertext block sequence.

[0027] X16. The sharing platform uses the public key of the currently accessing user to perform asymmetric encryption on the symmetric session key to obtain the second ciphertext;

[0028] X17. The sharing platform encapsulates the original digital signature, the sharing platform public key, the final ciphertext block sequence, and the second ciphertext into a data packet and transmits it to the user's client.

[0029] Furthermore, the determination of the parity of the current access time and the last historical access time specifically involves:

[0030] If the number of even-numbered information readings is the largest among all information readings at the current access time, then the current access time is even; otherwise, it is odd. If the number of even-numbered information readings is the largest among all information readings at the last historical access time, then the current access time is even; otherwise, it is odd. The information readings include year readings, month readings, day readings, hour readings, minute readings, and second readings.

[0031] Furthermore, the user terminal of the currently accessing user decrypts the data packet to obtain the government data to be accessed, including restoring the final ciphertext block sequence to the first ciphertext block sequence based on the parity of the current access time, and then restoring the first ciphertext block sequence to the initial ciphertext block sequence based on the parity of the last historical access time, specifically:

[0032] Obtain the number of ciphertext blocks n in the final ciphertext block sequence;

[0033] If n is even:

[0034] In the final ciphertext block sequence, if the current access time is even, then the first ciphertext block of the previous n / 2 ciphertext blocks is used as the first block of the sequence, and the next n / 2 ciphertext blocks are inserted into the previous n / 2 ciphertext blocks in turn to restore the first ciphertext block sequence. If the current access time is odd, then the first ciphertext block of the next n / 2 ciphertext blocks is used as the first block of the sequence, and the previous n / 2 ciphertext blocks are inserted into the next n / 2 ciphertext blocks in turn to restore the first ciphertext block sequence.

[0035] In the first ciphertext block sequence, if the last access time in history is even, then the first ciphertext block of the previous n / 2 ciphertext blocks is used as the first block of the sequence, and the next n / 2 ciphertext blocks are inserted into the previous n / 2 ciphertext blocks in turn to restore the initial ciphertext block sequence. If the last access time in history is odd, then the first ciphertext block of the next n / 2 ciphertext blocks is used as the first block of the sequence, and the previous n / 2 ciphertext blocks are inserted into the next n / 2 ciphertext blocks in turn to restore the initial ciphertext sequence.

[0036] If n is odd:

[0037] In the final ciphertext block sequence, if the current access time is even, then the first ciphertext block of the previous ((n+1) / 2 ciphertext blocks is taken as the first block of the sequence, and the next ((n-1) / 2 ciphertext blocks are inserted into the previous (n+1) / 2 ciphertext blocks in turn to restore the first ciphertext block sequence. If the current access time is odd, then the first ciphertext block of the next (n+1) / 2 ciphertext blocks is taken as the first block of the sequence, and the previous (n-1) / 2 ciphertext blocks are inserted into the next (n+1) / 2 ciphertext blocks in turn to restore the first ciphertext block sequence.

[0038] In the first ciphertext block sequence, if the last access time is even, the first ciphertext block of the previous (n+1) / 2 ciphertext blocks is used as the first block of the sequence, and the next (n-1) / 2 ciphertext blocks are inserted into the previous (n+1) / 2 ciphertext blocks in turn to restore the initial ciphertext block sequence. If the last access time is odd, the first ciphertext block of the next (n+1) / 2 ciphertext blocks is used as the first block of the sequence, and the previous (n-1) / 2 ciphertext blocks are inserted into the next (n+1) / 2 ciphertext blocks in turn to restore the initial ciphertext sequence.

[0039] The present invention also provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the method described in any of the preceding claims.

[0040] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0041] This invention queries similar government data corresponding to the government data to be uploaded, and analyzes whether the current uploading user has the upload permission for the government data to be uploaded by comparing the user information of the uploading user of the similar government data with the user information of the current uploading user. This prevents users from uploading restricted shared data of other departments through their own user terminals, which could lead to the data being leaked to departments without the necessary permissions.

[0042] This invention analyzes whether the uploaded government data is updated data of the corresponding similar government data, and then sends it to the user who uploaded the corresponding similar government data to confirm whether it has been updated. This two-way verification avoids incorrect government data to be uploaded from overwriting correct similar government data and ensures the accuracy of shared data.

[0043] This invention verifies the integrity and origin of data through digital signatures, preventing data from being tampered with or forged during transmission and ensuring the integrity and accuracy of accessed data.

[0044] Parity is determined by analyzing the user's current access time and the last historical access time. The parity is then used to sort and reorganize the segmented ciphertext blocks, shuffling the original order. During decryption, the sequence is restored by analyzing the parity of the user's current access time and the last historical access time, further improving data security. Attached Figure Description

[0045] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with the invention and, together with the description, serve to explain the principles of the invention.

[0046] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0047] Figure 1 This is a flowchart of the data upload steps in a government data sharing method of the present invention;

[0048] Figure 2 This is a flowchart of the data encryption step in the data access process of a government data sharing method of the present invention;

[0049] Figure 3 This is a flowchart of the data decryption step in the data access process of a government data sharing method of the present invention. Detailed Implementation

[0050] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, and not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0051] It should be noted that all directional indications (such as up, down, left, right, front, back, etc.) in the embodiments of the present invention are only used to explain the relative positional relationship and movement of each component in a certain specific posture (as shown in the figure). If the specific posture changes, the directional indication will also change accordingly.

[0052] Furthermore, the use of terms such as "first" and "second" in this invention is for descriptive purposes only and should not be construed as indicating or implying their relative importance or implicitly specifying the number of technical features indicated. Therefore, features defined with "first" and "second" may explicitly or implicitly include at least one of those features. Additionally, the technical solutions of the various embodiments can be combined with each other, but only on the basis of being achievable by those skilled in the art. When the combination of technical solutions is contradictory or impossible to implement, such a combination of technical solutions should be considered non-existent and not within the scope of protection claimed by this invention.

[0053] Example 1

[0054] See Figure 1 As shown, the present invention provides a method for sharing government data, which specifically includes the following steps:

[0055] Configuration steps: Configure user information for each user, including department information and job level;

[0056] Data upload steps:

[0057] S1. Obtain the government data to be uploaded and query whether there is similar government data in the sharing platform. If it exists, execute S2. If it does not exist, upload the government data to be uploaded to the sharing platform and set access permission information.

[0058] S2. Obtain the user information of the user who uploaded the similar government data, and compare it with the user information of the current uploader. Analyze whether the current uploader has the upload permission for the government data to be uploaded. If it does, then execute S3.

[0059] S3. Analyze whether the uploaded government data is updated data of the corresponding similar government data. If so, send the uploaded government data to the upload user of the corresponding similar government data to confirm whether it has been updated. If the update is confirmed, upload the uploaded government data to the sharing platform to update the similar government data. The access permission information of the uploaded government data is the same as that of the corresponding similar government data.

[0060] Data access steps: The sharing platform obtains the access instruction of the current user, determines whether the user information of the current user meets the access permission information of the government data to be accessed, and if it does, the sharing platform encrypts the government data to be accessed and encapsulates it into a data packet and sends it to the user's client. The user's client decrypts the data packet to obtain the government data to be accessed.

[0061] In step S1, the query to see if there is similar government data corresponding to the government data to be uploaded in the sharing platform specifically involves:

[0062] Obtain the preset content tags and data collection information of the government data to be uploaded, and compare them with the government data in the sharing platform. If the corresponding preset content tags and data collection information are the same as the government data to be uploaded, then the corresponding government data is the similar government data to the government data to be uploaded.

[0063] The data collection information includes the collection date and collection location.

[0064] Government data refers to various types of information and data generated by government departments in the course of performing their functions. Generally speaking, the functions of each department are different, and the content of their government data is also different. For example, there is economic data, population data, environmental data, etc. Environmental data can be further divided into air quality data, water quality data, soil pollution data, etc. According to the specific content, corresponding preset content tags are set for each type of government data. Combined with the data collection information, this invention enables a fast and accurate query to see if there is similar government data in the sharing platform that corresponds to the government data to be uploaded. For example, when a user uploads air quality data of location A collected on December 24, 2024, if the system recognizes that air quality data of location A collected on December 24, 2024 already exists in the sharing platform, it can automatically analyze and judge whether to update the data or avoid duplicate uploads, thereby improving data upload efficiency and avoiding waste of communication resources.

[0065] It should be noted that when there is no similar government data corresponding to the government data to be uploaded in the sharing platform, it means that the government data to be uploaded was collected by the department of the current uploading user. The data is from the department of the current uploading user, so it can be directly uploaded to the sharing platform. There is no situation where the current uploading user uploads shared data from other departments through their own user terminal.

[0066] In step S2, it is analyzed whether the current uploading user has the permission to upload the government data to be uploaded, specifically:

[0067] When the department information of the user who uploaded the similar government data is consistent with the department information of the current uploader, and the rank of the current uploader is greater than or equal to the rank of the user who uploaded the similar government data, then the current uploader has the upload permission for the government data to be uploaded.

[0068] In the sharing of government data among departments, not all uploaded and shared government data is shared with all departments. Some data can only be shared with certain departments. To prevent these departments from mistakenly uploading and sharing this restricted data, thus allowing all departments to access it and causing data leakage, this invention compares the user information of the user to be uploading the data with the user information of the user who uploaded similar government data to be uploaded. This restricts the upload permissions of the government data to be uploaded, effectively preventing other departments or lower-ranking personnel from mistakenly operating on this restricted data in the sharing platform and causing data leakage.

[0069] In step S3, the analysis of whether the uploaded government data is updated data of the corresponding similar government data specifically includes:

[0070] The values ​​of each major data item in the government data to be uploaded are compared with the values ​​of each major data item in the corresponding similar government data. The analysis is conducted to determine whether there are major data items with different values. If so, the uploaded government data is determined to be updated data of the corresponding similar government data.

[0071] For similar government data that has already been uploaded, there may be data errors that need to be corrected and updated. Therefore, this invention compares the values ​​of each major data item of the government data to be uploaded with the values ​​of each major data item of the corresponding similar government data to determine whether the major data items of the government data to be uploaded have changed compared to the corresponding major data items of the similar government data. If there are any changes, the data to be updated, i.e., the government data to be uploaded, is first sent to the uploader of the corresponding similar government data for confirmation before being updated. This two-way verification avoids the situation where the similar government data is correct, but the government data to be uploaded has errors, leading to an incorrect update. This ensures the accuracy of data updates and prevents the accidental modification of correct data.

[0072] The access permission information includes the department that grants access and the corresponding authorized access rank;

[0073] The determination of whether the user information of the currently accessing user matches the access permission information of the government data to be accessed specifically involves:

[0074] If the department information of the current user belongs to the authorized access department, and the job level of the current user belongs to the corresponding authorized access job level in the authorized access department, then the user information of the current user meets the access permission information of the government data to be accessed.

[0075] The access instruction includes the public key of the current user and the access time, where the access time includes the current access time and the last historical access time.

[0076] See Figure 2 As shown, the sharing platform encrypts and encapsulates the government data to be accessed into a data packet before transmitting it to the user's client, specifically including:

[0077] X11. The sharing platform uses its own private key to calculate and obtain the original digital signature of the government data to be accessed.

[0078] X12. The sharing platform will divide the government data to be accessed into multiple first data blocks, and then sort them in sequence to form a data block sequence.

[0079] X13. The sharing platform randomly generates a symmetric session key, encrypts each first data block into a first ciphertext block, and forms an initial ciphertext block sequence according to the order of the data block sequence.

[0080] X14. Determine the parity of the current access time and the last access time in history, specifically:

[0081] If the number of even-numbered information readings is the largest among the information readings at the current access time, then the current access time is even; otherwise, it is odd. The same logic applies to determining the parity of the last historical access time. The information readings include year readings, month readings, day readings, hour readings, minute readings, and second readings.

[0082] For example, if the current access time is 11:39:28 on December 30, 2024, then there are 4 even-numbered information readings and 2 odd-numbered information readings. Therefore, the current access time is even.

[0083] X15. Based on the parity of the last access time in history, extract the ciphertext blocks at odd / even positions in the initial ciphertext block sequence and arrange them sequentially at the end of the sequence to form the first ciphertext block sequence. Then, based on the parity of the current access time, extract the ciphertext blocks at odd / even positions in the first ciphertext block sequence and arrange them sequentially at the end of the sequence to form the final ciphertext block sequence.

[0084] For example: if the initial ciphertext block sequence is ABCDE, and the last access time in history is odd, then the first ciphertext block sequence is BDACE; if the current access time is even, then the final ciphertext block sequence is BAEDC.

[0085] X16. The sharing platform uses the public key of the currently accessing user to encrypt the symmetric session key to obtain the second ciphertext;

[0086] X17. The sharing platform encapsulates the original digital signature, the sharing platform public key, the final ciphertext block sequence, and the second ciphertext into a data packet and transmits it to the user's client.

[0087] The sharing platform uses its own private key to calculate and obtain the original digital signature of the government data to be accessed, specifically:

[0088] After calculating the original hash value of the government data to be accessed using a preset hash function, the sharing platform uses its own private key to encrypt the original hash value to obtain the original digital signature.

[0089] See Figure 3 As shown, the user terminal of the currently accessing user decrypts the data packet to obtain the government data to be accessed, specifically including:

[0090] X21. The current user's client uses its own private key to decrypt the second ciphertext to obtain the symmetric session key;

[0091] X22. Based on the parity of the current access time, restore the final ciphertext block sequence to the first ciphertext block sequence, and then based on the parity of the last access time in history, restore the first ciphertext block sequence to the initial ciphertext block sequence, specifically as follows:

[0092] Obtain the number of ciphertext blocks n in the final ciphertext block sequence;

[0093] If n is even:

[0094] In the final ciphertext block sequence, if the current access time is even, then the first ciphertext block of the previous n / 2 ciphertext blocks is used as the first block of the sequence, and the next n / 2 ciphertext blocks are inserted into the previous n / 2 ciphertext blocks in turn to restore the first ciphertext block sequence. If the current access time is odd, then the first ciphertext block of the next n / 2 ciphertext blocks is used as the first block of the sequence, and the previous n / 2 ciphertext blocks are inserted into the next n / 2 ciphertext blocks in turn to restore the first ciphertext block sequence.

[0095] In the first ciphertext block sequence, if the last access time in history is even, then the first ciphertext block of the previous n / 2 ciphertext blocks is used as the first block of the sequence, and the next n / 2 ciphertext blocks are inserted into the previous n / 2 ciphertext blocks in turn to restore the initial ciphertext block sequence. If the last access time in history is odd, then the first ciphertext block of the next n / 2 ciphertext blocks is used as the first block of the sequence, and the previous n / 2 ciphertext blocks are inserted into the next n / 2 ciphertext blocks in turn to restore the initial ciphertext sequence.

[0096] If n is odd:

[0097] In the final ciphertext block sequence, if the current access time is even, then the first ciphertext block of the previous (n+1) / 2 ciphertext blocks is taken as the first block of the sequence, and the next (n-1) / 2 ciphertext blocks are inserted into the previous (n+1) / 2 ciphertext blocks in turn to restore the first ciphertext block sequence. If the current access time is odd, then the first ciphertext block of the next (n+1) / 2 ciphertext blocks is taken as the first block of the sequence, and the previous (n-1) / 2 ciphertext blocks are inserted into the next (n+1) / 2 ciphertext blocks in turn to restore the first ciphertext block sequence.

[0098] In the first ciphertext block sequence, if the last access time in history is even, then the first ciphertext block of the previous (n+1) / 2 ciphertext blocks is used as the first block of the sequence, and the next (n-1) / 2 ciphertext blocks are inserted into the previous (n+1) / 2 ciphertext blocks in turn to restore the initial ciphertext block sequence. If the last access time in history is odd, then the first ciphertext block of the next (n+1) / 2 ciphertext blocks is used as the first block of the sequence, and the previous (n-1) / 2 ciphertext blocks are inserted into the next (n+1) / 2 ciphertext blocks in turn to restore the initial ciphertext sequence.

[0099] For example, according to the example in step X15 above, since the current access time is even, the final ciphertext block sequence is BAEDC. Since n=5 is an odd number, the first ciphertext block (i.e., B) of the previous 3 ciphertext blocks (i.e., BAE) is taken as the first block of the sequence. The next 2 ciphertext blocks (i.e., DC) are inserted into the previous 3 ciphertext blocks in turn to restore the first ciphertext block sequence BDACE. Since the last access time in history is odd, the first ciphertext block (i.e., A) of the next 3 ciphertext blocks (i.e., ACE) is taken as the first block of the sequence. The next 2 ciphertext blocks (i.e., BD) are inserted into the next 3 ciphertext blocks in turn to restore the initial ciphertext sequence ABCDE.

[0100] X23. Decrypt each ciphertext block of the initial ciphertext block sequence using the symmetric session key, and concatenate them according to the order of the initial ciphertext block sequence to obtain the government data to be accessed. At the same time, decrypt the original digital signature using the shared platform public key to obtain the original hash value.

[0101] X24. Calculate the hash value of the decrypted government data to be accessed using the same hash function as the sharing platform. If it is the same as the original hash value, then trust the decrypted government data to be accessed.

[0102] This invention verifies the integrity and origin of data through digital signatures, preventing data from being tampered with or forged during transmission and ensuring the integrity and accuracy of accessed data.

[0103] The uniqueness and irreversibility of hash functions ensure that any modification to the data will result in a change in the hash value. Therefore, if the data is tampered with, the recalculated hash value will differ from the verified hash value, thus detecting the tampering.

[0104] In some embodiments, in step X16, the sharing platform encrypts the symmetric session key using the public key of the currently accessing user to obtain a second ciphertext, and further includes:

[0105] The sharing platform uses cascaded Chebyshev mapping to process the public key of the currently accessing user and generates a first pseudo-random chaotic sequence;

[0106] A first scrambling matrix is ​​generated based on the first pseudo-random chaotic sequence using a preset first LSTM neural network model.

[0107] The scrambling matrix is ​​used to scramble and encrypt the symmetric session key to obtain the second ciphertext.

[0108] In step X23, before decrypting each ciphertext block of the initial ciphertext block sequence using the symmetric session key, the following steps are included:

[0109] The user terminal uses the cascaded Chebyshev mapping to process the current user's own public key and generate a second pseudo-random chaotic sequence. The mapping control parameters of the cascaded Chebyshev mapping processing on the user terminal are the same as those of the cascaded Chebyshev mapping processing on the sharing platform.

[0110] A second scrambling matrix is ​​generated based on the second pseudo-random chaotic sequence using a second LSTM neural network model. The second LSTM neural network model is obtained in advance using digital twin technology based on the preset first LSTM neural network model.

[0111] The second scrambling matrix is ​​used to reverse scramble the second ciphertext to obtain the symmetric session key.

[0112] This embodiment generates pseudo-random chaotic sequences through cascaded Chebyshev mapping. Since each user has a different public key, each user generates a unique pseudo-random chaotic sequence based on the preset cascaded Chebyshev mapping. Then, a unique scrambling matrix is ​​obtained based on the preset LSTM neural network model, ensuring the communication independence and security of each user. At the same time, the user end establishes the same cascaded Chebyshev mapping and LSTM neural network model with the same parameters as the shared platform in advance through digital twin, which can generate pseudo-random chaotic sequences and scrambling matrices consistent with the shared platform, reducing the data transmission of pseudo-random chaotic sequences and scrambling matrices, thereby ensuring the data security of the symmetric session key.

[0113] In other embodiments, in step X16, the sharing platform can directly use the public key of the currently accessing user to perform asymmetric encryption on the symmetric session key to obtain the second ciphertext.

[0114] In some embodiments, the sharing platform transmits data packets to the client of the currently accessing user, using secure communication protocols such as TLS / SSL for transmission.

[0115] Example 2

[0116] The present invention also provides an electronic device, including: a processor, a transmitting device, an input device, an output device, and a memory. The processor may be implemented using a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit, or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this application. The memory may be implemented using a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM), and is used to store computer program code. The computer program code includes computer instructions. When the processor executes the computer instructions, the electronic device executes a method as described in any of the above possible implementation methods.

[0117] Example 3

[0118] The present invention also provides a computer-readable storage medium storing a computer program, the computer program including program instructions, which, when executed by a processor of an electronic device, cause the processor to perform a method as described in any of the above possible implementations.

[0119] The beneficial effects of this invention are as follows:

[0120] This invention queries similar government data corresponding to the government data to be uploaded, and analyzes whether the current uploading user has the upload permission for the government data to be uploaded by comparing the user information of the uploading user of the similar government data with the user information of the current uploading user. This prevents users from uploading restricted shared data of other departments through their own user terminals, which could lead to the data being leaked to departments without the necessary permissions.

[0121] This invention analyzes whether the uploaded government data is updated data of the corresponding similar government data, and then sends it to the user who uploaded the corresponding similar government data to confirm whether it has been updated. This two-way verification avoids incorrect government data to be uploaded from overwriting correct similar government data and ensures the accuracy of shared data.

[0122] This invention verifies the integrity and origin of data through digital signatures, preventing data from being tampered with or forged during transmission and ensuring the integrity and accuracy of accessed data.

[0123] Parity is determined by analyzing the user's current access time and the last historical access time. The parity is then used to sort and reorganize the segmented ciphertext blocks, shuffling the original order. During decryption, the sequence is restored by analyzing the parity of the user's current access time and the last historical access time, further improving data security.

[0124] In the description of this specification, the references to terms such as "an embodiment," "example," "specific example," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of the present invention. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples.

[0125] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit. If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes multiple instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing programs, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0126] The above description is merely a specific embodiment of the present invention, enabling those skilled in the art to understand or implement the invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the invention. Therefore, the present invention is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features claimed herein.

Claims

1. A government affair data sharing method, characterized by, The method comprises the following steps: A configuration step: configuring user information of each user, including department information and job level; A data uploading step: S1, obtaining to-be-uploaded government data, and querying whether similar government data corresponding to the to-be-uploaded government data exists in the sharing platform, if so, performing S2, if not, uploading the to-be-uploaded government data to the sharing platform and setting access permission information; S2, obtaining user information of an uploading user to which the similar government data belongs, and comparing the user information with user information of a current uploading user, analyzing whether the current uploading user has uploading permission of the to-be-uploaded government data, if so, performing S3; S3, analyzing whether the uploading government data is update data of the corresponding similar government data, if so, sending the uploading government data to the uploading user to which the corresponding similar government data belongs to confirm whether to update, if confirming to update, uploading the uploading government data to the sharing platform to update the similar government data, and the access permission information of the uploading government data is the same as that of the corresponding similar government data; A data accessing step: the sharing platform obtains an access instruction of a current user, judges whether user information of the current access user meets access permission information of to-be-accessed government data, if so, the sharing platform encrypts and encapsulates the to-be-accessed government data into a data packet and transmits the data packet to a user terminal of the current access user, and the user terminal of the current access user decrypts the data packet to obtain the to-be-accessed government data; The access instruction comprises a public key of the current access user and an access time, and the access time comprises a current access time and a last historical access time; The sharing platform encrypts and encapsulates the to-be-accessed government data into a data packet and transmits the data packet to the user terminal of the current access user, and specifically comprises: X11, the sharing platform calculates an original digital signature of the to-be-accessed government data by using a private key of the sharing platform; X12, the sharing platform divides the to-be-accessed government data into a plurality of first data blocks, and sequentially orders the first data blocks to form a data block sequence; X13, the sharing platform randomly generates a symmetric session key, encrypts each first data block into a first ciphertext block, and forms an initial ciphertext block sequence according to the ordering of the data block sequence; X14, judging the parity of the current access time and the last historical access time respectively; X15, according to the parity of the last historical access time, extracting the ciphertext blocks at odd / even positions in the initial ciphertext block sequence and sequentially arranging the ciphertext blocks at the end of the sequence to form a first ciphertext block sequence, and according to the parity of the current access time, extracting the ciphertext blocks at odd / even positions in the first ciphertext block sequence and sequentially arranging the ciphertext blocks at the end of the sequence to form a final ciphertext block sequence; X16, the sharing platform performs asymmetric encryption on the symmetric session key by using the public key of the current access user to obtain a second ciphertext; X17, the sharing platform encapsulates the original digital signature, a public key of the sharing platform, the final ciphertext block sequence and the second ciphertext into a data packet and transmits the data packet to the user terminal of the current access user.

2. The government affair data sharing method of claim 1, wherein, The querying whether similar government data corresponding to the to-be-uploaded government data exists in the sharing platform specifically comprises: The preset content label and the data collection information of the to-be-uploaded government affair data are acquired and compared with government affair data in the sharing platform, and if the corresponding preset content label and the data collection information are the same as those of the to-be-uploaded government affair data, the corresponding government affair data is the similar government affair data corresponding to the to-be-uploaded government affair data.

3. The government affair data sharing method of claim 1, wherein, The analysis of whether the current uploading user has the uploading permission of the to-be-uploaded government affair data is specifically: When the department information of the uploading user to which the similar government affair data belongs is consistent with the department information of the current uploading user, and the job level of the current uploading user is greater than or equal to the job level of the uploading user to which the similar government affair data belongs, the current uploading user has the uploading permission of the to-be-uploaded government affair data.

4. The government affair data sharing method of claim 1, wherein, The analysis of whether the uploaded government affair data is the update data of the corresponding similar government affair data is specifically: The values of each main data item of the to-be-uploaded government affair data are compared with the values of each main data item of the corresponding similar government affair data, and whether there is a main data item with different values is analyzed, and if there is, it is determined that the uploaded government affair data is the update data of the corresponding similar government affair data.

5. The government affair data sharing method of claim 1, wherein, The access permission information includes a permission access department and a corresponding permission access job level.

6. The government affair data sharing method of claim 5, wherein, The judgment of whether the user information of the current access user meets the access permission information of the to-be-accessed government affair data is specifically: If the department information of the current access user belongs to the permission access department, and the job level of the current access user belongs to the corresponding permission access job level in the corresponding permission access department, the user information of the current access user meets the access permission information of the to-be-accessed government affair data.

7. The government affair data sharing method of claim 1, wherein, The judgment of the parity of the current access time and the historical last access time is specifically: If the number of information readings that are even is the most in each information reading of the current access time, the current access time is even, otherwise it is odd; if the number of information readings that are even is the most in each information reading of the historical last access time, the current access time is even, otherwise it is odd; the information readings include year readings, month readings, day readings, hour readings, minute readings and second readings.

8. The government affair data sharing method of claim 1, wherein, The user terminal of the current access user decrypts the data packet to obtain the to-be-accessed government affair data, including restoring the final ciphertext block sequence into a first ciphertext block sequence according to the parity of the current access time, and restoring the first ciphertext block sequence into an initial ciphertext block sequence according to the parity of the historical last access time, which is specifically: The number n of ciphertext blocks in the final ciphertext block sequence is acquired; If n is even: In the final ciphertext block sequence, if the current access time is even, the first ciphertext block of the first n / 2 ciphertext blocks is taken as the sequence head block, and the last n / 2 ciphertext blocks are inserted into the first n / 2 ciphertext blocks in turn, to restore the first ciphertext block sequence, if the current access time is odd, the first ciphertext block of the last n / 2 ciphertext blocks is taken as the sequence head block, and the first n / 2 ciphertext blocks are inserted into the last n / 2 ciphertext blocks in turn, to restore the first ciphertext block sequence; In the first ciphertext block sequence, if the last historical access time is even, the first ciphertext block of the previous n / 2 ciphertext blocks is the first block of the sequence, the following n / 2 ciphertext blocks are inserted into the previous n / 2 ciphertext blocks in turn, and the initial ciphertext block sequence is restored; if the last historical access time is odd, the first ciphertext block of the following n / 2 ciphertext blocks is the first block of the sequence, the previous n / 2 ciphertext blocks are inserted into the following n / 2 ciphertext blocks in turn, and the initial ciphertext sequence is restored; If n is odd: In the final ciphertext block sequence, if the current access time is even, the first ciphertext block of the previous (n+1) / 2 ciphertext blocks is the first block of the sequence, the following (n-1) / 2 ciphertext blocks are inserted into the previous (n+1) / 2 ciphertext blocks in turn, and the first ciphertext block sequence is restored; if the current access time is odd, the first ciphertext block of the following (n+1) / 2 ciphertext blocks is the first block of the sequence, the previous (n-1) / 2 ciphertext blocks are inserted into the following (n+1) / 2 ciphertext blocks in turn, and the first ciphertext block sequence is restored; In the first ciphertext block sequence, if the last historical access time is even, the first ciphertext block of the previous (n+1) / 2 ciphertext blocks is the first block of the sequence, the following (n-1) / 2 ciphertext blocks are inserted into the previous (n+1) / 2 ciphertext blocks in turn, and the initial ciphertext block sequence is restored; if the last historical access time is odd, the first ciphertext block of the following (n+1) / 2 ciphertext blocks is the first block of the sequence, the previous (n-1) / 2 ciphertext blocks are inserted into the following (n+1) / 2 ciphertext blocks in turn, and the initial ciphertext sequence is restored.

9. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer execution instructions, and when the processor executes the computer execution instructions, the method in any one of claims 1-8 is implemented.

Images