Lattice-based threshold-changeability for standard CRT secret-sharing schemes
Steinfeld, Ron, Pieprzyk, Josef, & Wang, Huaxiong (2006) Lattice-based threshold-changeability for standard CRT secret-sharing schemes. Finite Fields and Their Applications, 12(4), pp. 653-680.
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.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||Special Issue Celebrating Prof. Zhe-Xian Wan's 80th Birthday|
|Divisions:||Current > QUT Faculties and Divisions > Science & Engineering Faculty|
|Deposited On:||22 Jul 2014 03:24|
|Last Modified:||22 Jul 2014 23:06|
Repository Staff Only: item control page