Abstract
Linear secret sharing schemes and general access structures have played a key role in modern cryptography. Cramer-Damgård-Maurer recently proved that any linear secret sharing scheme over a finite field can be a verifiable one. We give a simple proof based on error-correcting codes. Our proof allows us to generalize the Cramer-Damgård-Maurer’s result to linear schemes over modules, which played an important role in threshold cryptography, i.e. any existing linear secret sharing scheme over a module can be changed into a verifiable one. We then reflect on another aspect of linear secret sharing. While there has been lots of research on bounds in general access secret sharing schemes, little has been done on the computational complexity aspects. In this paper we also demonstrate that verifying whether a linear scheme is a secret sharing scheme for a given access structure is coNP-complete. The later result relates to the problem cheating sharedealer, the dual problem of secret sharing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27–35. Springer, Heidelberg (1990)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, May 2-4, pp. 1–10 (1988)
Blackburn, S.R., Burmester, M., Desmedt, Y., Wild, P.R.: Efficient multiplicative sharing schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 107–118. Springer, Heidelberg (1996)
Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. Nat. Computer Conf. AFIPS Conf. Proc, vol. 48, pp. 313–317 (1979)
Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, May 2-4, pp. 11–19 (1988)
Cramer, R., Damgård, I., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316–334. Springer, Heidelberg (2000)
De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proceedings of the twenty-sixth annual ACM Symp. Theory of Computing, STOC, Montréal, Québec, Canada, May 23-25, pp. 522–533 (1994)
Desmedt, Y., Di Crescenzo, G., Burmester, M.: Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 21–32. Springer, Heidelberg (1995)
Desmedt, Y.G., Frankel, Y.: Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM Journal on Discrete Mathematics 7(4), 667–679 (1994)
Garay, M., Johnson, D.: Computers and Intractability: A guide to NPcompleteness. W. H. Freeman and Company, New York (1979)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth annual ACM Symp. Theory of Computing, STOC, May 25-27, pp. 218–229 (1987)
Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structures. In: Proc. IEEE Global Telecommunications Conf., Globecom 1987, pp. 99–102. IEEE Communications Soc. Press, Los Alamitos (1987)
Jacobson, N.: Basic Algebra I. W. H. Freeman and Company, New York (1985)
Jacobson, N.: Basic Algebra II. W. H. Freeman and Company, New York (1989)
Karnin, E.D., Greene, J.W., Hellman, M.: On secret sharing systems. IEEE Tr. Inform. Theory 29(1), 35–41 (1983)
McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Comm. ACM 24(9), 583–584 (1981)
Micali, S.: Fair public-key cryptosystems. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 113–138. Springer, Heidelberg (1993)
Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. SIAM Journal on Applied Mathematics 8, 300–304 (1960)
Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979)
Simmons, G.J., Jackson, W., Martin, K.: The geometry of shared secret schemes. Bulletin of the Institute of Combinatorics and its Applications 1, 71–88 (1991)
Wegener, I.: The Complexity of Boolean Functions. J. Wiley, New York (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Desmedt, Y., Kurosawa, K., Van Le, T. (2003). Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes. In: Boyd, C., Mao, W. (eds) Information Security. ISC 2003. Lecture Notes in Computer Science, vol 2851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10958513_30
Download citation
DOI: https://doi.org/10.1007/10958513_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20176-2
Online ISBN: 978-3-540-39981-0
eBook Packages: Springer Book Archive