Fast and proven secure blind identity-based signcryption from pairings

  • Authors:
  • Tsz Hon Yuen;Victor K. Wei

  • Affiliations:
  • Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong

  • Venue:
  • CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present the first blind identity-based signcryption(BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability (p1m-uf). We present an efficient construction from pairings, then prove a security theorem that reduces its p1m-uf to Schnorr's ROS Problem in the random oracle model plus the generic group and pairing model. The latter model is an extension of the generic group model to add support for pairings, which we introduce in this paper. In the process, we also introduce a new security model for (non-blind) identity-based signcryption (IBSC) which is a strengthening of Boyen's. We construct the first IBSC scheme proven secure in the strengthened model which is also the fastest IBSC in this model or Boyen's model. The shortcomings of several existing IBSC schemes in the strengthened model are shown.