.png){kind=icon}
Return
An efficient and provable secure identity-based ring signcryption scheme
.png){kind=icon}
PRE
AI
DOI：10.1016/j.csi.2008.09.023.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
ID-based ring signcryption schemes (IDRSC) are usually derived from bilinear parings, a powerful but computationally expensive primitive. The number of paring computations of all existing ID-based ring signcryption schemes from bilinear pairings grows linearly with group size, which makes the efficiency of ID-based schemes over traditional schemes questionable. This paper presents a new identity-based ring signcryption scheme. which only takes four pairing operations for any group size and the scheme is proven to be indistinguishable against adaptive chosen ciphertext ring attacks (IND-IDRSC-CCA2) and existentially unforgeable against adaptive chosen message and identity attacks (EUF-IDRSC-ACMA) under the random oracle model. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Identity-based cryptography
Ring signcryption
Bilinear pairing
Journal
C
IF:
3.1
Papers:
2.3K
Citations:
2.0K
.png){kind=icon}
