Short message sending system capable of preventing data leakage

Abstract

The invention relates to the technical field of short message security, and discloses a short message sending system capable of preventing data leakage, which comprises a session key generation module, an encryption module, a short message sending module and a short message decryption module, and is characterized in that the session key generation module executes that a sender sends a receiving request to a receiver and sends a random number, and the receiver sends the random number to the receiver after receiving the request; the method comprises the following steps: receiving one random number, generating the other random number, generating a session key by using the two random numbers by using a pre-agreed quantum security key exchange protocol, sending the other random number to a sender by a receiver, and generating the same session key after the sender receives the other random number. According to the invention, the receiver can safely receive the short message sent by the sender, meanwhile, the intermediate random relay and any third party cannot know the content of the short message, and the sending process utilizes a quantum secure cryptographic protocol and secure multi-party calculation, so that the security of short message interaction in the quantum computer era is ensured.

Description

Technical Field

[0001] The present invention relates to the field of SMS security, and more particularly to an SMS sending system capable of preventing data leakage. Background Art

[0002] Existing quantum computers have powerful parallel computing capabilities and can solve problems that are difficult for traditional computers to solve in a very short time, including large integer decomposition, discrete logarithms and other basic cryptographic problems. This means that the security of traditional public key cryptography systems such as RSA and ECC will be seriously threatened. If traditional public key cryptography systems are cracked, it also means data leakage and communication security risks.

[0003] Therefore, in the era of quantum computers, in order to achieve secure end-to-end encrypted text messaging, in the face of quantum computers, a text messaging system is needed to ensure that the text message content will not be intercepted by any third party except the sender and receiver. Summary of the invention

[0004] The present invention provides a short message sending system for preventing data leakage, which solves the technical problems in related technologies.

[0005] The present invention provides a data leakage prevention short message sending system, comprising:

[0006] The session key generation module is used to perform the following steps:

[0007] S100: The sender sends a receiving request to the receiver and sends a random number ;

[0008] S200: After receiving the request, the receiver generates a random number , and uses a pre-agreed quantum-secure key exchange protocol using random numbers and random numbers Generate a session key ;

[0009] S300: The receiver sends the random number Sent to the sender, the sender receives the random number After that, the same session key is generated ;

[0010] The encryption module is used to perform the following steps:

[0011] S400: The sender uses the session key and the pre-agreed quantum-safe symmetric encryption algorithm to encrypt the plaintext SMS to be sent , get the ciphertext ;

[0012] S500: The sender sends the ciphertext Sent to a random relay, the random relay receives the ciphertext After that, generate a random symmetric key , using a random symmetric key Secondary encrypted ciphertext Get the secondary ciphertext ;

[0013] The SMS sending module is used to perform the following steps:

[0014] S600: Random relay sends the secondary ciphertext Send to the recipient to complete the SMS sending.

[0015] Furthermore, the SMS sending module further performs the following steps: Sent to the sender.

[0016] Furthermore, it also includes a text message decryption module for performing the following steps:

[0017] S700: The sender receives After that, using the secure multi-party computing protocol, and In the case of ;

[0018] S800: The sender will update the key Sent to the receiver, the receiver receives the secondary ciphertext and the updated key After that, a secure multi-party computing protocol is used to In the case of an update, the key Recover a random symmetric key ;

[0019] S900: The receiver uses a random symmetric key Decrypting secondary ciphertext , get the ciphertext , the receiver then uses the session key Decrypting ciphertext , get the original plaintext SMS .

[0020] Furthermore, the pre-agreed quantum secure key exchange protocol is a symmetric encryption algorithm based on the learning with errors problem, a symmetric encryption algorithm based on the learning with errors problem on a ring, or a symmetric encryption algorithm based on supersingular elliptic curve homology encryption.

[0021] Furthermore, random relay includes the following parts:

[0022] Relay server module: includes one or more independent servers, used to forward the encrypted SMS content between the sender and the receiver, wherein the relay server can be distributed;

[0023] Quantum-safe cryptographic module: used to perform quantum-safe cryptographic operations;

[0024] Secure multi-party computing module: used to complete certain computing tasks with the sender and receiver without leaking sensitive information.

[0025] Furthermore, the secure multi-party computing protocol includes Yao's garbled circuit protocol, GMW protocol, BMR protocol or Shamir secret sharing protocol.

[0026] Furthermore, the sender, receiver, and random relays can all perform both traditional and quantum-resistant computing;

[0027] A quantum-safe key exchange protocol and a quantum-safe symmetric encryption algorithm that both the sender and the receiver must agree upon in advance;

[0028] There are authenticated quantum secure channels and traditional channels between the sender, receiver, and random relays.

[0029] Furthermore, the sender and receiver also need to perform identity authentication. The sender and receiver prove their identity through a trusted identity authentication mechanism, and the identity authentication process should use a quantum-safe protocol.

[0030] Furthermore, the sender and receiver also need to generate, store and manage their own public keys, private keys and other cryptographic keys. The keys should be generated using a quantum-safe algorithm and adopt a unified key storage mechanism.

[0031] The present invention also proposes a storage medium storing non-temporary computer-readable instructions for executing the functions of the module in the aforementioned SMS sending system for preventing data leakage.

[0032] The beneficial effects of the present invention are:

[0033] In the present invention, the receiver can securely receive the text messages sent by the sender through the above text message sending system. At the same time, the random relays in the middle and any third party cannot know the content of the text messages, even if they have quantum computing capabilities. The sending process utilizes quantum-safe cryptographic protocols and secure multi-party computing to ensure security in the era of quantum computers. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 It is a flow chart of a method for sending text messages to prevent data leakage proposed by the present invention;

[0035] Figure 2 It is a structural block diagram of a text message sending system for preventing data leakage proposed by the present invention. DETAILED DESCRIPTION

[0036] The subject matter described herein will now be discussed with reference to example embodiments. It should be understood that the discussion of these embodiments is only to enable those skilled in the art to better understand and implement the subject matter described herein, and the functions and arrangements of the elements discussed may be changed without departing from the scope of protection of the contents of this specification. Each example may omit, replace or add various processes or components as needed. In addition, the features described relative to some examples may also be combined in other examples.

[0037] Embodiment 1

[0038] like Figure 1 As shown, a method for sending text messages to prevent data leakage includes the following steps:

[0039] S100: The sender sends a receiving request to the receiver and sends a random number ;

[0040] S200: After receiving the request, the receiver generates a random number , and uses a pre-agreed quantum-secure key exchange protocol using random numbers and random numbers Generate a session key :

[0041] ;

[0042] in is a quantum secure key exchange function;

[0043] S300: The receiver sends the random number Sent to the sender, the sender receives the random number After that, the same session key is generated ;

[0044] S400: The sender uses the session key and the pre-agreed quantum-safe symmetric encryption algorithm to encrypt the plaintext SMS to be sent , get the ciphertext :

[0045] ;

[0046] in It is a quantum-safe symmetric encryption function;

[0047] In one embodiment of the present invention, the pre-agreed quantum secure key exchange protocol is a symmetric encryption algorithm based on the Learning with Errors (LWE) problem: wherein the LWE problem is to find the solution of an equation in a random linear system of equations, where the equation contains a certain error. The encryption process based on LWE is as follows:

[0048] ;

[0049] ;

[0050] in , is a random matrix, , n is a random n-dimensional vector, is the modulus, where Represents modulus The integer ring of is the key, , is a small random error, following a discrete Gaussian distribution, , are the bits to be encrypted, , represents the floor function, the ciphertext ;

[0051] S500: The sender sends the ciphertext Sent to a random relay, the random relay receives the ciphertext After that, generate a random symmetric key , using a random symmetric key Secondary encrypted ciphertext Get the secondary ciphertext :

[0052] ;

[0053] S600: Random relay sends the secondary ciphertext Send to the recipient, the random symmetric key Send to the sender;

[0054] S700: The sender receives After that, a secure multi-party computing protocol (such as Yao's Garbled Circuit) is used to and In the case of :

[0055] ;

[0056] in Represents a secure multi-party computation function;

[0057] In one embodiment of the present invention, random relay includes the following parts:

[0058] Relay server module: includes one or more independent servers, used to forward the encrypted SMS content between the sender and the receiver, wherein the relay server can be distributed;

[0059] Quantum-safe cryptographic module: The relay server is equipped with a quantum-safe cryptographic module, which is used to perform quantum-safe cryptographic operations, such as generating random keys, encryption and decryption. Even if the relay server is attacked by a quantum computer, the cryptographic system used cannot be cracked.

[0060] Secure multi-party computing module: used to complete certain computing tasks with the sender and the receiver without leaking sensitive information, such as the secure multi-party computing in process S700;

[0061] In one embodiment of the present invention, the secure multi-party computing protocol includes:

[0062] 1.Yao's Garbled Circuit (Yao's Garbled Circuit Protocol):

[0063] Parties: Two parties, usually referred to as A and B;

[0064] Function: Allows A and B to jointly compute the output of any function without revealing their respective inputs;

[0065] Basic principle: A represents the function as a Boolean circuit and "obfuscates" the circuit to generate a "obfuscated circuit". A sends the obfuscated circuit to B. The two parties exchange the secret values ​​of the input lines through the Oblivious Transfer protocol. Eventually, B can calculate the output of the circuit, while A cannot know B's input.

[0066] 2.Goldreich-Micali-Wigderson (GMW)Protocol (GMW protocol):

[0067] Participants: multiple parties (n≥2);

[0068] Function: Allows multiple parties to jointly compute the output of any function without disclosing their inputs;

[0069] Basic principle: Similar to Yao's Garbled Circuit, the GMW protocol also represents a function as a Boolean circuit, but the GMW protocol uses secret sharing to encrypt inputs and intermediate values. Participants evaluate the circuit through interactive secret sharing calculations, and finally obtain the secret sharing of the output, and then obtain the actual output through secret reconstruction.

[0070] 3. Beaver-Micali-Rogaway (BMR) Protocol (BMR protocol):

[0071] Participants: multiple parties (n≥2);

[0072] Function: Allows multiple parties to jointly compute the output of any function without disclosing their inputs;

[0073] Basic principle: The BMR protocol is a hybrid of Yao's Garbled Circuit and GMW protocol. It represents the function as an arithmetic circuit and uses secret sharing and oblivious transfer to evaluate the circuit. Compared with the Yao protocol, the BMR protocol supports multi-party computation; compared with the GMW protocol, the BMR protocol has better efficiency.

[0074] 4.Shamir's Secret Sharing:

[0075] Participants: multiple parties (n≥2);

[0076] Function: Split a secret into multiple shares and distribute them to multiple parties, ensuring that only a sufficient number of parties can collaborate to recover the original secret, and any party with less than a certain number cannot obtain any information about the secret;

[0077] Basic principle: Based on the idea of ​​polynomial interpolation, the secret owner selects a polynomial of degree t-1, with the constant term as the secret value, and randomly selects other coefficients. For n participants, the secret owner calculates the value of the polynomial at n different points and distributes it to each participant as a share. Any t participants can restore the original polynomial through Lagrange interpolation to obtain the secret value; and less than t participants cannot restore the polynomial and thus cannot obtain the secret;

[0078] S800: The sender will update the key Sent to the receiver, the receiver receives the secondary ciphertext and the updated key After that, a secure multi-party computing protocol is used to In the case of an update, the key Recover a random symmetric key :

[0079] ;

[0080] in It is the reverse recovery function of the secure multi-party computation function;

[0081] S900: The receiver uses a random symmetric key Decrypting secondary ciphertext , get the ciphertext :

[0082] ;

[0083] in is the decryption function;

[0084] The receiver then uses the session key Decrypting ciphertext , get the original plaintext SMS :

[0085] ;

[0086] In one embodiment of the present invention, the sender, receiver, and random relay can all perform traditional computing and quantum-resistant computing.

[0087] The sender and receiver agree in advance on a quantum-safe key exchange protocol (such as lattice-based key exchange) and a quantum-safe symmetric encryption algorithm (such as lattice-based encryption algorithm).

[0088] There are authenticated quantum secure channels and traditional channels between the sender, receiver, and random relays.

[0089] In one embodiment of the present invention, the sender and the receiver also need to have the following functions:

[0090] Authentication: Both the sender and the receiver need to prove their identity through a trusted authentication mechanism (such as public key infrastructure, digital certificates, etc.).

[0091] The authentication process should use quantum-safe protocols to resist attacks from quantum computers.

[0092] Key management: Senders and receivers need to securely generate, store, and manage their own public keys, private keys, and other cryptographic keys.

[0093] Keys should be generated using quantum-safe algorithms (such as lattice cryptography) and adopt a unified key storage mechanism (such as hardware security modules).

[0094] Communication security: Communication between the sender and the receiver should use a unified communication protocol (such as the Signal protocol) to ensure the confidentiality, integrity and authentication of the message.

[0095] Quantum-secure key exchange protocols (such as NewHope, Frodo, etc.) should be used to establish session keys during communication.

[0096] Embodiment 2

[0097] In this embodiment, a method for sending text messages to prevent data leakage includes the following steps:

[0098] S100: The sender sends a receiving request to the receiver and sends a random number ;

[0099] S200: After receiving the request, the receiver generates a random number , and using a pre-agreed quantum-secure key exchange protocol, using and Generate a session key :

[0100] ;

[0101] S300: The receiver will Sent to the sender, the sender receives After that, the same session key is generated ;

[0102] S400: The sender uses the session key and the pre-agreed quantum-safe symmetric encryption algorithm to encrypt the plaintext SMS to be sent , get the ciphertext :

[0103] ;

[0104] In one embodiment of the present invention, the pre-agreed quantum secure key exchange protocol is a symmetric encryption algorithm based on the Ring Learning with Errors (RLWE) problem: RLWE is a variant of LWE on a polynomial ring, with higher security and better efficiency;

[0105] The encryption process is as follows:

[0106] ;

[0107] ;

[0108] in , is a random polynomial, , Representation model and modulus The polynomial ring of is the key polynomial, i.e. the key, , is a small random error polynomial, , is the polynomial to be encrypted, , the coefficient is either 0 or 1, is the modulus, , represents the floor function, which rounds each coefficient of the polynomial. The ciphertext is .

[0109] S500: The sender sends the ciphertext Sent to a random relay, the random relay receives the ciphertext After that, generate a random symmetric key , using a random symmetric key Secondary encrypted ciphertext Get the secondary ciphertext :

[0110] ;

[0111] S600: Random relay sends the secondary ciphertext Send to the recipient, the random symmetric key Send to the sender;

[0112] S700: The sender receives After that, using the secure multi-party computing protocol, and In the case of :

[0113] ;

[0114] S800: The sender will update the key Sent to the receiver, the receiver receives the secondary ciphertext and the updated key After that, a secure multi-party computing protocol is used to In the case of an update, the key Recover a random symmetric key :

[0115] ;

[0116] S900: The receiver uses a random symmetric key Decrypting secondary ciphertext , get the ciphertext :

[0117] ;

[0118] The receiver then uses the session key Decrypting ciphertext , get the original plaintext SMS :

[0119] .

[0120] Embodiment 3

[0121] In this embodiment, a method for sending text messages to prevent data leakage includes the following steps:

[0122] S100: The sender sends a receiving request to the receiver and sends a random number ;

[0123] S200: After receiving the request, the receiver generates a random number , and using a pre-agreed quantum-secure key exchange protocol, using and Generate a session key :

[0124] ;

[0125] S300: The receiver will Sent to the sender, the sender receives After that, the same session key is generated ;

[0126] S400: The sender uses the session key and the pre-agreed quantum-safe symmetric encryption algorithm to encrypt the plaintext SMS to be sent , get the ciphertext :

[0127] ;

[0128] In one embodiment of the present invention, the pre-agreed quantum-secure key exchange protocol is a symmetric encryption algorithm based on supersingular elliptic curve homology encryption (SIKE): SIKE uses homology mapping between supersingular elliptic curves to construct a key encapsulation mechanism, and then combines it with symmetric encryption to achieve quantum-secure encryption;

[0129] The key exchange process is as follows:

[0130] ; ; ; ;

[0131] in , is defined over a finite field The initial supersingular elliptic curve on and are two generators defined on the curve, , is the private key, which is a pre-agreed quantum-safe symmetric encryption algorithm. , represents homology mapping, , , is the j-invariant of the initial supersingular elliptic curve, and both parties calculate the same and As a shared key, , is the public key, i.e., the j-invariant of the image of the initial supersingular elliptic curve under the homology mapping. In this embodiment, it is the aforementioned session key ;

[0132] S500: The sender sends the ciphertext Sent to a random relay, the random relay receives the ciphertext After that, generate a random symmetric key , using a random symmetric key Secondary encrypted ciphertext Get the secondary ciphertext :

[0133] ;

[0134] S600: Random relay sends the secondary ciphertext Send to the recipient, the random symmetric key Send to the sender;

[0135] S700: The sender receives After that, using the secure multi-party computing protocol, and In the case of :

[0136] ;

[0137] S800: The sender will update the key Sent to the receiver, the receiver receives the secondary ciphertext and the updated key After that, a secure multi-party computing protocol is used to In the case of an update, the key Recover a random symmetric key :

[0138] ;

[0139] S900: The receiver uses a random symmetric key Decrypting secondary ciphertext , get the ciphertext :

[0140] ;

[0141] The receiver then uses the session key Decrypting ciphertext , get the original plaintext SMS :

[0142] .

[0143] like Figure 2 As shown, based on the above-mentioned multiple embodiments, at least one embodiment of the present invention further discloses a short message sending system, including:

[0144] A session key generation module, used for executing S100-S300;

[0145] Encryption module, used to execute S400 and S500;

[0146] A short message sending module, used for executing S600;

[0147] SMS decryption module, used to execute S700-S900.

[0148] Based on the above-mentioned multiple embodiments, at least one embodiment of the present invention further discloses a storage medium storing non-temporary computer-readable instructions for executing one or more steps in the aforementioned method for sending text messages to prevent data leakage.

[0149] The computer program may be stored / distributed on a suitable medium, such as an optical storage medium or a solid-state medium supplied together with or as part of other hardware, but may also be distributed in other forms, such as via the Internet or other wired or wireless telecommunication systems. Any reference signs in the claims should not be construed as limiting the scope.

[0150] The above describes an embodiment of the present embodiment, but the present embodiment is not limited to the above-mentioned specific implementation methods. The above-mentioned specific implementation methods are merely illustrative and not restrictive. Under the guidance of the present embodiment, ordinary technicians in this field can also make many forms, all of which are within the protection of the present embodiment.

Claims

1. A text message sending system for preventing data leakage, characterized in that: include: The session key generation module is used to perform the following steps: S100: The sender sends a receiving request to the receiver and sends a random number ; S200: After receiving the request, the receiver generates a random number , and uses a pre-agreed quantum-secure key exchange protocol using random numbers and random numbers Generate a session key ; S300: The receiver sends the random number Sent to the sender, the sender receives the random number After that, the same session key is generated ; The encryption module is used to perform the following steps: S400: The sender uses the session key and the pre-agreed quantum-safe symmetric encryption algorithm to encrypt the plaintext SMS to be sent , get the ciphertext ; S5 00: The sender sends the ciphertext Sent to a random relay, the random relay receives the ciphertext After that, generate a random symmetric key , using a random symmetric key Secondary encrypted ciphertext Get the secondary ciphertext ; The SMS sending module is used to perform the following steps: S600: Random relay sends the secondary ciphertext Send to the recipient to complete the SMS sending.

2. The SMS sending system for preventing data leakage according to claim 1, characterized in that: The SMS sending module also performs the following steps: Sent to the sender.

3. The SMS sending system for preventing data leakage according to claim 2, characterized in that: It also includes a SMS decryption module that performs the following steps: S700: The sender receives After that, using the secure multi-party computing protocol, and In the case of ; S800: The sender will update the key Sent to the receiver, who receives the secondary ciphertext and the updated key After that, a secure multi-party computing protocol is used to In the case of an update, the key Recover a random symmetric key ; S900: The receiver uses a random symmetric key Decrypting secondary ciphertext , get the ciphertext , the receiver then uses the session key Decrypting ciphertext , get the original plaintext SMS .

4. The SMS sending system for preventing data leakage according to claim 3, characterized in that: The pre-agreed quantum secure key exchange protocol is a symmetric encryption algorithm based on the learning with errors problem, a symmetric encryption algorithm based on the learning with errors problem over a ring, or a symmetric encryption algorithm based on supersingular elliptic curve homology encryption.

5. The SMS sending system for preventing data leakage according to claim 4, characterized in that: Random relay consists of the following parts: Relay server module: includes one or more independent servers, used to forward the encrypted SMS content between the sender and the receiver, wherein the relay server can be distributed; Quantum-safe cryptographic module: used to perform quantum-safe cryptographic operations; Secure multi-party computing module: used to complete certain computing tasks with the sender and receiver without leaking sensitive information.

6. The SMS sending system for preventing data leakage according to claim 5, characterized in that: Secure multi-party computing protocols include Yao's garbled circuit protocol, GMW protocol, BMR protocol or Shamir secret sharing protocol.

7. The SMS sending system for preventing data leakage according to claim 6, characterized in that: The sender, receiver, and random relay can all perform traditional and quantum-resistant computing; A quantum-safe key exchange protocol and a quantum-safe symmetric encryption algorithm that both the sender and the receiver must agree upon in advance; There are authenticated quantum secure channels and traditional channels between the sender, receiver, and random relays.

8. The SMS sending system for preventing data leakage according to claim 7, characterized in that: The sender and receiver also need to perform identity authentication. The sender and receiver prove their identity through a trusted authentication mechanism, and the authentication process should use a quantum-safe protocol.

9. The SMS sending system for preventing data leakage according to claim 8, characterized in that: The sender and receiver also need to generate, store and manage their own public keys, private keys and other cryptographic keys. The keys should be generated using a quantum-safe algorithm and adopt a unified key storage mechanism.

10. A storage medium, characterized in that: Non-temporary computer-readable instructions are stored, and are used to execute a module in a data leakage prevention SMS sending system as described in any one of claims 1-9.

Images