How to construct fail-stop confirmer signature schemes

Rei Safavi-Naini, Willy Susilo, Huaxiong Wang

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution


In a confirmer signature, verification of a signature requires collaboration of the confirmer. A Fail-Stop Confirmer signature provides protection against an enemy with unlimited computational power. A Fail-Stop Confirmer signature is a combination of Fail-Stop Signature and Confirmer Signature Schemes which was first constructed in [15]. In this paper we discuss security issues that will arise in naive construction of such systems.

Original languageEnglish
Title of host publicationInformation Security and Privacy
Subtitle of host publication6th Australasian Conference, ACISP 2001 Sydney, Australia, July 11–13, 2001 Proceedings
EditorsVijay Varadharajan, Yi Mu
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Number of pages10
ISBN (Electronic)9783540477198
ISBN (Print)3540423001, 9783540423003
Publication statusPublished - Jul 2001
Event6th Australasian Conference on Information Security and Privacy, ACISP - 2001 - Sydney, Australia
Duration: 11 Jul 200113 Jul 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)03029743
ISSN (Electronic)16113349


Other6th Australasian Conference on Information Security and Privacy, ACISP - 2001

Fingerprint Dive into the research topics of 'How to construct fail-stop confirmer signature schemes'. Together they form a unique fingerprint.

Cite this