Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1996: STACS 96 pp 361–374Cite as

Optimal tree-based one-time digital signature schemes

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1046))

Abstract

A minimal cutset of a tree directed from the leaves to the root is a minimal set of vertices such that every path from a leaf to the root meets at least one of these vertices. An order relation on the set of minmal cutsets can be defined: U≤V if and only if every vertex of U is on the path from some vertex in V to the root. Motivated by the design of efficient cryptographic digital signature schemes, the problem of constructing trees with a large number of pairwise incomparable minimal cutsets or, equivalently, with a large antichain in the poset of minimal cutsets, is considered.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. D. Bleichenbacher and U.M. Maurer, On the efficiency of one-time digital signatures, preprint.

    Google Scholar 

  3. S. Even, O. Goldreich and S. Micali, On-line/off-line digital signatures, Advances in Cryptology — CRYPTO '89, Lecture Notes in Computer Science, vol. 435 (G. Brassard, ed.), Springer Verlag, 1990, pp. 263–275.

    Google Scholar 

  4. L. Lamport, Constructing digital signatures from a one-way function, Technical Report SRI Intl. CSL 98, 1979.

    Google Scholar 

  5. R. Merkle, A certified digital signature, Advances in Cryptology — CRYPTO '89, Lecture Notes in Computer Science, vol. 435 (G. Brassard, ed.), Springer Verlag, 1990, pp. 218–238.

    Google Scholar 

  6. C. Meyer and S. Matyas, Cryptography — a new dimension in computer data security, John Wiley & Sons, Inc., 1982.

    Google Scholar 

  7. 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.

    Article  Google Scholar 

  8. 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.), Springer-Verlag, pp. 217–228.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Theoretical Computer Science, ETH Zürich, CH-8092, Zürich, Switzerland

    Daniel Bleichenbacher & Ueli M. Maurer

Authors
  1. Daniel Bleichenbacher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ueli M. Maurer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Claude Puech Rüdiger Reischuk

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bleichenbacher, D., Maurer, U.M. (1996). Optimal tree-based one-time digital signature schemes. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-60922-9_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60922-3

  • Online ISBN: 978-3-540-49723-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation