Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
454977 | Computer Standards & Interfaces | 2009 | 6 Pages |
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 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
ZhenChao Zhu, Yuqing Zhang, Fengjiao Wang,