Digital signature verification system and method based on big data

By introducing the encryption mechanism of the crypto party's trace information and keys in digital signature verification, the problem of the inability to trace the signature source in the existing technology is solved, and the security and efficiency of digital signature verification is improved, ensuring the integrity and authenticity of information .

CN119030719APending Publication Date: 2024-11-26WUXI ALEADER INTELLIGENT TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410004999.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-01-03
Publication Date
2024-11-26

AI Technical Summary

Technical Problem

The existing digital signature verification technology cannot effectively trace the source and verification process of signatures, resulting in the decryption party receiving forged information and being unable to distinguish the real information when the key is leaked, resulting in the threat of data security and integrity.

Method used

By introducing traceability information during the encryption process, including the name, address and time of the encrypted party, and encrypting it with the key to generate a traceability ciphertext, the decryption party can judge the correctness of the traceability information to decide whether to continue decrypting the information. Hash algorithms and DSA encryption algorithms verify the integrity of digital signatures.

Benefits of technology

It improves the credibility and security of digital signature verification, allowing the decryptor to initially judge its security when receiving ciphertexts, improves efficiency, and ensures the integrity and authenticity of information.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119030719A_ABST
    Figure CN119030719A_ABST
Patent Text Reader

Abstract

The invention discloses a digital signature verification system and method based on big data, and relates to the technical field of data encryption. The verification method comprises the following steps: step S100, generating an information abstract, encrypting to obtain a digital signature, and writing the digital signature into information to obtain digital information; step S200, randomly generating a secret key to encrypt the digital information to obtain a ciphertext, and encrypting the secret key to obtain an encrypted secret key; step S300, generating tracing information; encrypting the tracing information to obtain a tracing ciphertext; step S400, decrypting the traceability ciphertext to obtain traceability information; step S500, judging whether the traceability information is correct or not, and decrypting the secret key by using the private key; step S600, operating the information by using a Hash algorithm to obtain a first information abstract, and decrypting the digital signature to obtain a second information abstract; and comparing whether the two abstracts are consistent or not.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of data encryption technology, and in particular to a digital signature verification system and method based on big data. Background Art

[0002] A digital signature is a string of numbers that can only be generated by the sender of the information and cannot be forged by others. It is used to verify the identity of the signer and the approval of the content of an electronic data. It can also verify whether the original text of the document has been changed during the transmission process, ensure the identity authentication of the sender, and ensure the integrity, authenticity and non-repudiation of the transmitted electronic file.

[0003] Although digital signature technology is relatively safe at present, there are still some means of attack, such as private key cracking, forgery of digital signatures and replay attacks; these attacks may render the signature ineffective, resulting in threats to the security and integrity of data; in traditional digital signature verification, usually only the authenticity of the signature can be verified, but the source of the signature and the verification process cannot be traced, which causes the decryption party to receive forged information from others due to the leakage of the encryption party's key and miss the real information. Summary of the invention

[0004] The purpose of the present invention is to provide a digital signature verification system and method based on big data to solve the problems raised in the above background technology.

[0005] In order to solve the above technical problems, the present invention provides the following technical solutions: a digital signature verification method based on big data, the verification method comprising the following steps:

[0006] Step S100: Generate a message digest using a hash algorithm, encrypt the message digest using the encryption party's private key to obtain a digital signature, and write the digital signature into the message to obtain digital information;

[0007] Step S200: randomly generate a key X to encrypt the digital information to obtain ciphertext, and encrypt the key X with the public key of the decryption party to obtain the encrypted key

[0008] Step S300: After the encryption key Write the name, address information Add and time T of the encryption party to generate traceability information Use the public key of the decryptor to trace the information Encrypt to get the traceable ciphertext

[0009] Step S400: trace the ciphertext Transmitted to the decryptor, the decryptor uses the private key to trace the ciphertext Decrypt to get traceability information

[0010] Step S500: Determine traceability information Is it correct? After it is correct, use the private key to decrypt the key X;

[0011] Step S600: Use the decrypted key X to decrypt the ciphertext transmitted by the information to obtain information, use the same hash algorithm to calculate the decrypted information to obtain the first information summary S1, use the public key of the encryption party to decrypt the digital signature to obtain the second information summary S2; compare whether the two summaries are consistent.

[0012] Furthermore, in step S100, the information digest is generated and encrypted to obtain a digital signature, including the following steps:

[0013] Step S101: Divide the information into groups of k bytes, assuming the number of bytes of the information is m; calculate the number of groups n according to the formula 组 :

[0014]

[0015] When the number of groups n 组 If it is not an integer, the number of bytes to be filled is calculated according to the formula:

[0016] l=k-mod(m,k)

[0017] Among them, mod() is the remainder function, and mod(m,k) represents the remainder obtained by dividing m by k;

[0018] Step S102: When the number of groups n is divided 组 Integer or byte-filled When it is an integer, a checksum of k bytes is added to the end of the message;

[0019] Step S103: using the MD function to process each group of information, and integrating each group of processed information to obtain an information summary;

[0020] Step S104: Use the DSA encryption algorithm to encrypt the information summary using the encryptor's private key to obtain a digital signature.

[0021] Furthermore, the random generation of the key X in step S200 includes the following steps:

[0022] Step S201: Assume that the randomly generated key X has a total of m digits, the value of the i-th digit in the key X is X(i), and X(1) is randomly generated;

[0023] The value X(i+1) of the i+1th bit in the key X is obtained according to the formula:

[0024] X(i+1)=mod[A×X(i)+B,C]

[0025] Among them, A, B and C are constant coefficients, and mod() is the remainder function;

[0026] Step S202: After the value of X(m) is calculated, each value is arranged in order of i to form the key X;

[0027] Furthermore, in step S200, the key X is encrypted with the public key, including the following steps:

[0028] Step S210: Select two different prime numbers p and q; calculate the modulus r according to the formula:

[0029] r=p×q

[0030] Calculate the number of positive integers that are less than the modulus r and are mutually prime to the modulus r according to the formula

[0031]

[0032] Step S220: Set when When , the value of e is obtained; where gcd() is a function for finding the greatest common divisor;

[0033] Step S230: Calculate the inverse element d of e on the domain modulo r, so that mod(e×d,r)=1;

[0034] Step S240: Generate a public key (r, e) and a private key (r, d); according to the formula:

[0035]

[0036] Use the public key to encrypt key X to get the encrypted key

[0037] Furthermore, in step S300, the public key of the decryption party is used to encrypt the traceable ciphertext The following steps are involved:

[0038] Step S301: After encryption, the key Write the name of the encryption party, the address information Add obtained in real time by the positioning system, and the time T obtained in real time to generate traceability information

[0039] Step S302: Generate a new public key (r', e') and private key (r', d') by using the method of encrypting the secret key with the public key in step S200; Encrypt to get the traceable ciphertext

[0040] Furthermore, in step S400, the decryption party uses the private key to decrypt the traceability ciphertext:

[0041] Use the private key (r', d') to decrypt the traceable ciphertext according to the formula:

[0042]

[0043] Get the traceability information x.

[0044] Furthermore, in step S500, the traceability information is determined Is it correct? It includes the following steps:

[0045] Step S501: pre-set the target address information Add1, the earliest target arrival time T e , the latest arrival time of the target is T l and the name of the encryption party;

[0046] Step S502: Compare traceability information The name of the encryption party in the encryption process and the name of the encryption party set in advance are compared. If the comparison result is inconsistent, the decryption party is prompted that an error has occurred in the ciphertext.

[0047] Step S503: Compare traceability information The address information Add in the pre-set target address information Add1, statistical tracing information The number of characters num1 in the address information Add in the target address information Add1 and the number of characters num2 that are different from the address information Add in the preset target address information Add1; the number of characters that are different from the address information Add in the traceability information is calculated according to the formula The address information in Add accounts for η:

[0048]

[0049] Set a threshold value θ. When η>θ, it indicates that the decryption party has an error in the ciphertext.

[0050] Step S504: Compare time T and earliest target arrival time T e , time T and the latest arrival time of the target T l When T <T e Or T>T l When the ciphertext is decrypted, it will prompt that an error has occurred in the decryption party.

[0051] Furthermore, in step S600, the ciphertext is decrypted using the key X, and the digital signature is decrypted using the public key, including the following steps:

[0052] Step S601: Use the private key (r, d) to encrypt the key Decrypt and get the key X according to the formula:

[0053]

[0054] Step S602: Decrypt the digital ciphertext using the key X and obtain digital information according to the formula:

[0055]

[0056] Splitting digital information into information and digital signature;

[0057] Step S603: applying the method described in step S100 to the information to obtain a first digital summary S1;

[0058] Step S604: Decrypt the digital signature using the DSA decryption algorithm to obtain a second digital summary S2;

[0059] Step S605: compare the first digital summary S1 with the second digital summary S2. If S1=S2, it is determined that there is no error in the information. If S1≠S2, it is prompted that there is an error in the information.

[0060] Furthermore, a digital signature verification system based on a digital signature verification method of big data is provided, wherein the system comprises a digital signature generation module, a key encryption module, a tracing ciphertext generation module, a tracing ciphertext decryption module, a key decryption module and a summary module;

[0061] The digital signature module is used to generate a message digest using a hash algorithm, encrypt the message digest using the private key of the encryptor to obtain a digital signature, and write the digital signature into the message to obtain digital information;

[0062] The key encryption module is used to randomly generate a key X to encrypt digital information to obtain ciphertext, and encrypt the key X with the public key of the decryption party to obtain the encrypted key

[0063] The traceability ciphertext generation module uses the encrypted key Write the name, address information Add and time T of the encryption party to generate traceability information Use the public key of the decryptor to trace the information Encrypt to get the traceable ciphertext

[0064] The tracing ciphertext decryption module is used to transmit the tracing ciphertext to the decryption party, and the decryption party uses the private key to decrypt the tracing ciphertext to obtain the tracing information;

[0065] The key decryption module is used to determine the traceability information Is it correct? After it is correct, use the private key to decrypt the key X;

[0066] The summary module is used to decrypt the ciphertext transmitted by the information with the decrypted key X to obtain information, use the same hash algorithm to calculate the decrypted information to obtain the first information summary S1, use the public key of the encryption party to decrypt the digital signature to obtain the second information summary S2; and compare whether the two summaries are consistent.

[0067] Compared with the prior art, the beneficial effects achieved by the present invention are as follows: 1. The present invention adds the name, encryption address and encryption time of the encryption party during the encryption process, and encrypts the traceability information together with the key to obtain the traceability ciphertext. By introducing the traceability mechanism, the entire digital signature verification process is made more credible and secure; 2. The decryption party decrypts the traceability ciphertext to obtain the traceability information and the key, and determines whether the traceability information is correct to decide whether to continue to use the key to decrypt the information, so that the decryption party can initially judge the security of the ciphertext when receiving the ciphertext, thereby improving efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0068] The accompanying drawings are used to provide a further understanding of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings:

[0069] Figure 1 It is a schematic diagram of the steps of a digital signature verification method based on big data;

[0070] Figure 2 It is a module diagram of a digital signature verification system based on big data. DETAILED DESCRIPTION

[0071] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions 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.

[0072] See also Figure 1 and Figure 2 The present invention provides a technical solution: a digital signature verification method based on big data, the verification method comprising the following steps:

[0073] Step S100: Generate a message digest using a hash algorithm, encrypt the message digest using the encryption party's private key to obtain a digital signature, and write the digital signature into the message to obtain digital information;

[0074] The step S100 generates a message digest and encrypts it to obtain a digital signature, including the following steps:

[0075] Step S101: Divide the information into groups of k bytes, assuming the number of bytes of the information is m; calculate the number of groups n according to the formula 组 :

[0076]

[0077] When the number of groups n 组 If it is not an integer, the number of bytes to be filled is calculated according to the formula:

[0078] l=k-mod(m,k)

[0079] Among them, mod() is the remainder function, and mod(m,k) represents the remainder obtained by dividing m by k;

[0080] Step S102: When the number of groups n is divided 组 Integer or byte-filled When it is an integer, a checksum of k bytes is added to the end of the message;

[0081] Step S103: using the MD function to process each group of information, and integrating each group of processed information to obtain an information summary;

[0082] Step S104: Use the DSA encryption algorithm to encrypt the information summary using the encryptor's private key to obtain a digital signature.

[0083] Step S200: randomly generate a key X to encrypt the digital information to obtain ciphertext, and encrypt the key X with the public key of the decryption party to obtain the encrypted key

[0084] The random generation of the key X in step S200 includes the following steps:

[0085] Step S201: Assume that the randomly generated key X has a total of m digits, the value of the i-th digit in the key X is X(i), and X(1) is randomly generated;

[0086] The value X(i+1) of the i+1th bit in the key X is obtained according to the formula:

[0087] X(i+1)=mod[A×X(i)+B,C]

[0088] Among them, A, B and C are constant coefficients, and mod() is the remainder function;

[0089] Step S202: After the value of X(m) is calculated, each value is arranged in order of i to form the key X;

[0090] Furthermore, in step S200, the key X is encrypted with the public key, including the following steps:

[0091] Step S210: Select two different prime numbers p and q; calculate the modulus r according to the formula:

[0092] r=p×q

[0093] Calculate the number of positive integers that are less than the modulus r and are mutually prime to the modulus r according to the formula

[0094]

[0095] Step S220: Set when When , the value of e is obtained; where gcd() is a function for finding the greatest common divisor;

[0096] Step S230: Calculate the inverse element d of e on the domain modulo r, so that mod(e×d,r)=1;

[0097] Step S240: Generate a public key (r, e) and a private key (r, d); according to the formula:

[0098]

[0099] Use the public key to encrypt key X to get the encrypted key

[0100] Step S300: After the encryption key Write the name, address information Add and time T of the encryption party to generate the traceability information x; use the public key of the decryption party to encrypt the traceability information Encrypt to get the traceable ciphertext

[0101] Among them, in step S300, the public key of the decryption party is used to encrypt the traceability ciphertext The following steps are involved:

[0102] Step S301: After encryption, the key Write the name of the encryption party, the address information Add obtained in real time by the positioning system, and the time T obtained in real time to generate traceability information

[0103] Step S302: Generate a new public key (r ‘ ,e') and private key (r ‘ ,d'); Encrypt the traceability information x to obtain the traceability ciphertext

[0104] Furthermore, in step S400, the decryption party uses the private key to decrypt the traceability ciphertext:

[0105] Using the private key (r ‘ ,d') decrypt the traceable ciphertext according to the formula:

[0106]

[0107] Get traceability information

[0108] Step S400: trace the ciphertext Transmitted to the decryptor, the decryptor uses the private key to trace the ciphertext Decrypt to get traceability information

[0109] Among them, in step S400, the decryption party uses the private key to decrypt the traceability ciphertext:

[0110] Using the private key (r ‘ ,d') decrypt the traceable ciphertext according to the formula:

[0111]

[0112] Get traceability information

[0113] Step S500: Determine traceability information Is it correct? After it is correct, use the private key to decrypt the key X;

[0114] The step S500 of determining whether the traceability information x is correct includes the following steps:

[0115] Step S501: pre-set the target address information Add1, the earliest target arrival time T e , the latest arrival time of the target is T l and the name of the encryption party;

[0116] Step S502: Compare traceability information The name of the encryption party in the encryption process and the name of the encryption party set in advance are compared. If the comparison result is inconsistent, the decryption party is prompted that an error has occurred in the ciphertext.

[0117] Step S503: Compare traceability information The address information Add in the pre-set target address information Add1, statistical tracing information The number of characters num1 in the address information Add in the target address information Add1 and the number of characters num2 that are different from the address information Add in the preset target address information Add1; the number of characters that are different from the address information Add in the traceability information is calculated according to the formula The address information in Add accounts for η:

[0118]

[0119] Set a threshold value θ. When η>θ, it indicates that the decryption party has an error in the ciphertext.

[0120] Step S504: Compare time T and earliest target arrival time T e , time T and the latest arrival time of the target T l When T <T e Or T>T l When the ciphertext is decrypted, it will prompt that an error has occurred in the decryption party.

[0121] Step S600: decrypt the ciphertext transmitted by the information with the decrypted key X to obtain the information, use the same hash algorithm to calculate the decrypted information to obtain the first information summary S1, use the public key of the encryption party to decrypt the digital signature to obtain the second information summary S2; compare whether the two summaries are consistent;

[0122] In step S600, the ciphertext is decrypted using the key X, and the digital signature is decrypted using the public key, including the following steps:

[0123] Step S601: Use the private key (r, d) to encrypt the key Decrypt and get the key X according to the formula:

[0124]

[0125] Step S602: Decrypt the digital ciphertext using the key X and obtain digital information according to the formula:

[0126]

[0127] Splitting digital information into information and digital signature;

[0128] Step S603: applying the method described in step S100 to the information to obtain a first digital summary S1;

[0129] Step S604: Decrypt the digital signature using the DSA decryption algorithm to obtain a second digital summary S2;

[0130] Step S605: compare the first digital summary S1 with the second digital summary S2. If S1=S2, it is determined that there is no error in the information. If S1≠S2, it is prompted that there is an error in the information.

[0131] Among them, a digital signature verification system based on a digital signature verification method of big data, the system includes a digital signature generation module, a key encryption module, a traceability ciphertext generation module, a traceability ciphertext decryption module, a key decryption module and a summary module;

[0132] The digital signature module is used to generate a message digest using a hash algorithm, encrypt the message digest using the private key of the encryptor to obtain a digital signature, and write the digital signature into the message to obtain digital information;

[0133] The key encryption module is used to randomly generate a key X to encrypt digital information to obtain ciphertext, and encrypt the key X with the public key of the decryption party to obtain the encrypted key

[0134] The traceability ciphertext generation module uses the encrypted key Write the name, address information Add and time T of the encryption party to generate traceability information Use the public key of the decryptor to trace the information Encrypt to get the traceable ciphertext

[0135] The tracing ciphertext decryption module is used to transmit the tracing ciphertext to the decryption party, and the decryption party uses the private key to decrypt the tracing ciphertext to obtain the tracing information;

[0136] The key decryption module is used to determine the traceability information Is it correct? After it is correct, use the private key to decrypt the key X;

[0137] The summary module is used to decrypt the ciphertext transmitted by the information with the decrypted key X to obtain information, use the same hash algorithm to calculate the decrypted information to obtain the first information summary S1, use the public key of the encryption party to decrypt the digital signature to obtain the second information summary S2; and compare whether the two summaries are consistent.

[0138] Assume that the number of bytes of the transmitted information is 1024B, and divide the information into groups of 100B. The number of groups divided is Because the number of groups n 组It is not an integer, so the information needs to be padded. The number of bytes required to be padded is l=100-mod(1024,100)=76B. After the padding is completed, the transmitted information is divided into 11 groups, and finally a 100-byte checksum is added to the end of the information; the MD function is used to process the information of each group, and each group of processed information is integrated to obtain the information summary.

[0139] In the process of randomly generating a key, assume that the key X has a total of 4 digits, and randomly generate the first digit 6. Set the formula X(i+1)=mod[3×X(i)+7,9], and get the second digit as 7, the third digit as 1, and the fourth digit as 1; therefore, the key X is 6711;

[0140] Encrypt key X to get key In the key Write Zhang San, xx province xx city xx county xxx, 0730102535 after it and generate traceability information Decrypt with the private key to get the key and traceability information First, compare the characters of the name, and then trace the information If the name in the ciphertext is inconsistent with the preset name, it is judged that the ciphertext is wrong or not the ciphertext required by the revealer, and the decryptor does not need to continue decryption; when the name is consistent, the address information Add is continued to be compared, and the traceability information is set. The number of characters in the address information Add in num1=20, and the number of characters in the preset target address information Add1 that are different from the address information Add is num2=2, so the characters that are different from the address information Add are obtained in the traceability information. The proportion of address information in Add Set the threshold θ = 20%. Since η < θ, there is no problem with the address information. Set the earliest target arrival time T e =0730102300, the latest arrival time of the target is T k =0730102700, because T>T e And T <T l , so there is no error in the ciphertext.

[0141] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[0142] Finally, it should be noted that the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art can still modify the technical solutions described in the aforementioned embodiments or replace some of the technical features therein by equivalents. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A digital signature verification method based on big data, characterized in that: The verification method comprises the following steps: Step S100: Generate a message digest using a hash algorithm, encrypt the message digest using the encryption party's private key to obtain a digital signature, and write the digital signature into the message to obtain digital information; Step S200: randomly generate a key X to encrypt the digital information to obtain ciphertext, and encrypt the key X with the public key of the decryption party to obtain the encrypted key Step S300: After the encryption key Write the name, address information Add and time T of the encryption party to generate traceability information Use the public key of the decryptor to trace the information Encrypt to get the traceable ciphertext Step S400: trace the ciphertext Transmitted to the decryptor, the decryptor uses the private key to trace the ciphertext Decrypt to get traceability information Step S500: Determine traceability information Is it correct? After it is correct, use the private key to decrypt the key X; Step S600: Use the decrypted key X to decrypt the ciphertext transmitted by the information to obtain information, use the same hash algorithm to calculate the decrypted information to obtain the first information summary S1, use the public key of the encryption party to decrypt the digital signature to obtain the second information summary S2; compare whether the two summaries are consistent.

2. According to a digital signature verification method based on big data according to claim 1, it is characterized in that: The step S100 generates a message digest and encrypts it to obtain a digital signature, including the following steps: Step S101: Divide the information into groups of k bytes, assuming the number of bytes of the information is m; calculate the number of groups n according to the formula 组 : When the number of groups n 组 If it is not an integer, the number of bytes to be filled is calculated according to the formula Among them, mod() is the remainder function, and mod(m,k) represents the remainder obtained by dividing m by k; Step S102: When the number of groups n is divided 组 Integer or byte-filled When it is an integer, a checksum of k bytes is added to the end of the message; Step S103: using the MD function to process each group of information, and integrating each group of processed information to obtain an information summary; Step S104: Use the DSA encryption algorithm to encrypt the information summary using the encryptor's private key to obtain a digital signature.

3. According to a digital signature verification method based on big data as described in claim 1, it is characterized in that: The step S200 of randomly generating a key X includes the following steps: Step S201: Assume that the randomly generated key X has a total of m digits, the value of the i-th digit in the key X is X(i), and X(1) is randomly generated; The value X(i+1) of the i+1th bit in the key X is obtained according to the formula: X(i+1)=mod[A×X(i)+B,C] Among them, A, B and C are constant coefficients, and mod() is the remainder function; Step S202: After the value of X(m) is calculated, each value is arranged in order of i to form the key X.

4. According to a digital signature verification method based on big data as described in claim 1, it is characterized in that: The step S200 uses the public key to encrypt the key X, including the following steps: Step S210: Select two different prime numbers p and q; calculate the modulus r according to the formula: r=p×q Calculate the number of positive integers that are less than the modulus r and are mutually prime to the modulus r according to the formula Step S220: Set when When , the value of e is obtained; where gcd() is a function for finding the greatest common divisor; Step S230: Calculate the inverse element of e on the domain modulo r Make Step S240: Generate a public key (r, e) and a private key According to the formula: Use the public key to encrypt key X to get the encrypted key 5. A digital signature verification method based on big data according to claim 4, characterized in that: In step S300, the public key of the decryption party is used to encrypt the traceability ciphertext The following steps are involved: Step S301: After encryption, the key Write the name of the encryption party, the address information Add obtained in real time by the positioning system, and the time T obtained in real time to generate traceability information Step S302: Generate a new public key (r', e') and private key by using the method of encrypting the secret key with the public key in step S200 Traceability Information Encrypt to get the traceable ciphertext 6. A digital signature verification method based on big data according to claim 5, characterized in that: In step S400, the decryption party uses the private key to decrypt the traceability ciphertext: Utilizing private keys Decrypt the traceback ciphertext according to the formula: Get traceability information 7. The digital signature verification method based on big data according to claim 1 is characterized in that: In step S500, the traceability information is determined Is it correct? It includes the following steps: Step S501: pre-set the target address information Add1, the earliest target arrival time T e , the latest arrival time of the target is T l and the name of the encryption party; Step S502: Compare traceability information The name of the encryption party in the encryption process and the name of the encryption party set in advance are compared. If the comparison result is inconsistent, the decryption party is prompted that an error has occurred in the ciphertext. Step S503: Compare traceability information The address information Add in the pre-set target address information Add1, statistical tracing information The number of characters num1 in the address information Add in the preset target address information Add1 and the number of characters num2 that are different from the address information Add; the number of characters that are different from the address information Add in the traceability information is calculated according to the formula The address information in Add accounts for η: Set a threshold value θ. When η>θ, it indicates that the decryption party has an error in the ciphertext. Step S504: Compare time T and earliest target arrival time T e , time T and the latest arrival time of the target T l When T <T e Or T>T l When the ciphertext is decrypted, it will prompt that an error has occurred in the decryption party.

8. A digital signature verification method based on big data according to claim 3 or claim 4, characterized in that: In step S600, the ciphertext is decrypted using the key X, and the digital signature is decrypted using the public key, including the following steps: Step S601: Use private key The encrypted key Decrypt and get the key X according to the formula: Step S602: Decrypt the digital ciphertext using the key X and obtain digital information according to the formula: Splitting digital information into information and digital signature; Step S603: applying the method described in step S100 to the information to obtain a first digital summary S1; Step S604: Decrypt the digital signature using the DSA decryption algorithm to obtain a second digital summary S2; Step S605: compare the first digital summary S1 with the second digital summary S2. If S1=S2, it is determined that there is no error in the information. If S1≠S2, it is prompted that there is an error in the information.

9. A digital signature verification system for a digital signature verification method based on big data applied to any one of claims 1 to 8, characterized in that: The system includes a digital signature generation module, a key encryption module, a traceability ciphertext generation module, a traceability ciphertext decryption module, a key decryption module and a summary module; The digital signature module is used to generate a message digest using a hash algorithm, encrypt the message digest using the private key of the encryptor to obtain a digital signature, and write the digital signature into the message to obtain digital information; The key encryption module is used to randomly generate a key X to encrypt digital information to obtain ciphertext, and encrypt the key X with the public key of the decryption party to obtain the encrypted key The traceability ciphertext generation module uses the encrypted key Write the name, address information Add and time T of the encryption party to generate traceability information Use the public key of the decryptor to trace the information Encrypt to get the traceable ciphertext The tracing ciphertext decryption module is used to transmit the tracing ciphertext to the decryption party, and the decryption party uses the private key to decrypt the tracing ciphertext to obtain the tracing information; The key decryption module is used to determine the traceability information Is it correct? After it is correct, use the private key to decrypt the key X; The summary module is used to decrypt the ciphertext transmitted by the information with the decrypted key X to obtain information, use the same hash algorithm to calculate the decrypted information to obtain the first information summary S1, use the public key of the encryption party to decrypt the digital signature to obtain the second information summary S2; and compare whether the two summaries are consistent.