M. Bellare and S. Micali : How to Sign Given Any Trapdoor Function. Proc. Crypto'88, LNCS 403, Springer-Verlag, pp. 200--215, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the cooperation of the signature algorithm, an extra 2 signature for a message that was not previously signed. A secure system was designed under the assumption that factoring is hard, or a more general assumption that claw free trapdoor permutations exist [15] Recently, Bellare and Micali [1] have shown how to construct a secure signature system based on the assumption that trapdoor one way permutations exist; this matches the original suggestion of Diffie and Hellman, but this time the system has a proof of security. As one can see in the above history, the entire research in ....

....2 log n 1 ) bits. An additional advantage is that the one way permutation (1 1 functions) has to be computed only on inputs of size m and the time complexity is essentially linear in n 1 . 3 One way based Signature Scheme In this section we give our definition of a signature scheme (based on [15, 1]) and its security. 3.1 Definition of a Signature Scheme A signature scheme includes the following components: 1. A security parameter k which determines the size of keys, messages and other resources; all sizes and algorithms are polynomial in k. 2. A message space MS; we allow all messages of ....

[Article contains additional citation context not shown here]

Bellare M. and S. Micali How to Sign Given any Trapdoor Function , Proc. 20th Annual Symposium on the Theory of Computing, Chicago, Il, 1988, pp. 32-42.

....possible goal while having the strongest possible access to the signer. Therefore, this level of security is thought to be the most desirable. In [5] a scheme is exhibited with this level of security, under the assumption that a family of claw free oneway trapdoor permutations exists. After [1], 7] and [9] the matter of secure signature schemes is, at least theoretically, settled: the existence of one way functions is a sufficient and necessary condition for the existence of signature schemes with this security level. It must be noted, however, that these theoretical schemes have, by ....

M. Bellare, S. Micali: How to Sign Given Any Trapdoor Function. Proceedings of STOC '88, pp.32--42.

....attempting E mail address: cramer cwi.nl. 1. Introduction 2 to quantify the efficiency needed, we require, secondly, that the amount of computation and the size of the signatures are small, and, finally, that the amount of storage needed is reasonably limited. In a sequence of results [12] [4], 13] and finally [14] it was established that the existence of one way functions is necessary and sufficient for the existence secure signatures. This result, however theoretically very important, does not give rise to a practical signature scheme. The construction, which is based on a general ....

M. Bellare, S. Micali: How to Sign Given any Trapdoor Function, Proceedings of Crypto '88, Springer Verlag LNCS series, pp. 200--215.

....under adaptively chosen message attacks [13] Without attempting to quantify the efficiency needed, we require, secondly, that the amount of computation and the size of the signatures are small, and, finally, that the amount of storage needed is reasonably limited. In a sequence of results [17] [1], 18] and finally [23] it was established that the existence of one way functions is necessary and sufficient for the existence secure signatures. This result, however theoretically very important, does not give rise to a practical signature scheme. The construction, which is based on a general ....

M. Bellare, S. Micali: How to Sign Given any Trapdoor Function, Proceedings of Crypto '88, Springer Verlag LNCS series, pp. 200--215.

No context found.

M. Bellare and S. Micali : How to Sign Given Any Trapdoor Function. Proc. Crypto'88, LNCS 403, Springer-Verlag, pp. 200--215, 1989.

No context found.

M. Bellare and S. Micali : How to Sign Given Any Trapdoor Function. Proc. Crypto'88, LNCS 403, Springer-Verlag, pp. 200--215, 1989.

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