Some weaknesses of “weaknesses of undeniable signatures”

7Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The weaknesses that are the subject of [DY 91] have already been addressed in the published literature [C 90 & CVA 89]. The main class of these weaknesses consists of ways of cheating undeniable signatures; but these ways are shown here to themselves be “weak.” Specifically, a cheater using them can double-cross the other cheaters, to the extent that the original ways of cheating are rendered useless. The remaining cited weaknesses are re-statements of, or variations on, some previously observed blinding techniques [CvA 89]. These techniques allow advantages in some applications when desired, but are also easily excluded when not desired.

Cite

CITATION STYLE

APA

Chaum, D. (1991). Some weaknesses of “weaknesses of undeniable signatures.” In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 547 LNCS, pp. 554–556). Springer Verlag. https://doi.org/10.1007/3-540-46416-6_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free