Fast and Proven Secure Blind Identity-Based Signcryption from Pairings

摘要

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 plm-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.