Data service operation information auditing method and system based on digital digest

By performing group hashing, chaotic mapping and asymmetric encryption on data service operation information based on digital summary methods, digital summaries are generated and verified, which solves the problem that data service operation information is easily tampered with, ensures the authenticity and integrity of data services, and improves security and computing efficiency.

CN120614128APending Publication Date: 2025-09-09SHANGHAI TOBACCO GROUP CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202510792565.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-06-13
Publication Date
2025-09-09

AI Technical Summary

Technical Problem

Traditional data service operation information audits are susceptible to tampering, resulting in inaccurate audit results and unreliable data services.

Method used

A digital summary-based method is adopted to collect original data, group them and calculate hash values, perform chaotic mapping and asymmetric encryption, generate a digital summary, bind it with the operation log to generate an identifier, write it into the private chain, and perform reverse verification when receiving an inspection request.

Benefits of technology

Ensure the authenticity and integrity of data service operation information, enhance anti-attack capabilities, and increase computing speed.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120614128A_ABST
    Figure CN120614128A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides a data service operation information auditing method and system based on a digital digest, and the method comprises the steps: collecting original data, carrying out the grouping of the original data, calculating the hash value of each group of data, and carrying out the chaotic mapping of the hash values, and obtaining a chaotic hash value; splicing the chaos hash value and a preset salt value to obtain a fixed hash value, calculating an asymmetric key, and performing signature encryption on the fixed hash value through the asymmetric key to generate a digital digest; binding the digital digest with a corresponding operation log to generate an identifier, and writing the digital digest and the identifier into a private chain; when an inspection request is received, the digital digest is retrieved based on the identifier, reverse verification of the digital digest is passed, and when verification of the digital digest is passed, inspection operation is executed based on the inspection request.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of auditing, and in particular to a method and system for auditing data service operation information based on digital summaries. Background Art

[0002] Data services are a crucial form of data sharing in today's information age. Specifically, they involve sharing data externally through APIs. When third parties use these APIs to share data, auditing the authenticity and integrity of data service call information is crucial, as auditing data service operation information directly impacts data sharing security.

[0003] Traditional auditing of data service operation information has several drawbacks, a major one of which is its vulnerability to tampering. This information can be easily tampered with by unauthorized users during transmission and processing, leading to inaccurate audit results and unreliable data services. Therefore, it is crucial to find an effective method to ensure the authenticity and integrity of data service operation information and improve the credibility and reliability of data services. Summary of the Invention

[0004] In view of the problems existing in the prior art, an embodiment of the present invention provides a data service operation information auditing method and system based on digital summary.

[0005] An embodiment of the present invention provides a method for auditing data service operation information based on digital summaries, the method comprising: Collecting raw data, grouping the raw data, calculating a hash value for each group of data, and performing chaotic mapping on the hash value to obtain a chaotic hash value; Concatenate the chaotic hash value and the preset salt value to obtain a fixed hash value, calculate the asymmetric key, sign and encrypt the fixed hash value using the asymmetric key, and generate a digital summary; Binding the digital summary to the corresponding operation log to generate an identifier, and writing the digital summary and identifier into a private chain; When a check request is received, the digital digest is retrieved based on the identifier, and reverse verification is performed through the digital digest. When the digital digest verification passes, a check operation is performed based on the check request.

[0006] In one embodiment, the method further comprises: Setting control parameters, combining iterative calculation with the chaotic mapping function to obtain a first chaotic sequence, performing a bitwise XOR operation on the chaotic sequence and the hash value to obtain a second obfuscated sequence; Calculating a second hash value of the second obfuscated sequence using a hash algorithm, and iteratively calculating the second hash value using a chaotic mapping function to obtain a third chaotic sequence; Perform a bitwise exclusive OR operation on the second hash value and the third chaotic sequence to obtain the chaotic hash value.

[0007] In one embodiment, the calculation formula of the chaos mapping function includes: Where r is the control parameter, is a random initial value, is the iterative chaotic sequence, and n is the group length.

[0008] In one embodiment, the method further comprises: Select a pair of prime numbers, calculate the product and the Euler function, and select an encryption prime number that is coprime with the Euler function, calculate a decryption prime number based on the encryption prime number and the Euler function, determine a public key based on the product and the encryption prime number, and determine a private key based on the decryption prime number; The fixed hash value is encrypted using a public key and a private key to form a ciphertext, and the ciphertext is hashed to generate a digital summary.

[0009] In one embodiment, the method further comprises: The encryption prime number and the decryption prime number are generated based on a fast power algorithm.

[0010] An embodiment of the present invention provides a data service operation information auditing system based on digital summaries, the system comprising: A grouping module is used to collect raw data, group the raw data, calculate the hash value of each group of data, and perform chaotic mapping on the hash value to obtain a chaotic hash value; An encryption module is used to concatenate the chaotic hash value and a preset salt value to obtain a fixed hash value, calculate an asymmetric key, sign and encrypt the fixed hash value using the asymmetric key, and generate a digital summary; an identification module, configured to bind the digital summary to the corresponding operation log to generate an identifier, and write the digital summary and the identifier into a private chain; The checking module is configured to retrieve the digital summary based on the identifier upon receiving the checking request, and reversely verify the digital summary through the digital summary, and perform a checking operation based on the checking request when the digital summary verification passes.

[0011] In one embodiment, the system further comprises: A first mapping module is used to set control parameters, iteratively calculate the chaotic mapping function to obtain a first chaotic sequence, and perform a bitwise XOR operation on the chaotic sequence and the hash value to obtain a second obfuscated sequence; A second mapping module is configured to calculate a second hash value of the second obfuscated sequence by using a hash algorithm, and iteratively calculate the second hash value through a chaotic mapping function to obtain a third chaotic sequence; The third mapping module is configured to perform a bitwise exclusive OR operation on the second hash value and the third chaotic sequence to obtain the chaotic hash value.

[0012] In one embodiment, the system further comprises: A computing module is configured to select a pair of prime numbers, calculate the product and the Euler function, select an encryption prime number that is coprime with the Euler function, calculate a decryption prime number based on the encryption prime number and the Euler function, determine a public key based on the product and the encryption prime number, and determine a private key based on the decryption prime number; The encryption module is used to encrypt the fixed hash value using a public key and a private key to form a ciphertext, perform hash processing on the ciphertext, and generate a digital summary.

[0013] An embodiment of the present invention provides an electronic device, including a processor and a memory; The processor is connected to the memory; The memory is used to store executable program code; The processor reads the executable program code stored in the memory to run a program corresponding to the executable program code, so as to execute the method described in one or more embodiments.

[0014] An embodiment of the present invention provides a non-transitory computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of the above-mentioned method for auditing data service operation information based on digital summaries are implemented.

[0015] In view of the above, in one or more embodiments of the present specification, the original data is collected, the original data is grouped, the hash value of each group of data is calculated, and the hash value is chaotically mapped to obtain a chaotic hash value; the chaotic hash value and the preset salt value are spliced ​​to obtain a fixed hash value, and an asymmetric key is calculated, and the fixed hash value is signed and encrypted by the asymmetric key to generate a digital summary; the digital summary is bound to the corresponding operation log to generate an identifier, and the digital summary and the identifier are written to a private chain; when a check request is received, the digital summary is retrieved based on the identifier, and reversely verified through the digital summary. When the digital summary verification passes, the check operation is performed based on the check request. This ensures that when auditing data service operation information, the authenticity and integrity of the data service operation information are guaranteed, and while enhancing anti-attack and security, the operation speed is improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0017] Figure 1 This is a flowchart of a data service operation information auditing method based on digital summary provided by an embodiment of this specification.

[0018] Figure 2 This is a structural diagram of a data service operation information audit system based on digital summary provided by an embodiment of this specification.

[0019] Figure 3 This is a structural diagram of an electronic device provided by an embodiment of this specification. DETAILED DESCRIPTION

[0020] The subject matter described herein will now be discussed with reference to example embodiments. It should be understood that these embodiments are discussed only to enable those skilled in the art to better understand and implement the subject matter described herein, and are not intended to limit the scope of protection, applicability, or examples set forth in the claims. The functions and arrangements of the elements discussed may be changed without departing from the scope of protection of this specification. Various examples may omit, replace, or add various processes or components as needed. For example, the described method may be performed in an order different from the order described, and various steps may be added, omitted, or combined. In addition, features described relative to some examples may also be combined in other examples.

[0021] As used herein, the term "including" and its variations are open terms meaning "including but not limited to". The term "based on" means "based at least in part on". The terms "one embodiment" and "an embodiment" mean "at least one embodiment". The term "another embodiment" means "at least one other embodiment". The terms "first", "second", etc. may refer to different or the same objects. Other definitions may be included below, whether explicit or implicit. Unless the context clearly indicates otherwise, the definition of a term is consistent throughout the specification.

[0022] like Figure 1 As shown, an embodiment of the present invention provides a data service operation information audit method based on digital summary, including: Step S102: collecting original data, grouping the original data, calculating a hash value for each group of data, and performing chaotic mapping on the hash value to obtain a chaotic hash value.

[0023] Specifically, the operation of internal enterprise and user systems (such as ERP and databases) generates a large number of operation logs (e.g., user logins, data modifications, etc.). This data is a core data source for auditing. To prevent data tampering, the raw logs are converted into digital fingerprints, and a digital digest is first constructed. The digital digest construction process primarily involves processing data service operation information using a hash algorithm and an asymmetric encryption algorithm. The hash algorithm involves grouping the collected raw data and adjusting the length of each group to a fixed length, such as 512 bits. Groups with less than 512 bits can be padded with zeros to ensure that each group of data is of the same length, providing the clean data for subsequent chaotic mapping processing. A hash value is then calculated for each group of data, for example, using a hash algorithm (SHA-3) to obtain a corresponding 256-bit initial hash value.

[0024] Performing chaotic mapping on the initial hash value may include multiple chaotic mapping steps, wherein the chaotic mapping function may be a Tent Map function, and the function definition of the Tent Map function includes: Among them, r is the control parameter, which can be 3.9 in the Tent Map function. A random number with a length of 512 bits is selected as the initial value X0, and the first chaotic sequence X1, X2, ..., X with a length of 512 bits is obtained through iterative calculation based on the Tent Map function. n-1 , where n is the packet length.

[0025] Then perform bitwise XOR operation on the grouped original hash value and the chaotic sequence to obtain the second confusion sequence c1, c2, ..., c n-1 , thus destroying the original data pattern.

[0026] Among them, d i is the i-th element in the original data group.

[0027] For the confusion sequence c1, c2, ..., c n-1 The hash value h is calculated again using the hash algorithm (SHA-3 algorithm) to obtain the corresponding 256-bit second hash value h i .

[0028] For the second hash value h i , continue to perform iterative calculations in the chaotic mapping function to obtain a new third chaotic sequence y1, y2, ...yn-1.

[0029] Among them, r is the control parameter, which can be 3.9 in the Tent Map function. A random number with a length of 512 bits is selected as the initial value X0, and an iterative calculation is performed again based on the Tent Map function to obtain the second chaotic sequence X1, X2, ..., X with a length of 512 bits. n-1 , where n is the packet length.

[0030] Then the hash value h i The final chaotic hash value is obtained by performing a bitwise XOR operation with the new chaotic sequence y1, y2, ...yn-1. The iterative calculation of multiple obfuscation sequences can prevent data tamperers and attackers from reversely deducing the original log.

[0031] Step S104: concatenate the chaotic hash value and the preset salt value to obtain a fixed hash value, calculate an asymmetric key, sign and encrypt the fixed hash value using the asymmetric key, and generate a digital summary.

[0032] Specifically, the asymmetric encryption algorithm prevents the hash value calculated in the previous step from being replaced, binding the hash value to the user's identity. This includes: splicing the chaotic hash value and the preset salt value. The preset salt value is a random value introduced in the hash function. In the subsequent hash-based encryption algorithm, the introduction of the preset salt value can increase the randomness and unpredictability of the hash result, thereby improving security. The splicing process can be, for example: First, input the hash value H as plaintext into the hash function to obtain a hash value of fixed length: Then introduce the random salt value s, combine the hash value with the random salt value, and get: In the subsequent asymmetric encryption step, Encrypt as an integer, such as in the subsequent steps, As an integer M, the asymmetric encryption steps include: 1. Select two prime numbers p and q with larger values ​​and calculate their product and Euler function .

[0033] 2. Choose an integer e that satisfies , and e and Mutually prime.

[0034] 3. Calculate e about The modular inverse element d, that is, The public key is (N, e) and the private key is d.

[0035] 4. Encrypt the integer M into ciphertext C and calculate , complete the encryption processing of the hash value.

[0036] 5. Hash the ciphertext C to get the digital summary The digital summary D is the result of encrypting the hash value H.

[0037] Furthermore, when performing the asymmetric encryption calculations, techniques such as the fast exponentiation algorithm can be used to accelerate the RSA algorithm's calculation process and improve efficiency. Specifically, using the fast exponentiation algorithm to calculate the encryption exponent e and the decryption exponent d can significantly shorten the calculation time and improve efficiency.

[0038] Step S106: Bind the digital summary with the corresponding operation log to generate an identifier, and write the digital summary and the identifier into a private chain.

[0039] Specifically, after determining the digital summary of the original data, the legality of the data summary is reviewed based on the audit legitimacy requirements. After the legality review is passed, the corresponding identifier (DID) is generated based on the digital summary and the operation log. Among them, the basis for generating the DID may include the timestamp of the operation log and the hash chain of the data summary. The DID can be associated and bound. The binding objects include the digital summary, including the hash value, signature, salt value, and operation information, including the operator, time, target data, behavior type, etc. After the data binding is completed, the DID and the digital summary are written to the user's private chain for distributed storage. After distributed storage, the data's tamper-proof capabilities can be further enhanced. For example, the registration record of each DID must be verified by the consensus node, and modifications require the consent of more than 51% of the nodes.

[0040] Step S108: upon receiving the check request, retrieving the digital digest based on the identifier, and performing reverse verification through the digital digest; when the digital digest verification passes, performing a check operation based on the check request.

[0041] Specifically, after detecting an audit request, the audit request is parsed to determine the identifier corresponding to the target data being audited. Based on the DID, the corresponding digital summary record and original operation log are retrieved from the database (or distributed storage). The digital summary record is then reverse-verified. This reverse verification step can involve recalculating the hash value of the original log using the same Chaos-SHA3 algorithm used in the data summary generation process in the previous step and comparing it with the hash value stored in the database. Any inconsistency is flagged as data tampering. In addition to digital summary verification, other aspects of data integrity can also be verified, such as verifying the private key signature of asymmetric encryption and performing a reasonableness check on the timestamp of the original operation log.

[0042] Once the digital summary is verified, the requested checkpoints are executed, such as data desensitization, compliance checks, format conversion, and so on. Upon completion, an audit log is generated, recording the detailed information of the resolution request (requester, time, and operation results). The audit log is then registered with the system again through the digital summary module, forming an "audit log of logs."

[0043] The embodiment of the present invention provides a data service operation information audit method based on digital summary, which collects original data, groups the original data, calculates the hash value of each group of data, and performs chaotic mapping on the hash value to obtain a chaotic hash value; concatenates the chaotic hash value and the preset salt value to obtain a fixed hash value, and calculates an asymmetric key, and uses the asymmetric key to sign and encrypt the fixed hash value to generate a digital summary; binds the digital summary to the corresponding operation log to generate an identifier, and writes the digital summary and the identifier into a private chain; when an inspection request is received, the digital summary is retrieved based on the identifier, and reversely verified through the digital summary. When the digital summary verification passes, the inspection operation is performed based on the inspection request. In this way, the authenticity and integrity of the data service operation information are guaranteed when auditing the data service operation information, and the operation speed is improved while enhancing anti-attack and security.

[0044] See Figure 2 , Figure 2 This is a structural diagram of a data service operation information audit system based on digital summary provided by the embodiment of the present application. Figure 2 As shown, the system includes: The grouping module S202 is used to collect raw data, group the raw data, calculate the hash value of each group of data, and perform chaotic mapping on the hash value to obtain a chaotic hash value; The encryption module S204 is used to concatenate the chaotic hash value and the preset salt value to obtain a fixed hash value, calculate an asymmetric key, sign and encrypt the fixed hash value using the asymmetric key, and generate a digital summary; Identification module S206, configured to bind the digital summary to the corresponding operation log to generate an identifier, and write the digital summary and identifier into a private chain; The checking module S208 is configured to retrieve the digital digest based on the identifier upon receiving the checking request, and reversely verify the digital digest through the digital digest. When the digital digest verification passes, perform a checking operation based on the checking request.

[0045] In another embodiment, a data service operation information audit system based on digital summaries further includes: A first mapping module is used to set control parameters, iteratively calculate the chaotic mapping function to obtain a first chaotic sequence, and perform a bitwise XOR operation on the chaotic sequence and the hash value to obtain a second obfuscated sequence; A second mapping module is configured to calculate a second hash value of the second obfuscated sequence by using a hash algorithm, and iteratively calculate the second hash value through a chaotic mapping function to obtain a third chaotic sequence; The third mapping module is configured to perform a bitwise exclusive OR operation on the second hash value and the third chaotic sequence to obtain the chaotic hash value.

[0046] In another embodiment, a data service operation information audit system based on digital summaries further includes: A computing module is configured to select a pair of prime numbers, calculate the product and the Euler function, select an encryption prime number that is coprime with the Euler function, calculate a decryption prime number based on the encryption prime number and the Euler function, determine a public key based on the product and the encryption prime number, and determine a private key based on the decryption prime number; The encryption module is used to encrypt the fixed hash value using a public key and a private key to form a ciphertext, perform hash processing on the ciphertext, and generate a digital summary.

[0047] Those skilled in the art will clearly understand that the technical solutions of the embodiments of the present application can be implemented with the help of software and / or hardware. "Unit" and "module" in this specification refer to software and / or hardware that can independently perform or cooperate with other components to perform specific functions, where the hardware can be, for example, a field-programmable gate array (FPGA) or an integrated circuit (IC).

[0048] Each processing unit and / or module in the embodiments of the present application may be implemented by an analog circuit that implements the functions described in the embodiments of the present application, or may be implemented by software that executes the functions described in the embodiments of the present application.

[0049] See also Figure 3 , which shows a schematic diagram of the structure of an electronic device involved in an embodiment of the present application, the electronic device can be used to implement Figure 1 The method in the embodiment shown. Figure 3 As shown, the electronic device 300 may include: at least one processor 301 , at least one network interface 304 , a user interface 303 , a memory 305 , and at least one communication bus 302 .

[0050] The communication bus 302 is used to implement the connection and communication between these components.

[0051] The user interface 303 may include a display screen (Display) and a camera (Camera). Optionally, the user interface 303 may also include a standard wired interface and a wireless interface.

[0052] The network interface 304 may optionally include a standard wired interface or a wireless interface (such as a WI-FI interface).

[0053] The processor 301 may include one or more processing cores. The processor 301 utilizes various interfaces and circuits to connect various components within the electronic device 300. It executes instructions, programs, code sets, or instruction sets stored in the memory 305 and accesses data stored in the memory 305 to perform various functions and process data within the electronic device 300. Optionally, the processor 301 may be implemented using at least one of the following hardware forms: a digital signal processing (DSP), a field-programmable gate array (FPGA), or a programmable logic array (PLA). The processor 301 may integrate one or a combination of a central processing unit (CPU), a graphics processing unit (GPU), and a modem. The CPU primarily processes the operating system, user interface, and application programs; the GPU is responsible for rendering and drawing content displayed on the display; and the modem handles wireless communications. It is understood that the modem may also be implemented independently of the processor 301 and implemented on a separate chip.

[0054] Among them, the memory 305 may include a random access memory (RAM) or a read-only memory (Read-Only Memory). Optionally, the memory 305 includes a non-transitory computer-readable storage medium. The memory 305 can be used to store instructions, programs, codes, code sets or instruction sets. The memory 305 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playback function, an image playback function, etc.), instructions for implementing the above-mentioned various method embodiments, etc.; the data storage area may store data involved in the above-mentioned various method embodiments, etc. The memory 305 may also be optionally at least one storage device located away from the aforementioned processor 301. As Figure 3 As shown, the memory 305 as a computer storage medium may include an operating system, a network communication module, a user interface module, and program instructions.

[0055] exist Figure 3In the electronic device 300 shown, the user interface 303 is mainly used to provide an input interface for the user and obtain the data input by the user; and the processor 301 can be used to call the image-generated interactive application stored in the memory 305, and perform the following operations: collect original data, group the original data, calculate the hash value of each group of data, and perform chaotic mapping on the hash value to obtain a chaotic hash value; splice the chaotic hash value and the preset salt value to obtain a fixed hash value, and calculate the asymmetric key, sign and encrypt the fixed hash value with the asymmetric key to generate a digital summary; bind the digital summary to the corresponding operation log to generate an identifier, and write the digital summary and the identifier into a private chain; when a check request is received, retrieve the digital summary based on the identifier, and reversely verify through the digital summary. When the digital summary verification passes, perform a check operation based on the check request.

[0056] The present application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the above method. The computer-readable storage medium may include, but is not limited to, any type of disk, including a floppy disk, an optical disk, a DVD, a CD-ROM, a microdrive, a magneto-optical disk, a ROM, a RAM, an EPROM, an EEPROM, a DRAM, a VRAM, a flash memory device, a magnetic card or an optical card, a nanosystem (including a molecular memory IC), or any type of medium or device suitable for storing instructions and / or data.

[0057] It should be noted that for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that this application is not limited by the order of the actions described, because according to this application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by this application.

[0058] In the above embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0059] In the several embodiments provided in this application, it should be understood that the disclosed devices can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some service interface, and the indirect coupling or communication connection of the device or unit can be electrical or other forms.

[0060] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0061] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0062] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application, 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. The computer software product is stored in a memory and includes a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned memory includes: U disk, read-only memory (ROM), random access memory (RAM), mobile hard disk, magnetic disk, or optical disk, etc., various media that can store program code.

[0063] Those skilled in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be performed by instructing related hardware through a program, and the program may be stored in a computer-readable memory, which may include a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, etc.

[0064] The foregoing description of this specification describes specific embodiments. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims can be performed in an order different from that described in the embodiments and still achieve the desired results. Furthermore, the processes depicted in the accompanying drawings do not necessarily require the specific order shown or the sequential order to achieve the desired results. In certain embodiments, multitasking and parallel processing are also possible or may be advantageous.

Claims

1. A method for auditing data service operation information based on digital summaries, the method comprising: Collecting raw data, grouping the raw data, calculating a hash value for each group of data, and performing chaotic mapping on the hash value to obtain a chaotic hash value; Concatenate the chaotic hash value and the preset salt value to obtain a fixed hash value, calculate the asymmetric key, sign and encrypt the fixed hash value using the asymmetric key, and generate a digital summary; Binding the digital summary to the corresponding operation log to generate an identifier, and writing the digital summary and identifier into a private chain; When a check request is received, the digital digest is retrieved based on the identifier, and reverse verification is performed through the digital digest. When the digital digest verification passes, a check operation is performed based on the check request.

2. The method according to claim 1, characterized in that The chaotic mapping is performed on the hash value to obtain the chaotic hash value, including: Setting control parameters, combining iterative calculation with the chaotic mapping function to obtain a first chaotic sequence, performing a bitwise XOR operation on the chaotic sequence and the hash value to obtain a second obfuscated sequence; Calculating a second hash value of the second obfuscated sequence using a hash algorithm, and iteratively calculating the second hash value using a chaotic mapping function to obtain a third chaotic sequence; Perform a bitwise exclusive OR operation on the second hash value and the third chaotic sequence to obtain the chaotic hash value.

3. The method according to claim 2, characterized in that The calculation formula of the chaotic mapping function includes: Among them, r is the control parameter, is a random initial value, is the iterative chaotic sequence, and n is the group length.

4. The method according to claim 1, wherein The method of signing and encrypting a fixed hash value using an asymmetric key to generate a digital summary includes: Select a pair of prime numbers, calculate the product and the Euler function, and select an encryption prime number that is coprime with the Euler function, calculate a decryption prime number based on the encryption prime number and the Euler function, determine a public key based on the product and the encryption prime number, and determine a private key based on the decryption prime number; The fixed hash value is encrypted using a public key and a private key to form a ciphertext, and the ciphertext is hashed to generate a digital summary.

5. The method according to claim 4, characterized in that The method further comprises: The encryption prime number and the decryption prime number are generated based on a fast power algorithm.

6. A data service operation information audit system based on digital summary, characterized in that: The system comprises: A grouping module is used to collect raw data, group the raw data, calculate the hash value of each group of data, and perform chaotic mapping on the hash value to obtain a chaotic hash value; An encryption module is used to concatenate the chaotic hash value and a preset salt value to obtain a fixed hash value, calculate an asymmetric key, sign and encrypt the fixed hash value using the asymmetric key, and generate a digital summary; an identification module, configured to bind the digital summary to the corresponding operation log to generate an identifier, and write the digital summary and the identifier into a private chain; The checking module is configured to retrieve the digital summary based on the identifier upon receiving the checking request, and reversely verify the digital summary through the digital summary, and perform a checking operation based on the checking request when the digital summary verification passes.

7. The method according to claim 6, characterized in that The system further comprises: A first mapping module is used to set control parameters, iteratively calculate the chaotic mapping function to obtain a first chaotic sequence, and perform a bitwise XOR operation on the chaotic sequence and the hash value to obtain a second obfuscated sequence; A second mapping module is configured to calculate a second hash value of the second obfuscated sequence by using a hash algorithm, and iteratively calculate the second hash value through a chaotic mapping function to obtain a third chaotic sequence; The third mapping module is configured to perform a bitwise exclusive OR operation on the second hash value and the third chaotic sequence to obtain the chaotic hash value.

8. The method according to claim 6, characterized in that The system further comprises: A computing module is configured to select a pair of prime numbers, calculate the product and the Euler function, select an encryption prime number that is coprime with the Euler function, calculate a decryption prime number based on the encryption prime number and the Euler function, determine a public key based on the product and the encryption prime number, and determine a private key based on the decryption prime number; The encryption module is used to encrypt the fixed hash value using a public key and a private key to form a ciphertext, perform hash processing on the ciphertext, and generate a digital summary.

9. An electronic device comprising a processor and a memory; The processor is connected to the memory; The memory is used to store executable program code; The processor reads the executable program code stored in the memory to run a program corresponding to the executable program code, so as to execute the method according to any one of claims 1 to 5.

10. A computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the method according to any one of claims 1 to 5 when executed by a processor.

Citation Information

Cited By

  • User operation recording method and device, electronic equipment and readable storage medium

    CN121333685A