Information-Theoretic Security for Signers Introduction

Ever since the invention of digital signature schemes, it had been accepted that signers can only be secure in the computational sense and on cryptologic assumptions (see [DiHe76] and Section 2.3). One purpose of this work is to show that this need not be so, and to present several alternatives, in particular fail-stop signature schemes. 

A complete overview of the signature schemes with new security properties is given in Chapter 6, after more terminology and classification criteria have been introduced in Chapters 4 and 5. 

The recipient of a signed message, in contrast, is absolutely secure If he has checked that the signature passes the test with the public key, he knows that it will also do so in court, no matter if it is authentic or forged. 

---