Name
Abstract | ||
|---|---|---|
In secret sharing, cheaters may reconstruct and recover the secret by providing faked shares, but the honest participants get no information about it. The anti-cheating secret sharing scheme can detect cheating and identify cheaters, so that it can effectively resist cheating attacks. In this paper, we construct a Cyclic Codes-based (k, n)-block secret sharing scheme against cheating. If there are more than k participants reconstructing the secret, we can detect cheating and identify cheaters. We discuss the relationship between the length of the secret block and the computational complexity, the length of the secret block and the storage space. Also, we give the upper bound of the number of identifiable cheaters. When there are no fewer than k honest participants, we can identify all cheaters. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/IIH-MSP.2013.99 | IIH-MSP |
Keywords | Field | DocType |
secret block,k honest participant,k participant,secret sharing scheme,cyclic codes-based,computational complexity,honest participant,anti-cheating block secret,secret sharing,anti-cheating secret sharing scheme,cheating attack | Secure multi-party computation,Secret sharing,Computer science,Computer security,Theoretical computer science,Verifiable secret sharing,Shamir's Secret Sharing,Cheating,Shared secret,Homomorphic secret sharing,Computational complexity theory | Conference |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xing-Fu Xu | 1 | 0 | 0.34 |
| daoshun wang | 2 | 362 | 27.74 |
| li shundong | 3 | 45 | 11.09 |
| Ching-Nung Yang | 4 | 1480 | 100.27 |