Chapter

Information Security

Volume 3650 of the series Lecture Notes in Computer Science pp 218-232

Analysis and Improvement of a Signcryption Scheme with Key Privacy

  • Guomin YangAffiliated withDepartment of Computer Science, City University of Hong Kong
  • , Duncan S. WongAffiliated withDepartment of Computer Science, City University of Hong Kong
  • , Xiaotie DengAffiliated withDepartment of Computer Science, City University of Hong Kong

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In PKC’04, a signcryption scheme with key privacy was proposed by Libert and Quisquater. Along with the scheme, some security models were defined with regard to the signcryption versions of confidentiality, existential unforgeability and ciphertext anonymity (or key privacy). The security of their scheme was also claimed under these models. In this paper, we show that their scheme cannot achieve the claimed security by demonstrating an insider attack which shows that their scheme is not semantically secure against chosen ciphertext attack (not even secure against chosen plaintext attack) or ciphertext anonymous. We further propose a revised version of their signcryption scheme and show its security under the assumption that the gap Diffie-Hellman problem is hard. Our revised scheme supports parallel processing that can help reduce the computation time of both signcryption and de-signcryption operations.

Keywords

Signcryption Key Privacy Ciphertext Anonymity Bilinear Pairings Gap Diffie-Hellman Groups