On Constructing Certificateless Cryptosystems from Identity Based Encryption

Libert, Benôıt; Quisquater, Jean-Jacques

doi:10.1007/11745853_31

Cited by 123 publications

(137 citation statements)

References 30 publications

(94 reference statements)

Supporting

Mentioning

123

Contrasting

Unclassified

Order By: Relevance

“…Finally, as in the proof of Theorem 1, the signature (z 1 , z 2 , z 3 , z 4 , z 5 , z 6 , c j ) is valid and can pass the verification. we can obtain the equation…”

mentioning

confidence: 90%

See 1 more Smart Citation

Lattice-Based Revocable Certificateless Signature

2017

View full text Add to dashboard Cite

Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by quantum computers in the future so that the signature schemes based on them will also become insecure. For post-quantum cryptography, lattice-based cryptography is significant due to its efficiency and security. However, no study on addressing the revocation problem in the existing lattice-based CLS schemes is presented. In this paper, we focus on the revocation issue and present the first revocable CLS (RCLS) scheme over lattices. Based on the short integer solution (SIS) assumption over lattices, the proposed lattice-based RCLS scheme is shown to be existential unforgeability against adaptive chosen message attacks. By performance analysis and comparisons, the proposed lattice-based RCLS scheme is better than the previously proposed lattice-based CLS scheme, in terms of private key size, signature length and the revocation mechanism.

show abstract

“…Finally, as in the proof of Theorem 1, the signature (z 1 , z 2 , z 3 , z 4 , z 5 , z 6 , c j ) is valid and can pass the verification. we can obtain the equation…”

mentioning

confidence: 90%

“…In addition, the user independently generates and publishes the public key, so the need of certificates in conventional PKC is abolished. Afterwards, numerous works [4][5][6][7][8][9] have addressed the CL-PKC area.…”

Section: Introductionmentioning

confidence: 99%

Lattice-Based Revocable Certificateless Signature

2017

View full text Add to dashboard Cite

show abstract

“…Some concrete efficient implementations were proposed in [8,9]. In addition, some generic construction were proposed in [7,5,6].…”

Section: Introductionmentioning

confidence: 99%

Self-Generated-Certificate Public Key Encryption Without Pairing

Lai

Kou²

2007

Public Key Cryptography – PKC 2007

View full text Add to dashboard Cite

Abstract. Certificateless Public Key Cryptography (CL-PKC) has very appealing features, namely it does not require any public key certification (cf. traditional Public Key Cryptography) nor having key escrow problem (cf. Identity-Based Cryptography). However, it does suffer to the Denialof-Decryption (DoD) Attack called by Liu and Au [1], as its nature is similar to the well known Denial-of-Service (DoS) Attack. Based on CL-PKC, they introduced a new paradigm called Self-Generated-Certificate Public Key Cryptography (SGC-PKC) that captured the DoD Attack and proposed a first scheme derived from a novel application of Water's Identity-Based Encryption scheme. In this paper, we propose a new SGC-PKE scheme that does not depend on the bilinear pairings, which make it be more efficient and more short public keys than Liu and Au's scheme. More importantly, our scheme reaches Girault's trusted level 3 (cf. Girault's trusted level 2 of Liu and Au's scheme), the same level as is enjoyed in a traditional PKI.

show abstract

“…Like ID-PKC, certificateless cryptography does not use public key certificate [1,11,18], it also needs a third party called Key Generation Center (KGC) to help a user to generate his private key. However, the KGC does not have access to a user's full private key.…”

Section: Introductionmentioning

confidence: 99%

New Efficient Certificateless Signature Scheme

Zhang

2007

Emerging Directions in Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

Abstract. In ubiquitous computing environment, how to implement security and trust among the users that connected to a network is a big problem. Digital signature provides authenticity, integrity and nonrepudiation to many kinds of applications in ubiquitous computing environment. In this paper, we present a very efficient certificateless signature scheme from bilinear maps. In our scheme, only one paring operation is needed in the signing and verification processes. The security of the new scheme is based on the intractability of the q-Strong Diffie-Hellman (q-SDH) Problem and the Discrete Logarithm Problem. We prove the existential unforgeability of our scheme under adaptively chosen message attack against both types of adversaries in the random oracle model [3].

show abstract

On Constructing Certificateless Cryptosystems from Identity Based Encryption

Cited by 123 publications

References 30 publications

Lattice-Based Revocable Certificateless Signature

Lattice-Based Revocable Certificateless Signature

Self-Generated-Certificate Public Key Encryption Without Pairing

New Efficient Certificateless Signature Scheme

Contact Info

Product

Resources

About