Signcryption KEM/tag-KEM, revisited

Abstract

Listen

Translate article

We revisit the problem of basing signcryption SC tag key encapsulation mechanism KEM on standard assumptions and standard model and present direct constructions of SC-KEM/tag-KEM, which satisfy confidentiality and unforgeability with respect to adversarially chosen keys where the adversary is given more advantageous attack environment than existing models in the literature;are based on the standard decisional bilinear Diffie-Hellman and computational Diffie-Hellman assumptions without random oracle;do not use strongly unforgeable signature schemes as building blocks; andprovide comparable performance to existing SC-KEM/tag-KEM schemes.