CryptoDB
An Efficient Identity-based Ring Signcryption Scheme
Authors: | |
---|---|
Download: | |
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). |
BibTeX
@misc{eprint-2008-17931, title={An Efficient Identity-based Ring Signcryption Scheme}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / Identity-based cryptography, ring signcryption, bilinear pairing}, url={http://eprint.iacr.org/2008/254}, note={ chao0121@126.com 14034 received 3 Jun 2008}, author={FengjiaoWANG and Yuqing ZHANG and Zhenchao ZHU}, year=2008 }