Abstract
A signcryption scheme is a cryptographic primitive that performs signature and encryption simultaneously, at less cost than is required by the traditional signature-then-encryption approach. We propose new signcryption schemes based on KCDSA. These are the first signcryption schemes that are based on a standardized signature scheme. We expect that these schemes will soon be applied to established KCDSA systems. We also propose a new signcryption scheme for multiple recipients which requires very small communication overhead.
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
F. Bao, R. H. Deng, “A signcryption scheme with signature directly verifiable by public key,” PKC’98, Springer-Verlag, LNCS 1431, pp. 55–59, 1998.
M. Bellare, P. Rogaway, “Random oracles are practical: A paradigm for designing efficient protocols,” Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62–73, 1993.
E. Brickell, D. Pointcheval, S. Vaudenay and M. Yung, “Design Validations for Discrete Logarithm Based Signature Schemes,” Proceedings of PKC 2000, LNCS 1751, pp. 276–292, Springer-Verlag, 2000.
W. Diffie, M.E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, 22, pp. 644–654, 1985.
T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, 31(4), pp. 469–472, 1985.
C. Gamage, J. Leiwo, Y. Zheng, “Encrypted message authentication by firewalls,” PKC’99, Springer-Verlag, LNCS 1560, pp. 69–81, 1999.
P. Horster, M. Michels, H. Petersen, “Meta-ElGamal signature schemes,” Proceedings of the 2nd ACM Conference on Computer and Communications Security, pp. 96–107, 1994.
C. H. Lim, P. J. Lee, “A study on the proposed Korean digital signature algorithm,” Asiacrypt’98, LNCS 1514, pp. 175–186, 1998.
NIST, “Digital signature standard (DSS),” FIPS PUB 186, U.S. Department of Commerce, 1994.
NIST, Digital signature standard, FIPS PUB 186-2, 2000.
NIST, Secure hash standard, FIPS PUB 180-1, 1993.
K. Nyberg, R. A. Rueppel, “Message recovery for signature schemes based on the discrete logarithm problem,” Eurocrypt’94, LNCS 950, pp. 182–193.
D. Pointcheval, J. Stern, “Security proofs for signature schemes,” Eurocrypt’96, Springer-Verlag, LNCS 1070, pp. 387–398, 1996.
R. Rivest, M. Hellman, J. Anderson, “Responses to NIST’s proposal,” Comm. ACM, 35(7), pp. 41–52, 1992.
D. H. Yum, P. J. Lee, “Security proof for KCDSA under the random oracle model,” CISC’99, pp. 173–180, 1999.
Y. Zheng, “Improved public key cryptosystems secure against chosen ciphertext attacks,” Technical Reprt 94-1, University of Wollongong Australia, 1994.
Y. Zheng, “Digital signcryption or how to achieve cost(signature & encryption) 《 cost(signature) + cost(encryption),” Crypto’97, Springer-Verlag, LNCS 1294, pp. 165–179, 1997.
Y. Zheng, “Digital signcryption or how to achieve cost(signature & encryption) 《 cost(signature) + cost(encryption),” full paper, http://www.pscit.monash.edu.au/~yuliang/, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yum, D.H., Lee, P.J. (2002). New Signcryption Schemes Based on KCDSA. In: Kim, K. (eds) Information Security and Cryptology — ICISC 2001. ICISC 2001. Lecture Notes in Computer Science, vol 2288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45861-1_23
Download citation
DOI: https://doi.org/10.1007/3-540-45861-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43319-4
Online ISBN: 978-3-540-45861-6
eBook Packages: Springer Book Archive