Efficient Aggregate Signcryption Scheme with Public Verifiability
Yiliang Han
Abstract
Yiliang Han
Abstract
Aggregate signature can put different messages into one which are encrypted by diffident users,and it promotes the efficiency greatly.Aggregate signcryption can realize not only aggregation,but also provides confidentiality and authentication.This paper proposes a new identity-based aggregate signcryption scheme based on the bilinear pairing,and proves its confidentiality and unforgeability based on the BDH and CDH problem.What's more,the scheme has the public verifiability property,and has a higher safety level,less computations and is more effient.
A significance statement is not available in the OpenAlex record.
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.
Aggregate signature can put different messages into one which are encrypted by diffident users,and it promotes the efficiency greatly.Aggregate signcryption can realize not only aggregation,but also provides confidentiality and authentication.This paper proposes a new identity-based aggregate signcryption scheme based on the bilinear pairing,and proves its confidentiality and unforgeability based on the BDH and CDH problem.What's more,the scheme has the public verifiability property,and has a higher safety level,less computations and is more effient.
Key concepts: Signcryption, Computer science, Aggregate (composite), Scheme (mathematics), Authentication (law), Computer security, Confidentiality, Random oracle