Common use of Efficiency Clause in Contracts

Efficiency. The protocol presented in this paper is very efficient, since almost everything can be precomputed off-line for the clients, while achieving a strong level of security. The amount of memory available on the clients may provide a trade-off: – by storing many distinct triples (yi, σi, αi) one increases the security level, but one hashing and one XOR have to be performed on-line; – by storing many H1(c αi), for each (yi, σi, αi), for several values of the counter, one increases efficiency, since only one XOR has to be performed on-line.

Efficiency. The protocol presented in this paper is very efficient, since almost everything can be precomputed off-line for the clients, while achieving a strong level of security. The amount of memory available on the clients may provide a trade-off: – by storing many distinct triples (yi, σi, αi) one increases the security level, but one hashing and one XOR have to be performed on-line; – by storing many H1(c αiH1(cǁαi), for each (yi, σi, αi), for several values of the counter, one increases efficiency, since only one XOR has to be performed on-line.

Efficiency. The protocol presented in this paper is very efficient, since almost everything can be precomputed off-line for the clients, while achieving a strong level of security. The amount of memory available on the clients may provide a trade-off: – by storing many distinct triples (yi, σi, αi) one increases the security level, but one hashing and one XOR have to be performed on-line; H – by storing many H1(c 1(c αi), for each (yi, σi, αi), for several values of the counter, one increases efficiency, since only one XOR has to be performed on-line.

Efficiency. The protocol presented in this paper is very efficient, since almost everything can be precomputed off-line for the clients, while achieving a strong level of securitysecu- rity. The amount of memory available on the clients may provide a trade-off: – • by storing many distinct triples (yi, σi, αi) one increases the security level, but one hashing and one XOR have to be performed on-line; – by storing many H1(c αi), for each (yi, σi, αi), for several values of the counter, one increases efficiency, since only one XOR has to be performed on-line.xxxxxxx’s working time. G

Efficiency. The protocol presented in this paper is very efficient, since almost everything can be precomputed off-line for the clients, while achieving a strong level of securitysecu- rity. The amount of memory available on the clients may provide a trade-off: – • by storing many distinct triples (yi, σi, αi) one increases the security level, but one hashing and one XOR have to be performed on-line; – by storing many H1(c αi), for each (yi, σi, αi), for several values of the counter, one increases efficiency, since only one XOR has to be performed on-line.versary’s working time. G