Efficient one-time proxy signatures

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

Volumn 2894, Issue , 2003, Pages 507-522

  Wang, Huaxiong ^a   Pieprzyk, Josef ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; COMPUTATION THEORY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

COMBINATORIAL OBJECTS; COMPUTATION EFFICIENCY; OBLIVIOUS TRANSFER PROTOCOLS; ONE-TIME SIGNATURE; ONE-WAY FUNCTIONS; PROXY SIGNATURE SCHEME; SECURITY PROPERTIES; TRUSTED AUTHORITIES;

CRYPTOGRAPHY;

EID: 0345490608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40061-5_32     Document Type: Article

References (33)

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. D. Bleichenbacher and U. Maurer. Directed acyclic graphs, one-way functions and digital signatures, Advances in Cryptology - Crypto'94, LNCS, 839(1994), 75-82.
5. D. Bleichenbacher and U. Maurer. On the efficiency of one-time digital signatures, Advances in Cryptology - Asiacrypt'96, LNCS, 1163(1996), 145-158.
6. D. Bleichenbacher and U. Maurer. Optimal tree-based one-time digital signature schemes, STACS'96, LNCS, 1046(1996), 363-374.
7. C. Dwork and M. Naor. An efficient existentially unforgeable signature scheme and its applications, Advances in Cryptology - Crypto'94, LNCS, 839(1994), 234-246.
8. G. Di Crescenzo, T. Malkin and R. Ostrovsky. Single database private information retrieval implies oblivious transfer, Advances in Cryptology - Eurocrypt'00, LNCS, 2000, 122-138.
9. S. Even, O. Goldreich and S. Micali. On-line/off-line digital signatures, Journal of Cryptology, 9(1996), 35-67.
10. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory. 31(1985), 469-472.
11. 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.
12. 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.
13. T. P. Pedersen and B. Pfitzmann. Fail-stop signatures. SIAM Journal on Computing, 26/2(1997), 291-330.
14. Y.-C Hu, A. Perrig and D.B. Johnson. Packet Leashes: A defense against wormhole attacks in wireless Ad Hoc Networks. Proceedings of the Send Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), 2003, to appear.
15. H. Kim, J. Baek, B. Lee and K. Kim. Secret Computation with secrets for mobile agent using one-time proxy signature. The 2001 Symposium on Cryptography and Information Security, Oiso, Japan.
16. L. Lamport. Constructing digital signatures from a one way function. Technical Report CSL-98, SRI International, 1979.
17. L. Lamport. Password authentication with insecure communication. Communication of the ACM, 24(11), 1981, 770-772.
18. B. Lee, H. Kim and K. Kim. Strong proxy signature and its applications. The 2001 Symposium on Cryptography and Information Security, Oiso, Japan.
19. M. Mambo, K. Usuda and E. Okamoto. Proxy signatures: Delegation of the power to sign messages. IEICE Trans. Fundamentals, Vol. E79-A (1996), 1338-1353.
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. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. Proceedings of the 31st ACM Symposium on Theory of Computing, 1999, 245-254
23. M. Naor and B. Pinkas. Efficient oblivious transfer protocols. SODA01, 2001.
24. H. Niederreiter and C. P. Xing, Rational Points on Curves over Finite Fields: Theory and Applications, Cambridge University Press, LMS 285, 2001.
25. A. Perrig. The BiBa one-time signature and broadcast authentication. Eighth ACM Conference on Computer and Communication Security, ACM, 2001, 28-37.
26. J. Pieprzyk, H. Wang and C. Xing. Multiple-time signature schemes secure against adaptive chosen message attacks, the 10th annual workshop on Selected Areas in Cryptography (SAC03), LNCS, to appear.
27. M.O. Rabin. Digitalized signatures. Foundations of Secure Communication, Academic Press, 1978, 155-168.
28. M.O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard University, 1981.
29. R.L. Rivest, A. Shamir and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21(1978), 120-12.
30. L. Reyzin and N. Reyzin. Better than BiBa: Short one -time signatures with fast signing and verifying. Information Security and Privacy (ACISP02), LNCS, 2384(2002), 144-153.
31. R. Rivest and A. Shamir. PayWord and MicroMint: two simple micro payment schemes. Tech. Rep., MIT Lab. for Computer Science, 1996.
32. P. Rohatgi. A compact and fast hybrid signature scheme for multicast packet authentication. 6th ACM conference on Computer and Communication Security, 1999, 93-100.
33. W-G Tzeng. Efficient 1-out-n Oblivious Transfer Schemes. PKC'02, LNCS, 159-171.