Fail-stop threshold signature schemes based on elliptic curves

Willy Susilo, Rei Safavi-Naini, Josef Pieprzyk

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)


Fail-stop signatures provide security for a sender against a forger with unlimited computational power. In this paper we present a fail-stop signature scheme based on discrete logarithm problem for elliptic curves and then show that the signing process can be distributed among a group of senders to obtain a threshold signature scheme. The threshold signature scheme has a cheater detection property and allows the combiner to detect a sender who is submitting false shares. We will show that our fail-stop signature scheme works in the two commonly used models of signature schemes, with or without a trusted authority.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 4th Australasian Conference, ACISP 1999, Proceedings
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Number of pages14
ISBN (Print)3540657568, 9783540657569
Publication statusPublished - 1999
Externally publishedYes
Event4th Australasian Conference on Information Security and Privacy, ACISP - 1999 - Wollongong, Australia
Duration: 7 Apr 19999 Apr 1999

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


Other4th Australasian Conference on Information Security and Privacy, ACISP - 1999

Fingerprint Dive into the research topics of 'Fail-stop threshold signature schemes based on elliptic curves'. Together they form a unique fingerprint.

Cite this