### Table 1. Comparison between different LSB method based on secret image.

2006

### 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: Comparing Codes for an Array of about 1000 Information Disks

1994

"... In PAGE 27: ... The 3d-parity and steiner codes share this very high reliability. Table1 reports higher MTTDL for the 2d-parity code than for the full-3 code. This may seem counter-intuitive, because the latter corrects all triple erasures and the former does not.... In PAGE 27: ... This may seem counter-intuitive, because the latter corrects all triple erasures and the former does not. We can prove, however, that the 2d-parity code has a smaller fraction of unrecoverable 4-erasures than the full-3 code (for the disk arrays treated in Table1 ). Moreover, based on Monte Carlo simulations, we conjecture that for all m larger than three, the 2d-parity code has a smaller frac- tion of unrecoverable m -erasures than the full-3 code.... ..."

Cited by 78

### Table 1: The summary of parameters used in the current challenge-response PCS secret shared key response key challenge response

2006

"... In PAGE 2: ...4 Generic Challenge-Response Based Protocol As we can see from the above described protocols, the crit- ical component in the challenge-response technique is that AS generates a challenge for MS and then waits for MS to send the corresponding response by hashing the challenge and the secret key shared with AS. Table1 shows the summary of the parameters used in the three challenge- response PCS. From Table 1, it is easy to find out that the secret shared keys between AS and MS play the critical role in the challenge-response protocol.... In PAGE 2: ... Table 1 shows the summary of the parameters used in the three challenge- response PCS. From Table1 , it is easy to find out that the secret shared keys between AS and MS play the critical role in the challenge-response protocol. Regardless to the proto- col GSM, DECT, or USDC, the response key is derived from the secret shared key.... ..."

### 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