Efficient Signature Scheme Research Articles

Efficient certificate-based verifiable encrypted signature scheme

Certificate-based public key cryptographic is a novel cryptographic primitive solving the heavy management problem in the conventional public key cryptographic. Verifiable encrypted signature is useful for many cryptographic protocols and often is used as to construct an optimistic fair exchange, it can convince a verifier that a given cipher text is an encryption of signature on a given message. In this paper, we propose an efficient certificate-based verifiable encrypted signature scheme by combining certificate-based public key cryptographic with a verifiable encrypted signature. We first give the formal definition of the certificate-based verifiable encrypted signature and its security goal, then we construct a secure certificate-based verifiable encrypted signature scheme, and gives the security analysis. The analysis shows that our scheme satisfies the security properties including validity, unforgeability, and opacity, and simplifies the certificate management process, solves the escrow problem, and there are fewer pairing operations and the least number of the total operations comparing with the other existing verifiable encrypted signature schemes.

A new construction of identity-based group signature

Identity-based (simply ID-based) public key cryptosystem allows the user to use his identity as the public key, which can be a good alternative for certificate-based public key setting. Group signature allows any member of a group to sign on behalf of the group without revealing his identity. A complete ID-based group signature scheme was proposed in ACISP’06. However, it was very impractical. In this paper, we give a construction of identity-based group signatures. Then, we construct an efficient ID-based group signature scheme. We also show that the group signature scheme is provably secure in the random oracle model.

Secure and Efficient Certificateless Signature and Blind Signature Scheme from Pairings

Based an identity-based signature scheme, we givea certificateless signature scheme. And then we propose a certificateless blind signature (CLBS) scheme in this paper. This schemeis more efficient than those of previous schemes by pre-computing the pairing e (P, P)=g. Based on CL-PKC, it eliminates theusing of certificates in the signature scheme with respect to thetraditional public key cryptography (PKC) and solves key escrowproblems in ID-based signature schemes. Meanwhile it retains themerits of BS schemes. The proposed CLBS scheme is existentialunforgeable in the random oracle model under the intractabilityof the q-Strong Diffie-Hellman problem.

Efficient certificate-based signature scheme with strong designated verifier

Concerning the flaw that it needs a fully credible third party in ID-based strong designated verifier signature and the low efficiency of existing schemes,taking the advantage of Certificate Authority(CA)'s low trust level in certificate-based public key cryptography,a new strong designated verifier signature scheme was proposed in this paper.Furthermore,the formal security analysis under assumed Bilinear Diffie-Hellman(BDH) problem in the random oracle model was presented.Performance analysis shows the scheme meets all properties of strong designated verifier signature schemes and enjoys higher correspondence efficiency used in bandwidth limited environment since the signature length is just one of the group elements.

Cryptanalysis of efficient identity-based signature scheme

Identity-based signatures are the groundwork of many cryptographic protocols.This paper analyzed GU KE et al.'s(GU KE,JIA WEIJIA,JIANG CHUNLIANG.Efficient and secure identity-based signature scheme.Journal of Software,2011,22(6):1350-1360) efficient identity-based signature scheme.Two equivalent signature generating algorithms were proposed and it was pointed out that Gu et al.'s scheme could not satisfy the basic security properties.In other words,any attacker could use the equivalent secret key and signature generating algorithms proposed in this paper to forge a valid secret key of a user and a valid signature on any message with respect to any identity in their scheme.Furthermore,the reason that the scheme is insecure was also analyzed and it was pointed out that designing a more efficient identity-based signature scheme than the classical one is almost impossible.

Efficient threshold signature scheme in standard model

To improve the computational efficiency in the threshold signature scheme,the authors proposed a new threshold signature scheme based on bilinear pairing via combining Gennaro's(GENNARO R,JAREAKI S,KRAWCZYK H,et al.Secure distributed key generation for discrete-log based cryptosystem.Journal of Cryptology,2007,20(1): 51-83) distributed secret key generation solution and Gu's(GU K,JIA W J,JIANG C L.Efficient and secure identity-based signature scheme.Journal of Software,2011,22(6): 1350-1360) signature scheme in the standard model.There was no trusted dealer for secret key share distribution and each party could verify the validity of some important information,which guaranteed the proposed scheme can avoid the malicious private key generator attack and public key share replacing attack.The comparison results with two previous threshold signature schemes show that the proposed scheme needs less pairing computation and raises the computational efficiency.

Structure and Analysis of Certificateless Proxy Blind Signature Scheme without Bilinear Pairing

Combined with certificateless public key cryptography and proxy blind signature, an efficient certificateless proxy blind signature scheme is proposed. Its security is based on the discrete logarithm problem. Compared with the existed certificateless proxy blind signature scheme, because without bilinear pairing, it have higher efficiency. According to the different attacker and all kinds of attacks, the scheme is proved to be correct and security under the hardness of discrete logarithm problem in the finite field.

Efficient identity-based signature scheme with batch authentication for delay tolerant mobile sensor network

Identity-based cryptography (IBC) has drawn a lot of attentions in delay tolerant environment. However, the high computational cost of IBC becomes the most critical issue in delay tolerant mobile sensor network (DTMSN) because of the limited processing power. In this paper, an efficient identify-based signature scheme with batch authentication (ISBA) is proposed for DTMSN. ISBA designs an online/offline signature with batch authentication to reduce the computational cost, and improves data delivery mechanism to increase the number of messages for each batch authentication. Simulation results show that ISBA not only realizes a lower computational cost than existed schemes, but also does not induce negative impact on the delivery performance.

Provably secure certificate-based signature scheme without pairings

In order to simplify certificate management in traditional public key cryptography and solve the key escrow problem in identity-based cryptography, the notion of certificate-based cryptography was introduced. Recently, Ming and Wang proposed a certificate-based signature scheme without pairings. They claimed that the scheme was existentially unforgeable against adaptive chosen message and identity attacks in the random oracle. In this paper, we show that the scheme is insecure against a malicious certifier under existing security model. We also propose a new efficient certificate-based signature scheme without pairings, which is proven secure in the random oracle model. Compared with the existed certificate-based signature schemes without parings, our scheme enjoys shorter signature length and less operation cost.

A Group Signature in the Composite Order Bilinear Groups

We present an efficient group signature scheme based on BMW model utilizing composite order(of 3 primes) bilinear groups theory proposed by Lewko et al.in 2010.Besides,we apply the Groth-Sahai non-interactive proof system in this scheme to solve the problem of traditional group signatures such as inefficient communication and chosen ciphertext attack.In addition,the size of the signature is a constant rather than relying on other parameters and the security of the scheme is proved under standard model.We compare the security and the efficiency respectively with the similar group signatures,and achieve the advantage.

Efficient Certificate-Based Blind Signature Scheme without Bilinear Pairings

Blind signature is a well-known cryptographical technique used to construct some advanced applications for the consideration of user privacy. In this work, we propose the first efficient certificate-based blind signature scheme that follows the idea of Certificate Based Encryption (CBE) presented by Gentry in EuroCrypt 2003. The security of our scheme is based on the elliptic curve discrete logarithm problem over a finite field. In addition, our scheme does not require any pairing operations which is regarded as cosely operations compared to other operations. Compared with the other secure blind signature scheme, our scheme enjoys shorter signature length, less running time and operation cost. So it can be used widely, especially in low-bandwidth communication environments such as wireless cooperative networks.

An Efficient and Provably-secure Digital signature Scheme based on Elliptic Curve Bilinear Pairings

We proposed an efficient and secure digital signature scheme using elliptic curve cryptography (ECC) and bilinear pairings in this paper. The proposed scheme employs the general cryptographic hash function (i.e., SHA-1) instead of map-to-point function, because the map-to-point is a cost-intensive operation and it is usually implemented as a probabilistic algorithm. Further, our scheme is computationally efficient as one bilinear paring and three elliptic curve scalar point multiplication operations are executed for signature generation and verification, and thus the scheme requires much lesser computation cost than other related schemes. In addition, in the random oracle model, our scheme is proven to be existential unforgeable against the adaptive chosen message and identity attacks (EUF-CMA) based on a variation of the collusion attack algorithm with ktraitors (k-CAA3) problem.

Joint Relay Selection and Resource Allocation for Cooperative OFDMA Network

A separable identity-based ring signature scheme has been constructed as a fundamental cryptographic primitive for protecting user privacy. Using the separability property, ring members can be selected from arbitrary domains, thereby, giving a signer a wide range of ways to control privacy. In this paper we propose a generic method to construct efficient identity-based ring signature schemes with various levels of separability. We first describe a method to efficiently construct an identity-based ring signature scheme for a single domain, in which a signer can select ring identities by choosing from identities defined only for the domain. Next, we present a generic method for linking ring signatures constructed for a single domain. Using this method, an identity-based ring signature scheme with a compact structure, supporting multiple arbitrary domains can be designed. We show that our method outperforms the best known schemes in terms of signature size and computational costs, and that the security model based on the separability of identity-based ring signatures, presented in this paper, is highly refined and effective by demonstrating the security of all of the proposed schemes, using a model with random oracles.

An efficient threshold key-insulated signature scheme

To tackle the key-exposure problem in signature settings, this paper introduces a new cryptographic primitive named threshold key-insulated signature (TKIS) and proposes a concrete TKIS scheme. For a TKIS system, at least k out of n helpers are needed to update a user’s temporary private key. On the one hand, even if up to k−1 helpers are compromised in addition to the exposure of any of temporary private keys, security of the non-exposed periods is still assured. On the other hand, even if all the n helpers are compromised, we can still ensure the security of all periods as long as none of temporary private keys is exposed. Compared with traditional key-insulated signature (KIS) schemes, the proposed TKIS scheme not only greatly enhances the security of the system, but also provides flexibility and efficiency.

An ID-Based Signature Scheme from Bilinear Pairing Based on Ex-K-Plus Problem

In an ID-Based cryptosystem, identity of users are used to generate their public and private keys. In this system private key is generated by trusted private key generator (PKG). Unlike traditional PKI, this system enables the user to use public keys without exchanging public key certificates. With the exploitation of bilinear pairing, several secure and efficient ID-Based signature schemes have been proposed till now. In this paper, we have proposed an ID-Based signature scheme from bilinear pairing based on Ex-K-Plus problem. The proposed scheme is existentially unforgeable in the random oracle model under the hardness of K-CAA problem. Our scheme is also unforgeable due to hardness of ex-k-plus problem and computationally more efficient than other existing schemes.

An Efficient and Provably Secure Proxy Signature Scheme

An Efficient and Provably Secure Proxy Signature Scheme

Another Attack on Tso's Short Signature Scheme Based on Bilinear Pairings

In 2009, R. Tso et al. proposed an efficient pairing-based short signature scheme which is provably secure in the Random Oracle Model. In this paper, we propose a new key substitution attack on Raylin Tso et al.’s short signature scheme. For a given message and the corresponding valid signature, the malicious attacker can generate a substituted public key. Everyone verifies the signature successfully with the malicious attacker’s substituted public key. Therefore, Raylin Tso et al.’s short signature scheme has a security flaw in the multi-user setting.

Key Substitution Attack and Malleability of a Short Signature Scheme with Batch Verification

At IWSEC 2008, F. Guo et al. proposed an efficient short signature scheme with batch verification based on C. Gentry’s scheme. In this paper, we firstly propose the key substitution attack on F. Guo et al.’s digital signature scheme and show that the malicious adversary can forge a valid signature, which can be verified with a substituted public key. Secondly, we prove that F. Guo et al.’s scheme is malleable and the attacker can produce a new valid signature on the message if he/she has known some valid signatures on the same message.

An Efficient and Provably Secure Proxy Signature Scheme

As a concept of delegating signing rights for digital signatures, proxy signature is a well studied subject in cryptography. Proxy signature is an important delegation technique. It plays an important role in auto-office system. In this paper, we give a secure and efficient proxy signature scheme. The security of the scheme is base on the fixed inversion problem of bilinear map. It has the following advantages: simple construction, short size and low computation.

The Modified Signature Scheme Based on Factoring and Discrete Logarithms

ABSTRACT Laih and Kuo developed two highly secure and efficient signature schemes based on factoring and discrete logarithms. Unfortunately, their schemes require many keys for signing document and verifying signature. Li, Tzeng, and Hwang improved one of their schemes and managed to reduce the number of keys, but unfortunately the improved scheme was shown to be insecure by Qian, Chao, and Bao. In this paper, a new modified scheme of Li-Tzeng-Hwang is presented with two main results: The modified scheme requires fewer keys than the scheme by Laih and Kuo, and it is able to withstand many attacks including the one mentioned by Qian, Chao and Bao.