Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes

Authors:
R. Steinfeld;J. Pieprzyk;Huaxiong Wang
Affiliations:
Macquarie Univ., Sydney;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 3

Fast communication: An analysis of Seysen's lattice reduction algorithm

Signal Processing
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

SIAM Journal on Discrete Mathematics
Threshold changeable secret sharing schemes revisited

Theoretical Computer Science

Quantified Score

Hi-index	754.84

Visualization

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 nonstandard 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.