Signcryption is a public key primitive proposed by Zheng [14] to achieve the combined functionality of digital signature and encryption in an efficient manner. We present a signcryption scheme based on RSA and provide proofs of security in the random oracle model [6] for its privacy and unforgeability. Both proofs are under the assumption that inverting the RSA function is hard. Our scheme has two appealing aspects to it. First of all it produces compact ciphertexts. Secondly it offers non-repudiation in a very straight-forward manner. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Malone-Lee, J., & Mao, W. (2003). Two birds one stone: Signcryption using RSA. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2612, 211–225. https://doi.org/10.1007/3-540-36563-x_14
Mendeley helps you to discover research relevant for your work.