Two proxy signcryption schemes from bilinear pairings

  • Authors:
  • Qin Wang;Zhenfu Cao

  • Affiliations:
  • Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China

  • Venue:
  • CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Proxy signcryption is a cryptographic primitive which combines the functionalities of a proxy signature scheme and a signcryption scheme. In this paper, based on bilinear pairings, we would like to propose two efficient proxy singcryption schemes. One is certificate based and the other is identity based. Also we analyze the two proposed schemes from efficiency point of view. We show that the certificate based scheme achieves great efficiency in terms of communication cost and computation overhead. And the identity based scheme is much more efficient than the scheme proposed by Li and Chen. What’s more, we also argument that the two proposed schemes are secure in the random oracle model without a secure channel.