[1] Shamir A. How to Share a Secret[J]. Communications of the ACM, 1979, 22(11): 612-613.
[2] Blakley G R. Safeguarding Cryptographic Keys[C]//Proceedings of the National Computer Conference. New York, USA: [s. n.], 1979: 313-317.
[3] Yang C C, Chang T Y, Hwang M S. A (t,n) Multi-secret Sharing Scheme[J]. Applied Mathematics and Computation, 2004, 151(2): 483-490.
[4] Pang Liaojun, Wang Yumin. A New (t,n) Multi-secret Sharing Scheme Based on Shamir’s Secret Sharing[J]. Applied Mathematics and Computation, 2005, 167(2): 840-848.
[5] Harn L. Efficient Sharing (Broadcasting) of Multiple Secret[J]. IEEE Proceedings on Computers and Digital Techniques, 1995, 142(3): 237-240.
[6] Shao Jun, Cao Zhenfu. A New Efficient (t,n) Verifiable Multi- secret Sharing(VMSS) Based on YCH Scheme[J]. Applied Mathematics and Computation, 2005, 168(1): 135-140.
[7] Zhao Jianjie, Zhang Jianzhong, Zhao Rong. A Practical Verifiable Multi-secret Sharing Scheme[J]. Computer Standards & Interfaces, 2007, 29(1): 138-141.
[8] Dehkordi M H, Mashhadi S. An Efficient Threshold Verifiable Multi-secret Sharing[J]. Computer Standards & Interfaces, 2008, 30(3): 187-190.
[9] 张艺林, 张建中. 可验证的(t,n)门限多重秘密共享方案[J]. 计算机工程, 2009, 35(15): 141-142.
[10] Koyama K, Maurer U, Okamoto T, et al. New Public-key Scheme Based on Elliptic Curves over the Ring Zn[C]//Proceedings of Advances in Cryptology-CRYPTO’91. Berlin, Germany: Springer- Verlag, 1992: 252-266. |