Hash based digital signature schemes

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

Volumn 3796 LNCS, Issue , 2005, Pages 96-115

  Dods, C ^a   Smart, N P ^a   Stam, M ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER APPLICATIONS; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; QUANTUM CRYPTOGRAPHY; SECURITY OF DATA;

DIGITAL SIGNATURE SCHEMES; HASH BASED SIGNATURE SCHEMES; HASH FUNCTIONS; PRACTICAL IMPLEMENTATIONS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33646825997     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11586821_8     Document Type: Conference Paper

References (23)

1. ANSI X9.63. Public Key Cryptography for the Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography. October 1999, Working Draft.
2. G. Brassard, P. Høyer, and A. Tapp. Quantum cryptanalysis of hash and claw-free functions. In C. L. Lucchesi and A. V. Moura, editors, LATIN'98, volume 1380 of Lecture Notes in Computer Science, pages 163-169. Springer-Verlag, 1998.
3. D. Bleichenbacher and U. M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y. Desmedt, editor, Advances in Cryptography-Crypto'94, volume 839 of Lecture Notes in Computer Science, pages 75-82. Springer-Verlag, 1994.
4. D. Bleichenbacher and U. Maurer. Optimal tree-based one-time digital signature schemes. Proc. Symp. Theoretical Aspects of Comp. Sci. - STACS '96, Springer-Verlag LNCS 1046, 363-374, 1996.
5. D. Bleichenbacher and U. Maurer. On the efficiency of one-time digital signature schemes. Advances in Cryptology - ASIACRYPT '96, Springer-Verlag LNCS 1163, 145-158, 1996.
6. J. Buchmann, C. Coronado, M. Döring, D. Engelbert, C. Ludwig, R. Overbeck, A. Schmidt, U. Vollmerand R.-P. Weinmann. Post-quantum signatures. Preprint, 2004.
7. S. Even, O. Goldreich, and S. Micali. On-line/off-line digital signatures. Journal of Cryptology, 9(1):35-67, 1996.
8. J. Håstad and M. Näslund. Practical construction and analysis of pseudorandomness primitives. In C. Boyd, editor, Advances in Cryptography-Asiacrypt'01, volume 2248 of Lecture Notes in Computer Science, pages 442-459. Springer-Verlag, 2001.
9. R. Hauser, M. Steiner, and M. Waidner. Micro-payments based on iKP. Technical report, IBM Research, 1996.
10. A. Hevia and D. Micciancio. The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. In Y. Zheng, editor, Advances in Cryptography-Asiacrypt'02, volume 2501 of Lecture Notes in Computer Science, pages 379-396. Springer-Verlag, 2002.
11. L. Lamport. Constructing digital signatures from a one-way function. SRI International, CSL-98, 1979.
12. L. A. Levin. One-way functions and pseudorandom generators. Combinatorica, 7(4):357-363, 1987.
13. R. J. Lipton and R. Ostrovsky. Micro-payments via efficient coin-flipping. In R. Hirschfeld, editor, FC'98, volume 1465 of Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, 1998.
14. M. Lomas, editor. Security Protocols, volume 1189 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
15. A.J. Menezes and P.C. van Oorschot and S.A. Vanstone. CRC-Handbook of Applied Cryptography, CRC Press, 1996.
16. R. Merkle. A certified digital signature. Advances in Cryptology - CRYPTO '89, Springer-Verlag LNCS 435, 218-238, 1990.
17. M. Mitzenmacher and A. Perrig. Bounds and improvements for BiBa singature schemes. Technical report, Harvard University, Cambridge, Massachusetts, 2002.
18. T. P. Pedersen. Electronic payments of small amount. In Lomas [14], pages 59-68.
19. A. Perrig. The BiBa one-time signature and broadcast authentication protocol. In M. Reiter and P. Samarati, editors, CCS'01, pages 28-37. ACM Press, 2001.
20. L. Reyzin and N. Reyzin. Better than BiBa: Short one-time signatures with fast signing and verifying. In L. M. Batten and J. Seberry, editors, ACISP'02, volume 2384 of Lecture Notes in Computer Science, pages 144-153. Springer-Verlag, 2002.
21. R. L. Rivest and A. Shamir. PayWord and MicroMint: Two simple micropayment schemes. In Lomas [14], pages 69-78.
22. D. R. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? In K. Nyberg, editor, Advances in Cryptography-Eurocrypt'98, volume 1403 of Lecture Notes in Computer Science, pages 334-345. Springer-Verlag, 1998.
23. M. Szydlo. Merkle tree traversal in log space and time. Advances in Cryptology -EUROCRYPT 2004, Springer-Verlag LNCS 3027, 541-554, 2004.