Directed Acyclic Graphs, One-way Functions and Digital Signatures (Extended Abstract) (1994)
| Venue: | Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science |
| Citations: | 27 - 3 self |
BibTeX
@INPROCEEDINGS{Bleichenbacher94directedacyclic,
author = {D. Bleichenbacher and Ueli M. Maurer},
title = {Directed Acyclic Graphs, One-way Functions and Digital Signatures (Extended Abstract)},
booktitle = {Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science},
year = {1994},
pages = {75--82},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
) Daniel Bleichenbacher and Ueli M. Maurer Institute for Theoretical Computer Science ETH Zurich CH-8092 Zurich, Switzerland Email addresses: maurer@inf.ethz.ch, bleichen@inf.ethz.ch Abstract. The goals of this paper are to formalize and investigate the general concept of a digital signature scheme, based on a general one-way function without trapdoor, for signing a predetermined number of messages. It generalizes and unifies previous work of Lamport, Winternitz, Merkle, Even et al. and Vaudenay. The structure of the computation yielding a public key from a secret key corresponds to a directed acyclic graph G. A signature scheme for G can be defined as an antichain in the poset of minimal verifyable sets of vertices of G with the naturally defined computability relation as the order relation and where a set is verifyable if and only if the public key can be computed from the set. Several types of graphs are analyzed, results on the number of signatures of these schemes are presented ...
Citations
| 2736 | L.: A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al. - 1978 |
| 1355 | An Introduction to Probability Theory and - Feller - 1971 |
| 299 | A certified digital signature - Merkle - 1990 |
| 296 | Efficient Identification and Signatures for Smart Cards - Schnorr - 1990 |
| 188 | One-Way Functions Are Necessary and Sufficient for Secure Signatures - Rompel - 1990 |
| 104 | Ein Satz über Untermengen einer endlichen Menge - Sperner - 1928 |
| 96 | Constructing digital signatures from a one-way function - Lamport - 1979 |
| 60 | On-line/off-fine digital signatures - Even, Goldreich, et al. |
| 46 | Cryptography: A New Dimension in Computer Data Security - Meyer, Matyas - 1982 |
| 10 | One-time identification with low memory - Vaudenay - 1992 |
| 3 | On the set of divisors of a number - Brujin, Tengebergen, et al. - 1952 |
| 1 | The Sperner property - Griggs - 1982 |
| 1 | Maximum antichains in the product of chains - Griggs - 1984 |
