{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:03Z","timestamp":1772283543294,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540239758","type":"print"},{"value":"9783540305392","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30539-2_13","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:41:57Z","timestamp":1268401317000},"page":"170-186","source":"Crossref","is-referenced-by-count":16,"title":["Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Ron","family":"Steinfeld","sequence":"first","affiliation":[]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"601","volume-title":"Proc. 33rd ACM Symp. on Theory of Comput.","author":"M. Ajtai","year":"2001","unstructured":"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\u2013610. ACM Press, New York (2001)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C. Asmuth","year":"1983","unstructured":"Asmuth, C., Bloom, J.: A Modular Approach to Key Safeguarding. IEEE Trans. on Information Theory\u00a029, 208\u2013210 (1983)","journal-title":"IEEE Trans. on Information Theory"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L.: On Lovasz\u2019 Lattice Reduction and the Nearest Lattice Point Problem. Combinatorica 6 (1986)","DOI":"10.1007\/BF02579403"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-48329-2_10","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"C. Blundo","year":"1994","unstructured":"Blundo, C., Cresti, A., De Santis, A., Vaccaro, U.: Fully Dynamic Secret Sharing Schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 110\u2013125. Springer, Heidelberg (1994)"},{"key":"13_CR5","unstructured":"Desmedt, Y., Jajodia, S.: Redistributing Secret Shares to New Access Structures and Its Application. Technical Report ISSE TR-97-01, George Mason University (1997)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/18.850672","volume":"46","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Ron, D., Sudan, M.: Chinese Remaindering with Errors. IEEE Transactions on Information Theory\u00a046, 1330\u20131338 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1993)"},{"key":"13_CR8","volume-title":"Geometry of Numbers","author":"P. Gruber","year":"1987","unstructured":"Gruber, P., Lekkerkerker, C.: Geometry of Numbers. Elsevier Science Publishers, Amsterdam (1987)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved Decoding of Reed-Solomon Codes and Algebraic-Geometric Codes. IEEE Trans. Inf. Th.\u00a045, 1757\u20131767 (1999)","journal-title":"IEEE Trans. Inf. Th."},{"key":"13_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75306-0","volume-title":"Geometric and Analytic Number Theory","author":"E. Hlawka","year":"1991","unstructured":"Hlawka, E., Schoi\u03b2engeier, J., Taschner, R.: Geometric and Analytic Number Theory. Springer, Heidelberg (1991)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1146\/annurev.cs.02.060187.001311","volume":"2","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Algorithmic Geometry of Numbers. Annual Review of Comp. Sci.\u00a02, 231\u2013267 (1987)","journal-title":"Annual Review of Comp. Sci."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Mathematische Annalen\u00a0261, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","first-page":"402","volume-title":"Information Security and Privacy","author":"A. Maeda","year":"2001","unstructured":"Maeda, A., Miyaji, A., Tada, M.: Efficient and Unconditionally Secure Verifiable Threshold Changeable Scheme. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol.\u00a02119, pp. 402\u2013416. Springer, Heidelberg (2001)"},{"key":"13_CR14","first-page":"255","volume-title":"Cryptography and Coding III","author":"K. Martin","year":"1993","unstructured":"Martin, K.: Untrustworthy Participants in Secret Sharing Schemes. In: Cryptography and Coding III, pp. 255\u2013264. Oxford University Press, Oxford (1993)"},{"key":"13_CR15","first-page":"34","volume":"31","author":"K. Martin","year":"1999","unstructured":"Martin, K., Pieprzyk, J., Safavi-Naini, R., Wang, H.: Changing Thresholds in the Absence of Secure Channels. Australian Computer Journal\u00a031, 34\u201343 (1999)","journal-title":"Australian Computer Journal"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1093\/comjnl\/42.8.638"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-45664-3_14","volume-title":"Public Key Cryptography","author":"M. Quisquater","year":"2002","unstructured":"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.\u00a02274, pp. 199\u2013210. Springer, Heidelberg (2002)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How To Share a Secret. Comm. of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Comm. of the ACM"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/18.748993","volume":"45","author":"M.A. Shokrollahi","year":"1999","unstructured":"Shokrollahi, M.A., Wasserman, H.: List Decoding of Algebraic-Geometric Codes. IEEE Transactions on Information Theory\u00a045, 432\u2013437 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR20","first-page":"209","volume-title":"Proc. 33rd STOC","author":"I.E. Shparlinski","year":"2001","unstructured":"Shparlinski, I.E.: Sparse Polynomial Approximation in Finite Fields. In: Proc. 33rd STOC, pp. 209\u2013215. ACM Press, New York (2001)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jco.2003.08.020","volume":"20","author":"I.E. Shparlinski","year":"2004","unstructured":"Shparlinski, I.E., Steinfeld, R.: Noisy Chinese Remaindering in the Lee Norm. Journal of Complexity\u00a020, 423\u2013437 (2004)","journal-title":"Journal of Complexity"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: Dealer-Free Threshold Changeability for Standard CRT Secret-Sharing Schemes (2004) (preprint)","DOI":"10.1007\/978-3-540-30539-2_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30539-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:59:02Z","timestamp":1605761942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30539-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239758","9783540305392"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30539-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}