Blockchain-based third-party assessment original record credibility verification method

Abstract

The application discloses a third-party evaluation original record credibility verification method based on a block chain, relates to the technical field of evaluation record credibility verification, and comprises the following steps: performing semantic identification on an original record, and extracting important data in the original record; combining the important data into a verification string, and converting the verification string into an encoding format to obtain a verification code; performing self-checking type encryption on the verification code, and encrypting the verification code into self-checking type ciphertext by using a self-checking type encryption algorithm; transmitting the self-checking type ciphertext to a block chain storage platform and performing safety self-checking to determine whether the self-checking type ciphertext is abnormal; and storing the self-checking type ciphertext in the block chain storage platform when the self-checking type ciphertext is not abnormal. The application is used to solve the problems that the existing evaluation record credibility verification technology cannot restore the evaluation record when the evaluation record is wrong, cannot ensure the safety of the evaluation record in the transmission process, and causes the original record to be easily permanently lost.

Description

Technical Field

[0001] This invention relates to the field of trusted verification technology for assessment records, specifically a blockchain-based method for trusted verification of original records of third-party assessments. Background Technology

[0002] The trusted verification technology for assessment records refers to a technical methodology that comprehensively utilizes cryptographic hash chains, blockchain notarization, digital signatures, and zero-knowledge proofs to transform each original record generated in a third-party assessment and its generation process into a system that anyone can independently verify, cannot be forged or tampered with afterward, and can prove compliance while protecting data privacy.

[0003] Existing trusted verification technologies for evaluation records typically employ the method of calculating and storing the hash value of the evaluation record for trusted verification. However, this method is vulnerable to failure if the original record is tampered with during subsequent verification. The hash value cannot reconstruct the original record, resulting in its permanent loss and irretrievable retrieval, thus failing to ensure the security of the evaluation record. Directly encrypting and storing the evaluation record would consume excessive storage space. Furthermore, evaluation records may be tampered with or corrupted during transmission. If tampered with during transmission, the calculated hash value used for verifying the evaluation record would be compromised. Errors can occur in the synchronization of verification data. For example, in patent application CN122311478A, a "tamper-proof data traceability and trusted verification system for intelligent agent output" is disclosed. This solution uses multiple verification methods, such as hash integrity verification, to perform weighted calculations and evaluate whether the data is trustworthy. However, this method cannot restore the data synchronously when it is untrustworthy, which poses a risk of permanently losing the original record. Existing trusted verification technologies for evaluation records also have the problems of not being able to restore the evaluation record when it is erroneous and not being able to ensure the security of the evaluation record during transmission, which can lead to the permanent loss of the original record. Summary of the Invention

[0004] This invention aims to at least partially address one of the technical problems in the prior art. It obtains the original record, performs semantic recognition on the original record, extracts important data from the original record, combines the important data into a verification string, converts the verification string into an encoding format to obtain a verification code, performs primary encryption on the verification code to obtain primary ciphertext, then performs self-check encryption on the primary ciphertext to obtain self-checking ciphertext, then transmits the self-checking ciphertext to a blockchain storage platform for security self-checking, outputs a self-check signal, and if the self-check fails, requests retransmission of the self-checking ciphertext or re-uploading of the original record. Finally, if the self-checking ciphertext is free of anomalies, it is stored in the blockchain storage platform. This addresses the problem that existing trusted verification technologies for evaluation records cannot restore the evaluation record when it is erroneous and cannot ensure the security of the evaluation record during transmission, leading to the easy permanent loss of the original record.

[0005] To achieve the above objectives, this application provides a blockchain-based method for third-party evaluation of the credibility of original records, comprising the following steps: Obtain the original records, perform semantic recognition on the original records, and extract the important data from the original records; The important data is combined into a verification string, and the verification string is converted into an encoding format to obtain the verification code; The verification code is encrypted using a self-checking encryption algorithm, which encrypts the verification code into self-checking ciphertext. The self-checking ciphertext is transmitted to the blockchain storage platform and a security self-check is performed to determine whether there are any anomalies in the self-checking ciphertext; If no anomalies are found in the self-checked ciphertext, it will be stored in the blockchain storage platform.

[0006] Furthermore, the steps of obtaining the original record, performing semantic recognition on the original record, and extracting important data from the original record also include the following sub-steps: Obtain the original records that require trusted verification; A semantic recognition model is introduced to analyze the original records, extracting numeric and adjective text, which are then named as important data.

[0007] Furthermore, the step of combining important data into a verification string and converting the verification string into an encoded format to obtain the verification code also includes the following sub-steps: Important data are grouped according to their order of appearance in the original record, with a separator inserted between every two adjacent pieces of important data, ultimately forming a string containing numbers, symbols, and text, namely the verification string. Name the binary encoding of the verification string in UTF-8 encoding as the verification code.

[0008] Furthermore, the step of performing self-checking encryption on the verification code and encrypting the verification code into self-checking ciphertext by the self-checking encryption algorithm further includes the following sub-steps: The verification code is initially encrypted to obtain the initial ciphertext; The initial ciphertext is self-checked and encrypted to obtain a self-checking ciphertext.

[0009] Furthermore, the step of performing primary encryption on the verification code to obtain primary ciphertext also includes the following sub-steps: The number of digits in the verification code is called the number of coded characters, denoted by the symbol NC. The factors of NC are obtained and denoted by Q and P. When obtaining Q and P, it is necessary to ensure that |QP| is minimized. Construct a matrix with Q rows and P columns, and input the verification code into the matrix, naming it the "segmentation matrix," while using the symbol NL. i,j This represents the number in the i-th row and j-th column of the partition matrix, where i and j are constants and are non-zero natural numbers; The user sets the security key, obtains the corresponding binary code of the security key in UTF-8 encoding, names it the key code, and assigns it the symbol PW from left to right. n The PW represents the numbers in the key encoding. n In this context, n is the subscript of PW and n is a non-zero natural number; Starting from i=j=1 and n=1, NL i,j Named the split point, if PW n If it is 0, then NL i,j If j is increased by one, then PW n If it is 1, then NL i,j Increment i by one, and simultaneously increment either i or j in the resulting NL. i,j Name it the split point, increment n+1, and iterate through it; During the iterative execution, if j does not exist after incrementing by one, then the increment of j during the iterative process is changed to j minus one; if j does not exist after minus one, then the minus one is changed to j incrementing by one. Similarly, if i does not exist after incrementing by one, then the increment of i during the iterative process is changed to i minus one; if i does not exist after minus one, then the minus one is changed to i incrementing by one. NL after i or j changes i,j If a segmentation point has been identified, the iteration stops, and the segmentation point in the segmentation matrix is ​​marked. The segmentation matrix is ​​then divided into different regions by the segmentation point, which are named the segmentation character regions. Given the minimum value of i within the delimiter character region, find the minimum value of j in the NL. i,jNamed as partition anchors, the segmented character regions are sorted in ascending order of the value of 'i' in the partition anchors. If there are segmented character regions with the same 'i' in the partition anchors, then the segmented character regions are sorted in ascending order of the value of 'j' in the partition anchors, using the symbol FA. m The FA represents the segmentation character area. m In this context, m is the subscript of FA and m is a non-zero natural number; Name the binary code corresponding to row Q and column P as the specification code. Extract the numbers from the split points in the order they appear to form a split string. Simultaneously, extract FA row by row. m The numbers in the sequence are used to form a string of regions. The strings of regions are combined in ascending order of m, and the segmentation string is placed at the beginning, while the specification code of the segmentation matrix is ​​placed at the end, thus forming the primary ciphertext.

[0010] Furthermore, the step of performing self-check encryption on the primary ciphertext to obtain self-checking ciphertext also includes the following sub-steps: The primary ciphertext is converted from binary format to 30-binary format to obtain the primary code; According to the symbol PC in left-to-right order d The PC represents the numbers in the primary encoding. d In this context, d is the index of PC and d is a non-zero natural number; Treating the letters I, L, O, and U (excluding binary numbers) as the numbers 32, 33, 34, and 35 respectively, starting from d=1, calculate PC. d +PC d+1 The calculation result is labeled as PT. d If PT d If it is I, L, O or U, then in PC d With PC d+1 PT implantation between d For the corresponding base-outer letter, increment d by one and recalculate PT. d until the maximum value of d is reached; PT are sorted in ascending order of d. d The self-checking ciphertext is obtained by combining letters from different number systems.

[0011] Furthermore, the step of transmitting the self-checking ciphertext to the blockchain storage platform and performing a security self-check to determine whether the self-checking ciphertext is abnormal also includes the following sub-steps: The self-checking encrypted data is transmitted to the blockchain storage platform and a security self-check is performed, outputting a self-checking signal. If the self-test fails, request a retransmission of the self-test encrypted text or a re-upload of the original record.

[0012] Furthermore, the step of transmitting the self-checking encrypted text to the blockchain storage platform and performing a security self-check, and outputting a self-checking signal, also includes the following sub-steps: The self-checking ciphertext is transmitted to the blockchain storage platform, using the symbol SC in left-to-right order. h Characters representing self-checking ciphertext; Find the letter outside the byte and mark it as SA. At the same time, find the character before and after the letter outside the byte and mark them as SB and SC respectively. Calculate and determine whether SB+SC equals SA. If the result of the judgment for all letters outside the byte is yes, output a self-test pass signal; otherwise, output a self-test fail signal.

[0013] Furthermore, the step of requesting retransmission of the self-test ciphertext or re-uploading of the original record if the self-test fails also includes the following sub-steps: If the output self-test fails, a request is made to retransmit the self-test ciphertext; If a self-test failure signal is output again after retransmission, a request is made to re-upload the original record.

[0014] Furthermore, the step of storing the self-checking ciphertext in the blockchain storage platform when no anomalies are found in the self-checking ciphertext also includes the following sub-steps: If a self-test pass signal is output, the self-test ciphertext will be stored in the blockchain platform. If a user needs to verify the original record, the self-checking ciphertext is extracted and decrypted to obtain the verification record. The important data in the original record and the verification record are checked to see if they are the same. If they are different, the important data in the original record is replaced with the important data in the verification record.

[0015] The beneficial effects of this invention are as follows: This invention obtains the original record, performs semantic recognition on the original record, extracts the important data from the original record, combines the important data into a verification string, converts the verification string into an encoding format to obtain a verification code, and performs primary encryption on the verification code to obtain primary ciphertext. The advantage is that the original record generated during third-party evaluation must contain various data for evaluation, of which only the specific value of each data item is considered important data, and the rest of the text is fixed-format text. Therefore, it is only necessary to extract the important data from the original record and encrypt it. This not only enables reliable verification of the original record in subsequent use, but also enables the restoration of untrusted original records with less storage space, further improving the security and effectiveness of reliable verification of evaluation records. This invention obtains a self-checking ciphertext by performing a self-checking encryption on the initial ciphertext. This self-checking ciphertext is then transmitted to a blockchain storage platform for a security self-check, outputting a self-check signal. If the self-check fails, a request is made to retransmit the self-checking ciphertext or re-upload the original record. Finally, if the self-checking ciphertext is free of anomalies, it is stored in the blockchain storage platform. The advantage lies in the fact that, to prevent data from being tampered with or erroneous during transmission, the initial ciphertext is further processed to obtain the self-checking ciphertext. This self-checking ciphertext, without changing the storage space required, can perform a self-check after transmission, verifying the trustworthiness of the transmission process and improving the security and effectiveness of record trust verification.

[0016] Advantages of additional aspects of the invention will be set forth in part in the detailed description of the invention below, and in part will be obvious from the description or may be learned by practice of the invention. Attached Figure Description

[0017] Other features, objects, and advantages of the invention will become more apparent from the following detailed description of non-limiting embodiments with reference to the accompanying drawings: Figure 1 This is a flowchart illustrating the steps of the method of the present invention; Figure 2 This is a schematic diagram of the segmentation matrix of the present invention; Figure 3 This is a schematic diagram of the dividing points of the present invention; Figure 4 This is a schematic diagram of the electronic device of the present invention. Detailed Implementation

[0018] 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 some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0019] Example 1, please refer to Figure 1 As shown, this application provides a blockchain-based method for third-party evaluation of the credibility of original records, including the following steps: Step S100: Obtain the original record, perform semantic recognition on the original record, and extract important data from the original record; Step S100 also includes the following sub-steps: Step S101: Obtain the original records that need to be verified; Step S101: Introduce a semantic recognition model, analyze the original records using the semantic recognition model, extract numeric text and adjective text from the original records, and name them as important data; In practice, due to the excessive length of the original records, it is not convenient to provide an example in this embodiment. Therefore, this embodiment only uses "PH: 7.5; Quality inspection result: qualified" as an example of the original record. The existing semantic recognition model is introduced to identify and extract the numeric text including 7.5 and the adjective text including qualified. That is, the important data is 7.5 and qualified. This is because in the data of each evaluation, the numeric text is usually related to the detailed results of the evaluation, or sensitive information such as dates, codes, and telephone numbers. In addition to the numeric text, there are also adjectives in the evaluation data, such as qualified and unqualified, valid and invalid, and feasible and infeasible. These evaluation results are usually adjectives. Therefore, the numeric text and the adjective text are directly included in the important data, and the rest of the text is formatted content and does not need to be focused on.

[0020] Step S200 involves combining important data into a verification string and converting the verification string into an encoded format to obtain the verification code. Step S200 also includes the following sub-steps: Step S201: The important data are grouped according to the order in which they appear in the original record, and a separator is inserted between every two adjacent important data, ultimately forming a string containing numbers, symbols, and text, i.e., the verification string. Step S202: Name the binary encoding corresponding to the verification string in UTF-8 encoding as the verification code; In the specific implementation, 7.5 appears before "qualified" in the original record. Therefore, the resulting verification string is "7.5; qualified". The content within the quotation marks is the verification string. It should be noted that all quotation marks in this embodiment are used to define the starting position of a certain data item and are not part of the data itself. The same applies to subsequent embodiments. The verification code is further obtained as "001101110010111000110101111011111011110010011011111001011001000010001110011011010100000101111100". Step S300 involves performing self-checking encryption on the verification code, using a self-checking encryption algorithm to encrypt the verification code into self-checking ciphertext; step S300 also includes the following sub-steps: Step S301: Perform primary encryption on the verification code to obtain primary ciphertext; Step S301 also includes the following sub-steps: Step S3011: Count the number of digits in the verification code, name it as the number of encoded characters, and represent it with the symbol NC. Obtain the factors of NC, denoted as Q and P. When obtaining Q and P, ensure that |QP| is minimized. Please see Figure 2 As shown, in step S3012, a matrix of Q rows and P columns is constructed, and the verification code is entered into the matrix, named the segmentation matrix, and simultaneously labeled with the symbol NL. i,j This represents the number in the i-th row and j-th column of the partition matrix, where i and j are constants and are non-zero natural numbers; In practice, the number of encoded characters NC is 96, and Q and P are 8 and 12 respectively. When taking factors, it is ensured that Q≤P and |QP| is minimized. An 8x12 matrix is ​​constructed, and the verification codes are entered in order from top left to bottom right, resulting in the segmentation matrix as shown below. Figure 2 As shown, each number in a cell corresponds to a number NL. i,j And 1≤i≤8, 1≤j≤12.

[0021] Step S3013: The user sets the security key, obtains the binary code corresponding to the security key in UTF-8 encoding, names it the key code, and assigns it the symbol PW from left to right. n PW represents the numbers in the key encoding. n In this context, n is the subscript of PW and n is a non-zero natural number; Step S3014, starting from i=j=1 and n=1, set NL i,j Named the split point, if PW n If it is 0, then NL i,j If j is increased by one, then PW n If it is 1, then NL i,j Increment i by one, and simultaneously increment either i or j in the resulting NL. i,j Name it the split point, increment n+1, and iterate through it; Step S3015: During the iteration process, if j does not exist after being incremented by one, then the increment of j during the iteration process is changed to j minus one; if j does not exist after being minus one, then the minus one is changed to j incremented by one. If i does not exist after being incremented by one, then the increment of i during the iteration process is changed to i minus one; if i does not exist after being minus one, then the minus one is changed to i incremented by one. Step S3016, when i or j changes NL i,j If a segmentation point has been identified, the iteration stops, and the segmentation point in the segmentation matrix is ​​marked. The segmentation matrix is ​​then divided into different regions by the segmentation point, which are named the segmentation character regions. In practice, the user-set security key is obtained as "test123", and the corresponding key code is "011101000110010101110011011101000011000100110010001100110011". The 56 binary numbers in the key code correspond to the symbols PW1 to PW from left to right. 56 Starting from i=j=1 and n=1, at this time NL i,j For NL 1,1 Since PW1 is 0, we increment j to get NL. 1,2 , will NL 1,2 Named the split point, it's important to note that when searching for split points, NL... 1,1 The default split point is NL. With i=1 and j=2, we increment n by 1. Since PW2 is now 1, we increment i by one to get the new split point NL. 2,2 And so on, continuing to search for the split point. When n=16, i=8, j=9, and PW 16 If the value is 1, i needs to be incremented by one, but the maximum value of i is 8. Therefore, the "if PW" in step S3014 is changed. n If it is 1, then NL i,j The "i plus one" in the text is changed to "if PW n If it is 1, then NL i,j "Subtract one from i", thus obtaining the new dividing point NL. 7，9 If PW appears again later n If the value is 1, the instruction to decrement i by one will continue until i no longer exists. After that, the instruction will be changed, and the instruction to increment i by one will be executed again. The same applies to the addition and subtraction instructions for j. This process continues iterating until n=24, at which point a new dividing point NL is found. 3,11 But NL 3,11 This point already belongs to a segmentation point, so the iteration stops, and the segmentation points in the resulting segmentation matrix are marked as follows: Figure 3 As shown, Figure 3 The cells selected by the square frame are the dividing points. Figure 3 The segmented point divides the area into three regions, meaning there are a total of three segmentation character areas. Figure 3 The gray area in the image is the separator character area.

[0022] Step S3017: Obtain the NL with the smallest i and the smallest j within the segmented character area. i,j Named as partition anchors, the segmented character regions are sorted in ascending order of the value of 'i' in the partition anchors. If there are segmented character regions with the same 'i' in the partition anchors, then the segmented character regions are sorted in ascending order of the value of 'j' in the partition anchors, using the symbol FA. m FA represents the character segmentation. mIn this context, m is the subscript of FA and m is a non-zero natural number; Step S3018: Name the binary code corresponding to row Q and column P as the specification code. Extract the numbers from the split points according to the order in which they appear to form a split string. At the same time, extract FA row by row. m The numbers in the data form a string of regions. The strings of regions are combined in ascending order of m, and the segmented string is placed at the beginning. The specification code of the segmentation matrix is ​​placed at the end to form the primary ciphertext. In practice, they are represented by the α region, β region, and γ region, respectively. Figure 3 The character segments are divided into the lower left, upper middle, and lower right sections. Among these, the NL characters with the smallest values ​​for i and j are found in the α, β, and γ sections. i,j NL in order 2,1 NL 1,3 and NL 4,12 Sort by i in ascending order to obtain FA1 as the β region, FA2 as the α region, and FA3 as the γ region. In this embodiment, the segmentation matrix is ​​8 rows and 12 columns, with the corresponding specification code "001110001110100010100001100011000110001001100100111001011100100010010111". Simultaneously, the extracted segmentation string is "001110100101101110000111", the region string for FA1 is "110111001010001101011011111001001100110001", and the region string for FA2 is "1111100001111000000101". The region string for A3 is "11010100". In this embodiment, the string is extracted from left to right and then from top to bottom. However, other orders can be used during the actual execution. This embodiment only shows one result. The final combination yields the primary ciphertext as "00111010010110111000011111011100101000110101101111100100110011000111111000011110000010111010100001110100010100001100011000110001100010011001011100101100100010010111001011100100010010111100101100100010010111".

[0023] Step S302: Perform self-check encryption on the primary ciphertext to obtain self-check ciphertext; Step S302 also includes the following sub-steps: Step S3021: Convert the primary ciphertext from binary format to 30-binary format to obtain the primary code; Step S3022, using the symbol PC in left-to-right order. d PC represents the number in the primary encoding. d In this context, d is the index of PC and d is a non-zero natural number; Step S3023: Treat the letters I, L, O, and U (excluding the base 32 and 33) as the numbers 32, 33, 34, and 35 respectively, and calculate PC starting from d=1. d +PC d+1 The calculation result is labeled as PT. d If PT d If it is I, L, O or U, then in PC d With PC d+1 PT implantation between d For the corresponding base-outer letter, increment d by one and recalculate PT. d until the maximum value of d is reached; Step S3024: Arrange PT in ascending order of d. d Combine letters outside the base to obtain a self-checking ciphertext; In practice, the converted primary code is "1TBE3XS8TVWK67W7G5TGWEH8CC64SEB24Q", and the numbers in the primary code correspond to PC1 to PC1 from left to right. 34 The 30-binary system does not include I, L, O, and U. Normally, decimal 31 corresponds to 30-binary Z, and decimal 32 corresponds to 30-binary 10. However, in this embodiment, I is considered 32, L 33, O 34, and U 35. This is used to verify whether the self-checking ciphertext has any abnormalities during transmission. It also gathers all 26 letters. In the primary encoding, PC5 and PC6 are 3 and X respectively, which add up to 10, corresponding to the letter I outside the base. Therefore, the letter I is inserted between PC5 and PC6. Similarly, all other PTs are treated similarly. d The analysis continued until d=34, and the final self-checking ciphertext was obtained as "1TBE3IXSL8OTVWK67UWU7G5TGWEH8CC64SEB24Q".

[0024] Step S400 involves transmitting the self-checking ciphertext to the blockchain storage platform and performing a security self-check to determine if the ciphertext is abnormal. Step S400 also includes the following sub-steps: Step S401: Transmit the self-checking encrypted text to the blockchain storage platform and perform a security self-check, then output a self-checking signal. Step S401 also includes the following sub-steps: Step S4011: Transmit the self-checking ciphertext to the blockchain storage platform, using the symbol SC in left-to-right order. hCharacters representing self-checking ciphertext; Step S4012: Find the letter outside the byte and mark it as SA. At the same time, find the character before and after the letter outside the byte and mark it as SB and SC respectively. Calculate and determine whether SB+SC equals SA. If the judgment result of all letters outside the byte is yes, output a self-test pass signal; otherwise, output a self-test fail signal. In practice, the self-checking ciphertext is transmitted to the blockchain storage platform, and the numbers or letters in the self-checking ciphertext "1TBE3IXSL8OTVWK67UWU7G5TGWEH8CC64SEB24Q" are marked in order from left to right to correspond to SC1 to SC2. 39 In this context, SC6 is I, and I is an external byte letter, so SA is I. At the same time, SB and SC are found to be 3 and X, respectively. Calculation shows that 3+X=10 in the 30-bit binary system, and 10 corresponds to the external byte letter I, i.e., SB+SC=SA. At this point, the judgment result for the external byte letter corresponding to SC6 is yes. There are other external byte letters in the self-test ciphertext. If all external byte letters lead to the conclusion that SB+SC=SA after calculation and judgment, then the self-test pass signal is output; otherwise, the self-test fail signal is output.

[0025] Step S402: If the self-test fails, request to retransmit the self-test ciphertext or re-upload the original record. Step S402 also includes the following sub-steps: Step S4021: If the self-test fails, a request is made to retransmit the self-test ciphertext. Step S4022: If a self-test failure signal is output again after retransmission, request to re-upload the original record; In practice, if the self-test fails, it means that the self-test ciphertext was interfered with during transmission, causing a deviation between the transmitted and received self-test ciphertext. Therefore, the correct self-test ciphertext needs to be retransmitted. If the self-test fails continuously, the possibility of tampering should be considered. In this case, the user needs to change the network environment and re-upload the original record, and then re-execute the process of processing the original record to obtain the self-test ciphertext.

[0026] Step S500: If no anomalies are found in the self-checked ciphertext, store the self-checked ciphertext in the blockchain storage platform; Step S500 also includes the following sub-steps: Step S501: If a self-test pass signal is output, the self-test ciphertext is stored in the blockchain platform. Step S502: If the user needs to verify the original record, the self-checking ciphertext is extracted and decrypted to obtain the verification record. The important data in the original record and the verification record are checked to see if they are the same. If they are not the same, the important data in the original record is replaced with the important data in the verification record. In specific implementation, if the output self-test pass signal indicates that the received self-test ciphertext is normal, then the self-test ciphertext is stored in the blockchain storage platform to avoid abnormalities during transmission. Simultaneously, the self-test ciphertext can restore the original record when the original record and the verification record differ, preventing permanent loss of the original record. During decryption, removing non-radix letters from the self-test ciphertext yields the primary code, which is then restored to the primary ciphertext. Next, the specification code is extracted from the primary ciphertext. The specification code is typically a fixed-length binary code at the end, so it can be directly extracted. A matrix of the corresponding size is then drawn, and the segmented character area is divided according to the user-submitted security key. These are then entered sequentially to restore the segmented matrix, which is then restored to the important data. This embodiment will not provide further details.

[0027] Example 2, please refer to Figure 4 As shown, Figure 4 A schematic diagram of an electronic device is provided, which may include a processor, a communication interface, a memory, and a communication bus. The processor, communication interface, and memory communicate with each other via the communication bus. The memory stores computer-readable instructions, and the processor can invoke these instructions. When the processor executes a computer-readable instruction, it performs steps similar to those in a blockchain-based third-party assessment method for verifying the trustworthiness of original records, to achieve the following functions: semantic recognition of the original record to extract important data; combining the important data into a verification string and converting the verification string into an encoded format to obtain a verification code; performing self-checking encryption on the verification code, encrypting the verification code into self-checking ciphertext using a self-checking encryption algorithm; transmitting the self-checking ciphertext to a blockchain storage platform for security self-checking to determine if the self-checking ciphertext is abnormal; and storing the self-checking ciphertext in the blockchain storage platform if no abnormalities are found.

[0028] Furthermore, the logical instructions in the aforementioned memory can be implemented as software functional units and, when sold or used as independent products, 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 a portion 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 several 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 described in the various embodiments of this application.

[0029] Example 3: This application also provides a computer program product, which includes a computer program stored on a computer-readable storage medium. The computer program includes program instructions. When the program instructions are executed by a computer, the computer can execute the blockchain-based third-party evaluation method for verifying the credibility of original records. This method includes: performing semantic recognition on the original record to extract important data from the original record; combining the important data into a verification string and converting the verification string into an encoding format to obtain a verification code; performing self-checking encryption on the verification code and encrypting the verification code into self-checking ciphertext using a self-checking encryption algorithm; transmitting the self-checking ciphertext to a blockchain storage platform and performing a security self-check to determine whether the self-checking ciphertext is abnormal; and storing the self-checking ciphertext in the blockchain storage platform when there is no abnormality.

[0030] Example 4: This application may also provide a computer-readable storage medium. When the instructions in the computer-readable storage medium are executed by the processor of a server, the server is able to perform and implement the following functions: semantic recognition of the original record to extract important data from the original record; combining the important data into a verification string and converting the verification string into an encoding format to obtain a verification code; performing self-checking encryption on the verification code and encrypting the verification code into self-checking ciphertext using a self-checking encryption algorithm; transmitting the self-checking ciphertext to the blockchain storage platform and performing a security self-check to determine whether there is an anomaly in the self-checking ciphertext; and storing the self-checking ciphertext in the blockchain storage platform when there is no anomaly in the self-checking ciphertext.

[0031] Furthermore, the computer-readable storage medium provided in this application may be: read-only memory (ROM), random access memory (RAM), random access programmable read-only memory (PROM), electrically erasable programmable read-only memory (EEPROM), dynamic random access memory (DRAM), static random access memory (SRAM), flash memory, non-volatile memory, CD-ROM, CD-R, CD+R, CD-RW, CD+RW, DVD-ROM, DVD-R, DVD+R, DVD-RW, DVD+RW, DVD-RAM, BD-ROM, BD-R, B DRAM, BD-RE, Blu-ray or optical disc storage, hard disk drive (HDD), solid-state drive (SSD), card storage (such as multimedia cards, secure digital cards, or high-speed digital cards), magnetic tape, floppy disk, magneto-optical data storage device, optical data storage device, hard disk, solid-state drive, and any other device configured to store a computer program and any associated data, data files, and data structures in a non-transitory manner and to provide the computer program and any associated data, data files, and data structures to a processor or computer so that the processor or computer can execute the computer program. The computer program in the aforementioned computer-readable storage medium can run in an environment deployed in computer devices such as clients, hosts, agent devices, servers, etc. Furthermore, in one example, the computer program and any associated data, data files, and data structures are distributed across a networked computer system, such that the computer program and any associated data, data files, and data structures are stored, accessed, and executed in a distributed manner through one or more processors or computers.

[0032] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media containing computer-usable program code. These computer program instructions can also be stored in a computer-readable storage medium capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means implemented in a process. Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0033] The above-described embodiments are merely specific implementations of the present invention, used to illustrate the technical solutions of the present invention, and are not intended to limit it. The scope of protection of the present invention is not limited thereto. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that any person skilled in the art can still modify or easily conceive of changes to the technical solutions described in the foregoing embodiments within the scope of the technology disclosed in the present invention, or make equivalent substitutions for some of the technical features; and these modifications, changes, or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention, and should all be covered within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of protection of the claims.

Claims

1. A blockchain-based method for verifying the credibility of original records in third-party assessments, characterized in that: Includes the following steps: Obtain the original records, perform semantic recognition on the original records, and extract the important data from the original records; The important data is combined into a verification string, and the verification string is converted into an encoding format to obtain the verification code; The verification code is encrypted using a self-checking encryption algorithm, which encrypts the verification code into self-checking ciphertext. The self-checking ciphertext is transmitted to the blockchain storage platform and a security self-check is performed to determine whether there are any anomalies in the self-checking ciphertext; If no anomalies are found in the self-checked ciphertext, it will be stored in the blockchain storage platform.

2. The blockchain-based third-party assessment original record trust verification method according to claim 1, characterized in that, The steps of obtaining the original record, performing semantic recognition on the original record, and extracting important data from the original record also include the following sub-steps: Obtain the original records that require trusted verification; A semantic recognition model is introduced to analyze the original records, extracting numeric and adjective text, which are then named as important data.

3. The blockchain-based third-party evaluation original record trust verification method according to claim 2, characterized in that, The step of combining important data into a verification string and converting the verification string into an encoded format to obtain the verification code further includes the following sub-steps: Important data are grouped according to their order of appearance in the original record, with a separator inserted between every two adjacent pieces of important data, ultimately forming a string containing numbers, symbols, and text, namely the verification string. Name the binary encoding of the verification string in UTF-8 encoding as the verification code.

4. The blockchain-based third-party assessment original record trust verification method according to claim 3, characterized in that, The step of performing self-checking encryption on the verification code and encrypting the verification code into self-checking ciphertext by the self-checking encryption algorithm further includes the following sub-steps: The verification code is initially encrypted to obtain the initial ciphertext; The initial ciphertext is self-checked and encrypted to obtain a self-checking ciphertext.

5. The blockchain-based third-party evaluation original record trust verification method according to claim 4, characterized in that, The step of performing primary encryption on the verification code to obtain primary ciphertext further includes the following sub-steps: The number of digits in the verification code is called the number of coded characters, denoted by the symbol NC. The factors of NC are obtained and denoted by Q and P. When obtaining Q and P, it is necessary to ensure that |QP| is minimized. Construct a matrix with Q rows and P columns, and input the verification code into the matrix, naming it the "segmentation matrix," while using the symbol NL. i,j This represents the number in the i-th row and j-th column of the partition matrix, where i and j are constants and are non-zero natural numbers; The user sets the security key, obtains the corresponding binary code of the security key in UTF-8 encoding, names it the key code, and assigns it the symbol PW from left to right. n The PW represents the numbers in the key encoding. n In this context, n is the subscript of PW and n is a non-zero natural number; Starting from i=j=1 and n=1, NL i,j Named the split point, if PW n If it is 0, then NL i,j If j is increased by one, then PW n If it is 1, then NL i,j Increment i by one, and simultaneously increment either i or j in the resulting NL. i,j Name it the split point, increment n+1, and iterate through it; During the iterative execution, if j does not exist after incrementing by one, then the increment of j during the iterative process is changed to j minus one; if j does not exist after minus one, then the minus one is changed to j incrementing by one. Similarly, if i does not exist after incrementing by one, then the increment of i during the iterative process is changed to i minus one; if i does not exist after minus one, then the minus one is changed to i incrementing by one. NL after i or j changes i,j If a segmentation point has been identified, the iteration stops, and the segmentation point in the segmentation matrix is ​​marked. The segmentation matrix is ​​then divided into different regions by the segmentation point, which are named the segmentation character regions. Given the minimum value of i within the delimiter character region, find the minimum value of j in the NL. i,j Named as partition anchors, the segmented character regions are sorted in ascending order of the value of 'i' in the partition anchors. If there are segmented character regions with the same 'i' in the partition anchors, then the segmented character regions are sorted in ascending order of the value of 'j' in the partition anchors, using the symbol FA. m The FA represents the segmentation character area. m In this context, m is the subscript of FA and m is a non-zero natural number; Name the binary code corresponding to row Q and column P as the specification code. Extract the numbers from the split points in the order they appear to form a split string. Simultaneously, extract FA row by row. m The numbers in the sequence are used to form a string of regions. The strings of regions are combined in ascending order of m, and the segmentation string is placed at the beginning, while the specification code of the segmentation matrix is ​​placed at the end, thus forming the primary ciphertext.

6. The blockchain-based third-party assessment original record trust verification method according to claim 5, characterized in that, The step of performing self-check encryption on the primary ciphertext to obtain self-checking ciphertext further includes the following sub-steps: The primary ciphertext is converted from binary format to 30-binary format to obtain the primary code; According to the symbol PC in left-to-right order d The PC represents the numbers in the primary encoding. d In this context, d is the index of PC and d is a non-zero natural number; Treating the letters I, L, O, and U (excluding binary numbers) as the numbers 32, 33, 34, and 35 respectively, starting from d=1, calculate PC. d +PC d+1 The calculation result is labeled as PT. d If PT d If it is I, L, O or U, then in PC d With PC d+1 PT implantation between d For the corresponding base-outer letter, increment d by one and recalculate PT. d until the maximum value of d is reached; PT are sorted in ascending order of d. d The self-checking ciphertext is obtained by combining letters from different number systems.

7. The blockchain-based third-party assessment original record trust verification method according to claim 6, characterized in that, The step of transmitting the self-checking ciphertext to the blockchain storage platform and performing a security self-check to determine whether the self-checking ciphertext is abnormal also includes the following sub-steps: The self-checking encrypted data is transmitted to the blockchain storage platform and a security self-check is performed, outputting a self-checking signal. If the self-test fails, request a retransmission of the self-test encrypted text or a re-upload of the original record.

8. The blockchain-based third-party assessment original record trust verification method according to claim 7, characterized in that, The step of transmitting the self-testing encrypted text to the blockchain storage platform, performing a security self-test, and outputting a self-test signal further includes the following sub-steps: The self-checking ciphertext is transmitted to the blockchain storage platform, using the symbol SC in left-to-right order. h Characters representing self-checking ciphertext; Find the letter outside the byte and mark it as SA. At the same time, find the character before and after the letter outside the byte and mark them as SB and SC respectively. Calculate and determine whether SB+SC equals SA. If the result of the judgment for all letters outside the byte is yes, output a self-test pass signal; otherwise, output a self-test fail signal.

9. The blockchain-based third-party assessment original record trust verification method according to claim 8, characterized in that, The step of requesting retransmission of the self-test ciphertext or re-uploading of the original record if the self-test fails also includes the following sub-steps: If the output self-test fails, a request is made to retransmit the self-test ciphertext; If a self-test failure signal is output again after retransmission, a request is made to re-upload the original record.

10. The blockchain-based third-party assessment original record trust verification method according to claim 9, characterized in that, The step of storing the self-checked ciphertext in the blockchain storage platform when no anomalies are found in the self-checked ciphertext further includes the following sub-steps: If a self-test pass signal is output, the self-test ciphertext will be stored in the blockchain platform. If a user needs to verify the original record, the self-checking ciphertext is extracted and decrypted to obtain the verification record. The important data in the original record and the verification record are checked to see if they are the same. If they are different, the important data in the original record is replaced with the important data in the verification record.

Images