An efficient and provable secure identity-based ring signcryption scheme

  • Authors:
  • ZhenChao Zhu;Yuqing Zhang;Fengjiao Wang

  • Affiliations:
  • Key Lab of Computer Networks and Information Security of Ministry of Education, Xidian University, Xi'an 710071, P.R. China and National Computer Network Intrusion Protection Center, GUCAS, Beijin ...;National Computer Network Intrusion Protection Center, GUCAS, Beijing 100049, P.R. China;National Computer Network Intrusion Protection Center, GUCAS, Beijing 100049, P.R. China

  • Venue:
  • Computer Standards & Interfaces
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.