Revised fischlin’s (blind) signature schemes

Authors:
Kewei Lv
Affiliations:
State Key Laboratory of Information Security, Graduate School of Chinese, Academy of Sciences, Beijing, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Year:
2005

Citing 8
Cited 0

How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Nonmalleable Cryptography

SIAM Journal on Computing
The Representation Problem Based on Factoring

CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Efficient Non-malleable Commitment Schemes

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Efficient and Non-interactive Non-malleable Commitment

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Identification Protocols Secure against Reset Attacks

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

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.