A new certificateless signature scheme under enhanced security models

Security and Communication Networks

Volumn 8, Issue 5, 2015, Pages 801-810

  Kim, Kee Sung ^a   Jeong, Ik Rae ^a  

^a Korea University   (South Korea)

Author keywords

Certificateless signature; Lattice; Malicious but passive KGC attack; Random oracle

Indexed keywords

AUTHENTICATION;

CERTIFICATELESS SIGNATURE; CERTIFICATELESS SIGNATURE SCHEMES; IDENTITY BASED SIGNATURE; KEY GENERATION CENTERS; LATTICE; LATTICE PROBLEMS; MALICIOUS-BUT-PASSIVE KGC ATTACK; RANDOM ORACLE;

NETWORK SECURITY;

EID: 84922998373     PISSN: 19390114     EISSN: 19390122     Source Type: Journal    
DOI: 10.1002/sec.1036     Document Type: Article

References (23)

1. Shamir A. Identity-based cryptosystems and signature schemes. In Advances in Cryptology, vol. 196 of Lecture Notes in Computer Science, 1984; 47-53.
2. Al-Riyami SS, Paterson KG. Certificateless public key cryptography, Proceedings of ASIACRYPT'03, Taipei, Taiwan, 2003; 452-473.
3. Au MH, Chen J, Liu JK, Mu Y, Wong DS, Yang G. Malicious KGC attacks in certificateless cryptography, In ACM ASIACCS'07, Singapore, 2007; 302-311.
4. Huang X, Susilo W, Mu Y, Zhang F. On the security of certificateless signature schemes from Asiacrypt 2003, In Proceedings of CANS 2005, Xiamen, China, 2005; 13-25.
5. Yum DH, Lee PJ. Generic construction of certificateless signature, In Proceedings of ACISP 2004, Sydney, Australia, 2004; 200-211.
6. Hu BC, Wong DS, Zhang Z, Deng X. Key replacement attack against a generic construction of certificateless signature, In Proceedings of ACISP 2006, Melbourne, Australia, 2006; 235-246.
7. Hu BC, Wong DS, Zhang Z, Deng X. Certificateless signature: a new security model and an improved generic construction. Designs, Codes and Cryptography 2007; 42(2): 109-126.
8. Huang X, Mu Y, Susilo W, Wong DS, Wu W. Certificateless signature revisited, In Proceedings of ACISP 2007, Townsville, Australia, 2007; 308-322.
9. Liu JK, Au MH, Susilo W. Self-generated-certificate public key cryptography and certificateless signature/encryption scheme in the standard model, In ACM ASIACCS'07, Singapore, 2007; 273-283.
10. Alexander W. Dent, a survey of certificateless encryption schemes and security models. International Journal of Information Security 2008; 7(5): 349-377.
11. Tso R, Huang X, Susilo W. Strongly secure certificateless short signatures. Journal of Systems and Software 2012; 85(6): 1409-1417.
12. Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing 1997; 26: 1484-1509.
13. Peikert C. Public-key cryptosystems from the worst-case shortest vector problem, In STOC'09, Maryland, US, 2009; 333-342.
14. Regev O. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM 2009; 56(6): 34.1-34.40.
15. Agrawal S, Boneh D, Boyen X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE, In Advanced in Cryptology - CRYPTO 2010, Santa Barbara, CA, USA, 2010; 98-115.
16. Agrawal S, Boneh D, Boyen X. Efficient lattice (H)IBE in the standard model, In Advanced in Cryptology - EUROCRYPT 2010, French Riviera, 2010; 553-572.
17. Cash D, Hofheinz D, Kiltz E, Peikert C. Bonsai trees, or how to delegate a lattice basis, In Proceedings of Eurocrypt 2010, French Riviera, 2010; 523-552.
18. Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions, In STOC, Victoria, BC, Canada, 2008; 197-206.
19. Rückert M. Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles, In PQCrypto'10, Darmstadt, Germany, 2010; 182-200.
20. Micciancio D, Regev O. Worst-case to average-case reductions based on Gaussian measures. In SIAM Journal on Computing (SICOMP) 2007; 37(1): 267-302.
21. Ajtai M. Generating hard instance of lattice problems, In STOC, Philadelphia, Pennsylvania, USA, 1996; 99-108.
22. Alwen J, Peikert C. Generating shorter bases for hard random lattices, In STACS, Freiburg, Germany, 2009; 75-86.
23. Micciancio D, Goldwasser S. Complexity of lattice problems: a cryptographic perspective, Vol.671. Kluwer Academic Publishers: Boston, Massachusetts, March 2002.