Efficient “on the fly” signature schemes based on integer factoring

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

Volumn 2247, Issue , 2001, Pages 275-286

  Okamoto, Takeshi ^a   Tada, Mitsuru ^a   Miyaji, Atsuko ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION;

COMMUNICATION LOAD; COMPUTATIONAL COSTS; COMPUTATIONAL WORK; ON THE FLIES; PRE-COMPUTATION; SECRET KEY; SIGNATURE GENERATION; SIGNATURE SCHEME;

CRYPTOGRAPHY;

EID: 84974726301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45311-3_26     Document Type: Conference Paper

References (26)

1. M. Bellare and P. Rogaway: "Random oracles are practical: a paradigm for designing efficient protocols", Proceedings of the 1st ACM Conference on Computer and Communications Security (CCS), 1993.
2. I. Damgård: "Collision free hash functions and public key signature schemes", Advances in cryptology - Eurocrypt’87, Lecture Notes in Computer Science 304, Springer-Verlag, pp.203-216, 1988.
3. T. ElGamal: "A public-key cryptosystem and a signature scheme based on discrete logarithms", IEEE transactions of information theory, vol.IT-31, no.4, pp.469-472, 1985.
4. U. Feige, A. Fiat and A. Shamir: "Zero-knowledge proofs of identity", Journal of cryptology, vol.1, pp.77-95, 1988.
5. A. Fujisaki, S. Miyaguchi and T. Okamoto: "ESIGN: an efficient digital signature implementation for smart cards", Advances in cryptology - Eurocrypt’91, Lecture Notes in Computer Science 547, Springer-Verlag, pp.446-457, 1992.
6. M. Girault: "An identity-based identification scheme based on discrete logarithms modulo a composite number", Advances in cryptology - Eurocrypt’90, Lecture Notes in Computer Science 473, Springer-Verlag, pp.481-486, 1991.
7. M. Girault: "Self-certified public keys", Advances in cryptology - Eurocrypt’91, Lecture Notes in Computer Science 547, Springer-Verlag, pp.490-497, 1992.
8. D. E. Knuth: "Seminumerical Algorithms", The art of computer programming, vol.2, Second edition, Addison-Wesley, 1981.
9. D. E. Knuth: "Sorting and Searching", The art of computer programming, vol.3, Second edition, Addison-Wesley, 1998.
10. A. K. Lenstra, H. W. Lenstra Jr., M. S. Manasse and J. M. Pollard: "The number field sieve", Proceedings of ACM Annual Symposium on Theory of Computing, pp.564-572, 1990.
11. H. W. Lenstra Jr.: "Factoring integers with elliptic curves", Annuals of Mathematics, vol.126, pp.649-673, 1987.
12. D. Naccache, D. M’raihi, S. Vaudenay and D. Raphaeli: "Can DSA be improved ?", Advances in cryptology - Eurocrypt’94, Lecture Notes in Computer Science 950, 1995.
13. National Institute of Standards and Technology (NIST): "Digital signature standards (DSS)", Federal Information Processing Standards, 1991.
14. National Institute of Standards and Technology (NIST): "Secure hash standards (SHS)", Federal Information Processing Standards, 1995.
15. T. Okamoto, M. Tada and A. Miyaji: "Proposal of Efficient Signature Schemes Based on Factoring" (in Japanese), Transactions of Information Processing Society of Japan, vol. 42, no. 8, pp.2123-2133, 2001.
16. D. Pointcheval: "The Composite Discrete Logarithm and Secure Authentication", Advances in cryptology - PKC’00, Lecture Notes in Computer Science 1751, 2000.
17. J. Pollard: "Monte Carlo methods for index computation mod p", Mathematics of Computation, vol 32, pp.918-924, 1978.
18. D. Pointcheval and J. Stern: "Security proofs for signature schemes", Advances in cryptology - Eurocrypt’96, Lecture Notes in Computer Science 1070, 1996.
19. D. Pointcheval and J. Stern: "Security arguments for digital signatures and blind signatures", Journal of cryptology, vol.13, no.3, Springer-Verlag, pp.361-396, 2000.
20. G. Poupard and J. Stern: "Security analysis of a practical ‘on the fly’ authentication and signature generation", Advances in cryptology - Eurocrypt’98, Lecture Notes in Computer Science 1403, Springer-Verlag, pp.422-436, 1998.
21. G. Poupard and J. Stern: "On the fly signatures based on factoring", Proceedings of the 6th ACM Conference on Computer and Communications Security (CCS), pp.48-57, 1999.
22. R. L. Rivest: "The MD5 message-digest algorithm", Internet Request for Comments, RFC 1321, 1992.
23. R. L. Rivest, A. Shamir and L. M. Adleman: "A method for obtaining digital signatures and public-key cryptosystems", Communications of the ACM, vol.21, no.2, pp.120-126, 1978.
24. C. P. Schnorr: "Efficient signature generation by smart cards", Journal of cryptology, vol.4, Springer-Verlag, pp.161-174, 1991.
25. R. D. Silverman: "A cost-based security analysis of symmetric and asymmetric key length", RSA Laboratories, CryptoBytes, Bulletins, no.13, 1999. Available from: http://www.rsasecurity.com/rsalabs/bulletins/bulletin13.html.
26. R. Steinfeid and Y. Zheng: "A Signencryption Scheme Based on Integer Factorization", Advances in cryptology - ISW’00, Lecture Notes in Computer Science 1975, 2000.