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.
Preview
Unable to display preview. Download preview PDF.
References
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.
D. Bleichenbacher and U.M. Maurer, On the efficiency of one-time digital signatures, preprint.
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.
L. Lamport, Constructing digital signatures from a one-way function, Technical Report SRI Intl. CSL 98, 1979.
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.
C. Meyer and S. Matyas, Cryptography — a new dimension in computer data security, John Wiley & Sons, Inc., 1982.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights 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