On constructing certificateless cryptosystems from identity based encryption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3958 LNCS, Issue , 2006, Pages 474-490

  Libert, Benoît ^a   Quisquater, Jean Jacques ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Bilinear maps; Certificateless encryption; Provable security

Indexed keywords

CODES (SYMBOLS); COMPUTER CRIME; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PROBLEM SOLVING; SECURITY OF DATA; TEXT PROCESSING;

BILINEAR MAPS; CERTIFICATELESS ENCRYPTION; PROVABLE SECURITY; RANDOM ORACLE MODEL;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33745833916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745853_31     Document Type: Conference Paper

References (33)

1. S. S. Al-Riyami. Cryptographic schemes based on elliptic curve pairings. PhD thesis, University of London, 2004.
2. S. S. Al-Riyami and K. Paterson. Certificateless public key cryptography. In Asiacrypt'03, volume 2894 of LNCS, pages 452-473. Springer, 2003.
3. S. S. Al-Riyami and K. Paterson. CBE from CL-PKE: A generic construction and efficient schemes. In PKC'05, volume 3386 of LNCS, pages 398-415. Springer, 2005.
4. J. Baek, R. Safavi-Naini, and W. Susilo. Certificateless public key encryption without pairing. In ISC'05, volume 3650 of LNCS, pages 134-148. Springer, 2005.
5. P. S. L. M. Barreto, B. Lynn, and M. Scott. On the selection of pairing-friendly groups. In SAC'03, volume 3006 of LNCS, pages 17-25. Springer, 2003.
6. P. S. L. M. Barreto and M. Naehrig. Pairing-friendly elliptic curves of prime order. In SAC'05. To Appear.
7. P. S. L. M. Barreto and M. Scott. Compressed pairings. In Crypto'04, volume 3152 of LNCS, pages 140-156. Springer, 2004.
8. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communications Security, pages 62-73, ACM Press, 1993.
9. K. Bentahar, P. Farshim, J. Malone-Lee, and N. P. Smart. Generic construction of identity-based and certificateless KEMs. Cryptology ePrint Archive, Report 2005/058, 2005. http://eprint.iacr.org/2005/058.
10. D. Boneh and X. Boyen. Efficient selective-ID secure identity based encryption without random oracles. In Eurocrypt'04, volume 3027 of LNCS, pages 223-238. Springer, 2004.
11. D. Boneh and X. Boyen. Short signatures without random oracles. In Eurocrypt'04, volume 3027 of LNCS, pages 56-73. Springer, 2004.
12. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In Crypto'01, volume 2139 of LNCS, pages 213-229. Springer, 2001.
13. R. Canetti, S. Halevi, and J. Katz. A forward secure public key encryption scheme. In Eurocrypt'03, volume 2656 of LNCS, pages 254-271. Springer, 2003.
14. L. Chen and Z. Cheng. Security proof of Sakai-Kasahara's identity-based encryption scheme. In IMA Int. Conf. 2005, volume 3796 of LNCS, pages 442-459. Springer, 2005. Also available from http://eprint.iacr.org/2005/226.
15. L. Chen, Z. Cheng, J. Malone-Lee, and N. P. Smart. An efficient ID-KEM based on the Sakai-Kasahara key construction. Cryptology ePrint Archive, Report 2005/224, 2005. http://eprint.iacr.org/2005/224.
16. Z. Cheng and R. Comley. Efficient certificateless public key encryption. Cryptology ePrint Archive, Report 2005/012, 2005. http://eprint.iacr.org/2005/012.
17. A. Dent and C. Kudla. On Proofs of Security for Certificateless Cryptosystems. Cryptology ePrint Archive, Report 2005/348, 2005. http://eprint.iacr.org/2005/348.
18. Y. Dodis and J. Katz. Chosen-ciphertext security of multiple encryption. In TCC'05, volume 3378 of LNCS, pages 188-209. Springer, 2005.
19. E. Fujisaki and T. Okamoto. How to enhance the security of public-key encryption at minimum cost. In PKC'99, volume 1560 of LNCS, pages 53-68. Springer, 1999.
20. E. Fujisaki and T. Okamoto. Secure integration of asymmetric and symmetric encryption schemes. In Crypto'99, volume 1666 of LNCS, pages 537-554. Springer, 1999.
21. T. E. Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Crypto'84, volume 196 of LNCS, pages 10-18. Springer, 1985.
22. C. Gentry. Certificate-based encryption and the certificate revocation problem. In Euror-ypt'03, volume 2656 of LNCS, pages 272-293. Springer, 2003.
23. M. Girault. Self-certified public keys. In Eurocrypt'91, volume 547 of LNCS, pages 490-497. Springer, 1991.
24. G. Kang and S. H. H. J. H. Park. A certificate-based signature scheme. In CTRSA'04, volume 2964 of LNCS, pages 99-111. Springer, 2004.
25. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals, E84-A(5):1234-1243, 2001.
26. R. Sakai and M. Kasahara. ID-based cryptosystems with pairing on elliptic curve. In SCIS'03, Hamamatsu, Japan, 2003. http://eprint.iacr.org/2003/054.
27. A. Shamir. Identity based cryptosystems and signature schemes. In Crypto'84, volume 196 of LNCS, pages 47-53. Springer, 1984.
28. N. P. Smart and F. Vercauteren. On computable isomorphisms in efficient pairing based systems. Cryptology ePrint Archive, Report 2005/116, 2005. http://eprint.iacr.org/2005/116.
29. D. H. Yum and P. J. Lee. Generic construction of certificateless encryption. In ICCSA'04, volume 3043 of LNCS, pages 802-811. Springer, 2004.
30. D. H. Yum and P. J. Lee. Generic construction of certificateless signature. In ACISP'04, volume 3108 of LNCS, pages 200-211. Springer, 2004.
31. D. H. Yum and P. J. Lee. Identity-based cryptography in public key management. In EuroPKI'04, volume 3093 of LNCS, pages 71-84. Springer, 2004.
32. R. Zhang, G. Hanaoka, J. Shikata and H. Imai. On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security? In PKC'04, volume 2947 of LNCS, pages 360-374. Springer, 2004.
33. F. Zhang, R. Safavi-Naini, and W. Susilo. An efficient signature scheme from bilinear pairings and its applications. In PKC'04, volume 2947 of LNCS, pages 277-290. Springer, 2004.