Another countermeasure to forgeries over message recovery signature

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E80-A, Issue 11, 1997, Pages 2192-2200

  Miyaji, Atsuko ^a  

^a PANASONIC CORPORATION   (Japan)

Author keywords

Discrete logarithms; Forgery; Message recovery signature

Indexed keywords

NETWORK PROTOCOLS; SECURITY OF DATA;

MESSAGE RECOVERY SIGNATURE; NYBERG RUEPPEL'S SIGNATURE;

CRYPTOGRAPHY;

EID: 0031275993     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. W. Diffie and M. Hellman, New directions in cryptography, IEEE Trans. Inf. Theory, vol.IT-22, pp.644-654, 1976.
2. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inf. Theory, vol.IT-31, pp.469-472, 1985.
3. C.G. Günther, An identity-based key-exchange protocol, Advances in Cryptology-Proceedings of Eurocrypt'89, Lecture Notes in Computer Science, vol.434, pp.29-37, Springer-Verlag, 1990.
4. P. Horster, M. Michels, and H. Petersen, Meta-Message Recovery and Meta-Blind signature schemes based on the discrete logarithm problem and their applications, Advances in Cryptology-Proceedings of Asiacrypt'94, Lecture Notes in Computer Science, vol.917, pp.224-237, Springer-Verlag, 1995.
5. L. Harn and Y. Xu, Design of generalized ElGamal type digital signature schemes based on discrete logarithm, Electronics letters, vol.30, no.24, p.2025, 1994.
6. ISO/IEC, 9796, Information technology-Security techniques- Digital signature scheme giving message recovery.
7. N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, pp.203-209, 1987.
8. V.S. Miller, Use of elliptic curves in cryptography, Advances in Cryptology-Proceedings of Crypto'85, Lecture Notes in Computer Science, vol.218, pp.417-426, Springer-Verlag, 1986.
9. A. Miyaji, A message recovery signature scheme equivalent to DSA over elliptic curves, Advances in CryptologyProceedings of ASIACRYPT'96, Lecture Notes in Computer Science, vol.1163, pp. 1-14, Springer-Verlag, 1996.
10. A. Menezes, T. Okamoto, and S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, Proc. 22nd Annual ACM Symposium on the Theory of Computing, pp.80-89, 1991.
11. Proposed federal information processing standard for digital signature standard (DSS), Federal Register, vol.56, no.169, pp.42980-42982, 30 Aug. 1991.
12. K. Nyberg and R.A. Rueppel, A new signature scheme based on the DSA giving message recovery, Proc. 1st ACM Conference on Computer and Communications Security, 1993.
13. K. Nyberg and R.A. Rueppel, Message recovery for signature schemes based on the discrete logarithm problem, Advances in Cryptology-Proceedings of Eurocrypt'94, Lecture Notes in Computer Science, vol.950, pp.182-193, Springer-Verlag, 1995.
14. K. Nyberg and R.A. Rueppel, Message recovery for signature schemes based on the discrete logarithm problem, Designs Codes and Cryptography, vol.7, pp.61-81, 1996.
15. R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, no.2, pp.120-126, 1978.
16. C.P. Schnorr, Efficient identification and signatures for smart cards, Advances in cryptology-Proceedings of Crypto'89, Lecture Notes in Computer Science, vol.435, pp.239-252, Springer-Verlag, 1989.