Lattice-based threshold-changeability for standard Shamir secret-sharing schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3329, Issue , 2004, Pages 170-186

  Steinfeld, Ron ^a   Wang, Huaxiong ^a   Pieprzyk, Josef ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

Changeable threshold; Geometry of numbers; Lattice reduction; Shamir secret sharing

Indexed keywords

CRYPTOGRAPHY; INFORMATION THEORY; NUMBER THEORY; REED-SOLOMON CODES; SECURITY OF DATA; SHAREHOLDERS;

CHANGEABLE THRESHOLD; CRYPTOGRAPHIC APPLICATIONS; GEOMETRY OF NUMBERS; INFORMATION- THEORETIC SECURITIES; LATTICE REDUCTION; SECRET SHARING; SECRET SHARING SCHEMES; THRESHOLD PARAMETERS;

LATTICE THEORY;

EID: 33845960920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30539-2_13     Document Type: Article

References (22)

1. M. Ajtai, R. Kumar, and D. Sivakumar. A Sieve Algorithm for the Shortest Lattice Vector Problem. In Proc. 33-rd ACM Symp. on Theory of Comput., pages 601-610, New York, 2001. ACM Press.
2. C. Asmuth and J. Bloom. A Modular Approach to Key Safeguarding. IEEE Trans. on Information Theory, 29:208-210, 1983.
3. L. Babai. On Lovasz' Lattice Reduction and the Nearest Lattice Point Problem. Combinatorica, 6, 1986.
4. C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro. Fully Dynamic Secret Sharing Schemes. In CRYPTO '93, volume 773 of LNCS, pages 110-125, Berlin, 1993. Springer-Verlag.
5. Y. Desmedt and S. Jajodia. Redistributing Secret Shares to New Access Structures and Its Application. Technical Report ISSE TR-97-01, George Mason University, 1997.
6. O. Goldreich, D. Ron, and M. Sudan. Chinese Remaindering with Errors. IEEE Transactions on Information Theory, 46:1330-1338, 2000.
7. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1993.
8. P. Gruber and C. Lekkerkerker. Geometry of Numbers. Elsevier Science Publishers, 1987.
9. V. Guruswami and M. Sudan. Improved Decoding of Reed-Solomon Codes and Algebraic-Geometric Codes. IEEE Trans. Inf. Th., 45:1757-1767, Sep. 1999.
10. E. Hlawka, J. Schoißengcier, and R. Taschner. Geometric and Analytic Number Theory. Springer-Verlag, 1991.
11. R. Kannan. Algorithmic Geometry of Numbers. Annual Review of Comp. Sci., 2:231-267, 1987.
12. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring Polynomials with Rational Coefficients. Mathematische Annalen, 261:515-534, 1982.
13. A. Maeda, A. Miyaji, and M. Tada. Efficient and Unconditionally Secure Verifiable Threshold Changeable Scheme. In ACISP 2001, volume 2119 of LNCS, pages 402-416, Berlin, 2001. Springer-Verlag.
14. K. Martin. Untrustworthy Participants in Secret Sharing Schemes. In Cryptography and Coding III, pages 255-264. Oxford University Press, 1993.
15. K. Martin, J. Pieprzyk, R. Safavi-Naini, and H. Wang. Changing Thresholds in the Absence of Secure Channels. Australian Computer Journal, 31:34-43, 1999.
16. K. Martin, R. Safavi-Naini, and H. Wang. Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures. The Computer Journal, 8, 1999.
17. M. Quisquater, B. Preneel, and J. Vandewalle. On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem. In PKC 2002, volume 2274 of LNCS, pages 199-210, Berlin, 2002. Springer-Verlag.
18. A. Shamir. How To Share a Secret. Comm. of the ACM, 22:612-613,1979.
19. M. A. Shokrollahi and H. Wasserman. List Decoding of Algebraic-Geometric Codes. IEEE Transactions on Information Theory, 45:432-437, March 1999.
20. I.E. Shparlinski. Sparse Polynomial Approximation in Finite Fields. In Proc. 33rd STOC, pages 209-215, New York, 2001. ACM Press.
21. I.E. Shparlinski and R. Steinfeld. Noisy Chinese Remaindering in the Lee Norm. Journal of Complexity, 20:423-437, 2004.
22. R. Steinfeld, J. Pieprzyk, and H. Wang. Dealer-Free Threshold Changeability for Standard CRT Secret-Sharing Schemes. Preprint, 2004.