An efficient fail-stop signature scheme based on factorization

Authors:
Willy Susilo;Rei Safavi-Naini
Affiliations:
Centre for Computer Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;Centre for Computer Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia
Venue:
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Year:
2002

Citing 7
Cited 2

The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Fail-Stop Signatures

SIAM Journal on Computing
Digital Signature Schemes: General Framework and Fail-Stop Signatures

Digital Signature Schemes: General Framework and Fail-Stop Signatures
Cryptography: Theory and Practice

Cryptography: Theory and Practice
New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
RSA-Based Fail-Stop Signature Schemes

ICPP '99 Proceedings of the 1999 International Workshops on Parallel Processing
Collision-free accumulators and fail-stop signature schemes without trees

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

Provably secure fail-stop signature schemes based on RSA

International Journal of Wireless and Mobile Computing
One-time signatures and Chameleon hash functions

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography

Quantified Score

Hi-index	0.01

Visualization

Abstract

Fail-stop signature (FSS) schemes protect a signer against a forger with unlimited computational power by enabling the signer to provide a proof of forgery, if it occurs. In this paper, we show a flaw in a previously proposed fail-stop signature that is based on the difficulty of factorization, and then describe a secure scheme based on the same assumption.