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

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 secure channels between shareholders. In contrast, we show how to increase the threshold parameter of the standard CRT secret-sharing scheme without secure channels between the shareholders. Our method can thus be applied to existing CRT schemes even if they were set up without consideration to future threshold increases. Our method is a positive cryptographic application for lattice reduction algorithms, and we also use techniques from lattice theory (geometry of numbers) to prove statements about the correctness and information-theoretic security of our constructions.

[1]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[2]  Reihaneh Safavi-Naini,et al.  Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures , 1999, Comput. J..

[3]  Bart Preneel,et al.  On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem , 2002, Public Key Cryptography.

[4]  P. Shiu,et al.  Geometric and analytic number theory , 1991 .

[5]  Dan Boneh,et al.  Finding smooth integers in short intervals using CRT decoding , 2000, STOC '00.

[6]  László Babai,et al.  On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..

[7]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[8]  Atsuko Miyaji,et al.  Efficient and Unconditionally Secure Verifiable Threshold Changeable Scheme , 2001, ACISP.

[9]  Josef Pieprzyk,et al.  Changing Thresholds in the Absence of Secure Channels , 1999, Aust. Comput. J..

[10]  Alfredo De Santis,et al.  Fully Dynamic Secret Sharing Schemes , 1993, Theor. Comput. Sci..

[11]  Ueli Maurer,et al.  Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[12]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[13]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[14]  John Bloom,et al.  A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.

[15]  Dana Ron,et al.  Chinese remaindering with errors , 1999, STOC '99.

[16]  F. Thorne,et al.  Geometry of Numbers , 2017, Algebraic Number Theory.

[17]  Sushil Jajodia,et al.  Redistributing Secret Shares to New Access Structures and Its Applications , 1997 .

[18]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[19]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[20]  Ron Steinfeld,et al.  Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes , 2004, IEEE Transactions on Information Theory.

[21]  Igor E. Shparlinski,et al.  Noisy Chinese remaindering in the Lee norm , 2004, J. Complex..