A (k,n)-Threshold Secret Sharing Algorithm Based on XOR Operation

doi:10.19678/j.issn.1000-3428.0059258

Abstract

Abstract: Most of the existing secret sharing algorithms are constructed based on the SHAMIR algorithm, and involve complex polynomial calculations, which slows down data processing.In order to improve computational efficiency, a new secret sharing algorithm is proposed based on XOR operation.The number of clues to be generated is calculated according to the input values of k and n.Then all the clues required by the algorithm are generated by continuous XOR operation on a random binary sequence, and the clues are grouped in permutation and combinations to form a shadow secret.Experimental results show that the algorithm can realize arbitrary (k, n)-threshold secret sharing, and greatly improves the processing speed compared with the SHAMIR algorithm, while avoding the security risk of partial secret information disclosure.

Key words: XOR operation, secret sharing, permutation and combination, information safety, attacker

摘要： 现有典型的秘密共享算法多基于SHAMIR算法构建，涉及复杂的多项式计算，数据处理速度较慢。为提高计算效率，提出一种仅基于异或运算的秘密共享算法。根据k、n输入值计算待生成的线索个数，通过与随机二进制序列进行连续异或运算生成算法所需的全部线索，并借助排列组合将所有线索进行分组形成影子秘密。实验结果表明，该算法能够实现任意份额（k，n）门限秘密共享，相较于SHAMIR算法处理速度得到大幅提升，且不存在部分秘密信息泄露的安全隐患。

关键词: 异或运算, 秘密共享, 排列组合, 信息安全, 攻击者

CLC Number:

TP309

XIA Gao, HE Chengwan. A (k,n)-Threshold Secret Sharing Algorithm Based on XOR Operation[J]. Computer Engineering, 2021, 47(10): 111-115,124.

夏高, 何成万. 一种基于异或运算的(k,n)门限秘密共享算法[J]. 计算机工程, 2021, 47(10): 111-115,124.

/ / Recommend / Download Citations

URL: http://www.ecice06.com/EN/10.19678/j.issn.1000-3428.0059258

http://www.ecice06.com/EN/Y2021/V47/I10/111

Figures/Tables 8

References

[1] SHAMIR A.How to share a secret[J].Communications of the ACM, 1979, 22(11):612-613.
[2] FUJII Y.A fast (2, n)-threshold scheme and its application[C]//Proceedings of CSS'05.New York, USA:ACM Press, 2005:631-636.
[3] CHATTOPADHYAY A K, NAG A, SINGH J P, et al.A verifiable multi-secret image sharing scheme using XOR operation and Hash function[J].Multimedia Tools and Applications, 2020(12):1-5.
[4] MATSUO M, MUTO K.(k, n)-threshold secret sharing scheme using exclusive OR[J].Panasonic Technical Journal, 2013, 59(2):29-34.
[5] 荣辉桂, 莫进侠, 常炳国, 等.基于Shamir秘密共享的密钥分发与恢复算法[J].通信学报, 2015, 36(3):60-69. RONG H G, MO J X, CHANG B G, et al.Key distribution and recovery algorithm based on Shamir's secret sharing[J].Journal on Communications, 2015, 36(3):60-69.(in Chinese)
[6] 何晓婷, 苗付友, 方亮.基于秘密共享的(t, m, n)-AS组认证方案[J].计算机工程, 2018, 44(1):154-159. HE X T, MIAO F Y, YOU L.(t, m, n)-AS group authentication scheme based on secret sharing[J].Computer Engineering, 2018, 44(1):154-159.(in Chinese)
[7] 刘鹏, 李飞.基于异或运算的份额可更新(2, n)门限秘密共享方案[J].科学技术与工程, 2009, 9(14):4186-4188. LIU P, LI F.New (2, n)threshold secret sharing scheme with share refreshing based on XOR operations[J].Science Technology and Engineering, 2009, 9(14):4186-4188.(in Chinese)
[8] 谷婷, 杜伟章.无可信中心的可动态更新多秘密共享方案[J].计算机工程, 2016, 42(3):148-155. GU T, DU W Z.Dynamically updatable multi-secret sharing scheme without trusted center[J].Computer Engineering, 2016, 42(3):148-155.(in Chinese)
[9] 王彩芬, 苏舜昌, 杨小东.可动态更新的口令授权多秘密共享方案[J].计算机工程与科学, 2019, 41(9):1597-1602. WANG C F, SU S C, YANG X D.A dynamically updated password authorization multi-secret sharing scheme[J].Computer Engineering, 2019, 41(9):1597-1602.(in Chinese)
[10] 张艳硕, 李文敬, 陈雷, 等.基于特征值的可验证特殊门限秘密共享方案[J].通信学报, 2018, 39(8):169-175. ZHANG Y S, LI W J, CHEN L, et al.Verifiable special threshold secret sharing scheme based on eigenvalue[J].Journal on Communications, 2018, 39(8):169-175.(in Chinese)
[11] SRINIVASAN A, VASUDEVAN P N.Leakage resilient secret sharing and applications[C]//Proceedings of 2019 Annual International Cryptology Conference.Berlin, Germany:Springer, 2019:480-509.
[12] KUMAR A, MEKA R, SAHAI A.Leakage-resilient secret sharing[C]//Proceedings of ECCC'18.New York, USA:ACM Press, 2018:200.
[13] NIELSEN J B, SIMKIN M.Lower bounds for leakage-resilient secret sharing[C]//Proceedings of 2020 Annual International Conference on the Theory and Applications of Cryptographic Techniques.Berlin, Germany:Springer, 2020:556-577.
[14] BENHAMOUDA F, DEGWEKAR A, ISHAI Y, et al.On the local leakage resilience of linear secret sharing schemes[C]//Proceedings of 2018 Annual International Cryptology Conference.Berlin, Germany:Springer, 2018:531-561.
[15] 张明武, 陈泌文, 李发根, 等.强抗泄漏的无条件安全动态秘密共享方案[J].密码学报, 2016, 3(4):361-373. ZHANG M W, CHEN B W, LI F G, et al.A strongly leakage-resilient and unconditionally secure dynamic secret-sharing scheme[J].Journal of Cryptologic Research, 2016, 3(4):361-373.
[16] AGGARWAL D, DAMGÅRD I, NIELSEN J B, et al.Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures[C]//Proceedings of 2019 Annual International Cryptology Conference.Berlin, Germany:Springer, 2019:510-539.
[17] 王晨宇, 汪定, 王菲菲, 等.面向多网关的无线传感器网络多因素认证协议[J].计算机学报, 2020, 43(4):683-700. WANG C Y, WANG D, WANG F F, et al.Multi-factor user authentication scheme for multi-gateway wireless sensor networks[J].Chinese Journal of Computers, 2020, 43(4):683-700.(in Chinese)
[18] WANG D, WANG P.Two birds with one stone:two-factor authentication with security beyond conventional bound[J].IEEE Transactions on Dependable and Secure Computing, 2018, 15(4):708-722.
[19] WANG C Y, XU G A, SUN J.An enhanced three-factor user authentication scheme using elliptic curve cryptosystem for wireless sensor networks[J].Sensors, 2017, 17(12):2946.
[20] XU G S, QIU S M, AHMAD H, et al.A multi-server two-factor authentication scheme with un-traceability using elliptic curve cryptography[J].Sensors, 2018, 18(7):2394.

Please choose a citation manager

Content to export