Breaking and building of threshold signcryption schemes

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

  • Affiliations:
  • Theoretical Computer Science Lab, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;Theoretical Computer Science Lab, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;National Institute of Technology Bhopal, Bhopal, India;Theoretical Computer Science Lab, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India

  • Venue:
  • Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption in a single step, at a cost significantly lower than that is required by the traditional signature-then-encrypt approach. Threshold involved with signcryption is used where the sender or receiver side has a group of members. Threshold Signcryption comes into picture when a message to be sent needs the authentication of a particular number of members in an organization, whereas threshold unsigncryption is used where until a given number of members join, a particular message cannot be decrypted. In this paper we show that three of the threshold signcryption schemes reported in the literature, lack confidentiality under the stronger notion of insider security. We also propose an improved scheme and give the formal proof of security in new stronger security model.