Skip to main content
placeholder image

Threshold fail-stop signature schemes based on discrete logarithm and factorization

Chapter


Abstract


  • Security of ordinary digital signature schemes relies on a computational assumption. Fail-Stop Signature (FSS) 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, first we propose a new FSS scheme whose security is based on discrete logarithm modulo a composite number, and integer factorization. We provide a security proof of the scheme, and show that it is as efficient as the most efficient previously known FSS scheme. Next, we construct a Threshold FSS that requires collaboration of t out of n participants to generate a signature and to prove forgery if it occurs. The scheme is equipped with cheater detection (incorrect partial signature) which is essential for an effiective proof of forgery in Threshold FSS and only requires trusted authority during pre-key generation.

Publication Date


  • 2000

Citation


  • Safavi-Naini, R., & Susilo, W. (2000). Threshold fail-stop signature schemes based on discrete logarithm and factorization. In Unknown Book (Vol. 1975, pp. 292-307). doi:10.1007/3-540-44456-4_22

International Standard Book Number (isbn) 13


  • 9783540414162

Scopus Eid


  • 2-s2.0-79952595914

Book Title


  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Start Page


  • 292

End Page


  • 307

Abstract


  • Security of ordinary digital signature schemes relies on a computational assumption. Fail-Stop Signature (FSS) 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, first we propose a new FSS scheme whose security is based on discrete logarithm modulo a composite number, and integer factorization. We provide a security proof of the scheme, and show that it is as efficient as the most efficient previously known FSS scheme. Next, we construct a Threshold FSS that requires collaboration of t out of n participants to generate a signature and to prove forgery if it occurs. The scheme is equipped with cheater detection (incorrect partial signature) which is essential for an effiective proof of forgery in Threshold FSS and only requires trusted authority during pre-key generation.

Publication Date


  • 2000

Citation


  • Safavi-Naini, R., & Susilo, W. (2000). Threshold fail-stop signature schemes based on discrete logarithm and factorization. In Unknown Book (Vol. 1975, pp. 292-307). doi:10.1007/3-540-44456-4_22

International Standard Book Number (isbn) 13


  • 9783540414162

Scopus Eid


  • 2-s2.0-79952595914

Book Title


  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Start Page


  • 292

End Page


  • 307