An efficient signcryption scheme with key privacy and its extension to ring signcryption^*

Issue title: The 2007 European PKI Workshop: Theory and Practice (EuroPKI'07)

Article type: Research Article

Authors: Li, Chung Ki^a | Yang, Guomin^a | Wong, Duncan S.^a | Deng, Xiaotie^a | Chow, Sherman S.M.^b

Affiliations: [a] Department of Computer Science, City University of Hong Kong, China. E-mails: travisli@cs.cityu.edu.hk, csyanggm@cs.cityu.edu.hk, duncan@cs.cityu.edu.hk, deng@cs.cityu.edu.hk | [b] Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, NY 10012, USA. E-mail: schow@cs.nyu.edu

Note: [*] A preliminary version appears in the Proc. of the 4th European PKI Workshop – Theory and Practice (EuroPKI 2007). The work was supported by a grant from CityU (Project No. 7002001).

Abstract: In Information Processing Letters (2006), Tan pointed out that the anonymous signcryption scheme proposed by Yang, Wong and Deng (YWD) in ISC 2005 provides neither confidentiality nor anonymity. However, no discussion has been made on how a secure scheme can be made and there is no secure scheme available to date. In this paper, we propose a modification of YWD scheme which resolves the security issues of the original scheme without sacrificing its high efficiency and simple design. Indeed, we show that our scheme achieves confidentiality, existential unforgeability and anonymity with more precise reduction bounds. We also give a variation of our scheme and extend it to a ring signcryption scheme by using the technique due to Boneh, Gentry, Lynn and Shacham.

Keywords: Signcryption, ring signcryption, privacy, anonymity

DOI: 10.3233/JCS-2009-0374

Journal: Journal of Computer Security, vol. 18, no. 3, pp. 451-473, 2010