Abstract
A cheating-immune secret sharing scheme prevents a cheater, who submits a corrupted share, from gaining an advantage in knowing the secret over the honest participants. We revisit two methods, that uses linear codes, to construct Boolean functions satisfying multiple cryptographic criteria. We show that these methods can be used to build new cheating-immune (n, n)-secret sharing schemes. We also revisit two general constructions of secret sharing schemes using cumulative arrays and apply them to build cheating-immune (t, n)-threshold secret sharing schemes.
| Original language | English |
|---|---|
| Pages (from-to) | 67-83 |
| Number of pages | 17 |
| Journal | Cryptography and Communications |
| Volume | 5 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2013 |
Keywords
- Boolean function
- Cumulative array
- Linear code
- Perfect hash family
- Secret sharing
Fingerprint Dive into the research topics of 'Cheating-immune secret sharing schemes from codes and cumulative arrays'. Together they form a unique fingerprint.
Cite this
dela Cruz, R., & Wang, H. (2013). Cheating-immune secret sharing schemes from codes and cumulative arrays. Cryptography and Communications, 5(1), 67-83. https://doi.org/10.1007/s12095-012-0076-4