### Table 4: Computation times for secret sharing and secret recovery of an 8 KB block using the XOR secret sharing scheme

2005

"... In PAGE 6: ... In practice, XOR secret sharing can be implemented with word-wide operations for efficiency. Table4 lists the computation times during secret sharing and secret recovery for a selection of (q, q) values for XOR secret sharing. Note that XOR secret sharing is also a perfect secret sharing scheme.... ..."

Cited by 8

### Table 1: Comparison between Pure Quorum Systems, Pure Secret Sharing, Method Regular- Sharing, and Method GridSharing for n = 44 and b = 3

2004

"... In PAGE 17: ... With only the quorum sizes being different, this slighty-modified secret sharing scheme and Method RegularSharing are identical. Table1 compares these methods in terms of different performance metrics when the number of servers in the system is 44 and the fault threshold is 3. In calculating the availabilities, it is assumed that a server can be compromised or crashed with a probability of 0.... ..."

Cited by 1

### Table 1. A Secret Sharing Scheme for C6 S

1995

"... In PAGE 10: ... If we consider n = 6 and jSj = 2, then from the previous corollary we get that 2:5 (C6; 2) 3. Brickell and Stinson [12] gave the secret sharing scheme for C6 depicted in Table1 . It is easy to see that in this case the dealer apos;s randomness is log2 6 lt; 2:58497, and hence (C6; 2) log2 6.... ..."

Cited by 9

### Table 4. A secret-sharing scheme for AR,G.

2001

Cited by 4

### Table 6.1: A comparison of robust (m,n) threshold sharing schemes, showing the scheme type, whether the dealer or shareholders may be faulty, and whether m or n may be changed. Note that Desmedt and Jajodia [16] do not specify a phase for the initial distribution of shares of a secret.

2004

Cited by 4

### Table 2. Protocol for two secrets of ` bits

2001

"... In PAGE 8: ... Therefore, we can conclude saying that Zig-zag and fully Zig-zag de nitions de ne the same class of functions. Therefore, the known constructions for Zig-zag functions enable us to improve the protocol described in Table 1 by substituting the secrets with the pre-images of a Zig- zag functions, as done in the protocol described in Table2 for two secrets. A complete description of our protocol can be found in Table 3.... ..."

Cited by 3