Provably Secure Identity-based Threshold Ring Signcryption Scheme in Standard Model
Hua Sun, Aimin Wang, Zheng Xuefeng
Abstract
Hua Sun, Aimin Wang, Zheng Xuefeng
Abstract
Signcryption is a cryptographic primitive which can provide authentication and confidentiality simultaneously with a computational cost lower than signing and encryption respectively,while the ring signcryption has anonymity in addition to authentication and confidentiality.In order to design an identity-based threshold ring signcryption,this paper presented an efficient identity-based threshold ring signcryption scheme without random oracles by means of secret sharing and bilinear pairing technique,and gave security analysis of the scheme.At last,we proved this scheme satisfies indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen message and identity attacks in terms of the hardness of DBDH problem and CDH problem.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Signcryption is a cryptographic primitive which can provide authentication and confidentiality simultaneously with a computational cost lower than signing and encryption respectively,while the ring signcryption has anonymity in addition to authentication and confidentiality.In order to design an identity-based threshold ring signcryption,this paper presented an efficient identity-based threshold ring signcryption scheme without random oracles by means of secret sharing and bilinear pairing technique,and gave security analysis of the scheme.At last,we proved this scheme satisfies indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen message and identity attacks in terms of the hardness of DBDH problem and CDH problem.
Key concepts: Signcryption, Computer science, Random oracle, Ciphertext, Anonymity, Identity (music), Authentication (law), Cryptographic primitive