Secure Certi¯cateless Encryption with ShortCiphertext

SUN Yinxia and ZHANG Futai

Article Contents

Article Navigation > Chinese Journal of Electronics > 2010 > 19(2): 313-318

SUN Yinxia and ZHANG Futai, “Secure Certi¯cateless Encryption with ShortCiphertext,” Chinese Journal of Electronics, vol. 19, no. 2, pp. 313-318, 2010,

Citation:

SUN Yinxia and ZHANG Futai, “Secure Certi¯cateless Encryption with ShortCiphertext,” Chinese Journal of Electronics, vol. 19, no. 2, pp. 313-318, 2010,

SUN Yinxia and ZHANG Futai, “Secure Certi¯cateless Encryption with ShortCiphertext,” Chinese Journal of Electronics, vol. 19, no. 2, pp. 313-318, 2010,

Citation:

SUN Yinxia and ZHANG Futai, “Secure Certi¯cateless Encryption with ShortCiphertext,” Chinese Journal of Electronics, vol. 19, no. 2, pp. 313-318, 2010,

PDF( 311 KB)

Secure Certi¯cateless Encryption with ShortCiphertext

SUN Yinxia and ZHANG Futai

Received Date: 1900-01-01
Rev Recd Date: 1900-01-01
Publish Date: 2010-04-05

Abstract

Abstract

Certi¯cateless public key cryptography was
introduced to solve the key escrow problem in identity
based cryptography while enjoying the most attractive cer-
ti¯cateless property. In this paper, we present a secure
Certi¯cateless encryption (CLE) scheme with short cipher-
text. The ciphertext length is at least jmj-bit (the length
of a plaintext) shorter than the existing CLE schemes
while retaining similar e±ciency of computation. The new
scheme is provably secure against adaptive chosen cipher-
text attacks in the random oracle model.
- Certi¯cateless encryption,
- Short cipher-text,
- Bilinear pairing,
- Random oracle,
- Gap-BDH problem,
- Twinning technique.