Constructing Practical Signcryption KEM from Standard Assumptions without Random Oracles

  • Xiangxue Li
  • Haifeng Qian
  • Yu Yu
  • Yuan Zhou
  • Jian Weng
Conference paper

DOI: 10.1007/978-3-642-38980-1_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7954)
Cite this paper as:
Li X., Qian H., Yu Y., Zhou Y., Weng J. (2013) Constructing Practical Signcryption KEM from Standard Assumptions without Random Oracles. In: Jacobson M., Locasto M., Mohassel P., Safavi-Naini R. (eds) Applied Cryptography and Network Security. ACNS 2013. Lecture Notes in Computer Science, vol 7954. Springer, Berlin, Heidelberg

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.

Keywords

Signcryption KEM Standard Model Standard Assumption 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Xiangxue Li
    • 1
    • 2
  • Haifeng Qian
    • 1
  • Yu Yu
    • 3
  • Yuan Zhou
    • 4
  • Jian Weng
    • 5
  1. 1.Department of Computer Science and TechnologyEast China Normal UniversityChina
  2. 2.State Key Laboratory of Integrated Services NetworksXidian UniversityChina
  3. 3.Institute for Interdisciplinary Information SciencesTsinghua UniversityChina
  4. 4.Network Emergency Response Technical TeamCoordination CenterChina
  5. 5.Department of Computer ScienceJinan UniversityChina

Personalised recommendations