Abstract
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases.
Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (Geometry of Numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.
Chapter PDF
Similar content being viewed by others
References
Ajtai, M., Kumar, R., Sivakumar, D.: A Sieve Algorithm for the Shortest Lattice Vector Problem. In: Proc. 33rd ACM Symp. on Theory of Comput., pp. 601–610. ACM Press, New York (2001)
Asmuth, C., Bloom, J.: A Modular Approach to Key Safeguarding. IEEE Trans. on Information Theory 29, 208–210 (1983)
Babai, L.: On Lovasz’ Lattice Reduction and the Nearest Lattice Point Problem. Combinatorica 6 (1986)
Blundo, C., Cresti, A., De Santis, A., Vaccaro, U.: Fully Dynamic Secret Sharing Schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 110–125. Springer, Heidelberg (1994)
Desmedt, Y., Jajodia, S.: Redistributing Secret Shares to New Access Structures and Its Application. Technical Report ISSE TR-97-01, George Mason University (1997)
Goldreich, O., Ron, D., Sudan, M.: Chinese Remaindering with Errors. IEEE Transactions on Information Theory 46, 1330–1338 (2000)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1993)
Gruber, P., Lekkerkerker, C.: Geometry of Numbers. Elsevier Science Publishers, Amsterdam (1987)
Guruswami, V., Sudan, M.: Improved Decoding of Reed-Solomon Codes and Algebraic-Geometric Codes. IEEE Trans. Inf. Th. 45, 1757–1767 (1999)
Hlawka, E., Schoiβengeier, J., Taschner, R.: Geometric and Analytic Number Theory. Springer, Heidelberg (1991)
Kannan, R.: Algorithmic Geometry of Numbers. Annual Review of Comp. Sci. 2, 231–267 (1987)
Lenstra, A.K., Lenstra, H.W., Lovász, L.: Factoring Polynomials with Rational Coefficients. Mathematische Annalen 261, 515–534 (1982)
Maeda, A., Miyaji, A., Tada, M.: Efficient and Unconditionally Secure Verifiable Threshold Changeable Scheme. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 402–416. Springer, Heidelberg (2001)
Martin, K.: Untrustworthy Participants in Secret Sharing Schemes. In: Cryptography and Coding III, pp. 255–264. Oxford University Press, Oxford (1993)
Martin, K., Pieprzyk, J., Safavi-Naini, R., Wang, H.: Changing Thresholds in the Absence of Secure Channels. Australian Computer Journal 31, 34–43 (1999)
Martin, K., Safavi-Naini, R., Wang, H.: Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures. The Computer Journal 8 (1999)
Quisquater, M., Preneel, B., Vandewalle, J.: On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 199–210. Springer, Heidelberg (2002)
Shamir, A.: How To Share a Secret. Comm. of the ACM 22, 612–613 (1979)
Shokrollahi, M.A., Wasserman, H.: List Decoding of Algebraic-Geometric Codes. IEEE Transactions on Information Theory 45, 432–437 (1999)
Shparlinski, I.E.: Sparse Polynomial Approximation in Finite Fields. In: Proc. 33rd STOC, pp. 209–215. ACM Press, New York (2001)
Shparlinski, I.E., Steinfeld, R.: Noisy Chinese Remaindering in the Lee Norm. Journal of Complexity 20, 423–437 (2004)
Steinfeld, R., Pieprzyk, J., Wang, H.: Dealer-Free Threshold Changeability for Standard CRT Secret-Sharing Schemes (2004) (preprint)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steinfeld, R., Wang, H., Pieprzyk, J. (2004). Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes. In: Lee, P.J. (eds) Advances in Cryptology - ASIACRYPT 2004. ASIACRYPT 2004. Lecture Notes in Computer Science, vol 3329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30539-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-30539-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23975-8
Online ISBN: 978-3-540-30539-2
eBook Packages: Springer Book Archive