Efficient Certificate-based Signature Research Articles

Efficient Certificate-Based Signature with Short Key and Signature Sizes from Lattices

Certificate-based cryptography (CB-PKC) is an attractive public key setting, which reduces the complexity of public key infrastructure in traditional public key settings and resolves the key escrow problem in ID-based public key settings. In the past, a large number of certificate-based signature and encryption schemes were proposed. Nevertheless, the security assumptions of these schemes are mainly relied on the difficulties of the discrete logarithm and factorization problems. Unfortunately, both problems will be resolved when quantum computers come true in the future. Public key cryptography from lattices is one of the important candidates for post-quantum cryptography. However, there is little work on certificate-based cryptography from lattices. In the paper, we propose a new and efficient certificate-based signature (CBS) scheme from lattices. Under the short integer solution (SIS) assumption from lattices, the proposed CBS scheme is shown to be existential unforgeability against adaptive chosen message attacks. Performance comparisons are made to demonstrate that the proposed CBS scheme from lattices is better than the previous lattice-based CBS scheme in terms of private key size and signature size.

A New Efficient Certificate‐Based Signature Scheme

Certificate-based cryptography is a newkind of public key algorithm, which combines the merits oftraditional Public key infrastructure (PKI) and identitybased cryptography. It removes the inherent key escrowproblem in the identity-based cryptography and eliminatesthe certificate revocation problem and third-party queriesin the traditional PKI. In this paper, we propose an efficient certificate-based signature scheme based on bilinearpairings. Under the strong security model of certificatebased signature scheme, we prove that our scheme is existentially unforgeable against adaptive chosen message andidentity attacks in the random oracle. In our scheme, onlytwo pairing operations are needed in the signing and verification processes. Compared with some certificate-basedsignature schemes from bilinear pairings, our scheme enjoys more advantage in computational cost and communicational cost.

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.

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.

Cryptanalysis of a Certificate-Based on Signature Scheme

Certificate-based cryptosystem combines the advantage of both traditional public key cryptosystem and identity based cryptosystem as it avoids the usage of certificates and resolves the key escrow problem. Recently, Liu et al. proposed a short and efficient certificate-based signature scheme and showed that the scheme was secure in the random oracles. In this paper, we show that Liu et al.’s certificate-based signature scheme is universally forgeable by a Type I adversary who models an uncertified entity and can replace the public keys of entities at will, but is not allowed to obtain the target user's certificate.

A Provably Secure Certificate-Based Signature Scheme with Bilinear Pairings

Traditional public key cryptosystem (PKC) requires high maintenance cost for certificate management. Although, identity based cryptosystem (IBC) reduces the overhead of management, it suffers from the drawback of key escrow. Certificate-based cryptosystem solves certificate revocation problem and eliminate third party queries in the traditional PKI. In addition, it also solves the inherent key escrow problem in the IBC. In this paper, we proposed an efficient certificate-based signature and the result shows that the scheme is provable secure against two game attacks of certificate-based signature in the random oracle model. The security is closely related to the difficulty of solving the discrete logarithm problem.