Identity based online/offline encryption and signcryption schemes revisited

  • Authors:
  • S. Sharmila Deva Selvi;S. Sree Vivek;C. Pandu Rangan

  • Affiliations:
  • Theoretical Computer Science Laboratory, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;Theoretical Computer Science Laboratory, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;Indian Statistical Institute and Theoretical Computer Science Laboratory, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India

  • Venue:
  • InfoSecHiComNet'11 Proceedings of the First international conference on Security aspects in information technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consider the situation where a low power device with limited computational power has to perform cryptographic operation in order to do secure communication to the base station where the computational power is not limited. The most obvious way is to split each and every cryptographic operations into resource consuming, heavy operations and the fast light weight operations. This concept can be efficiently implemented through online/offline cryptography. In this paper, we show the security weakness of an identity based online offline encryption scheme proposed in ACNS 09 by Liu et al. [9]. The scheme in [9] is the first identity based online offline encryption scheme in the random oracle model, in which the message and recipient are not known during the offline phase. We have shown that this scheme is not CCA secure. We have also proposed a new identity based online offline encryption scheme in which the message and receiver are not known during the offline phase and is efficient than the scheme in [9]. Online/Offline signcryption is a cryptographic primitive where the signcryption process is divided into two phases - online and offline phase. To the best of our knowledge there exists three online/offline signcryption schemes in the literature: we propose various attacks on two of the existing schemes. Then, we present an efficient and provably secure identity based online/offline signcryption scheme. We formally prove the security of the new scheme in the random oracle model.