An efficient and provable secure identity-based ring signcryption scheme

作者：Zhu ZhenChao; Zhang Yuqing^*; Wang Fengjiao

来源：Computer Standards & Interfaces, 2009, 31(6): 1092-1097.

DOI：10.1016/j.csi.2008.09.023

• Identity-based cryptography
• Ring signcryption
• Bilinear pairing

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.

• 出版日期2009-11
• 单位西安电子科技大学; 中国科学院大学