Certificateless Signcryption Scheme Research Articles

A Secure Routing Protocol Based on Certificateless Signcryption for Satellite Networks

The article introduces a certificateless signcryption scheme targeting the problem of lacking of security mechanism in the routing of satellite networks, and designs a secure routing protocol suitable for the satellite networks. The proposed protocol avoids complicated management in the certificate mechanism and bypasses the key escrow problem in the identity-based cryptography using the certificateless cryptography and signcryption. The analysis shows that the new protocol can resist several common attacks, effectively improve the security of the satellite networks routing.

Certificateless Mult-i receiver Signcryption Scheme Based on Multivariate Public Key Cryptography

Certificateless Mult-i receiver Signcryption Scheme Based on Multivariate Public Key Cryptography

On security of a certificateless signcryption scheme

It would be interesting if a signcryption scheme in the standard model could be made certificateless. One of the interesting attempts is due to Liu et al. [Z. Liu, Y. Hu, X. Zhang, H. Ma, Certificateless signcryption scheme in the standard model, Information Sciences 180 (3) (2010) 452–464]. In this paper, we provide a cryptanalysis on this scheme by depicting two kinds of subtle public key replacement attacks against it. Our analysis reveals that it does not meet the basic requirements of confidentiality and non-repudiation.

Certificateless Signcryption Scheme Without Bilinear Pairing

Only six certificateless signcryption schemes have been proposed in recent years.Most of them cannot provide confidentiality and authentication.Even if some of them are secure,all of them need pairing operations.In order to solve the above-mentioned problems,a pairing-free certificateless signcryption scheme is proposed,and its security has proven to be in the random oracle model(ROM) under the computational Diffie-Hellman(CDH) assumption and the hardness of discrete logarithm problem(DLP).This scheme eliminates pairing operations and is the most efficient certificateless signcryption scheme.

Certificateless Signcryption Scheme with Proxy Unsigncryption

Firstly,this paper gives a new signcryption model,named signcryption with proxy unsigncryption.In this model,the original unsigncrypter divides messages into several subjects and delegates his unsigncryption powers to different proxies.The authorized proxies can directly unsigncrypt ciphertexts for the original unsigncrypter.Secondly,this paper gives the security model and based on certificateless public key cryptography give a concrete scheme.At last,this paper proves its security based on Weak-BDH problem.

Efficient Certificateless Signcryption Scheme from Weil Pairing

Certificateless signcryption has both the advantage of certificateless public key cryptography, which overcome the escrow problem inherited from identity based cryptography without the use of certificates as in traditional public key cryptography, and signcryption which can fulfill both the functions of signature and encryption in a logical signal step. In this paper, we explicit the security model for certificateless signcryption and propose an efficient certificateless signcryption scheme from Weil pairings. The new scheme not only can be proved to be secure in our model but also can simultaneously provide public verifiability and forward security. Furthermore, compared with existing schemes, the new scheme is more efficient.

Efficient Certificateless Hybrid Signcryption

Certificateless hybrid signcryption can handle messages of arbitrary length while the conventional certificateless signcryption cannot.This paper demonstrates that the attacks presented by Selvi,et al.,do not hold, and proposes a new certificateless hybrid signcryption scheme,which outperforms all the existing schemes on both bandwidth usage and computation efficiency.Hence,this scheme is more suitable for the applications with a narrow bandwidth and limited computation resources such as ad hoc networks.This scheme has been proven to be secure in the random oracle model,under the bilinear Diffie-Hellman assumption.

Security Pitfalls of the Certificateless Signature and Multi-Receiver Signcryption Schemes

Recently, Xiong et al. and Selvi et al. proposed a certificateless signature scheme secure in the standard model and a certificateless multi-receiver signcryption scheme secure in the random oracle model, respectively. In this paper, we show that they are insecure against malicious-butpassive KGC attacks. More specifically, the former does not achieve unforgeability and the latter does not satisfy confidentiality against type II adversaries.

Cryptanalysis of a certificateless signcryption scheme in the standard model

Certificateless signcryption is a useful primitive which simultaneously provides the functionalities of certificateless encryption and certificateless signature. Recently, Liu et al. [15] proposed a new certificateless signcryption scheme, and claimed that their scheme is provably secure without random oracles in a strengthened security model, where the malicious-but-passive KGC attack is considered. Unfortunately, by giving concrete attacks, we indicate that Liu et al. certificateless signcryption scheme is not secure in this strengthened security model.

Certificateless signcryption scheme in standard model

Most of the current identity-based signature schemes are secure in the random oracle model but many of them have security problem.In this paper an efficient and provably secure identity-based certificateless signcryption scheme was proposed.The scheme was proved secue in the standard model and reduced the q-Augmented Bilinear Diffie-Hellman Exponent q-ABDHE problem.Compared with the known identity-based scheme in the standard model the proposed scheme has shorter signature length and less operation.

Certificateless signcryption scheme in the standard model

Certificateless public key signcryption scheme is an important cryptographic primitive in cryptography. Barbosa and Farshim proposed a certificateless signcryption scheme. However, their construction is proven to be secure in the random oracle model but not the standard model, and the scheme is also vunlerable to the malicious-but-passive key generation center (KGC) attacks. To overcome these disadvantages, we introduce a formal security model for certificateless signcryption schemes secure against the malicious-but-passive KGC attacks and propose a novel certificateless signcryption scheme. The proposed certificateless signcryption scheme is proven to be IND-CCA2 secure under the decisional Bilinear Diffie–Hellman intractability assumption without using the random oracles. The proposed scheme is also proven to be existentially unforgeable under the computational Diffie–Hellman intractability assumptions. Furthermore, performance analysis shows that the proposed scheme is efficient and practical.