Abstract
An efficient multi-signature scheme was proposed,whose security is tightly related to the hardness of the Dicisional Diffie-Hellman problem(DDHP) in the random oracle model.Under the Proof-Of-Possession(POP) key registration assumption,the scheme was proved unforgeable against the adaptive chosen message and signing groups attacks.Both the size of multi-signature and the computation cost of verification do not increase with the increase of the signers.Compared with the Computational Diffie-Hellman Problem(CDHP)-based scheme with tight security reduction proposed by Z C WANG,the scheme has the merits of fewer communication rounds and less computation cost.Thus it can be used in many electronic transactions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
