Research On Anonymous Signcryption Scheme For Multi-recipients Based On Certificateless System

The multi-recipient signcryption scheme is a method of secure broadcast communication.It solves the problem of repeated signcryption for one-to-many communication.Only one signcryption process can be sent to multiple recipients.In the electronic voting,firewall group It is widely used in broadcast and other scenarios.Many existing multi-recipient signcryption schemes are identity-based and face the problem of key escrow and Key Generation Centers(KGC)leaking private keys.To solve this problem,a certificateless system and multi-recipient signcryption are proposed In the combined method,the user's private key is generated by the user and both parties,which avoids the problem of key escrow and malicious disclosure of the private key,and improves the security of the scheme.Therefore,it attracts many people to sign cryptographically for multiple receivers without certificates Study the plan.However,many certificateless multi-recipient signcryption schemes have the problem of leaking user identities and excessive calculations,and cannot meet actual application requirements.In response to these two problems,the article proposes a multi-recipient anonymous signcryption scheme under the certificateless system,which uses multiple receiver public key sets to signcryption the message,generate a ciphertext,and then broadcast the ciphertext to all receiver.This scheme uses the hash function and dot product operation to obtain the transformation set of the public key,and then uses Lagrange interpolation to hide the transformation set of the public key of the recipient in the polynomial to avoid the identity of the recipient appearing directly in the ciphertext Here,the anonymity of the recipient's identity is achieved;The method of fusion of random numbers and identity is used to determine the signature parameters of the sender,which protects the identity of the sender and solves the problem of the identity leakage of the sender.The scheme adopts the dot product algorithm on the elliptic curve to avoid excessive use of bilinear pairs,and only uses bilinear pair operations in the authentication process,which improves the calculation efficiency.Under the Random Oracle Model(ROM),based on the Elliptic Curve Discrete Logarithm problem(ECDLP)and Computational Diffie-Hellman(CDH)difficult problem prove the confidentiality,unforgeability,and anonymity of the scheme.Finally,it is compared with several classic multi-recipient signcryption algorithms in terms of calculation amount and security attributes.The results show that the article scheme has high calculation efficiency and good security.There are 12 pictures,2 tables and 55 references in these thesis.