Abstract
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 straightforward manner.
This author’s research is partially funded by the EU Fifth Framework Project IST- 2001-324467 “CASENET”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abdalla, M. Bellare and P. Rogaway. The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES. In Topics in Cryptology-CT-RSA 2001, volume 2020 of Lecture Notes in Computer Science, pages 143–158. Springer-Verlag, 2001. 214
J. H. An and Y. Dodis and T. Rabin. On the Security of Joint Signature and Encryption, In Advances in Cryptology-EUROCRYPT 2002, volume 2332 of Lecture Notes in Computer Science, pages 83–107. Springer-Verlag, 2002. 211
J. Baek, R. Steinfeld and Y. Zheng. Formal Proofs for the Security of Signcryption. In Public Key Cryptography 2002, volume 2274 of Lecture Notes in Computer Science, pages 80–98. Springer-Verlag, 2002. 211, 222
M. Bellare, A. Desai, D. Pointcheval and P. Rogaway. Relations Among Notions of Security for Public-Key Encryption Schemes. In Advances in Cryptology-CRYPTO’ 98, volume 1462 of Lecture Notes in Computer Science, pages 26–45. Springer-Verlag, 1998. 214
M. Bellare and P. Rogaway. Optimal Asymmetric Encryption-How to Encrypt with RSA. In Advances in Cryptology-EUROCRYPT’ 94, volume 950 of Lecture Notes in Computer Science, pages 92–111. Springer-Verlag, 1994. 214
M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In Proceedings of the First ACM Conference on Computer and Communications Security, pages 62–73. 1993. 211
M. Bellare and P. Rogaway. The Exact Security of Digital Signatures-How to sign with RSA and Rabin. In Advances in Cryptology-EUROCRYPT’ 96, volume 1070 of Lecture Notes in Computer Science, pages 399–416. Springer-Verlag, 1996. 212, 224
[8] J.-S. Coron, M. Joye, D. Naccache, and P. Paillier. Universal Padding Schemes for RSA. In Advances in Cryptology-CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 226–241. Springer-Verlag, 2002. 212, 217, 221, 222
[9] J.-S. Coron, M. Joye, D. Naccache, and P. Paillier. Universal Padding Schemes for RSA. Full version from http://eprint.iacr.org/2002/115/. 2002. 221
R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In Advances in Cryptology-CRYPTO’ 98, volume 1462 of Lecture Notes in Computer Science, pages 13–25. Springer-Verlag, 1998. 214
R. Cramer and V. Shoup. Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack. Available at http://eprint.iacr.org/2001/108/, 2001. 214
E. Fujisaki, T. Okamoto, D. Pointcheval and J. Stern. RSA-OAEP Is Secure under the RSA Assumption. In Advances in Cryptology-CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 260–274. Springer-Verlag, 2001. 216, 222
S. Goldwasser, S. Micali and R. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing, 17(2):281–308, 1988. 215
Y. Zheng. Digital Signcryption or How to Achieve Cost(Signature & Encryption) Cost(Signature) + Cost(Encryption). In Advances in Cryptology-CRYPTO’ 97, volume 1294 of Lecture Notes in Computer Science, pages 165–179. Springer-Verlag, 1997. 211
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malone-Lee, J., Mao, W. (2003). Two Birds One Stone: Signcryption Using RSA. In: Joye, M. (eds) Topics in Cryptology — CT-RSA 2003. CT-RSA 2003. Lecture Notes in Computer Science, vol 2612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36563-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-36563-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00847-7
Online ISBN: 978-3-540-36563-1
eBook Packages: Springer Book Archive