运用有限域上的正交投影矩阵, 对已有的门限秘密分享方案进行安全性分析, 在理论上严格证明了该方案的验证式存在安全漏洞: 任何一个参与者恶意提供伪份额而不被发现的欺骗行为能以不可忽略的概率存在.
The security deficiency against cheating, which lies in a threshold secret sharing scheme is analyzed with the method of orthogonal projection matrix over finite field. There exists some illicit participant successfully passing the check by his forged shares and reconstructing a wrong secret without being perceived. A strict proof shows that the cheater has non-negligible advantage in above deception.
[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]// Proc AFIPS. 1979: 313-317.
[3] Tompa M, Woll H. How to share a secret with cheaters [J]. Journal of Cryptology, 1989, 1(3): 133-138.
[4] Brickell E F, Stinson D R. The detection of cheaters in threshold schemes [C]//Advances in Cryptology-CRYPTO’88. Berlin: Springer Verlag, 1990: 564-577.
[5] Ogata W, Kurosawa K, Stinson D R. Optimum secret sharing scheme secure against cheating [J]. SIAM Journal on Discrete Mathematics, 2006, 20(1): 79-95.
[6] Obana S, Araki T. Almost optimum secret sharing scheme secure against cheating for arbitrary secret distribution [C]//Advances in Asiacrypt’2006. Berlin: Springer Verlag, 2006: 364-379.
[7] Bai L. A strong ramp secret sharing scheme using matrix projection [C]//Proceedings of International Symposium on a World of Wireless, Mobile and Multimedia Network. 2006: 652-656.
[8] Bai L, Zou X K. A proactive secret sharing scheme in matrix projection method [J]. Int J Security and Networks, 2009, 4(4): 201-209.
[9] Wang K, Zou X K, Sui Y. A multiple secret sharing scheme base on matrix projection [C]// 33rd Annual IEEE International Computer Software and Applications Conference. 2009: 400-405.
[10] Yanai H, Takeuchi K, Takane Y. Projection matrices, generalized inverse matrices, and singular value decomposition [M]. New York: Springer Verlag, 2011: 25-32.
[11] Migler T, Morrison K, Ogle M. How much does a matrix of rank k weight [J]. Mathematics Magazine, 2006, 79(4): 262-271.
