Heterogeneous blind signcryption method capable of proving security

Abstract

The invention provides a heterogeneous blind signcryption method capable of proving security, and relates to the technical field of key security. According to the method, security parameters are used for generating system parameters and a master key, user identity information and part of public keys are used as parameters of a hash function for generating part of private keys, so that a complete key of a user in the CLPKC is generated, the key of the user in the TPKI is generated by the user himself / herself, a certificate is issued by the CA, and in the blind signcryption process, the message provider blinds the message by using the blinding factor and then sends the blinded message to the blind signcryption person, the blind signcryption person signs and returns the signed message, the message provider receives the signed message and then de-blinds the signed message, generates a ciphertext and sends the ciphertext to the receiver, and the receiver verifies the legality of the identity of the sender for the ciphertext and returns a plaintext after the verification succeeds. In the verification stage, any user private information is not needed, any trusted third party can verify, and public verification is achieved; and in the signcryption process, the signcryption person cannot see the content of the message and cannot track the ciphertext, so that blindness is achieved.

Description

technical field [0001] The invention relates to the technical field of key security, in particular to a provably secure heterogeneous blind signcryption method. Background technique [0002] Signcryption is to realize the two functions of public key encryption and digital signature in the same operation step, and to ensure the confidentiality and authentication of messages. Compared with the way that signature and encryption are completed in two steps successively, the calculation cost and communication overhead of signcryption are greatly reduced, and the safety factor and efficiency are higher. In 1997, Zheng Y.Digital signcryption orhow to achieve cost(signature&encryption)<<cost(signature)+cost(encryption)[C] / / Annual international cryptology conference. Springer, Berlin, Heidelberg, 1997:165-179. Proposed The idea of ​​signcryption, and a specific scheme design is given to meet the confidentiality and non-repudiation of messages. In 2002, Baek J, Steinfeld R, Zhe...

AI Technical Summary

Problems solved by technology

In 2005, Yuen T H, Wei V K. Fast and proven secureblind identity-based signcryption from pairings[C] / / Cryptographers'Track at the RSA Conference. Springer, Berlin, Heidelberg, 2005: 305-322. An efficient and A provably secure blind signcryption scheme, and the corresponding blind signcryption security model is given, but this scheme uses a total of 5 bilinear pairing operations in the blind signcryption and decryption phases, which has a large amount of calculation and relatively low efficiency. Low

[0003] Among the existing signcryption schemes, there are mostly blind signcryption schemes under a single system, and there are relatively few blind signcryption schemes under a heterogeneous environment.

Images