On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids and a special class of secret sharing schemes, namely multiplicative linear secret sharing schemes. Such schemes are known to enable multi-party computation protocols secure against general (non-threshold) adversaries.
Two open problems related to the complexity of multiplicative LSSSs are considered in this paper.
The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. We prove a property of strongly multiplicative LSSSs that could be useful in solving this problem. Namely, using a suitable generalization of the well-known Berlekamp-Welch decoder, we show that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults.
The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, we wonder whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be re-stated in terms of representability of identically self-dual matroids by self-dual codes. We introduce a new concept, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. We prove that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.
Keywordsmulti-party computation multiplicative linear secret sharing schemes identically self-dual matroids self-dual codes efficient error correction
- 3.Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. ACM STOC 1988, pp. 1–10 (1988)Google Scholar
- 7.Cameron, P.J.: Cycle index, weight enumerator, and Tutte polynomial. Electron. J. Combin. 9, 10, Note 2 (2002)Google Scholar
- 8.Canetti, R., Feige, U., Goldreich, O., Naor, M.: Proc. ACM STOC 1996. In: Proc. ACM STOC 1996, pp. 639–648 (1996)Google Scholar
- 9.Chaum, D., Crépeau, C., Damgård, I.: Multi-party unconditionally secure protocols. In: Proc. ACM STOC 1988, pp. 11–19 (1988)Google Scholar
- 11.Goldreich, O., Micali, M., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. 19th ACM Symposium on the Theory of Computing STOC 1987, pp. 218–229 (1987)Google Scholar
- 13.Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation. In: Proc. 16th Symposium on Principles of Distributed Computing PODC 1997, pp. 25–34 (1997)Google Scholar
- 14.Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing any access structure. In: Proc. IEEE Globecom, pp. 99–102 (1987)Google Scholar
- 16.Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the Eighth Annual Structure in Complexity Theory Conference, San Diego, CA, pp. 102–111 (1993)Google Scholar
- 27.Simmons, G.J.: An introduction to shared secret and/or shared control schemes and their application. In: Contemporary Cryptology. The Science of Information Integrity, pp. 441–497. IEEE Press, Los Alamitos (1991)Google Scholar