Constructing practical signcryption KEM from standard assumptions without random oracles

  • Authors:
  • Xiangxue Li;Haifeng Qian;Yu Yu;Yuan Zhou;Jian Weng

  • Affiliations:
  • Department of Computer Science and Technology, East China Normal University, China,State Key Laboratory of Integrated Services Networks, Xidian University, China;Department of Computer Science and Technology, East China Normal University, China;Institute for Interdisciplinary Information Sciences, Tsinghua University, China;Network Emergency Response Technical Team, Coordination Center, China;Department of Computer Science, Jinan University, China

  • Venue:
  • ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a direct construction for signcryption Key Encapsulation Mechanism (KEM) without random oracles under standard complexity assumptions. Chosen-ciphertext security is proven in the standard model under the DBDH assumption, and unforgeability is proven in the standard model under the CDH assumption. The proof technique allows us to achieve strong unforgeability from the weakly unforgeable Waters signature. The validity of the ciphertext of our signcryption KEM can be verified publicly, without knowledge of the decryption key.