An Efficient Identity-Based Signcryption Scheme for Multiple Receivers

  • Authors:
  • S. Sharmila Deva Selvi;S. Sree Vivek;Rahul Srinivasan;Chandrasekaran 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;Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Mumbai, India;Theoretical Computer Science Laboratory Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India

  • Venue:
  • IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper puts forward a new efficient construction for Multi-Receiver Signcryption in the Identity-based setting. We consider a scenario where a user wants to securely send a message to a dynamically changing subset of the receivers in such a way that non-members of this subset cannot learn the message. One obvious solution is to signcrypt the message to each member of the subset and transmit it to each of them individually. This requires a very long transmission (the number of receivers times the length of the message) and high computation cost. Another simple solution is to provide a key for every possible subset of receivers. This requires every user to store a huge number of keys. In this case, the storage efficiency is compromised. The goal of this paper is to provide a solution which is efficient in all three measures i.e. transmission length, storage of keys and computation at both ends. We propose a new scheme that achieves both confidentiality and authenticity simultaneously in this setting and is the most efficient scheme to date, in the parameters described above. It breaks the barrier of ciphertext length of linear order in the number of receivers, and achieves constant sized ciphertext, independent of the size of the receiver set. This is the first Multi-receiver Signcryption scheme to do so. We support the scheme with security proofs in the random oracle model under precisely defined security model.