An Efficient Signature Scheme Based on Tate Pairing

A novel ID-based proxy-protected signature scheme based on identity information is presented in this paper. We review the concept ID-Based signature introduced by Shamir, define the security notion of an ID-Based signature. We also improve the Shamir’s ID-Based signature and prove its security under the proposed security notion. From the improved Shamir’s ID-Based signature scheme we construct an ID-Based proxy signature scheme, the security is based on the underlying ID-based signature scheme. Our scheme is efficient and easy to implement. The scheme simplifies the public key as the user’s id and can be easily applied to all the RSA-type cryptosystems.

In this paper, we first propose an efficient provably secure identity-based signature (IBS) scheme based on bilinear pairings, then propose an efficient identity-based blind signature (IBBS) scheme based on our IBS scheme. Assuming the intractability of the Computational Diffie-Hellman Problem, our IBS scheme is unforgeable under adaptive chosen-message and ID attack. Efficiency analyses show that our schemes can offer advantages in runtime over the schemes available. Furthermore, we show that, contrary to the authors claimed, Zhang and Kim’s scheme in ACISP 2003 is one-more forgeable, if the ROS-problem is solvable.

Post-quantum secure identity-based signature achieving forward secrecy

Recently, Tseng et al. proposed a new notion for identity-based signature (IBS) scheme to resist ephemeral secret leakage (ESL) attacks, called leakage-free identity-based signature (leakage-free IBS), and devised the first secure leakage-free IBS scheme. However, they only considered the situation of the leakage of ephemeral secrets used for generating the signatures. Notice that the private key extraction procedure is probabilistic as well in their scheme, that is, there are ephemeral secrets used by the key generation center to generate the signers’ private keys. It is practical to consider that if the adversary comprises these ephemeral secrets, then he can reveal the master key of the system. Therefore, it is desired to introduce a new security notion for the leakage-free IBS schemes to consider the ESL attacks on both private key extraction and signing procedures. In this paper, we present such security notion. Moreover, we propose two IBS schemes that are proved to be secure under the new security notion.

Comment on “An efficient identity-based signature scheme with provable security”

Faster computation of the Tate pairing

Based on the GDH signature (short signature scheme) a probabilistic signature scheme is proposed in this paper with security proof. Then a new threshold proxy signature from bilinear pairings is proposed as well by using the new probabilistic signature scheme and the properties of the Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy to solve). Our constructions are based on the recently proposed GDH signature scheme of Bonel et al.’s article. Bilinear pairings could be built from Weil pairing or Tate pairing. So most our constructions would be simpler, but still with high security. The proposed threshold proxy signature is the first one which is built from bilinear pairings. At the end of this paper security and performance of the threshold proxy signature scheme is also analyzed.

Recently, the notion of the key-insulated public- key system has been suggested to protect the security of users' private keys. A general idea of this system is changing the user's private key along with the time, but the user's public key remains unchanged. In this paper, we propose a new identity (ID)-based key-insulated signature scheme from bilinear pairings. As compared with the recently proposed ID-based key-insulated signature schemes, our proposed scheme has better performance in the batch verifying phase. For security analysis, our scheme is a provably secure key-insulated signature scheme in the random oracle model and under the computational Diffie-Hellman assumption. Meanwhile, to demonstrate the additional advantage of a key-insulated signature, we present a novel application based on the proposed scheme, called full delegation ID-based proxy signature scheme with time restriction. To our best knowledge, no such a proxy signature scheme is proposed until now.

Optimal resilient threshold GQ signatures

Recently, Tsai et al. constructed an efficient identity-based signature (IBS) scheme and claimed that it was strongly unforgeable in the standard model. Unfortunately, we find that their scheme is insecure. By giving concrete attack, we show that their scheme does not meet the requirement of strong unforgeability. Meanwhile, we demonstrate that there are serious flaws in their security proof. The simulator cannot correctly answer the signing query in the security model. Furthermore, we propose an improved strongly unforgeable IBS scheme without random oracles. Compared with other strongly unforgeable IBS schemes in the standard model, our scheme is more efficient in terms of computation cost and signature size.

Identity-based ring signatures from RSA

Authentication of public keys in asymmetric cryptography is an important objective to fulfil. Identity-based schemes are an efficient solution for this scenario. There are various identity-based schemes that are based on either factoring problem or DLP problem, but these problems can be solved in polynomial time using quantum computers. Multivariate cryptography is one of the main alternatives for the construction of post-quantum digital signature schemes. Digital signature construction needs modest computations in multivariate public key cryptography, so these schemes are considered quite efficient. In this paper, we present a new identity-based signature scheme in which the signature size and user key size are relatively small. The design of our proposed signature scheme is based on MQDSS construction.KeywordsMultivariate public key cryptographyMQ problemIdentity-based signature scheme

This paper proposes a new identity-based signature scheme. The new scheme is proven to be existentially unforgeable against Chosen-Principle and Chosen-Message CP-CM attackers who are the strongest attackers so far defined for identity-based signatures. The security of our scheme relies on the standard Computational Diffie-Hellman CDH assumption. The proof is given in the random oracle model where a hash function is modelled as random oracle. Analysis shows that our scheme is also more efficient than the state of the art in terms of computation and communication. We finally improve the basic scheme by eliminating the single-point problem, allow using as a proxy signature scheme and enable fast verification in multi-user settings. The basic scheme and its extensions show that our proposal is versatile to realise efficient and secure authentication in various scenarios.

An efficient provably secure identity-based blind signature (IBBS) scheme based on bilinear pairings is proposed. Assuming the intractability of the q-Strong Diffie-Hellman problem, our IBBS is unforgeable under adaptive chosen-message and ID attack. Because of avoiding using the inefficient MapToPoint function, our IBBS can offer advantages in runtime over the schemes available. Based on this ID-based blind signature scheme, we describe the first ID-based threshold blind signature (TBS) and show that it has security properties of unforgeability and robustness.

Compared with ordinary digital signature, the strong designated verifier signature (SDVS) scheme makes it possible for a signer to convince a designated verifier that he or she has signed a message in such a way that the designated verifier cannot transfer the signature to a third party. Recently, Bao et al. proposed two ID-based SDVS schemes by use of bilinear pairing. In this paper, we show both of these schemes are insecure against active attack, that is the attacker can forge signature without signer's private key. Combining with the Schnorr signature scheme, we also provide a new efficient ID-based designated verifier signature scheme.