A New and Efficient Fail-stop Signature Scheme

Authors: Susilo W.¹; Safavi-Naini R.¹; Gysin M.²; Seberry J.¹

Source: Computer Journal, Volume 43, Number 5, 2000 , pp. 430-437(8)

Buy & download fulltext article:

Price: $42.29 plus tax (Refund Policy)

Abstract:

The security of ordinary digital signature schemes relies on a computational assumption. Fail-stop 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 chosen message attack, and is the most efficient scheme with respect to the ratio of the message length to the signature length. The scheme provides an efficient solution to signing messages up to 1881 bits.

Language: English

Document Type: Original article

Affiliations: 1: Centre for Computer Security Research, School of IT and CS, University of Wollongong, Wollongong 2522, Australia Email: wsusilo@uow.edu.au 2: School of Information Technology, Townsville, QLD 4811, Australia

Publication date: 2000-01-01

More about this publication?

The Computer Journal publishes research papers in a full range of subject areas, as well as regular feature articles and occasional themed issues to enable readers to easily access information outside their direct area of research. The journal provides a complete overview of developments in the field of Computer Science.