File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Fast and proven secure blind identity-based signcryption from pairings
Title | Fast and proven secure blind identity-based signcryption from pairings |
---|---|
Authors | |
Issue Date | 2005 |
Citation | Lecture Notes in Computer Science, 2005, v. 3376, p. 305-322 How to Cite? |
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. © Springer-Verlag Berlin Heidelberg 2005. |
Persistent Identifier | http://hdl.handle.net/10722/260244 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yuen, Tsz Hon | - |
dc.contributor.author | Wei, Victor K. | - |
dc.date.accessioned | 2018-09-12T02:00:53Z | - |
dc.date.available | 2018-09-12T02:00:53Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Lecture Notes in Computer Science, 2005, v. 3376, p. 305-322 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/260244 | - |
dc.description.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. © Springer-Verlag Berlin Heidelberg 2005. | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science | - |
dc.title | Fast and proven secure blind identity-based signcryption from pairings | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-24144434019 | - |
dc.identifier.volume | 3376 | - |
dc.identifier.spage | 305 | - |
dc.identifier.epage | 322 | - |
dc.identifier.issnl | 0302-9743 | - |