Improvements to Almost Optimum Secret Sharing with Cheating Detection
Secret sharing allows a secret s to be distributed amongst n participants in the form of shares. An authorised set of these participants is then able to reconstruct s at a latter date by pooling their shares. Secret sharing with cheating detection capability (SSCD) allows participants to detect the submission of faulty or modified shares. Within this field researchers consider two different models of security, the OKS model and the CDV model.
In SPACE 2015 Jhanwar and Safavi-Naini (JS) presented two SSCD schemes, one developed under each of the security models. We prove that both of these schemes fail to detect cheating. We then show that with some modifications both schemes can be made secure. The resulting schemes have near optimal share size, support operations from an arbitrary finite field and provide a high level of security even if the secret domain is small. The first of these schemes is devised under the OKS model and is the most efficient of its kind, whilst the second is devised under the CDV model and is as efficient as the current best solution.
- 2.Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 1–10. ACM, New York (1988)Google Scholar
- 4.Blakley, G.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, pp. 313–317. AFIPS Press, Monval (1979)Google Scholar
- 7.Cevallos, A., Fehr, S., Ostrovsky, R., Rabani, Y.: Unconditionally-secure robust secret sharing with compact shares. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 195–208. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29011-4_13CrossRefGoogle Scholar
- 8.Cramer, R., Dodis, Y., Fehr, S., Padró, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471–488. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78967-3_27CrossRefGoogle Scholar