A New and Efficient Fail-stop Signature Scheme

@article{Susilo2000ANA,
  title={A New and Efficient Fail-stop Signature Scheme},
  author={W. Susilo and R. Safavi-Naini and Marc Gysin and J. Seberry},
  journal={Comput. J.},
  year={2000},
  volume={43},
  pages={430-437}
}
The security of ordinary digital signature schemes relies on a computational assumption. Failstop signature schemes provide security for a sender against a forger with unlimited computational power by enabling the sender to provide a proof of forgery if it occurs. In this paper we give an efficient fail-stop signature scheme that uses two hard problems, discrete logarithm and factorization, as the basis of a receiver’s security. We show that the scheme has provable security against adaptively… Expand
Fail-Stop Signature for Long Messages
Provably secure fail-stop signature schemes based on RSA
An Efficient Fail-Stop Signature Scheme Based on Factorization
Efficient Fail-Stop Signatures from the Factoring Assumption
Comment fail-stop blind signature scheme design based on pairings
...
1
2
3
...

References

SHOWING 1-10 OF 46 REFERENCES
RSA-based fail-stop signature schemes
  • W. Susilo, R. Safavi-Naini, J. Pieprzyk
  • Computer Science
  • Proceedings of the 1999 ICPP Workshops on Collaboration and Mobile Computing (CMC'99). Group Communications (IWGC). Internet '99 (IWI'99). Industrial Applications on Network Computing (INDAP). Multime
  • 1999
How to Make Efficient Fail-stop Signatures
Fail-Stop Signatures Without Trees
Fail-stop Signatures; Principles and Applications
Fail-Stop Signatures
Fail-stop Signatures and their Application
...
1
2
3
4
5
...