Aggregate signature can aggregate n signatures on n messages from n signers into a single signature that convinces any verifier that n signers sign the n messages, respectively. In this paper, by combining certificate...Aggregate signature can aggregate n signatures on n messages from n signers into a single signature that convinces any verifier that n signers sign the n messages, respectively. In this paper, by combining certificateless public key cryptography and aggregate signatures, we propose an efficient certificateless aggregate signature scheme and prove its security. The new scheme is proved secure against the two representative types adversaries in certificateless aggregate signature under the assumption that computational Diffie-Hellman problem is hard. Furthermore, from the comparison of the computation cost of the new scheme with some existing certificateless aggregate signature schemes in group sum computation, scalar multiplication computation, Hash computation and abilinear pairings computation, it concludes that the new scheme reduces the computation cost in scalar multiplication computation in half and maintains the same in the other computation costs.展开更多
In this paper, we prove common fixed point results for quadruple self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify,...In this paper, we prove common fixed point results for quadruple self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify, unify, extend and generalize many relevant results existing in literature. Also, we define the concept of compatible maps and its variants in the setting of digital metric space and establish some common fixed point results for these maps. Also, an application of the proposed results is quoted in this note.展开更多
基金Supported by the Applied Basic and Advanced Technology Research Programs of Tianjin(15JCYBJC15900)
文摘Aggregate signature can aggregate n signatures on n messages from n signers into a single signature that convinces any verifier that n signers sign the n messages, respectively. In this paper, by combining certificateless public key cryptography and aggregate signatures, we propose an efficient certificateless aggregate signature scheme and prove its security. The new scheme is proved secure against the two representative types adversaries in certificateless aggregate signature under the assumption that computational Diffie-Hellman problem is hard. Furthermore, from the comparison of the computation cost of the new scheme with some existing certificateless aggregate signature schemes in group sum computation, scalar multiplication computation, Hash computation and abilinear pairings computation, it concludes that the new scheme reduces the computation cost in scalar multiplication computation in half and maintains the same in the other computation costs.
文摘In this paper, we prove common fixed point results for quadruple self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify, unify, extend and generalize many relevant results existing in literature. Also, we define the concept of compatible maps and its variants in the setting of digital metric space and establish some common fixed point results for these maps. Also, an application of the proposed results is quoted in this note.
