Signature function, definition

Newly sanctioned systems will require compliance with regulations for GMP electronic records and electronic signatures, and definition of the functionality required will need to be included. 

If one considers machines that react on many interface inputs, as they are needed in a general definition of signature schemes, one can choose to measure complexity as a function of the sum of the lengths of the interface inputs that occurred so far, or still of the initial state only. In particular situations, one might even make more special requirements, such as considering the time needed until the next output as a function of the most recent input only. ... 

External verifiability of the behaviour of participants in a transaction essentially means that there is a variant of this transaction where additional parties can observe the original participants and decide whether they behave correctly. Such a property has not been required explicitiy in any previous definition of signature schemes, but it can easily be fulfilled with some types of schemes and may be needed in some applications. The same property will be needed for other types of schemes in Sections 7.3 and 7.5.2 (zero-knowledge proofs and multi-party function evaluation), and the need for it may become clearer there. 

Definition 7.9. A standard fail-stop signature scheme provides correctness of initialization if it has the following properties. For all probabilistic interactive functions A and B and all parameters par according to Definition 7.1 or 7.2, respectively ... 

The definition of effectiveness of authentication deals with arbitrary signatures in the sequence of signatures hence the functional notation is used. 

Definition 7.11. A standard fail-stop signature scheme is secure for risk bearers iff for all probabilistic polynomial-time interactive algorithms Aj and non-interactive A2 (the two parts of the attacker strategy) and all polynomials Qsig, Qn (determining the growth of a and N as functions of k) ... 

If the underlying fail-stop signature scheme with one risk bearer is with prekey (Definition 7.31), the zero-knowledge proof and all test can be omitted in the representation of the function Gen If A, B, and res are executed correctly, the result of these steps is always acc j = acc observed = TRUE. 

If one combines the standard fail-stop signature schemes for signing one message block from Definition 9.17 with message hashing, there are no particular problems, because the function rho can be used to adapt the message-block spaces. 

Definition 11.19 (Rudimentary standard information-theoretically secure signature schemes). The components of a rudimentary standard information-theoretically secure signature scheme (in functional notation) for a nonempty message space Me 0, and a non-empty set Messagejbounds c N u oo are a triple Gen, sign, test) where... 

The general definition of a risk in this context is "a measure of the probability and severity of undesired effects", and more specifically for LIMS software, the critical functions and how they may affect LIMS data. The criticality of the data associated with electronic records and signatures is also a key subject for the regulators at present this subject is discussed later in this chapter. The intention of the risk assessment is to consider the following areas ... 

---