Efficient and provably-secure identity-based signatures and signcryption from bilinear maps

Barreto, PSLM;Quisquater, Jean-Jacques;Libert, Benoît;McCullagh, N
(2005) 11th International Conference on the Theory and Application of Cryptology and Information Security — Location: Chennai(India) (4.December.2005)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 335.69 KB
Request a copy

Details

Authors
Abstract
In this paper we describe a new identity-based signcryption (IBSC) scheme built upon bilinear maps. This scheme turns out to be more efficient than all others proposed so far. We prove its security in a formal model under recently studied computational assumptions and in the random oracle model. As a result of independent interest, we propose a new provably secure identity-based signature (IBS) scheme that is also faster than all known pairing-based IBS methods.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Barreto, P., Quisquater, J.-J., Libert, B., & McCullagh, N. (2005). Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. Lecture Notes in Computer Science, 3788, 515-532. https://doi.org/10.1007/11593447_28 (Original work published 2005)