"Digital Signatures with Blindfold Arbitrators who Cannot Form Alliances", SG Akl, in Proceedings of the 1983 IEEE Computer Society Symposium on Security and Privacy, pp 129--135  Home/Search   Document Not in Database   Summary   Related Articles

....information (such as a random input) however, in their definition it produces only a single output [15] This model therefore excludes the Guy Fawkes protocol. But it also excludes the large class of arbitrated signatures that were already well known and in use by that time (see, for example, [16]) as well as most of the special purpose signature constructions that require interaction, such as undeniable signatures, designated confirmer signatures and oblivious signatures [17] Naor and Yung refined the approach of Goldwasser, Micali and Rivest, by cutting the complexity theoretic ....

....codeword will with high probability have found a different one from that known to the genuine signer, who will thus be able to exhibit a collision for the hash function. 5 Signing Bidirectional Digital Streams Hash based signatures have been condemned as time consuming, costly and wasteful ([16]) Guy Fawkes is much less so than previous schemes; and there are applications for which it might be practical. Firstly, let us consider the most convincing proposal for a practical application of hash based signatures. This is the method of Gennaro and Rohatgi for signing digital steams [21] ....

"Digital Signatures with Blindfold Arbitrators who Cannot Form Alliances", SG Akl, in Proceedings of the 1983 IEEE Computer Society Symposium on Security and Privacy, pp 129--135

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