Top-Down Derivation of the Components

The components of a fail-stop signature scheme in the general definition are programs for the different types of entities. The components in a conventional definition are parts of these programs corresponding to particular transactions, or even to one round within such a transaction. Thus the transactions are now considered one by one and decomposed into algorithms. Two notations are used  

Actually, the difference could not be seen at all in previous definitions and constructions, because there was no notion of entities and access points, only of algorithms and people. However, this often led to the notions of recipients and risk bearers being mixed up. 

The more detailed algorithmic notation is used for the original definitions, and the functional notation is derived from it. 

General restrictions and their consequences for outputs. The following restrictions on initialization were made in Section 6.1.2  

For notational convenience, a public key is also defined if initialization is unsuccessful let pk = e if acc = FALSE. 

---