Constructing Practical Signcryption KEM from Standard Assumptions without Random Oracles
- 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
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.
KeywordsSigncryption KEM Standard Model Standard Assumption
Unable to display preview. Download preview PDF.