M. Lepinski, S. Micali, and A. Shelat. Collusion-Free Protocols. 37th Annual ACM Symposium on Theory of Computing (STOC 2005). 12  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and is a legal replacement for handwritten signatures [LM78, Ma79] However, a number of technical problems arise if digital signatures are implemented using trap door functions as suggested by Die and Hellman [DH76] these problems have been addressed and solved in part elsewhere. For example, [GMY83] showed how to handle arbitrary or sparse messages sets and how to ensure that if an enemy sees previous signatures (for messages that he has not chosen) it does not help him to forge new signatures (this is a non adaptive chosen message attack see section 2.2) The signature scheme presented ....

....and Williams , and is totally breakable with a directed chosen message attack. Shamir [Sh78] This knapsack type signature scheme has recently been shown by Tulpan [Tu84] to be universally forgeable with a key only attack for any practical values of the security parameter. Goldwasser Micali Yao [GMY83]: This paper presents for the rst time signature schemes which are not of the trap door type, and which have the interesting property that their security characteristics hold for any message space. The rst signature scheme presented in [GMY83] was proven not to be even existentially forgeable ....

[Article contains additional citation context not shown here]

Goldwasser, S., S. Micali, and A. Yao, \Strong Signature Schemes," Proc. 15th Annual ACM Symposium on Theory of Computing, (Boston Massachusetts, April 1983), 431-439.

No context found.

M. Lepinski, S. Micali, and A. Shelat. Collusion-Free Protocols. 37th Annual ACM Symposium on Theory of Computing (STOC 2005). 12

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