Common use of Key-Uniformity Clause in Contracts

Key-Uniformity. In the remainder of this work we will require a technical condition on E˜, which informally assures that E˜ does not behave structurally different for different keys. For instance, it should not be the case that for some keys, l1 can take only one value independent of the tweak, while for other keys, it can take 2n values (one for every tweak). We will call this property “key-uniformity.” Note that the condition slightly limits the generality of the scheme, but it is quite reasonable that a scheme should behave comparably for all keys. For brevity, view the functions Bpre for i = 1,...,ρ as mappings (ka, kb, t) '→ lpre, and the functions B for i =1 as mappings (ka, kb, t) '→ l . Note that, indeed, (ypre,..., ypre), is a function of (ka, kb, t) for any i. 1 i ˜

Key-Uniformity. In the remainder of this work we will require a technical condition on E˜, which informally assures that E˜ does not behave structurally different different for different different keys. For instance, it should not be the case that for some keys, l1 can take only one value independent of the tweak, while for other keys, it can take 2n values (one for every tweak). We will call this property “key-uniformity.” Note that the condition slightly limits the generality of the scheme, but it is quite reasonable that a scheme should behave comparably for all keys. For brevity, view the functions Bpre for i = 1,...,ρ as mappings (ka, kb, t) '→ ›→ lpre, and the functions B for i == 1 as mappings (ka, kb, t) '→ ›→ l . Note that, indeed, (ypre,..., ypre), is a function of (ka, kb, t) for any i. 1 i ˜