On the efficiency of one-time digital signatures

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

Volumn 1163, Issue , 1996, Pages 145-158

  Bleichenbacher, Daniel ^a   Maurer, Ueli ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

Cryptography; Digital signature; Directed acyclic graph; One way function; Partially ordered set

Indexed keywords

AUTHENTICATION; COMPUTATION THEORY; CRYPTOGRAPHY; DIRECTED GRAPHS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY; SET THEORY; TREES (MATHEMATICS);

CRYPTOGRAPHIC FUNCTIONS; DIGITAL SIGNATURE SCHEMES; DIRECTED ACYCLIC GRAPH (DAG); GENERAL GRAPH; HIGHER EFFICIENCY; ONE-WAY FUNCTIONS; PARTIALLY ORDERED SET; TRAPDOOR ONE WAY FUNCTION;

EFFICIENCY;

EID: 84955557264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0034843     Document Type: Conference Paper

References (14)

1. D. Bleichenbacher and U. M. Maurer, Directed acyclic graphs, one-way functions and digital signatures, Advances in Cryptology-CRYPTO '94, Y. Desmedt (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 839, pp. 75-82, 1994.
2. D. Bleichenbacher and U. M. Maurer, Optimal tree-based one-time digital signature schemes, Proc. 13th Symp. on Theoretical Aspects of Computer Science (STACS'96), C. Puech and R. Reischuk (eds.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1046, pp. 363-374, 1996.
3. J. N. E. Bos and D. Chaum, Provably unforgeable signatures, Advances in Cryptology-CRYPTO '92, E. Brickell (ed.), Lecture Notes in Computer Science, Berlin: Springer Verlag, vol. 740, pp. 1-14, 1993.
4. N. de Brujin, C. A. van Ebbenhorst Tengebergen, and D. R. Kruyswijk, "On the set of divisors of a number," Nieuw Arch. Wish, vol. 23, pp. 191-193, 1952.
5. S. Even, O. Goldreich and S. Micali, On-line/off-line digital signatures, Advances in Cryptology-CRYPTO '89, Lecture Notes in Computer Science, G. Brassard (ed.), Berlin: Springer Verlag, vol. 435, pp. 263-275, 1990.
6. N. Ferguson, personal communication, 1994.
7. L. Lamport, Constructing digital signatures from a one-way function, Technical Report SRI Intl. CSL 98, 1979.
8. R. Merkle, A certified digital signature, Advances in Cryptology-CRYPTO '89, Lecture Notes in Computer Science, G. Brassard (ed.), Berlin: Springer Verlag, vol. 435, pp. 218-238, 1990.
9. C. Meyer and S. Matyas, Cryptography-a new dimension in computer data security, John Wiley & Sons, Inc., 1982.
10. M. Naor and M. Yung, Universal one-way hash functions and their cryptographic significance, Proc. 21st ACM Symp. on Theory of Computing (STOC), pp. 33-43, 1989.
11. R. L. 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.
12. J. Rompel, One-way functions are necessary and sufficient for secure signatures, Proc. 22nd ACM Symp. on Theory of Computing (STOC), pp. 387-394, 1990.
13. C. P. Schnorr, Efficient identification and signatures for smart cards, Advances in Cryptology-Crypto '89, Lecture Notes in Computer Science, G. Brassard (ed.), Berlin: Springer-Verlag, vol. 435, pp. 239-252, 1990.
14. S. Vaudenay, One-time identification with low memory, Proc. of EUROCODE '92, Lecture Notes in Computer Science, Springer Verlag. CISM Courses and Lectures, no. 339, International Centre for Mechanical Sciences, P. Camion, P. Charpin and S. Harari (eds.), Berlin: Springer-Verlag, pp. 217-228, 1992.