Identity-based threshold group signature scheme based on multiple hard number theoretic problems

We introduce in this paper a new identity-based threshold signature (IBTHS) technique, which is based on a pair of intractable problems, residuosity and discrete logarithm. This technique relies on two difficult problems and offers an improved level of security relative to an individual hard problem. The majority of the denoted IBTHS techniques are established on an individual difficult problem. Despite the fact that these methods are secure, however, a prospective solution of this sole problem by an adversary will enable him/her to recover the entire private data together with secret keys and configuration values of the associated scheme. Our technique is immune to the four most familiar attack types in relation to the signature schemes. Enhanced performance of our proposed technique is verified in terms of minimum cost of computations required by both of the signing algorithm and the verifying algorithm in addition to immunity to attacks

A new digital signature scheme with message recovery using hybrid problems

We present a new digital signature scheme with message recovery and its authenticated encryption based on elliptic curve discrete logarithm and quadratic residue. The main idea is to provide a higher level of security than all other techniques that use signatures with single hard problem including factoring, discrete logarithm, residuosity, or elliptic curves. The proposed digital signature schemes do not involve any modular exponentiation operations that leave no gap for attackers. The security analysis demonstrates the improved performance of the proposed schemes in comparison with existing techniques in terms of the ability to resist the most common attack

A new RSA public key encryption scheme with chaotic maps

Public key cryptography has received great attention in the field of information exchange through insecure channels. In this paper, we combine the Dependent-RSA (DRSA) and chaotic maps (CM) to get a new secure cryptosystem, which depends on both integer factorization and chaotic maps discrete logarithm (CMDL). Using this new system, the scammer has to go through two levels of reverse engineering, concurrently, so as to perform the recovery of original text from the cipher-text has been received. Thus, this new system is supposed to be more sophisticated and more secure than other systems. We prove that our new cryptosystem does not increase the overhead in performing the encryption process or the decryption process considering that it requires minimum operations in both. We show that this new cryptosystem is more efficient in terms of performance compared with other encryption systems, which makes it more suitable for nodes with limited computational ability

Numerical approach of riemann-liouville fractional derivative operator

This article introduces some new straightforward and yet powerful formulas in the form of series solutions together with their residual errors for approximating the Riemann-Liouville fractional derivative operator. These formulas are derived by utilizing some of forthright computations, and by utilizing the so-called weighted mean value theorem (WMVT). Undoubtedly, such formulas will be extremely useful in establishing new approaches for several solutions of both linear and nonlinear fractionalorder differential equations. This assertion is confirmed by addressing several linear and nonlinear problems that illustrate the effectiveness and the practicability of the gained findings

Design of Identity-Based Blind Signature Scheme Upon Chaotic Maps

Cryptosystems relying on chaotic maps have been presented lately. As a result of inferred and convenient connections amongst the attributes of conventional cryptosystems and chaotic frameworks, the concept of chaotic systems with applications to cryptography has earned much consideration from scientists working in the various domains. Hence, we suggest a novel IDentity-based Blind Signature (ID-BS) based technique in this paper that relies on a pair of hard number theoretic problems, namely, the Chaotic Maps (CM) and FACtoring (FAC) problems. The technique is immune to attacks, in addition to its efficiency in application. Relative to other related schemes, it requires fewer module operations. In summary, our proposed technique is superior to similar schemes within the cryptosystems domain.</span

A New Digital Signature Scheme Based on Chaotic Maps and Quadratic Residue Problems

Securing electronic signature gives the contracting parties, especially the consumer, safety and security, which positively reflects on trade exchange. Digital-signature algorithms can be categorized based on the type of security suppositions, for example discrete logarithm, factorization of hard-problems, and elliptic-curve cryptography, which are all currently believed to be unsolvable in a reasonable time period. In recent years, a variety of chaotic cryptographic schemes have been proposed. The idea of chaotic systems with applications to cryptography has received a great deal of attention from researchers from a variety of disciplines. Therefore, in this paper, we propose a new signature scheme based on two hard number theoretic problems, Chaotic Maps (CM) and Quadratic Residue (QR). Our performance analysis shows that compared, to other associated schemes, our scheme not only improves the efficiency level but also ensures security . We also give a proof that the security of the proposed scheme can protect against the known key attacks

Design of Identity-Based Blind Signature Scheme Upon Chaotic Maps

Cryptosystems relying on chaotic maps have been presented lately. As a result of inferred and convenient connections amongst the attributes of conventional cryptosystems and chaotic frameworks, the concept of chaotic systems with applications to cryptography has earned much consideration from scientists working in the various domains. Hence, we suggest a novel IDentity-based Blind Signature (ID-BS) based technique in this paper that relies on a pair of hard number theoretic problems, namely, the Chaotic Maps (CM) and FACtoring (FAC) problems. The technique is immune to attacks, in addition to its efficiency in application. Relative to other related schemes, it requires fewer module operations. In summary, our proposed technique is superior to similar schemes within the cryptosystems domain

Generalization of Some Coupled Fixed Point Results on Partial Metric Spaces

Using the setting of partial metric spaces, we prove some coupled fixed point results. Our results generalize several well-known comparable results of H. Aydi (2011). Also, we introduce an example to support our results