New signcryption schemes based on KCDSA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2288, Issue , 2002, Pages 305-317

  Yum, Dae Hyun ^a   Lee, Pil Joong ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMIUM COMPOUNDS; SECURITY OF DATA;

COMMUNICATION OVERHEADS; CRYPTOGRAPHIC PRIMITIVES; SIGNATURE SCHEME; SIGNCRYPTION SCHEMES;

CRYPTOGRAPHY;

EID: 84949961454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45861-1_23     Document Type: Conference Paper

References (18)

1. 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.
2. 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.
3. 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.
4. W. Diffie, M.E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, 22, pp. 644-654, 1985.
5. 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.
6. C. Gamage, J. Leiwo, Y. Zheng, “Encrypted message authentication by firewalls,” PKC’99, Springer-Verlag, LNCS 1560, pp. 69-81, 1999.
7. 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.
8. C. H. Lim, P. J. Lee, “A study on the proposed Korean digital signature algorithm,” Asiacrypt’98, LNCS 1514, pp. 175-186, 1998.
9. NIST, “Digital signature standard (DSS),” FIPS PUB 186, U.S. Department of Commerce, 1994.
10. NIST, Digital signature standard, FIPS PUB 186-2, 2000.
11. NIST, Secure hash standard, FIPS PUB 180-1, 1993.
12. K. Nyberg, R. A. Rueppel, “Message recovery for signature schemes based on the discrete logarithm problem,” Eurocrypt’94, LNCS 950, pp. 182-193.
13. D. Pointcheval, J. Stern, “Security proofs for signature schemes,” Eurocrypt’96, Springer-Verlag, LNCS 1070, pp. 387-398, 1996.
14. R. Rivest, M. Hellman, J. Anderson, “Responses to NIST’s proposal,” Comm. ACM, 35(7), pp. 41-52, 1992.
15. D. H. Yum, P. J. Lee, “Security proof for KCDSA under the random oracle model,” CISC’99, pp. 173-180, 1999.
16. Y. Zheng, “Improved public key cryptosystems secure against chosen ciphertext attacks,” Technical Reprt 94-1, University of Wollongong Australia, 1994.
17. 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.
18. 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.