Zero-knowledge proof encryption method, system, equipment, medium and product

Abstract

The invention relates to the technical field of data encryption, and discloses a zero-knowledge proof encryption method, system, device, medium and product. According to the method, a message receiver receives communication information sent by a message generator and verifies the message generator; the method comprises the following steps of: generating a certification instruction matched with a to-be-certified instruction through a complete filtered image obtained by carrying out image filtering on an original certification image, carrying out difference comparison on the complete filtered image and a pre-stored filtered image through a message receiver, and verifying the credibility of communication information sent by a message generator according to a difference comparison result. Therefore, the filtering characteristic of the image is combined with the data encryption technology, the zero-knowledge verification process is simplified, the calculation complexity is reduced, only image comparison operation needs to be carried out in the verification process, the calculation efficiency is improved, the method is suitable for real-time application, meanwhile, sensitive data does not need to be transmitted, the information leakage risk is avoided, and the verification efficiency is improved. And the privacy protection effectiveness is improved.

Description

Technical Field

[0001] The present invention relates to the field of data encryption technology, and in particular to a zero-knowledge proof encryption method, system, device, medium and product. Background Art

[0002] As the demand for privacy protection increases, zero-knowledge proof technology has received widespread attention in privacy-sensitive fields such as blockchain and identity authentication. Zero-knowledge proof (ZKP) is a cryptographic technology that allows the prover to show the verifier the authenticity of specific information without revealing the specific content of the information. It has unique advantages in protecting privacy and enhancing information security, and is particularly suitable for scenarios where identity or data authenticity needs to be verified but the data content cannot be leaked.

[0003] In the field of privacy protection, zero-knowledge proof mainly relies on complex encryption algorithms. Most existing zero-knowledge proof algorithms are based on complex mathematical calculations and encryption operations, which require a lot of computing resources, especially when processing large-scale data. This high computational complexity makes zero-knowledge proof technology difficult to promote in some efficient verification and real-time application scenarios.

[0004] In traditional identity authentication and data sharing scenarios, information content is often disclosed or transmitted during the verification process, while the advantage of zero-knowledge proof is that it can verify the authenticity of information without leaking the information itself. However, in traditional zero-knowledge proof methods, it is still necessary to design and ensure the confidentiality of information transmission, and this transmission design has the risk of being cracked. Summary of the invention

[0005] In view of this, the present invention provides a zero-knowledge proof encryption method, system, device, medium and product, which solve the technical problems of high computational complexity and lack of data privacy protection in existing zero-knowledge proof encryption methods.

[0006] A first aspect of the present invention provides a zero-knowledge proof encryption method, comprising:

[0007] When the message receiving party receives the communication information sent by the message generating party, it sends a to-be-proven instruction to the message generating party; wherein the to-be-proven instruction includes the original proof graph generated corresponding to the communication information;

[0008] The message generator generates a proof instruction matching the instruction to be proved in response to the instruction to be proved sent by the message receiver, and sends the proof instruction to the message receiver, wherein the proof instruction includes a complete filtered image obtained after the original proof image is filtered;

[0009] The message receiver compares the complete filtered image with a pre-stored filtered image, and verifies the credibility of the communication information sent by the message generator based on the difference comparison result, wherein the pre-stored filtered image is a partial filtered image obtained after image filtering of the original proof image.

[0010] Preferably, the process of generating the original proof graph includes:

[0011] Performing hash processing on the communication information to generate a hash value;

[0012] Convert the hash value to a decimal number;

[0013] The original proof graph is generated by the decimal number.

[0014] Preferably, the method further comprises: a step of obtaining the complete filtered image after image filtering according to the original proof image; the step of obtaining the complete filtered image after image filtering according to the original proof image comprises:

[0015] Inputting the original proof image into a preset first filter for image filtering to obtain an initial filtered image;

[0016] The initial filtered image is input into a preset second filter for image filtering to obtain the complete filtered image; wherein the filtering parameters of the preset first filter and the preset second filter are both randomly generated.

[0017] Preferably, the method further comprises: allocating the preset first filter and the preset second filter to the message generator.

[0018] Preferably, the method further comprises:

[0019] Performing image segmentation on the complete filtered image to obtain a plurality of partial filtered images;

[0020] The original proof image and at least one of the partial filtered images are distributed to the message recipient.

[0021] Preferably, the message receiving party performs a difference comparison between the complete filtered image and a pre-stored filtered image, and verifies the credibility of the communication information sent by the message generating party according to the difference comparison result, including:

[0022] The message receiving party performs difference calculation between pixels of the pre-stored filtered image and the filtered image at a position corresponding to the pre-stored filtered image in the complete filtered image to obtain a pixel difference;

[0023] Determining whether the pixel difference satisfies a preset difference error range;

[0024] If it is determined that the pixel difference does not satisfy the preset difference error range, then it is determined that the communication information sent by the message generator is not credible;

[0025] If it is determined that the pixel difference satisfies the preset difference error range, then it is determined that the communication information sent by the message generator is credible.

[0026] In a second aspect, the present invention further provides a zero-knowledge proof encryption system, comprising:

[0027] A message receiving module, configured to send a to-be-proven instruction to the message generating module upon receiving the communication information sent by the message generating module; wherein the to-be-proven instruction includes an original proof diagram generated corresponding to the communication information;

[0028] The message generating module is used to generate a proof instruction matching the instruction to be proved in response to the instruction to be proved sent by the message receiving module, and send the proof instruction to the message receiving module, wherein the proof instruction includes a complete filtered image obtained after the original proof image is filtered;

[0029] The message receiving module is also used to compare the complete filtered image with the pre-stored filtered image, and verify the credibility of the communication information sent by the message generating module according to the difference comparison result, wherein the pre-stored filtered image is a partial filtered image obtained after image filtering of the original proof image.

[0030] In a third aspect, the present invention further provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the steps of the zero-knowledge proof encryption method as described in the first aspect.

[0031] In a fourth aspect, the present invention further provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed, the steps of the zero-knowledge proof encryption method as described in the first aspect are implemented.

[0032] In a fifth aspect, the present invention further provides a computer program product, comprising a computer program stored on a non-transitory computer-readable storage medium, wherein the computer program comprises program instructions, wherein when the program instructions are executed by a computer, the computer executes the steps of the zero-knowledge proof encryption method as described in the first aspect.

[0033] It can be seen from the above technical scheme that the present invention receives the communication information sent by the message generator through the message receiver, verifies the message generator, and introduces image filtering technology to generate a proof instruction matching the instruction to be proved through the complete filtered image obtained after the original proof image is filtered by the image. The message receiver compares the complete filtered image with the pre-stored filtered image, and verifies the credibility of the communication information sent by the message generator according to the difference comparison result, thereby simplifying the zero-knowledge verification process and reducing the computational complexity, making it suitable for efficient and frequent verification scenarios. During the verification process, only image comparison operations need to be performed, which improves the computational efficiency and is suitable for real-time applications. At the same time, there is no need to transmit sensitive data, the verification process is simple and effective, and the risk of information leakage is avoided, thereby improving the effectiveness of privacy protection. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0035] Figure 1 An application environment of a zero-knowledge proof encryption method provided by an embodiment of the present invention;

[0036] Figure 2 A flowchart of a zero-knowledge proof encryption method provided by an embodiment of the present invention;

[0037] Figure 3 A control block diagram of a zero-knowledge proof encryption method provided by an embodiment of the present invention;

[0038] Figure 4 A control block diagram for generating an original image in a zero-knowledge proof encryption method provided by an embodiment of the present invention;

[0039] Figure 5 A control block diagram for generating a filter graph in a zero-knowledge proof encryption method provided by an embodiment of the present invention;

[0040] Figure 6 A control block diagram of pre-allocation in a zero-knowledge proof encryption method provided by an embodiment of the present invention;

[0041] Figure 7 A schematic diagram of the structure of a zero-knowledge proof encryption system provided by an embodiment of the present invention;

[0042] Figure 8 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0043] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0044] The zero-knowledge proof encryption method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown. Among them, the message generator (also known as the prover) and the message receiver (also known as the verifier) ​​are connected to each other in communication. When the message receiver receives the communication information sent by the message generator, it sends the instruction to be proved to the message generator; wherein the instruction to be proved includes the original proof image generated corresponding to the communication information; the message generator responds to the instruction to be proved sent by the message receiver, generates a proof instruction matching the instruction to be proved, and sends the proof instruction to the message receiver, the proof instruction includes the complete filtered image obtained after the original proof image is filtered by the image; the message receiver compares the complete filtered image with the pre-stored filtered image, and verifies the credibility of the communication information sent by the message generator according to the difference comparison result, wherein the pre-stored filtered image is a partial filtered image obtained after the original proof image is filtered by the image.

[0045] The message generator and the message receiver may be two different terminals or different nodes in the same system.

[0046] like Figure 2~3 As shown, the embodiment of the present application provides a zero-knowledge proof encryption method, including the following steps S1 to S3. Among them:

[0047] Step S1. When the message receiving party receives the communication information sent by the message generating party, it sends the instruction to be proved to the message generating party; wherein the instruction to be proved includes the original proof diagram generated corresponding to the communication information.

[0048] Among them, communication information refers to the information that the message recipient and the message generator want to record or transmit, including message content, creation time and additional information.

[0049] In some embodiments, the process of generating the original proof graph includes:

[0050] Step S101: Perform hash processing on communication information to generate a hash value.

[0051] The hashing process can be recorded as follows:

[0052]

[0053] In the formula, For communication information, For hash processing, Is the hash value.

[0054] Step S102: Convert the hash value into a decimal number.

[0055] Among them, the decimal number conversion process can be recorded as:

[0056]

[0057] In the formula, is a decimal number, This is the decimal number conversion process.

[0058] Step S103, generate the original proof graph through decimal numbers.

[0059] Among them, the decimal number is used as the seed number to generate the original proof image through the fixed image generation model on the system, and the image can be used for comparison operations in the verification process. That is:

[0060]

[0061] In the formula, This is the original proof diagram. is the image generation function.

[0062] Step S2: The message generator generates a proof instruction that matches the instruction to be proved in response to the instruction to be proved sent by the message receiver, and sends the proof instruction to the message receiver. The proof instruction includes a complete filtered image obtained after the original proof image is filtered.

[0063] Among them, the complete filtered image is obtained by filtering the original proof image.

[0064] In image filtering algorithms, neighborhood filtering is the most basic type of filtering. When a 3×3 neighborhood filtering is performed on an image, the filter used for the filtering can be easily deduced by comparing the difference between the original image and the filtered image. However, when a dual filter is used in the filtering process, that is, the original image is filtered twice through two different filters, it is theoretically very difficult to deduc the two filters used by comparing the original image and the filtered image.

[0065] The embodiment of the present application simplifies the zero-knowledge verification process by introducing image filtering technology, reduces a large number of mathematical calculation steps in the traditional algorithm, and can complete the proof process more efficiently. This simplification not only ensures the authenticity of the verification, but also significantly reduces the calculation cost.

[0066] Specifically, in an embodiment of the present application, it also includes the step of obtaining a complete filtered image after image filtering based on the original proof image.

[0067] The steps of obtaining a complete filtered image after filtering the original proof image include:

[0068] Step S201: input the original proof image into a preset first filter for image filtering to obtain an initial filtered image.

[0069] Step S202: input the initial filtered image into a preset second filter for image filtering to obtain a complete filtered image; wherein the filtering parameters of the preset first filter and the preset second filter are both randomly generated.

[0070] For example, Figures 3-5 As shown, two filters (filter 1, filter 2) with the same size but randomly generated filtering parameters are generated by a random number generator, and the original proof image (original image) is input into filter 1 and filter 2 in turn for filtering to obtain a filtered image. The filtering process is defined as follows:

[0071]

[0072] In the formula, , They are filter 1 and filter 2 respectively. For the filtering process, , are two different random parameters used to generate different filters. Then, the original image Applied in sequence and Generate filtered image :

[0073]

[0074] Here, As the filtered image, Sufficient visual difference, but difficult to distinguish Inversely deduce the original filter parameters and .

[0075] It can be understood that the embodiment of the present application generates an "irreversible encrypted" image structure through image filtering, that is, the message is encoded into the image through random filtering. The verifier can use this image structure for verification without obtaining specific numerical or character information, thereby more effectively protecting information privacy.

[0076] Step S3: The message receiver compares the complete filtered image with the pre-stored filtered image, and verifies the credibility of the communication information sent by the message generator based on the difference comparison result, wherein the pre-stored filtered image is a partial filtered image obtained after image filtering of the original proof image.

[0077] In some embodiments, in order to improve the verification efficiency, the embodiments of the present application also pre-allocate the information. Specifically, Figure 6 As shown, after the system is ready, filter 1 and filter 2 are pre-allocated to the message generator, and the original image and the filtered image are pre-allocated to the message receiver.

[0078] Zero-knowledge proof technology has unique advantages in scenarios that require large-scale and frequent verification, such as blockchain, cryptocurrency, and cloud computing. However, high-frequency usage scenarios will face pressure in data calculation and transmission.

[0079] In order to solve the problem of data calculation and transmission pressure in high-frequency usage scenarios, the embodiments of the present application include:

[0080] Step S31, performing image segmentation on the complete filtered image to obtain multiple partial filtered images.

[0081] Step S32: distribute the original proof image and at least one partially filtered image to the message recipient.

[0082] For example, the original image And the partially filtered image Assigned to the message recipient. yes is a subset of , which is used to reduce the amount of data and the information that the verifier needs to store. Winning The sub-region of , which can be expressed as:

[0083]

[0084] In the formula, are the starting coordinates of the subregion. This subregion is compared with the filtered image provided by the prover during the verification process.

[0085] It can be understood that the image filtering zero-knowledge proof algorithm used in the embodiment of the present application only needs to store limited image information and filtering parameters, which can greatly reduce the amount of data that needs to be transmitted and stored, simplify the data verification process, and improve the response speed and adaptability of the system.

[0086] It should be noted that the traditional zero-knowledge proof algorithm requires the design of a special algorithm structure and multiple verification steps to ensure the authenticity of the information. This operational complexity places high demands on the user's technical level, making the deployment and application of zero-knowledge proof more difficult.

[0087] In the embodiments of the present application, by organically combining image filtering and zero-knowledge proof, the verification operation is simplified by utilizing the random filtering process of the image. The verifier can complete the verification through simple image comparison, thereby lowering the application threshold of zero-knowledge proof and improving the operability and popularity of the application.

[0088] Specifically, in step S3, the message receiver compares the complete filtered image with the pre-stored filtered image, and verifies the credibility of the communication information sent by the message generator according to the difference comparison result, including:

[0089] Step S301: The message receiver calculates the difference between the pre-stored filtered image and the pixels of the filtered image at the corresponding position of the pre-stored filtered image in the complete filtered image to obtain the pixel difference.

[0090] The pre-stored filtered image is a partial filtered image obtained after segmentation of the complete filtered image. Therefore, the pre-stored filtered image can be positioned in the complete filtered image to determine the filtered image at a corresponding position of the pre-stored filtered image in the complete filtered image.

[0091] Step S302: determine whether the pixel difference satisfies a preset difference error range.

[0092] Step S303: If it is determined that the pixel difference does not satisfy the preset difference error range, it is determined that the communication information sent by the message generator is not credible.

[0093] Step S304: If it is determined that the pixel difference satisfies the preset difference error range, it is determined that the communication information sent by the message generator is credible.

[0094] As a preferred solution, when the message receiver receives the result, it can compare the difference of the partial filtered image it contains at the corresponding position. If the pixel difference is zero, it can be proved that there is no difference between the pre-stored filtered image and the filtered image at the corresponding position of the pre-stored filtered image in the complete filtered image, and it can be determined that the message generator is indeed the correct sender and has not obtained the specific information of the filter used for the image. If there is a difference, it can be proved that there is a difference between the pre-stored filtered image and the filtered image at the corresponding position of the pre-stored filtered image in the complete filtered image, and it can be determined that the sender is not the original message generator and the received message is not credible.

[0095] For example, after receiving the message, the message recipient sends the original image Return to the message generator, asking it to provide a complete filtered image The verifier will and The pixel difference calculation is performed on the corresponding parts of the information. If the two are consistent, it can be verified that the proving party is indeed the sender of the information.

[0096] set up for and The pixel difference is:

[0097] .

[0098] The verification conditions for verifying that the proving party is indeed the sender of the information are:

[0099] .

[0100] It should be noted that, in the embodiment of the present application, the message receiving party receives the communication information sent by the message generating party, verifies the message generating party, and introduces image filtering technology to generate a proof instruction matching the instruction to be proved through a complete filtered image obtained after image filtering of the original proof image, and compares the complete filtered image with the pre-stored filtered image through the message receiving party, and verifies the credibility of the communication information sent by the message generating party based on the difference comparison result, thereby simplifying the zero-knowledge verification process and reducing the computational complexity, making it suitable for efficient and frequent verification scenarios. During the verification process, only image comparison operations need to be performed, which improves computational efficiency and is suitable for real-time applications. At the same time, there is no need to transmit sensitive data, the verification process is simple and effective, the risk of information leakage is avoided, and the effectiveness of privacy protection is improved.

[0101] Based on the same inventive concept, an embodiment of the present application also provides a zero-knowledge proof encryption system for implementing the zero-knowledge proof encryption method involved above.

[0102] The implementation solution provided by the system to solve the problem is similar to the implementation solution recorded in the above method. Therefore, the specific limitations in one or more zero-knowledge proof encryption system embodiments provided below can refer to the limitations on the zero-knowledge proof encryption method above and will not be repeated here.

[0103] like Figure 7 As shown, the embodiment of the present application also provides a zero-knowledge proof encryption system, including:

[0104] The message receiving module 100 is used to send a to-be-proven instruction to the message generating module 200 when receiving the communication information sent by the message generating module 200; wherein the to-be-proven instruction includes the original proof diagram generated corresponding to the communication information;

[0105] The message generating module 200 is used to generate a proof instruction matching the instruction to be proved in response to the instruction to be proved sent by the message receiving module 100, and send the proof instruction to the message receiving module 100, wherein the proof instruction includes a complete filtered image obtained after the original proof image is filtered;

[0106] The message receiving module 100 is also used to compare the complete filtered image with the pre-stored filtered image, and verify the credibility of the communication information sent by the message generating module 200 according to the difference comparison result, wherein the pre-stored filtered image is a partial filtered image obtained after image filtering of the original proof image.

[0107] In some embodiments, the system further includes a proof graph generation module 300 for generating an original proof graph, specifically including:

[0108] Perform hash processing on the communication information to generate a hash value;

[0109] Convert the hash value to a decimal number;

[0110] Generate the original proof graph through decimal numbers.

[0111] In some embodiments, the system further includes a random filter generation module 400, which is used to obtain a complete filtered image after image filtering based on the original proof image.

[0112] Among them, after the original proof image is filtered, a complete filtered image is obtained, including:

[0113] Input the original proof image into a preset first filter for image filtering to obtain an initial filtered image;

[0114] The initial filtered image is input into a preset second filter for image filtering to obtain a complete filtered image; wherein the filtering parameters of the preset first filter and the preset second filter are both randomly generated.

[0115] In some embodiments, the system further includes a pre-assignment module 500 for assigning a preset first filter and a preset second filter to a message generator.

[0116] The pre-allocation module is also used to perform image segmentation on the complete filtered image to obtain multiple partial filtered images; and allocate the original proof image and at least one partial filtered image to the message recipient.

[0117] In some embodiments, the message receiving module 100 includes a zero-knowledge proof module 600, which is used to calculate the difference between the pixels of the pre-stored filtered image and the filtered image at the corresponding position of the pre-stored filtered image in the complete filtered image through the message receiving party to obtain a pixel difference; determine whether the pixel difference is greater than a preset difference threshold; if the pixel difference is greater than the preset difference threshold, it is determined that the communication information sent by the message generator is not credible; if the pixel difference is not greater than the preset difference threshold, it is determined that the communication information sent by the message generator is credible.

[0118] like Figure 8 As shown, an embodiment of the present application also provides an electronic device, the electronic device 10 includes a memory 20 and a processor 30, the memory 20 stores a computer program, and when the computer program is executed by the processor 30, the processor 30 executes the steps of the zero-knowledge proof encryption method in the above embodiment.

[0119] An embodiment of the present application also provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed, the steps of the zero-knowledge proof encryption method in the above embodiment are implemented.

[0120] An embodiment of the present application also provides a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium, and the computer program includes program instructions, wherein when the program instructions are executed by a computer, the computer executes the steps of the zero-knowledge proof encryption method in the above embodiment.

[0121] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described systems, electronic devices, computer storage media and computer program products can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0122] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0123] In several embodiments provided by the present invention, it is understood that each box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and a part of a module, a program segment or a code includes one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from that marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved.

[0124] In the several embodiments provided by the present invention, it should be understood that the disclosed systems, electronic devices, computer storage media, computer program products and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, 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 an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

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

[0126] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0127] 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 storage medium. Based on this understanding, the technical solution of the present invention is essentially 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 storage medium, including several instructions for executing all or part of the steps of the method described in each embodiment of the present invention through a computer device (which can be a personal computer, server, or network device, etc.). The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (full name in English: Read-Only Memory, English abbreviation: ROM), random access memory (full name in English: Random Access Memory, English abbreviation: RAM), disk or optical disk and other media that can store program codes.

[0128] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A zero-knowledge proof encryption method, characterized in that: include: When the message receiving party receives the communication information sent by the message generating party, it sends a to-be-proven instruction to the message generating party; wherein the to-be-proven instruction includes the original proof graph generated corresponding to the communication information; The message generator generates a proof instruction matching the instruction to be proved in response to the instruction to be proved sent by the message receiver, and sends the proof instruction to the message receiver, wherein the proof instruction includes a complete filtered image obtained after the original proof image is filtered; The message receiver compares the complete filtered image with a pre-stored filtered image, and verifies the credibility of the communication information sent by the message generator based on the difference comparison result, wherein the pre-stored filtered image is a partial filtered image obtained after image filtering of the original proof image.

2. The zero-knowledge proof encryption method according to claim 1, characterized in that: The generation process of the original proof graph includes: Performing hash processing on the communication information to generate a hash value; Convert the hash value to a decimal number; The original proof graph is generated by the decimal number.

3. The zero-knowledge proof encryption method according to claim 1, characterized in that: Also includes: A step of obtaining the complete filtered image after image filtering according to the original proof image; The step of obtaining the complete filtered image after image filtering according to the original proof image comprises: Inputting the original proof image into a preset first filter for image filtering to obtain an initial filtered image; The initial filtered image is input into a preset second filter for image filtering to obtain the complete filtered image; wherein the filtering parameters of the preset first filter and the preset second filter are both randomly generated.

4. The zero-knowledge proof encryption method according to claim 3, characterized in that: Also includes: The preset first filter and the preset second filter are allocated to the message generator.

5. The zero-knowledge proof encryption method according to claim 1, characterized in that: Also includes: Performing image segmentation on the complete filtered image to obtain a plurality of partial filtered images; The original proof image and at least one of the partial filtered images are distributed to the message recipient.

6. The zero-knowledge proof encryption method according to claim 1, characterized in that: The message receiving party compares the complete filtered image with a pre-stored filtered image, and verifies the credibility of the communication information sent by the message generating party according to the difference comparison result, including: The message receiving party performs difference calculation between pixels of the pre-stored filtered image and the filtered image at a position corresponding to the pre-stored filtered image in the complete filtered image to obtain a pixel difference; Determining whether the pixel difference satisfies a preset difference error range; If it is determined that the pixel difference does not satisfy the preset difference error range, then it is determined that the communication information sent by the message generator is not credible; If it is determined that the pixel difference satisfies the preset difference error range, then it is determined that the communication information sent by the message generator is credible.

7. A zero-knowledge proof encryption system, characterized in that: include: A message receiving module, configured to send a to-be-proven instruction to the message generating module upon receiving the communication information sent by the message generating module; wherein the to-be-proven instruction includes an original proof diagram generated corresponding to the communication information; The message generating module is used to generate a proof instruction matching the instruction to be proved in response to the instruction to be proved sent by the message receiving module, and send the proof instruction to the message receiving module, wherein the proof instruction includes a complete filtered image obtained after the original proof image is filtered; The message receiving module is also used to compare the complete filtered image with the pre-stored filtered image, and verify the credibility of the communication information sent by the message generating module according to the difference comparison result, wherein the pre-stored filtered image is a partial filtered image obtained after image filtering of the original proof image.

8. An electronic device, characterized in that: The electronic device includes a memory and a processor, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes the steps of the zero-knowledge proof encryption method as described in any one of claims 1-6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed, the steps of the zero-knowledge proof encryption method as described in any one of claims 1 to 6 are implemented.

10. A computer program product, characterized in that The computer program product comprises a computer program stored on a non-transitory computer-readable storage medium, wherein the computer program comprises program instructions, wherein when the program instructions are executed by a computer, the computer is caused to perform the steps of the zero-knowledge proof encryption method as described in any one of claims 1 to 6.

Images