A General Construction for Fail-Stop Signature using Authentication Codes
Reihaneh Safavi–Naini, Willy Susilo · Birkhäuser Basel eBooks · 2001
Security of an ordinary digital signature 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 describe a method of constructing fail-stop signature schemes from authentication codes. We also give an example that fits this general construction and prove its security. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.