Multiple-time signature schemes against adaptive chosen message attacks

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

Volumn 3006, Issue , 2004, Pages 88-100

  Pieprzyk, Josef ^a   Wang, Huaxiong ^a   Xing, Chaoping ^b,c  

^a MACQUARIE UNIVERSITY   (Australia)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

CHOSEN MESSAGE ATTACKS; COVER-FREE FAMILY; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROBLEMS; DIGITAL SIGNATURE SCHEMES; FORWARD-SECURE SIGNATURES; ONE-WAY FUNCTIONS; SIGNATURE SCHEME;

AUTHENTICATION;

EID: 34548472878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24654-1_7     Document Type: Article

References (30)

1. M. Abdalla and L. Reyzin. A new forward-secure digital signature scheme, Advances in Cryptology - Asiacrypt'00, LNCS, 1976(2000), 116-129.
2. J.N.E. Bos and D. Chaum. Provably unforgeable signature, Advances in Cryptology - Crypto'92, LNCS, 740(1993), 1-14.
3. M. Bellare and S. Micali. How to sign given any trapdoor function. Journal of Cryptology, 39(1992), 214-233.
4. M. Bellare and S. Miner. A forward-secure digital signature scheme, Advances in Cryptology - Crypto'99, LNCS, 1666(1999), 431-448.
5. M. Ballare and S.G. Neven. Transitive signatures based on factoring and RSA, Advances in Cryptology - Asiacrypt'02, LNCS, 2501(2002), 397-314.
6. D. Bleichenbacher and U. Maurer. Directed acyclic graphs, one-way functions and digital signatures, Advances in Cryptology - Crypto'94, LNCS, 839(1994), 75-82.
7. D. Bleichenbacher and U. Maurer. On the efficiency of one-time digital signatures, Advances in Cryptology - Asiacrypt'96, LNCS, 1163(1996, 145-158.
8. D. Bleichenbacher and U. Maurer. Optimal tree-based one-time digital signature schemes, STACS'96, LNCS, 1046(1996), 363-374.
9. D. Coppersmith and M. Jakobsson. Almost optimal hash sequence traversal, Financial Cryptography (FC'02), LNCS, 2002, to appear.
10. C. Dwork and M. Naor. An efficient existentially unforgeable signature scheme and its applications, Advances in Cryptology - Crypto'94, LNCS, 839(1994), 234-246.
11. P. Erdös, P. Frankl, and Z. Furedi, Families of finite sets in which no set is covered by the union of r others, Israel Journal of Mathematics, 51(1985), 79-89.
12. S. Even, O. Goldreich and S. Micali. On-line/off-line digital signatures, Journal of Cryptology, 9(1996), 35-67.
13. S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal on Computing, 17(1988), 281-308.
14. A. Hevia and D. Micciancio. The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. Advances in Cryptology - Asiacrypt'02, LNCS, 2501(2002), 379-396.
15. Y.-C Hu, A. Perrig and D.B. Johnson. Packet Leashes: A defense against wormhole attacks in wireless Ad Hoc Networks, Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), 2003, to appear.
16. M. Jakobsson. Fractal hash sequence representation and traversal, Proceedings of the IEEE International Symposium on Information Theory (ISIT02), 2002, 437-444.
17. R. Kumar, S. Rajagopalan and A. Sahai, Coding constructions for blacklist in problems without computational assumptions, Advances in Cryptology - CRYPTO '99, LNCS, 1666(1999), 609-623.
18. L. Lamport. Constructing digital signatures from a one way function, Technical Report CSL-98, SRI International, 1979.
19. L. Lamport. Password authentication with insecure communication, Communication of the ACM, 24(11), 1981, 770-772.
20. R.C. Merkle. A digital signature based on a conventional function, Advances in Cryptology - Crypto'87, LNCS, 293(1987), 369-378.
21. R.C. Merkle. A certified digital signature. Advances in Cryptology - Crypto'87, LNCS, 435(1990), 218-238.
22. H. Niederreiter and C.P. Xing, Rational Points on Curves over Finite Fields: Theory and Applications, Cambridge University Press, LMS 285, 2001.
23. A. Perrig. The BiBa one-time signature and broadcast authentication. Eighth ACM Conference on Computer and Communication Security, ACM, 2001, 28-37.
24. M.O. Rabin. Digitalized signatures, Foundations of Secure Communication, Academic Press, 1978, 155-168.
25. L. Reyzin and N Reyzin. Better than BiBa: Short one -time signatures with fast signing and verifying. Information Security and Privacy (ACISP02), LNCS 2384, 144-153.
26. R. Rivest and A. Shamir. PayWord and MicroMint: two simple micro payment schemes, Tech. Rep., MIT Lab. for Computer Science, 1996.
27. P. Rohatgi. A compact and fast hybrid signature scheme for multicast packet authentication, 6th ACM conference on Computer and Communication Security, 1999, 93-100.
28. H. Stichtenoth. Algebraic function fields and codes, Berlin: Springer 1993.
29. D.R. Stinson. Cryptography: theory and practice, CRC Press, 1995.
30. D.R. Stinson, R. Wei and L. Zhu. Some new bounds for cover-free families, Journal of Combinatorial Theory, A, 90(2000), 224-234.