Multi-party secure communication method and device

Through the design of the elliptic curve encryption algorithm and key generation center, the problems of traditional encryption methods in key length and resource consumption are solved, information anonymity and security balance in multi-party communication are realized, key management is optimized, and key management is improved. communication efficiency.

CN118316605BActive Publication Date: 2024-11-01INSPUR SOFTWARE TECH CO LTD
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202410732799.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-06-07
Publication Date
2024-11-01
Estimated Expiration
2044-06-07

AI Technical Summary

Technical Problem

Traditional encryption methods are vulnerable to attacks when the key length is short, resource consumption is high, and there are problems such as complex key management and low communication efficiency in multi-party secure communication scenarios, especially when the number of communication parties increases.

Method used

The elliptic curve encryption algorithm is used to generate base points and private keys through the initialization stage of the key generation center, and the identity public key and private key are distributed. The information is blinded and signed in the blinding stage, and the signature stage is aggregated and signed in the signature stage, and the envelope encryption and transmission stage are generated in the transmission stage. Symmetric keys enable secure transmission of information.

Benefits of technology

It realizes the balance of information anonymity and security in the multi-party signature and authentication process, overcomes the problem of decreased communication efficiency, optimizes key management, and improves the security and efficiency of multi-party communication.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118316605B_ABST
    Figure CN118316605B_ABST
Patent Text Reader

Abstract

The present invention relates to the field of information and communication technology, and specifically provides a multi-party secure communication method and device, which has the following steps: S1, in the initialization phase, a key generation center generates a base point and a private key based on an elliptic curve, and publishes a cryptographic hash function H , and generate their own public key and private key for the signer, and the information receiver generates a random key pair according to the elliptic curve base point; S2, the blinding stage, the information sender uses the secret value randomly selected by each signer to blind the original information; S3, the signing stage, each signer signs the blinded information with the private key, and performs an aggregate signature; S4, the envelope encryption and sending stage, the information sender unblinds the blind signature result, constructs a digital envelope and sends it to the information receiver; S5, the receiving and verification stage, obtains the valid original information. Compared with the prior art, the present invention can realize multi-party confidential communication under the premise of ensuring communication efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of information communication technology, and specifically provides a multi-party secure communication method and device. Background Art

[0002] With the continuous acceleration of the global digital transformation process, especially the rapid popularization of new technologies such as 5G, artificial intelligence, and the Internet of Things, information exchange is becoming more and more frequent. In particular, in digital scenarios such as e-commerce, electronic voting, and digital copyright protection, in order to complete the joint signing or authentication of a certain information, the demand for multi-party communication is stronger. In this process, it becomes particularly important to protect the security of communication content.

[0003] Traditional encryption methods, such as RSA, are widely used, but they face some limitations. First, when the key length is short, it is vulnerable to threats from attackers with strong computing power. A longer key length is required to provide corresponding security, resulting in a large consumption of resources. Therefore, it is not suitable for application in resource-constrained environments such as mobile devices. Secondly, the large amount of calculation required in the key generation and encryption and decryption process further affects the communication efficiency and real-time performance. In addition, in multi-party secure communication scenarios, there are often problems such as complex key management and low communication efficiency. Especially as the number of communicating parties increases, these problems become more prominent.

[0004] As a public key cryptography system, Elliptic Curve Cryptography (ECC) has higher security and smaller key length than traditional encryption algorithms. It can provide security comparable to that of traditional encryption algorithms with a relatively short key length and reduce resource consumption. It is particularly suitable for applications in resource-constrained environments such as mobile devices, and is therefore widely used in the field of secure communications.

[0005] How to use the high efficiency of the elliptic curve encryption algorithm to design a multi-party secure communication method, effectively solve problems such as information encryption, authentication and key negotiation in the communication process, overcome the decrease in communication efficiency caused by the increase in the number of communicating parties, and further improve the security of multi-party communication is an urgent problem to be solved by technical personnel in this field. Summary of the invention

[0006] The present invention aims at the above-mentioned deficiencies of the prior art and provides a multi-party secure communication method with strong practicability.

[0007] A further technical task of the present invention is to provide a multi-party secure communication device that is rationally designed, safe and applicable.

[0008] The technical solution adopted by the present invention to solve its technical problem is:

[0009] A multi-party secure communication method comprises the following steps:

[0010] S1, initialization phase, the key generation center generates base points and private keys based on the elliptic curve, and publishes a cryptographic hash function H , respectively generate a corresponding public key and private key for each signatory, and send the private key to the corresponding signatory through a secure channel. At the same time, the information receiver generates a random key pair (Lu, Lv) according to the elliptic curve base point;

[0011] S2, in the blinding stage, each signatory randomly selects a secret value and calculates the corresponding secret point on the elliptic curve. The sender aggregates the signatory's identity public key and secret point and blinds the original information.

[0012] S3, during the signing phase, each signatory signs the blinded information with his / her private key and encrypts it twice. The sender of the information performs an aggregate signature on the private key signatures and the secondary encryption results of each signatory.

[0013] S4, envelope encryption and sending stage, the sender of the information unblinds the blind signature result and uses the randomly generated symmetric key to encrypt the original information and the signature information to obtain , and generate an elliptic curve random key pair (Pu, Pv), construct The digital envelope is sent to the information recipient;

[0014] S5, during the reception and verification phase, the information receiver first decrypts the digital envelope and then , and obtain valid original information.

[0015] Furthermore, in step S1, the key generation center KGC randomly selects a large prime number q , choose the definition in the finite field F( q ), G is a prime number on the elliptic curve E. n base point.

[0016] Furthermore, in step S1, it further includes:

[0017] S101, randomly select an integer d , and 1≤ d ≤ n- 1 , Publish the base point G and keep the private key secret d ;

[0018] S102. Publish a cryptographic hash function with an integer length H : {0, 1} * → Zq ;

[0019] S103. Publish the Signing Party P i ID i , i =1、2、……、 k ,common k There are signatories, signator P i Generate an identity based ID i The private key psk i , and use the identity private key psk i Calculate the public key Q for the signer i , announce the signing party P i The public key Q i , and pass the identity private key psk through a secure channel i Sent to the signing party P i ;

[0020] S104. The information receiver L generates a random key pair (Lu, Lv) based on the base point G, secretly stores the private key Lv, and publishes the public key Lu.

[0021] Furthermore, in step S2, it further includes:

[0022] S201, Signing Party P i , i=1, 2, ..., k, randomly select a number r i As its secret value, r i Encrypt to get the secret point R on the elliptic curve i , sent to the information sender P;

[0023] S202, the information sender P randomly selects two numbers α and β , aggregate the public keys and secret points of all signatories to get the first part of the signature t ;

[0024] S203, the information sender P uses α , β , t Original information m Perform blinding and obtain blinding information m 1;

[0025] S204, the information sender P will m 1, t ) is broadcast to all signatories.

[0026] Furthermore, in step S3, it further includes:

[0027] S301, Signing Party Pi , i =1、2、 …、 k , upon receiving ( m 1, t ) After that, the blind information m 1 Perform a personal signature based on the identity private key and secret value to obtain s i , using the identity private key pair s i Encrypted c i ,send( s i , c i ) to the information sender P;

[0028] S302, the information sender P s i , i =1, 2, ..., k , perform validity verification, determine the validity of the signature information, return the invalid signature to the corresponding signatory for re-signing;

[0029] S303, the information sender P s i , c i , i =1、2、……、 k , perform aggregate signature and obtain blind signature result s , c .

[0030] Furthermore, in step S4, it further includes:

[0031] S401, the information sender P respectively performs blind signature results s , c Unblind and get the second part of the signature S and the third part signature C ;

[0032] S402, the information sender P randomly generates a symmetric key syk, and m , t , S , C ) are connected together and symmetric encryption is performed using a symmetric encryption algorithm to obtain ;

[0033] S403, the information sender P generates a random key pair (Pu, Pv) based on the base point G, and uses it to encrypt Lu and syk to obtain evp1 and evp2 respectively, ( ,evp1,evp2) form a digital envelope;

[0034] S404, put ,evp1,evp2) is sent to the information receiver L.

[0035] Furthermore, in step S5, it further includes:

[0036] S501, the information receiver L uses the private key Lv to decrypt evp1 and evp2 respectively to obtain the symmetric key syk;

[0037] S502, decrypt with symmetric key syk ,get( m , t , S , C );

[0038] S503. Based on public information and ( m , t , S , C ) to verify the validity of the received information.

[0039] A multi-party secure communication device, comprising: at least one memory and at least one processor;

[0040] The at least one memory is used to store a machine-readable program;

[0041] The at least one processor is configured to call the machine-readable program to execute a multi-party secure communication method.

[0042] Compared with the prior art, the multi-party secure communication method and device of the present invention have the following outstanding beneficial effects:

[0043] The present invention can achieve a balance between information anonymity and security in the process of multi-party signature or authentication, and can effectively overcome the decrease in communication efficiency caused by the increase in the number of communicating parties, thereby achieving safe and efficient multi-party communication.

[0044] By introducing a key generation center, the key management problem in the multi-party communication process is optimized and the complexity of key distribution in the traditional public key system is reduced. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] 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 some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0046] Attached Figure 1 It is a schematic diagram of the signature process in a multi-party secure communication method;

[0047] Attached Figure 2 It is a schematic diagram of the flow of envelope encryption and information sending in a multi-party secure communication method;

[0048] Attached Figure 3 The invention is a schematic diagram of the information receiving and verifying process in a multi-party secure communication method. DETAILED DESCRIPTION

[0049] In order to enable those skilled in the art to better understand the solution of the present invention, the present invention is further described in detail below in conjunction with specific implementation methods. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than 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.

[0050] A best embodiment is given below:

[0051] like Figure 1 As shown, a multi-party secure communication method in this embodiment has the following steps:

[0052] S1, initialization phase;

[0053] The key generation center generates base points and private keys based on the elliptic curve and publishes a cryptographic hash function H , respectively generate a corresponding public key and private key for each signatory, and send the private key to the corresponding signatory through a secure channel. At the same time, the information receiver generates a random key pair (Lu, Lv) according to the elliptic curve base point;

[0054] The specific operation method is:

[0055] S101. The key generation center KGC randomly selects a large prime number q , choose the definition in the finite field F( q ), G is a prime number on the elliptic curve E. n The base point;

[0056] S102, randomly select an integerd , and 1≤ d ≤ n- 1 , Publish the base point G and keep the private key secret d ;

[0057] S103. Publish a cryptographic hash function with an integer length H : {0, 1} * → Z q ;

[0058] S104. Publish the Signing Party P i ID i , i =1, 2, ..., k ,common k There are signatories, signator P i Generate an identity based ID i The private key psk i = d · H (ID i )(mod n ), using psk i Calculate P i The public key Q i = psk i ·G, announce P i The public key Q i , and pass the identity private key psk through a secure channel i Sent to the signing party P i ;

[0059] S105. The information receiver L generates a random key pair (Lu, Lv) according to the base point G, Lu=Lv·G, keeps the private key Lv in secret, and publishes the public key Lu.

[0060] S2, blinding stage;

[0061] Each signatory randomly selects a secret value and calculates the corresponding secret point on the elliptic curve. The sender aggregates the signatory's identity public key and secret point and blinds the original information.

[0062] The specific operation method is:

[0063] S201, Signing Party P i , i =1, 2, ..., k , randomly select a number r i As its secret value, calculate R i=r i G, get the secret point R on the elliptic curve i , sent to the information sender P;

[0064] S202, the information sender P randomly selects two numbers α and β , calculate T = + =( x , y ), get the aggregate value of all signatory identity public keys and secret points, and calculate t=x+H (m) (mod n ), get the first part of the signature t ;

[0065] S203, the information sender P uses α , β and t , for the original information m Perform blinding and obtain blinding information m 1= α -1 ·( t - β );

[0066] S204, the information sender P will m 1, t ) is broadcast to all signatories.

[0067] S3, signing stage;

[0068] Each signatory signs the blinded information with his / her private key and encrypts it twice. The sender of the information performs an aggregate signature on the private key signatures of each signatory and the secondary encryption results.

[0069] The specific operation method is:

[0070] S301, Signing Party P i , i =1, 2, ..., k , upon receiving ( m 1, t ), calculate s i =(1+psk i ) -1 ·( r i - m 1. psk i ), c i = s i ·pski , and ( s i , c i ) is sent to the information sender P;

[0071] S302, the information sender P s i , i =1, 2, ..., k ,calculate( s i + m 1) Q i + s i G=R i Whether it is established, judge the validity of the obtained signature information, and return the invalid signature to the corresponding signer for re-signing;

[0072] S303, the information sender P s i , c i , i =1, 2, ..., k , perform aggregate signature, calculate s= , c= .

[0073] S4, envelope encryption and sending stage;

[0074] The sender of the information unblinds the blind signature result and uses the randomly generated symmetric key to encrypt the original information and the signature information to obtain , and generate an elliptic curve random key pair (Pu, Pv), construct The digital envelope is sent to the information recipient;

[0075] like Figure 2 As shown, the specific operation method is:

[0076] S401, the information sender P checks the blind signature result s , c Unblind and calculate S = α · s, C = α · c , ( t , S , C )yes m signature;

[0077] S402, the information sender P randomly generates a symmetric key syk, and m , t , S , C ) are connected together and symmetric encryption is performed using a symmetric encryption algorithm to obtain ;

[0078] S403, the information sender P generates a random key pair (Pu, Pv) based on the base point G, Pu = Pv G = ( x ', y '), calculate evp1=Pv·Lu, evp2= x '·syk, then ( ,evp1,evp2) form a digital envelope;

[0079] S404, put ,evp1,evp2) is sent to the information receiver L.

[0080] S5, acceptance and verification stage;

[0081] The recipient of the information first decrypts the digital envelope and then decrypts , get valid original information;

[0082] like Figure 3 As shown, the specific operation method is:

[0083] S501, information receiver L calculates Lv -1 evp1=Lv -1 ·Pv·Lu= Pv·G=( x ', y '),syk= x ' -1 evp2, obtain the symmetric key syk;

[0084] S502, decrypt with symmetric key syk ,get( m , t , S , C );

[0085] S503, based on the public information, by calculating ( S + C ) G + t · = (x, y), judge t=x+H (m)(mod n ) is established, verifying the validity of the received information.

[0086] Based on the above method, a multi-party secure communication device in this embodiment includes: at least one memory and at least one processor;

[0087] The at least one memory is used to store a machine-readable program;

[0088] The at least one processor is configured to call the machine-readable program to execute a multi-party secure communication method.

[0089] The above-mentioned specific implementations are only specific cases of the present invention. The patent protection scope of the present invention includes but is not limited to the above-mentioned specific implementations. Any technical solutions that comply with the claims of the present invention and any appropriate changes or substitutions made by ordinary technicians in the relevant technical field shall fall within the patent protection scope of the present invention.

[0090] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A multi-party secure communication method, characterized in that: The steps are as follows: S1, initialization stage, the key generation center generates base points and private keys based on the elliptic curve, publishes a cryptographic hash function H, generates corresponding public keys and private keys for each signatory, and sends the private keys to the corresponding signatory through a secure channel. At the same time, the information receiver generates a random key pair (Lu, Lv) based on the elliptic curve base point; The specific operation method is: S101. The key generation center KGC randomly selects a large prime number q, and selects a secure elliptic curve E defined on a finite field F(q), where G is a base point on the elliptic curve E with an order of prime number n; S102. Randomly select an integer d, where 1≤d≤n-1, publish the base point G, and keep the private key d secret; S103. Publish a cryptographic hash function H with an integer length: {0, 1} * →Z q ; S104. Publish the Signing Party P i ID i , i = 1, 2, ..., k, a total of k signatories, signator P i Generate an identity based ID i The private key psk i =d·H(ID i )(mod n), using psk i Calculate P i The public key Q i =psk i ·G, announce P i The public key Q i , and pass the identity private key psk through a secure channel i Sent to the signing party P i ; S105, the information receiver L generates a random key pair (Lu, Lv) according to the base point G, Lu = Lv·G, secretly stores the private key Lv, and publishes the public key Lu; S2, in the blinding stage, each signatory randomly selects a secret value and calculates the corresponding secret point on the elliptic curve. The sender aggregates the signatory's identity public key and secret point and blinds the original information. The specific operation method is: S201, Signing Party P i , i = 1, 2, ..., k, randomly select a number r i As its secret value, calculate R i =r i G, get the secret point R on the elliptic curve i , sent to the information sender P; S202, the information sender P randomly selects two numbers α and β, and calculates Get the aggregate value of all signatory identity public keys and secret points, calculate t = x + H (m) (mod n), and get the first part of the signature t; S203, the information sender P uses α, β and t to blind the original information m, and obtains the blinded information m1=α -1 (t-β); S204, the information sender P broadcasts (m1, t) to each signatory; S3, during the signing phase, each signatory signs the blinded information with his / her private key and encrypts it twice. The sender of the information performs an aggregate signature on the private key signatures of each signatory and the secondary encryption results. The specific operation method is: S301, Signing Party P i , i = 1, 2, ..., k, after receiving (m1, t), calculate s i =(1+psk i ) -1 ·(r i -m1·psk i ), c i =s i ·psk i , and (s i ,c i ) is sent to the information sender P; S302, the information sender P through s i , i = 1, 2, ..., k, calculate (s i +m1)·Q i +s i G=R i Whether it is established, judge the validity of the obtained signature information, and return the invalid signature to the corresponding signer for re-signing; S303, information sender P to s i , c i , i = 1, 2, ..., k, perform aggregate signature, calculate S4, envelope encryption and sending stage, the sender of the information unblinds the blind signature result and uses the randomly generated symmetric key to encrypt the original information and the signature information to obtain And generate an elliptic curve random key pair (Pu, Pv), construct The digital envelope is sent to the information recipient; The specific operation method is: S401. The information sender P unblinds the blind signature results s and c and calculates S = α·s, C = α·c, where (t, S, C) is the signature of m. S402, the information sender P randomly generates a symmetric key syk, connects (m, t, S, C) together, and uses a symmetric encryption algorithm to perform symmetric encryption to obtain S403, the information sender P generates a random key pair (Pu, Pv) based on the base point G, Pu = Pv·G = (x', y'), calculates evp1 = Pv·Lu, evp2 = x'·syk, then Constitute a digital envelope; S404, Send to the information receiver L; S5, during the reception and verification phase, the information receiver first decrypts the digital envelope and then Get valid original information; The specific operation method is: S501, information receiver L calculates Lv -1 evp1=Lv -1 ·Pv·Lu=Pv·G=(x', y'), syk=x' -1 evp2, obtain the symmetric key syk; S502, decrypt with symmetric key syk Get (m, t, S, C); S503, based on public information, by calculating Determine whether t=x+H(m)(mod n) holds and verify the validity of the received information.

2. A multi-party secure communication device, characterized in that: include: at least one memory and at least one processor; The at least one memory is used to store a machine-readable program; The at least one processor is configured to call the machine-readable program to execute the method of claim 1.

Citation Information

Patent Citations

  • Identity-based partial blind signature method and apparatus

    CN106656508A

  • Blind signcryption method of elliptic curves in certificateless environments

    CN109257181A

  • RSA multiple blind signature method and device based on identity

    CN116455582A

  • Secure communication method and device based on multiple blind signatures

    CN116455585A

  • Efficient broadcast RSA multiple blind signature method and device and medium

    CN116633561A