[1] SHAMIR A. How to share a secret[J]. Communications of the ACM, 1979, 22(11):612-613. [2] 王洁,蔡永泉, 田有亮. 基于博弈论的门限签名体制分析与构造[J]. 通信学报, 2015, 36(5):1-8.(WANG J, CAI Y Q, TIAN Y L. Analysis and construction for threshold signature scheme based on game theory[J]. Journal on Communications, 2015, 36(5):1-8.) [3] 曹阳. 基于秘密共享的数字签名方案[J]. 重庆邮电大学学报(自然科学版), 2015, 27(3):418-421.(CAO Y. Digital signature scheme based on secret sharing[J]. Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), 2015, 27(3):418-421.) [4] DING K, DING C. A class of two-weight and three-weight codes and their applications in secret sharing[J]. IEEE Transactions on Information Theory, 2015, 11(61):5835-5842. [5] ASMUTH C, BLOOM J. A modular approach to key safeguarding[J]. IEEE Transactions on Information Theory, 1983, 29(2):208-210. [6] SHI N, HOU Z F, TAN M N, et al. A threshold encryption scheme without a dealer based on Chinese remainder theorem[C]//Proceedings of the 2017 IEEE 9th International Conference on Communication Software and Networks. Piscataway, NJ:IEEE, 2017:90-96. [7] 徐甫, 马静谨. 基于中国剩余定理的门限RSA签名方案的改进[J]. 电子与信息学报, 2015, 37(10):2495-2500.(XU F, MA J J. Improvement of threshold RSA signature scheme based on Chinese remainder theorem[J]. Journal of Electronic & Information Technology, 2015, 37(10):2495-2500.) [8] HOU Z F, TAN M N. A CRT-based(t, n) threshold signature scheme without a dealer[J]. Journal of Computational Information Systems, 2015, 11(3):975-986. [9] OSTROVSKY R, YUNG M. How to withstand mobile virus attacks[C]//Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing. New York:ACM, 1991:51-59. [10] HERZBERG A, JARECKI S, KRAWCZYK H, et al. Proactive secret sharing or:how to cope with perpetual leakage[C]//Proceedings of CRYPTO 1995 on Advances in Cryptology. Berlin:Springer, 1995:339-352. [11] 于义科, 郑雪峰. 标准模型下基于身份的高效动态门限代理签名方案[J]. 通信学报, 2011, 32(8):55-63.(YU Y K, ZHENG X F. ID-based efficient and proactive threshold proxy signature in the standard model[J]. Journal on Communications, 2011, 32(8):55-63.) [12] WANG X Q, LIN C L, LI Y. Proactive secret sharing without a trusted party[C]//Proceedings of the 5th IEEE International Conference on Intelligent Networking and Collaborative Systems. Washington, DC:IEEE Computer Society, 2013:511-515. [13] ZHU Y S, WANG B J, CAI C. A novel smart-card based authentication scheme using proactive secret sharing[J]. International Journal of Computer and Communication Engineering, 2016, 5(3):196-205. [14] 徐甫. 基于多项式秘密共享的前摄性门限RSA签名方案[J]. 电子与信息学报, 2016, 38(9):2280-2286.(XU F. Proactive threshold RSA signature scheme based on polynomial secret sharing[J]. Journal of Electronics & Information Technology, 2016, 38(9):2280-2286.) [15] LUO H Y, LU S W. Ubiquitous and robust authentication services for Ad Hoc wireless networks:TR-200030[R]. Los Angeles:University of California, 2000. [16] DONG P, KUANG X H, LU X C. A non-interactive protocol for member expansion in a secret sharing scheme[J]. Journal of Software, 2005, 16(1):116-120. [17] 殷凤梅, 濮光宁. 允许新成员加入的无可信中心秘密共享方案分析[J]. 重庆科技学院学报(自然科学版), 2011, 13(6):173-175.(YIN F M, PU G N. Analysis of member expansion of a secret sharing scheme without dealer[J]. Journal of Chongqing University of Science and Technology (Natural Science Edition), 2011, 13(6):173-175.) [18] 许静芳, 崔国华, 程琦, 等. 秘密共享新个体加入协议的安全性分析与改进[J]. 通信学报, 2009, 30(10):118-123.(XU J F, CUI G H, CHENG Q, et al. Cryptanalysis of a non-interactive protocol for member expansion in a secret sharing scheme[J]. Journal on Communications, 2009, 30(10):118-123.) |