Efficient Revocable Certificateless Encryption Secure in the Standard Model

Shen, Limin; Zhang, Futai; Sun, Yinxia

doi:10.1093/comjnl/bxt040

Cited by 20 publications

(25 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let

{double-struckG}_{1}

and

{double-struckG}_{2}

be two multiplicative cyclic groups of large prime order p . An admissible bilinear map

ê : {double-struckG}_{1} \times {double-struckG}_{1} \to {double-struckG}_{2}

must satisfy three properties, namely bilinearity, non‐degeneracy, and computability .…”

Section: Preliminariesmentioning

confidence: 99%

“…Thus, the CL‐PKS construction solves the key escrow problem and retains the merit of eliminating the required certificates. The research on CL‐PKSs has undergone quite rapidly, and a large number of papers have been presented .…”

Section: Introductionmentioning

confidence: 99%

“…For the revocation mechanism of CL‐PKSs, Tsai and Tseng proposed the first revocable certificateless public key encryption (RCL‐PKE) scheme in the random oracle model, while Shen et al . proposed an RCL‐PKE scheme in the standard model (without random oracles). However, Shen et al .…”

Section: Introductionmentioning

confidence: 99%

“…Immediately, Shen et al . proposed an RCL‐PKE scheme in the standard model (without random oracles). However, Shen et al .…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient revocable certificateless public key encryption with a delegated revocation authority

Tsai

Tseng

Huang

2015

Security Comm Networks

View full text Add to dashboard Cite

Quite recently, Shen et al. proposed a revocable certificateless public key encryption (RCL‐PKE) scheme in the standard model, in which the key generation center (KGC) can efficiently revoke misbehaving or compromised users. However, their scheme was shown to be insecure. Moreover, the work of revoking users is executed only by the KGC, and their scheme requires high computation cost. In this paper, we propose the first secure RCL‐PKE scheme with a delegated revocation authority in the standard model. We emphasize that the delegated revocation authority shares the responsibility for user revocation to reduce the load of the KGC and provide the revocation flexibility. When compared with Shen et al.'s scheme, our scheme has better performance in terms of each user's private key size and computation cost. Under the decisional bilinear Diffie–Hellman and collision‐resistant hash function assumptions, we demonstrate that the proposed RCL‐PKE scheme is semantically secure in the standard model. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

“…Let

{double-struckG}_{1}

and

{double-struckG}_{2}

be two multiplicative cyclic groups of large prime order p . An admissible bilinear map

ê : {double-struckG}_{1} \times {double-struckG}_{1} \to {double-struckG}_{2}

must satisfy three properties, namely bilinearity, non‐degeneracy, and computability .…”

Section: Preliminariesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Immediately, Shen et al . proposed an RCL‐PKE scheme in the standard model (without random oracles). However, Shen et al .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient revocable certificateless public key encryption with a delegated revocation authority

Tsai

Tseng

Huang

2015

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…Tseng and Tsai [10] presented the revocation method using public channel. In addition, two primitives (encryption and signature) in revocable certificateless public-key cryptography (RCL-PKC) were also proposed, such as revocable certificateless public-key encryption (RCL-PKE) schemes [11,12] and revocable certificateless signature (RCLS) scheme [13,14]. Furthermore, Hung et al [15] presented a short RCLS scheme.…”

Section: Introductionmentioning

confidence: 99%

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