Paper 2008/254
An Efficient Identity-based Ring Signcryption Scheme
Zhenchao ZHU, Yuqing ZHANG, and Fengjiao WANG
Abstract
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 the group size, which makes the efficiency of ID-based schemes over traditional schemes questionable. In this paper, we present 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 secure against an existential forgery for adaptive chosen messages attacks (EF-IDRSC-ACMA).
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Identity-based cryptographyring signcryptionbilinear pairing
- Contact author(s)
- chao0121 @ 126 com
- History
- 2008-06-05: received
- Short URL
- https://ia.cr/2008/254
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/254,
author = {Zhenchao ZHU and Yuqing ZHANG and Fengjiao WANG},
title = {An Efficient Identity-based Ring Signcryption Scheme},
howpublished = {Cryptology ePrint Archive, Paper 2008/254},
year = {2008},
note = {\url{https://eprint.iacr.org/2008/254}},
url = {https://eprint.iacr.org/2008/254}
}
