TY - GEN
T1 - Dynamic threshold scheme based on the definition of cross-product in an N-dimensional linear space
AU - Laih, Chi Sung
AU - Harn, Lein
AU - Lee, Jau Yien
AU - Hwang, Tzonelih
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1990.
PY - 1990
Y1 - 1990
N2 - This paper investigates the characterizations of threshold/ramp schemes which give rise to the time-dependent threshold schemes. These schemes are called the “dynamic threshold schemes” as compared to the conventional time-independent threshold scheme. In a (d, m, n, T) dynamic threshold scheme, there are n secret shadows and a public shadow, pj, at time t=tj, 1≤tj≤T. After knowing any m shadows, m≤n, and the public shadow, pj, we can easily recover d master keys, k1 j, K2 j, …, and Kd j. Furthermore, if the d master keys have to be changed to Kj+1 1,Kj+ ½,…,and Kj+1d for some security reasons, only the public shadow, pj, has to be changed to pj+1. All the n secret shadows issued initially remain unchanged. Compared to the conventional threshold/ramp schemes, at least one of the previous issued n shadows need to be changed whenever the master keys need to be updated for security reasons. A (1, m, n, T) dynamic threshold scheme based on the definition of cross-product in an N- dimensional linear space is proposed to illustrate the characterizations of the dynamic threshold schemes.
AB - This paper investigates the characterizations of threshold/ramp schemes which give rise to the time-dependent threshold schemes. These schemes are called the “dynamic threshold schemes” as compared to the conventional time-independent threshold scheme. In a (d, m, n, T) dynamic threshold scheme, there are n secret shadows and a public shadow, pj, at time t=tj, 1≤tj≤T. After knowing any m shadows, m≤n, and the public shadow, pj, we can easily recover d master keys, k1 j, K2 j, …, and Kd j. Furthermore, if the d master keys have to be changed to Kj+1 1,Kj+ ½,…,and Kj+1d for some security reasons, only the public shadow, pj, has to be changed to pj+1. All the n secret shadows issued initially remain unchanged. Compared to the conventional threshold/ramp schemes, at least one of the previous issued n shadows need to be changed whenever the master keys need to be updated for security reasons. A (1, m, n, T) dynamic threshold scheme based on the definition of cross-product in an N- dimensional linear space is proposed to illustrate the characterizations of the dynamic threshold schemes.
UR - http://www.scopus.com/inward/record.url?scp=33749312824&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33749312824&partnerID=8YFLogxK
U2 - 10.1007/0-387-34805-0_26
DO - 10.1007/0-387-34805-0_26
M3 - Conference contribution
AN - SCOPUS:33749312824
SN - 9780387973173
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 286
EP - 298
BT - Advances in Cryptology — CRYPTO 1989, Proceedings
A2 - Brassard, Gilles
PB - Springer Verlag
T2 - Conference on the Theory and Applications of Cryptology, CRYPTO 1989
Y2 - 20 August 1989 through 24 August 1989
ER -