D. Bleichenbacher and U.M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y.G. Desmedt, editor, Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 75--82. Springer-Verlag, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Keywords: Broadcast authentication, source authentication for multicast, one time signature, signature based on a one way function without trapdoor. 1. INTRODUCTION For the past 25 years researchers have created and refined digital signature schemes using one way functions without trapdoors [2, 5, 9, 10, 13, 14, 18, 23]. These signature schemes are efficient for signature generation and verification, but the signatures are too large for many applications. We propose the BiBa signature, a new approach for signatures based on one way functions without trapdoor. The signature size of our scheme is much smaller than ....

D. Bleichenbacher and U. M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y. G. Desmerit, editor, Advances in Cryptology - CRYPTO '9d, volume 839 of Lecture Notes in Computer Science, pages 75-82.

....(assuming that the signature code even ts into memory) Section 7 reviews related work in ecient signature schemes. Signatures based on one way functions without trapdoors (sometimes called one time signature schemes) are an interesting alternative to signatures based on asymmetric cryptography [4, 5, 14, 18, 19, 28]. One of their main advantages is that these signatures only rely on a one way function, which we can implement with a fast hash function (e.g. SHA 1 [22] or MD5 [29] or from a block cipher [16, 20, 26, 27] These one time signature schemes are orders of magnitude faster than traditional ....

....BiBa signature. Furthermore, the signer computes 350 o line one way function applications per signature, and the veri er computes 184 one way functions on average to verify the signature. Bleichenbacher and Maurer analyzed signature algorithms with a minimal number of nodes in the graph [5, 4, 3]. Table 6 compares the various one time signature algorithms. We consider the computation and communication overhead as a basis for comparison. We choose the signature parameters such that a forger has a probability of 2 80 to nd a valid signature after one try. For the computation overhead, ....

D. Bleichenbacher and U. M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y. G. Desmedt, editor, Advances in Cryptology { CRYPTO '94, volume 839 12 of Lecture Notes in Computer Science, pages 75-82. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1994.

....treeauthentication schemes for signing several messages consecutively with a single public key. Multiple keys can be put on the leaves of an authentication tree and authenticated through the paths of the tree. Vaudenay [38] showed an improved scheme requiring less memory. Bleichenbacher and Maurer [5, 6, 7] formalized the concept of one time signatures using directed acyclic graphs and proved some theoretical results. These schemes for signing multiple messages use a single public key for verification, a feature resembles public key cryptography. However, it is achieved at higher computational ....

D. Bleichenbacher and U.M. Maurer, Directed Acyclic Graphs, One-way Functions and Digital Signatures, Proc. CRYPTO'94, LNCS 839, Springer Verlag, 1994, pp 75-82.

.... 46 N 1 N 2 P 1 P N 1 P 2N 1 P 3N 1 N 0 Sig X P 1 P N 1 P 2N 1 P 3N 1 P 2 P N 2 P 2N 2 P 3N 2 P N P 2N P 3N P 4N h2 h1 Figure 3 7 Combined UOBT and PayTree Authentication trees for one time signatures were generalised into directed acyclic graphs by Bleichenbacher and Maurer [BM94]. Miyano [Miy98] investigated the efficiency limits of one time signatures on directed graphs. Domingo Ferrer and Herrera Joancomarti [FJ99] further generalised chains and trees based on hash functions into cyclic hash graphs, which they called spending programs. Their scheme allows hash values to ....

D. Bleichenbacher and U. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Advances in Cryptology -- CRYTPTO '94 Proceedings, pp. 75-82, Lecture Notes in Computer Science vol. 839. Springer-Verlag, Berlin, 1994.

....for computing signatures. Since the security of the decomposition approach above may depend on the stealth of a particular computation, how indistinguishable it is from the real computation, this flexibility is attractive. For example, there are one way functions based upon DAG and tree traversals [6] that have a very natural integration into pointer rich programs. 5 Program Obfuscation Approaches The goal of program obfuscation is to make a program difficult to understand. Open to interpretation, this goal refers to the human or machine difficulty of understanding various program properties ....

Bleichenbacher, D., and Maurer, U. M. Directed acyclic graphs, one-way functions and digital signatures. In Proc. CRYPTO 95 (1994), Y. G. Desmedt, Ed., Springer, pp. 75--82. Lecture Notes in Computer Science No. 839.

....are not comparable for the inclusion relation is maximal when we take all the subsets with size n=2. This has been used for optimizing signature schemes based on hash functions. Those algorithms have been studied and discovered by several authors including by one author of the present paper [9, 11, 12, 16, 3]. We can adapt the last updated combinatorial technics from this area, but this downgrades the simplicity of the protocol. 8 Secure communications Communications with the broker must be secure in two ways. Firstly, the secrecy of the keys (k B for the vendor and s for the customer) must be ....

D. Bleichenbacher, U. M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Advances in Cryptology CRYPTO'94, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 839, pp. 75--82, Springer-Verlag, 1994.

....1. As an example, if we wished to sign the 8 bit message 0100 1110 we would first count the number of 0 bits (there are 4) and then append a 3 bit count field (with the value 4) to the original 8 bit message producing the 11 bit message 0100 1110 100 which we would sign by releasing x[2] x[5], x[6] x[7] and x[9] The receiver cannot pretend that he did not receive x[2] because the resulting erroneous message 0000 1110 100 would have 5 0 s in it, not 4. Similarly, pretending he did not receive x[9] would produce the erroneous message 0100 1110 000 in which the count field ....

....treeauthentication schemes for signing several messages consecutively with a single public key. Multiple keys can be put on the leaves of an authentication tree and authenticated through the paths of the tree. Vaudenay [38] showed an improved scheme requiring less memory. Bleichenbacher and Maurer [5, 6, 7] formalized the concept of one time signatures using directed acyclic graphs and proved some theoretical results. These schemes for signing multiple messages use a single public key for verification, a feature resembles public key cryptography. However, it is achieved at higher computational ....

D. Bleichenbacher and U.M. Maurer, Directed Acyclic Graphs, One-way Functions and Digital Signatures, Proc. CRYPTO'94, LNCS 839, Springer Verlag, 1994, pp 75-82.

....document authentication in EDI or for public key certification used to establish the emerging international public key infrastructure. One can distinguish between two types of digital signature schemes. The first type of scheme was proposed by Lamport [4] and generalized in [5] 6] 3] 8] and [1]. Once it is set up, it can only be used for signing a predetermined number of messages 2 from a certain message space. The second type of schemes, the first realization of which was the well known RSA system [7] can be used an unlimited number of times. A motivations for investigating and ....

....that it is infeasible to compute the secret key, or any intermediate result of the computation, from the public key. 2 In this paper we only consider schemes for signing a single message, but these results can easily be generalized to obtain schemes that allow to sign a fixed number of messages [1]. 3 A one way function f is a function that is easy to compute but computationally infeasible to invert, for suitable definitions of easy and infeasible . It is not difficult to define a function that appears to be one way even to an expert in cryptography. However, not even the existence of ....

[Article contains additional citation context not shown here]

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.

No context found.

D. Bleichenbacher and U. Maurer. Directed acyclic graphs, one-way functions and digital signature. In Y. Desmedt, editor, Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 75#82. Springer Verlag Berlin, 1994.

....document authentication in EDI or for public key certification used to establish the emerging international public key infrastructure. One can distinguish between two types of digital signature schemes. The first type of scheme was proposed by Lamport [7] and generalized in [8] 9] 5] 14] and [1]. Once it is set up, it can only be used for signing a predetermined number of messages 2 from a certain message space. The second type of schemes, the first realization of which was the well known RSA system [11] can be used an unlimited number of times. There are two different motivations for ....

.... is used as the input to a sequence of OWF evaluations which results in a sequence of intermediate results and finally 2 In this paper we only consider schemes for signing a single message, but these results can easily be generalized to obtain schemes that allow to sign a fixed number of messages [1]. 3 A one way function f is a function that is easy to compute but computationally infeasible to invert, for suitable definitions of easy and infeasible . It is not difficult to define a function that appears to be one way even to an expert in cryptography. However, not even the existence of ....

[Article contains additional citation context not shown here]

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.

....Key words. Cryptography, Digital signature, One way function, Directed acyclic graph, Partially ordered set. 1 Introduction One can distinguish between three types of digital signature schemes. The first type of scheme was proposed by Lamport [7] and generalized in [8] 9] 5] 14] and [1]. Once it is set up, it can only be used for signing a predetermined number (e.g. one) of messages from a certain message space. The second type of schemes, the first realization of which was the RSA system [11] can be used an unlimited number of times. In contrast to the first type of scheme, ....

....than OWFs with appropriate structure. Moreover, these schemes have applications in efficiency critical smartcard applications [6] in on line off line signatures [5] and in the signature schemes of [3] The general concept of a digital signature schemes of the first type was formalized in [1]. The purpose of this paper is to discuss constructions for such schemes and to prove several results on the achievable efficiency, in particular for computation graphs that are trees. The outline of the paper is as follows. To make the paper reasonably self contained, the basic ideas underlying ....

[Article contains additional citation context not shown here]

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.

....if it happens rarely. This could be guaranteed by so called observers (as proposed in [3] and [12] which would imply that double spending required breaking a tamper proof component. This method has the advantage that an arbitrary and hence very efficient signature scheme could be used (e.g. [1, 14]) As is the case with most complex cryptographic protocols, the proposed protocol can quite convincingly be argued to be secure if computing discrete logarithms in the underlying group is infeasible, but the security cannot be proved rigorously. It is an open problem to prove that the protocol is ....

D. Bleichenbacher and U. Maurer. Directed acyclic graphs, one-way functions and digital signature. In Y. Desmedt, editor, Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 75--82. Springer Verlag Berlin, 1994.

No context found.

D. Bleichenbacher and U.M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y.G. Desmedt, editor, Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 75--82. Springer-Verlag, 1994.

No context found.

D. Bleichenbacher and U.M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y.G. Desmedt, editor, Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 75--82. Springer-Verlag, 1994.

No context found.

D. Bleichenbacher and U.M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y.G. Desmedt, editor, Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 75--82. Springer-Verlag, 1994.

No context found.

D. Bleichenbacher and U. Maurer. Directed Acyclic Graphs, One-way Functions and Digital Signatures. In Crypto '94, LNCS 839, pages 75--82. Springer-Verlag, Berlin, 1994.

No context found.

D. Bleichenbacher and U.M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y.G. Desmedt, editor, Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 75--82. Springer-Verlag, 1994.

No context found.

Bleichenbacher, D., and Maurer, U. Directed acyclic graphs, one-way functions and digital signatures. In Proceedings of Advances in Cryptology -- CRYPTO'94 (1994), vol. 963 of LNCS, pp. 75-- 82.

No context found.

D. Bleichenbacher and U.M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y.G. Desmedt, editor, Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 75--82. Springer-Verlag, 1994.

No context found.

D. Bleichenbacher and U.M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y.G. Desmedt, editor, Advances in Cryptology --- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 75--82. Springer-Verlag, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC