Please use this identifier to cite or link to this item:
Title: Threshold changeable secret sharing schemes revisited
Authors: Zhang, Zhifang
Chee, Yeow Meng
Ling, San
Liu, Mulan
Wang, Huaxiong
Issue Date: 2012
Source: Zhang, Z., Chee, Y. M., Ling, S., Liu, M., & Wang, H. (2012). Threshold changeable secret sharing schemes revisited. Theoretical Computer Science, 418, 106-115.
Series/Report no.: Theoretical computer science
Abstract: This paper studies the methods for changing thresholds in the absence of secure channels after the setup of threshold secret sharing schemes. First, we construct a perfect (t,n)(t,n) threshold scheme that is threshold changeable to t′>tt′>t, which is optimal with respect to the share size. This improves the scheme of Wang and Wong by relaxing the requirement from q≥n+vq≥n+v to q>nq>n with the secret-domain Fqv. But these threshold changeable schemes along with most previously known schemes turn out to be insecure under the collusion attack of players holding initial shares. By adding a broadcast enforcement term we enhance the model with collusion security and NN options of threshold change. Then we construct a computationally secure scheme under the enhanced model, which involves much shorter shares and broadcast messages than the perfect schemes. Finally, we discuss how to realize the enrollment and disenrollment of players, and particularly, how to deal with L-fold changes of access polices.
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.09.027
Rights: © 2012 Elsevier B. V.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SPMS Journal Articles

Citations 10

Updated on Jan 23, 2023

Web of ScienceTM
Citations 10

Updated on Jan 30, 2023

Page view(s) 20

Updated on Feb 5, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.