| Niko Bari' c: Digitale Signaturen mit Fail-stop Sicherheit ohne Baumauthentifizierung. Diplomarbeit, Institut f ur Informatik, Universit at Hildesheim, July 1996. |
....logarithmically in the number of messages that can be signed. The question whether this can be Work done while both authors were at the University of Hildesheim. Supported by the DFG (German Research Foundation) A preliminary version was available as [Pfit94] more details can be found in [Bari96]. avoided was also the main gap between known lower and upper bounds on the complexity of fail stop signature schemes [HePP93] The accumulators presented in [BeMa94] seem to be a solution to this problem: a large number of values is accumulated into one value z. Later on, for authentication of ....
Niko Bari' c: Digitale Signaturen mit Fail-stop Sicherheit ohne Baumauthentifizierung. Diplomarbeit, Institut f ur Informatik, Universit at Hildesheim, July 1996.
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