Abstract
The representation problem based on factoring gives rise to alternative solutions to a lot of cryptographic protocols in the literature. Fischlin applies the problem to identification and (blind) signatures. Here we show some flaw of Fischlin's schemes and present the revision. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
APA
Lv, K. (2005). Revised Fischlin’s (blind) signature schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3802 LNAI, pp. 96–103). https://doi.org/10.1007/11596981_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free