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

  • Authors:
  • Chung Ki Li;Guomin Yang;Duncan S. Wong;Xiaotie Deng;Sherman S. M. Chow

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

  • Venue:
  • Journal of Computer Security - The 2007 European PKI Workshop: Theory and Practice (EuroPKI'07)
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.