### Table 1. A case expressed in the TwoInOne case representation. Casename Case690

1998

Cited by 2

### 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. 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 2. A secret-sharing scheme for C6C9CAC8D4.

"... In PAGE 5: ... Define DED1A0BD def BP A0 C8D1A0BE CXBPBC DECX, where here and in the following all arithmetic operations involving ring elements are performed in CID4. The shares of the parties are specified in Table2 . We turn to prove that this secret-sharing scheme... ..."

### Table 3. A secret-sharing scheme for C6C9CAD1.

"... In PAGE 11: ... However, since here D9 is not fixed, we cannot guarantee that the above condition always holds. Nevertheless, this already implies that the secret can be correctly reconstructed from the shares in Table3 with a one-sided error probability of at most BD A0 B3B4D9B5BPD9, which is bounded away from 1. The following tighter analysis shows that the one-sided error probability of reconstruction can be as low as BDBPBE.... ..."