Answers are grounded in this paper and cite their sources.
ABSTRACTIn a digital multisignature scheme, two or more signers are allowed to produce a single signature on a common message, which can be verified by anyone. In the literature, many schemes are available based on the public key infrastructure or identity-based cryptosystem with bilinear pairing and map-to-point (MTP) hash function. The bilinear pairing and the MTP function are time-consuming operations and they need a large super-singular elliptic curve group. Moreover, the cryptosystems based on them are difficult to implement and less efficient for practical use. To the best of our knowledge, certificateless digital multisignature scheme without pairing and MTP hash function has not yet been devised and the same objective has been fulfilled in this paper. Furthermore, we formally prove the security of our scheme in the random oracle model under the assumption that ECDLP is hard.KEYWORDS: elliptic curve cryptographycertificateless public key cryptosystemmultisignaturemap-to-point hash functionbilinear pairing2010 AMS Subject Classifications: 94A6014H5268P2597F6097P20 AcknowledgmentsThe work is supported by the Outstanding Potential for Excellence in Research and Academics (OPERA) award, Birla Institute of Technology and Science (BITS) Pilani, Pilani Campus, Rajasthan, India. The authors extend their sincere appreciations to the Deanship of Scientific Research at King Saud University for its funding this Prolific Research Group (PRG-1436-16). The authors are thankful to the Editor-in-Chief and anonymous reviewers for their valuable comments and suggestions that helped us to improve the work presented in this paper.Disclosure statementNo potential conflict of interest was reported by the author(s).
No takes yet. Share an insight, caveat, or question.
Islam et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: