scispace - formally typeset
Journal ArticleDOI

Certificateless signature and proxy signature schemes from bilinear pairings

TLDR
A new certificateless signature scheme based on bilinear pairings is presented, which is very simple and does not require any pairing computation, and a certificateless proxy signature scheme is presented.
Abstract
Due to avoiding the inherent escrow of identity-based cryptography and yet not requiring certificates to guarantee the authenticity of public keys, certificateless public key cryptography has received a significant attention. Due to various applications of bilinear pairings in cryptography, numerous pairing-based encryption schemes, signature schemes, and other cryptographic primitives have been proposed. In this paper, a new certificateless signature scheme based on bilinear pairings is presented. The signing algorithm of the proposed scheme is very simple and does not require any pairing computation. Combining our signature scheme with certificateless public key cryptography yields a complete solution of certificateless public key system. As an application of the proposed signature scheme, a certificateless proxy signature scheme is also presented. We analyze both schemes from security point of view.

read more

Citations
More filters
Journal ArticleDOI

Certificateless Remote Anonymous Authentication Schemes for WirelessBody Area Networks

TL;DR: A pair of efficient and light-weight authentication protocols to enable remote WBAN users to anonymously enjoy healthcare service and outperform the existing schemes in terms of better trade-off between desirable security properties and computational overhead, nicely meeting the needs of WBANs.
Book ChapterDOI

Certificateless signature revisited

TL;DR: This paper revisits the security models of certificateless signatures and proposes two new constructions which are provably secure in the random oracle model and proves secure against Normal Type I and Super Type II Adversary.
Proceedings ArticleDOI

Malicious KGC attacks in certificateless cryptography

TL;DR: Wang et al. as discussed by the authors proposed new security models that remove this assumption for both certificateless signature and encryption schemes and showed that a class of certificateless encryption and signature schemes proposed previously are insecure.
Journal ArticleDOI

A Provably Secure Certificateless Public Key Encryption with Keyword Search

TL;DR: A provably secure certificateless dPEKS which has fixed an insecure scheme which was proposed earlier and is proven to be secure under Bilinear Diffie–Hellman problem.
Journal ArticleDOI

An efficient and provably-secure certificateless signature scheme without bilinear pairings

TL;DR: In 2011, Wang et al. as mentioned in this paper proposed a certificateless signature scheme without bilinear pairings, which is more practical than the previous related schemes for practical application, and also showed the proposed scheme is secure in the random oracle.
References
More filters
Book ChapterDOI

Identity-based cryptosystems and signature schemes

TL;DR: In this article, the authors introduce a novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other's signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party.
Book ChapterDOI

Short Signatures from the Weil Pairing

TL;DR: A short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyperelliptic curves is introduced, designed for systems where signatures are typed in by a human or signatures are sent over a low-bandwidth channel.
Book ChapterDOI

Certificateless Public Key Cryptography

TL;DR: In this article, the concept of certificateless public key cryptography (CL-PKC) was introduced and made concrete, which does not require certificates to guarantee the authenticity of public keys.
Journal Article

Certificateless public key cryptography

TL;DR: In this article, the concept of certificateless public key cryptography (CL-PKC) was introduced and made concrete, which does not require certificates to guarantee the authenticity of public keys.
Book ChapterDOI

Efficient Algorithms for Pairing-Based Cryptosystems

TL;DR: In this paper, fast new algorithms to implement recent cryptosystems based on the Tate pairing have been described, which improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3 and attain performance comparable to that of RSA in larger characteristics.